{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MQZEKILRNYMFHRKD24LIAIVTIO","short_pith_number":"pith:MQZEKILR","schema_version":"1.0","canonical_sha256":"64324521716e1853c543d7168022b343a79beb97d2da899c458ca248354b0129","source":{"kind":"arxiv","id":"1205.4458","version":2},"attestation_state":"computed","paper":{"title":"Model Checking Vector Addition Systems with one zero-test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Alain Finkel (LSV, CNRS, ENS Cachan, France, France), J\\'er\\^ome Leroux (LaBRI, LaBRI, Marc Zeitoun (LSV, R\\'emi Bonnet (LSV, Universit\\'e de Bordeaux","submitted_at":"2012-05-20T20:48:35Z","abstract_excerpt":"We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test. This algorithm yields decision procedures for several problems for these systems, open until now, such as place-boundedness or LTL model-checking. The proof techniques to handle the zero-test are based on two new notions of cover: the refined and the filtered cover. The refined cover is a hybrid between the reachability set and the classical cover. It inherits properties of t"},"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":"1205.4458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-20T20:48:35Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"ffa53c80c583e0a0d422a81086a1234931f8a79bd6f1ea0714411bbc29280718","abstract_canon_sha256":"d06aecbaab59a95b87d05faacf10a91ff0f852558fae4a7878519e30ce1efa4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.771509Z","signature_b64":"07sA8AxHvbmnJXJAU/w/6wbjL7uowcXMljaU6kyhAALPkncksJ2SuUD4bttMLOmcUVgwtvy5twbi+x0xbY9FBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64324521716e1853c543d7168022b343a79beb97d2da899c458ca248354b0129","last_reissued_at":"2026-05-18T01:37:38.770839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.770839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking Vector Addition Systems with one zero-test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Alain Finkel (LSV, CNRS, ENS Cachan, France, France), J\\'er\\^ome Leroux (LaBRI, LaBRI, Marc Zeitoun (LSV, R\\'emi Bonnet (LSV, Universit\\'e de Bordeaux","submitted_at":"2012-05-20T20:48:35Z","abstract_excerpt":"We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test. This algorithm yields decision procedures for several problems for these systems, open until now, such as place-boundedness or LTL model-checking. The proof techniques to handle the zero-test are based on two new notions of cover: the refined and the filtered cover. The refined cover is a hybrid between the reachability set and the classical cover. It inherits properties of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4458","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":"1205.4458","created_at":"2026-05-18T01:37:38.770929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4458v2","created_at":"2026-05-18T01:37:38.770929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4458","created_at":"2026-05-18T01:37:38.770929+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQZEKILRNYMF","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQZEKILRNYMFHRKD","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQZEKILR","created_at":"2026-05-18T12:27:14.488303+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/MQZEKILRNYMFHRKD24LIAIVTIO","json":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO.json","graph_json":"https://pith.science/api/pith-number/MQZEKILRNYMFHRKD24LIAIVTIO/graph.json","events_json":"https://pith.science/api/pith-number/MQZEKILRNYMFHRKD24LIAIVTIO/events.json","paper":"https://pith.science/paper/MQZEKILR"},"agent_actions":{"view_html":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO","download_json":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO.json","view_paper":"https://pith.science/paper/MQZEKILR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4458&json=true","fetch_graph":"https://pith.science/api/pith-number/MQZEKILRNYMFHRKD24LIAIVTIO/graph.json","fetch_events":"https://pith.science/api/pith-number/MQZEKILRNYMFHRKD24LIAIVTIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO/action/storage_attestation","attest_author":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO/action/author_attestation","sign_citation":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO/action/citation_signature","submit_replication":"https://pith.science/pith/MQZEKILRNYMFHRKD24LIAIVTIO/action/replication_record"}},"created_at":"2026-05-18T01:37:38.770929+00:00","updated_at":"2026-05-18T01:37:38.770929+00:00"}