{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K5HKBLT63UJ6CC33TX422CNGEE","short_pith_number":"pith:K5HKBLT6","schema_version":"1.0","canonical_sha256":"574ea0ae7edd13e10b7b9df9ad09a621218d938008e502d7db92bbe2fa178f22","source":{"kind":"arxiv","id":"1802.06683","version":1},"attestation_state":"computed","paper":{"title":"Unboundedness problems for languages of vector addition systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche, Piotr Hofman, Wojciech Czerwi\\'nski","submitted_at":"2018-02-19T15:58:24Z","abstract_excerpt":"A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being well-understood, it is difficult to devise decision procedures for such languages. This is especially true for checking properties that state the existence of infinitely many words of a particular shape. Informally, we call these \\emph{unboundedness properties}. We present a simple set of axioms for predicates that can express unboundedness properties. Our main result is that such a predicate is decidable for VAS lan"},"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":"1802.06683","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-02-19T15:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"05918d263dedcf4704808752647cc8964ff7ed45278061b13266ea0767713c60","abstract_canon_sha256":"fa9221bf5d87dacaa35e06bbed1e4fa95fc382cf54eff5fe0e0418cf93d04fd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:02.585958Z","signature_b64":"p+eLOdjORIchUKozNzuVLknlfGriiJmAaMK6DdmL6PIACFJliIXUFaIgnZJhmuZyDReh+/IzU0Wr4BqZifD2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"574ea0ae7edd13e10b7b9df9ad09a621218d938008e502d7db92bbe2fa178f22","last_reissued_at":"2026-05-18T00:23:02.585343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:02.585343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unboundedness problems for languages of vector addition systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche, Piotr Hofman, Wojciech Czerwi\\'nski","submitted_at":"2018-02-19T15:58:24Z","abstract_excerpt":"A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being well-understood, it is difficult to devise decision procedures for such languages. This is especially true for checking properties that state the existence of infinitely many words of a particular shape. Informally, we call these \\emph{unboundedness properties}. We present a simple set of axioms for predicates that can express unboundedness properties. Our main result is that such a predicate is decidable for VAS lan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06683","kind":"arxiv","version":1},"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":"1802.06683","created_at":"2026-05-18T00:23:02.585433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06683v1","created_at":"2026-05-18T00:23:02.585433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06683","created_at":"2026-05-18T00:23:02.585433+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5HKBLT63UJ6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5HKBLT63UJ6CC33","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5HKBLT6","created_at":"2026-05-18T12:32:33.847187+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/K5HKBLT63UJ6CC33TX422CNGEE","json":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE.json","graph_json":"https://pith.science/api/pith-number/K5HKBLT63UJ6CC33TX422CNGEE/graph.json","events_json":"https://pith.science/api/pith-number/K5HKBLT63UJ6CC33TX422CNGEE/events.json","paper":"https://pith.science/paper/K5HKBLT6"},"agent_actions":{"view_html":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE","download_json":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE.json","view_paper":"https://pith.science/paper/K5HKBLT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06683&json=true","fetch_graph":"https://pith.science/api/pith-number/K5HKBLT63UJ6CC33TX422CNGEE/graph.json","fetch_events":"https://pith.science/api/pith-number/K5HKBLT63UJ6CC33TX422CNGEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/action/storage_attestation","attest_author":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/action/author_attestation","sign_citation":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/action/citation_signature","submit_replication":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/action/replication_record"}},"created_at":"2026-05-18T00:23:02.585433+00:00","updated_at":"2026-05-18T00:23:02.585433+00:00"}