{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R2K2ZWH5SETX3DO2P3P2L46L2Q","short_pith_number":"pith:R2K2ZWH5","schema_version":"1.0","canonical_sha256":"8e95acd8fd91277d8dda7edfa5f3cbd4253c477889e3ef1a1b17500ae4e9d174","source":{"kind":"arxiv","id":"1511.04893","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.04893","created_at":"2026-05-18T01:11:57.755021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04893v2","created_at":"2026-05-18T01:11:57.755021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04893","created_at":"2026-05-18T01:11:57.755021+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2K2ZWH5SETX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2K2ZWH5SETX3DO2","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2K2ZWH5","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q","json":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q.json","graph_json":"https://pith.science/api/pith-number/R2K2ZWH5SETX3DO2P3P2L46L2Q/graph.json","events_json":"https://pith.science/api/pith-number/R2K2ZWH5SETX3DO2P3P2L46L2Q/events.json","paper":"https://pith.science/paper/R2K2ZWH5"},"agent_actions":{"view_html":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q","download_json":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q.json","view_paper":"https://pith.science/paper/R2K2ZWH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04893&json=true","fetch_graph":"https://pith.science/api/pith-number/R2K2ZWH5SETX3DO2P3P2L46L2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/R2K2ZWH5SETX3DO2P3P2L46L2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/action/storage_attestation","attest_author":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/action/author_attestation","sign_citation":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/action/citation_signature","submit_replication":"https://pith.science/pith/R2K2ZWH5SETX3DO2P3P2L46L2Q/action/replication_record"}},"created_at":"2026-05-18T01:11:57.755021+00:00","updated_at":"2026-05-18T01:11:57.755021+00:00"}