{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NLPYVYMSWTM2SD5UEIRSXVLYQI","short_pith_number":"pith:NLPYVYMS","schema_version":"1.0","canonical_sha256":"6adf8ae192b4d9a90fb422232bd578823b998a5bd0f3cb9b2140a40ee3b1229b","source":{"kind":"arxiv","id":"1406.2590","version":2},"attestation_state":"computed","paper":{"title":"Integer Vector Addition Systems with States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Christoph Haase, Simon Halfon","submitted_at":"2014-06-10T15:22:52Z","abstract_excerpt":"This paper studies reachability, coverability and inclusion problems for Integer Vector Addition Systems with States (ZVASS) and extensions and restrictions thereof. A ZVASS comprises a finite-state controller with a finite number of counters ranging over the integers. Although it is folklore that reachability in ZVASS is NP-complete, it turns out that despite their naturalness, from a complexity point of view this class has received little attention in the literature. We fill this gap by providing an in-depth analysis of the computational complexity of the aforementioned decision problems. Mo"},"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":"1406.2590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-10T15:22:52Z","cross_cats_sorted":[],"title_canon_sha256":"4fdc7a8abeaa951599c4c5291195a40ee804b128e6d447bfeed5c54a8dc36d8d","abstract_canon_sha256":"739d3e8f90083815ac33ff6840ba691dff038471bbb8b4bed56455e67fbe387c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:25.930489Z","signature_b64":"ODkdFLEQYlLMU+po71NQM6d2Dsu06do0xIWCk7APJEPmAUT+tX89I+BfHXDPfMjAq0FxEa0Y7FaihqcF5+qyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6adf8ae192b4d9a90fb422232bd578823b998a5bd0f3cb9b2140a40ee3b1229b","last_reissued_at":"2026-05-18T02:41:25.929950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:25.929950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integer Vector Addition Systems with States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Christoph Haase, Simon Halfon","submitted_at":"2014-06-10T15:22:52Z","abstract_excerpt":"This paper studies reachability, coverability and inclusion problems for Integer Vector Addition Systems with States (ZVASS) and extensions and restrictions thereof. A ZVASS comprises a finite-state controller with a finite number of counters ranging over the integers. Although it is folklore that reachability in ZVASS is NP-complete, it turns out that despite their naturalness, from a complexity point of view this class has received little attention in the literature. We fill this gap by providing an in-depth analysis of the computational complexity of the aforementioned decision problems. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2590","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":"1406.2590","created_at":"2026-05-18T02:41:25.930034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2590v2","created_at":"2026-05-18T02:41:25.930034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2590","created_at":"2026-05-18T02:41:25.930034+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLPYVYMSWTM2","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLPYVYMSWTM2SD5U","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLPYVYMS","created_at":"2026-05-18T12:28:41.024544+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/NLPYVYMSWTM2SD5UEIRSXVLYQI","json":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI.json","graph_json":"https://pith.science/api/pith-number/NLPYVYMSWTM2SD5UEIRSXVLYQI/graph.json","events_json":"https://pith.science/api/pith-number/NLPYVYMSWTM2SD5UEIRSXVLYQI/events.json","paper":"https://pith.science/paper/NLPYVYMS"},"agent_actions":{"view_html":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI","download_json":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI.json","view_paper":"https://pith.science/paper/NLPYVYMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2590&json=true","fetch_graph":"https://pith.science/api/pith-number/NLPYVYMSWTM2SD5UEIRSXVLYQI/graph.json","fetch_events":"https://pith.science/api/pith-number/NLPYVYMSWTM2SD5UEIRSXVLYQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI/action/storage_attestation","attest_author":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI/action/author_attestation","sign_citation":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI/action/citation_signature","submit_replication":"https://pith.science/pith/NLPYVYMSWTM2SD5UEIRSXVLYQI/action/replication_record"}},"created_at":"2026-05-18T02:41:25.930034+00:00","updated_at":"2026-05-18T02:41:25.930034+00:00"}