{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R2K2ZWH5SETX3DO2P3P2L46L2Q","short_pith_number":"pith:R2K2ZWH5","canonical_record":{"source":{"id":"1511.04893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-16T10:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"5021d4646b35bbba97106543a61da67d9b1e7e3558ab42f78c5976d77d7ce7cd","abstract_canon_sha256":"00764ff53c95a66826b65f251c41d8cf4fd5e2e66635132ee0521d70fd712bf5"},"schema_version":"1.0"},"canonical_sha256":"8e95acd8fd91277d8dda7edfa5f3cbd4253c477889e3ef1a1b17500ae4e9d174","source":{"kind":"arxiv","id":"1511.04893","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04893","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04893v2","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04893","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"R2K2ZWH5SETX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R2K2ZWH5SETX3DO2","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R2K2ZWH5","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R2K2ZWH5SETX3DO2P3P2L46L2Q","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-16T10:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"5021d4646b35bbba97106543a61da67d9b1e7e3558ab42f78c5976d77d7ce7cd","abstract_canon_sha256":"00764ff53c95a66826b65f251c41d8cf4fd5e2e66635132ee0521d70fd712bf5"},"schema_version":"1.0"},"canonical_sha256":"8e95acd8fd91277d8dda7edfa5f3cbd4253c477889e3ef1a1b17500ae4e9d174","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.755418Z","signature_b64":"C7Q1eNw/EPLvgfHN6OhaS1V7k5DOQialf/DyjI1nLIvVZiyoydWABYJdziwM7nYVyQJ3bXVApqiyGbGl/VCDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e95acd8fd91277d8dda7edfa5f3cbd4253c477889e3ef1a1b17500ae4e9d174","last_reissued_at":"2026-05-18T01:11:57.754950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.754950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04893","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kB3PZVKL3bBXmFKR3Pfq21UsK9V/WWKCpcf6nAg5F5xQpBIqdok7+CI/R9PK7uFRDGPY+2NQWPhbGKD1ihVpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:01:14.924139Z"},"content_sha256":"0a51e223cdcccea952fd5cc2564e58ae582be4edccdc62ac0c3b9c5e3d262b35","schema_version":"1.0","event_id":"sha256:0a51e223cdcccea952fd5cc2564e58ae582be4edccdc62ac0c3b9c5e3d262b35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R2K2ZWH5SETX3DO2P3P2L46L2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-Free Commutative Grammars with Integer Counters and Resets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Christoph Haase, Dmitry Chistikov, Simon Halfon","submitted_at":"2015-11-16T10:15:40Z","abstract_excerpt":"We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those grammars can alternatively be viewed as an extension of communication-free Petri nets. Our main results are that reachability and coverability are inter-reducible and both NP-complete. In particular, this class of commutative grammars enjoys semi-linear reachability sets. We also show that the inclusion problem is, in general, coNEXP-complete and already $\\Pi_2^\\text{P}$-complete for grammars with only on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04893","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cV9tAaVHfyS1XyXOB53nwqZR7UKtQ7R5agNbJ5UG5dBqrzlkpqv+znZ4BFoQHCcsrgMfIXIVWL771anMtBMDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:01:14.924507Z"},"content_sha256":"f31c08e9feaf2fa388e76bffdf38c8266ad601e252e8d6a8b0c966f2559cdc0a","schema_version":"1.0","event_id":"sha256:f31c08e9feaf2fa388e76bffdf38c8266ad601e252e8d6a8b0c966f2559cdc0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/bundle.json","state_url":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T00:01:14Z","links":{"resolver":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q","bundle":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/bundle.json","state":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R2K2ZWH5SETX3DO2P3P2L46L2Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"00764ff53c95a66826b65f251c41d8cf4fd5e2e66635132ee0521d70fd712bf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-16T10:15:40Z","title_canon_sha256":"5021d4646b35bbba97106543a61da67d9b1e7e3558ab42f78c5976d77d7ce7cd"},"schema_version":"1.0","source":{"id":"1511.04893","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04893","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04893v2","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04893","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"R2K2ZWH5SETX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R2K2ZWH5SETX3DO2","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R2K2ZWH5","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f31c08e9feaf2fa388e76bffdf38c8266ad601e252e8d6a8b0c966f2559cdc0a","target":"graph","created_at":"2026-05-18T01:11:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those grammars can alternatively be viewed as an extension of communication-free Petri nets. Our main results are that reachability and coverability are inter-reducible and both NP-complete. In particular, this class of commutative grammars enjoys semi-linear reachability sets. We also show that the inclusion problem is, in general, coNEXP-complete and already $\\Pi_2^\\text{P}$-complete for grammars with only on","authors_text":"Christoph Haase, Dmitry Chistikov, Simon Halfon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-16T10:15:40Z","title":"Context-Free Commutative Grammars with Integer Counters and Resets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04893","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a51e223cdcccea952fd5cc2564e58ae582be4edccdc62ac0c3b9c5e3d262b35","target":"record","created_at":"2026-05-18T01:11:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"00764ff53c95a66826b65f251c41d8cf4fd5e2e66635132ee0521d70fd712bf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-16T10:15:40Z","title_canon_sha256":"5021d4646b35bbba97106543a61da67d9b1e7e3558ab42f78c5976d77d7ce7cd"},"schema_version":"1.0","source":{"id":"1511.04893","kind":"arxiv","version":2}},"canonical_sha256":"8e95acd8fd91277d8dda7edfa5f3cbd4253c477889e3ef1a1b17500ae4e9d174","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e95acd8fd91277d8dda7edfa5f3cbd4253c477889e3ef1a1b17500ae4e9d174","first_computed_at":"2026-05-18T01:11:57.754950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:57.754950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C7Q1eNw/EPLvgfHN6OhaS1V7k5DOQialf/DyjI1nLIvVZiyoydWABYJdziwM7nYVyQJ3bXVApqiyGbGl/VCDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:57.755418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04893","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a51e223cdcccea952fd5cc2564e58ae582be4edccdc62ac0c3b9c5e3d262b35","sha256:f31c08e9feaf2fa388e76bffdf38c8266ad601e252e8d6a8b0c966f2559cdc0a"],"state_sha256":"fb446041b22d5e1508573f60a5339178655ef64df8560076646a4beeda3f7b93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiNPVXdJU94a4aIT8HnBOJ/ijH9PtX5wQEdiDpdmpjjdPrAQBNgRh4ePc0wzI7aCQNzC0CSlfYLZihiSfw0fCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:01:14.926533Z","bundle_sha256":"e1a8cd2430bbf7b4b63d7c628361d082241750eefe609812f9d022fb8f69f82d"}}