{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K5HKBLT63UJ6CC33TX422CNGEE","short_pith_number":"pith:K5HKBLT6","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"},"canonical_sha256":"574ea0ae7edd13e10b7b9df9ad09a621218d938008e502d7db92bbe2fa178f22","source":{"kind":"arxiv","id":"1802.06683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06683","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06683v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06683","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"K5HKBLT63UJ6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K5HKBLT63UJ6CC33","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K5HKBLT6","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K5HKBLT63UJ6CC33TX422CNGEE","target":"record","payload":{"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"},"canonical_sha256":"574ea0ae7edd13e10b7b9df9ad09a621218d938008e502d7db92bbe2fa178f22","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"},"source_kind":"arxiv","source_id":"1802.06683","source_version":1,"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-18T00:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VV3v1neV0TEyt+ljbF/i8LxKkYQG69B0Z1vMzG/LbXQfAjCJBN7W6GhZcan6NUGv+BTwGIuNFIoqbctmFYo5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:22:52.429106Z"},"content_sha256":"c7e1d01f83e7d33e07b348a739da33d56d37a2044e099d54ecd2c9fbaebd2cfe","schema_version":"1.0","event_id":"sha256:c7e1d01f83e7d33e07b348a739da33d56d37a2044e099d54ecd2c9fbaebd2cfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K5HKBLT63UJ6CC33TX422CNGEE","target":"graph","payload":{"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"},"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-18T00:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPF8zqd8bmm4Ypozo98x4HRzGFohb33EeCuTaqOTUi4Y1rmZaoPWK7qQq9/ltgomP000LvqUA9fs5iqQiBSqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:22:52.429760Z"},"content_sha256":"5d36ad1893de960c8acd45a6f0074178816fa6649ce36a44653489fa2ba4aca0","schema_version":"1.0","event_id":"sha256:5d36ad1893de960c8acd45a6f0074178816fa6649ce36a44653489fa2ba4aca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/bundle.json","state_url":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5HKBLT63UJ6CC33TX422CNGEE/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-05-27T12:22:52Z","links":{"resolver":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE","bundle":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/bundle.json","state":"https://pith.science/pith/K5HKBLT63UJ6CC33TX422CNGEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5HKBLT63UJ6CC33TX422CNGEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K5HKBLT63UJ6CC33TX422CNGEE","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":"fa9221bf5d87dacaa35e06bbed1e4fa95fc382cf54eff5fe0e0418cf93d04fd2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-02-19T15:58:24Z","title_canon_sha256":"05918d263dedcf4704808752647cc8964ff7ed45278061b13266ea0767713c60"},"schema_version":"1.0","source":{"id":"1802.06683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06683","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06683v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06683","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"K5HKBLT63UJ6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K5HKBLT63UJ6CC33","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K5HKBLT6","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:5d36ad1893de960c8acd45a6f0074178816fa6649ce36a44653489fa2ba4aca0","target":"graph","created_at":"2026-05-18T00:23:02Z","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":"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","authors_text":"Georg Zetzsche, Piotr Hofman, Wojciech Czerwi\\'nski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-02-19T15:58:24Z","title":"Unboundedness problems for languages of vector addition systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06683","kind":"arxiv","version":1},"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:c7e1d01f83e7d33e07b348a739da33d56d37a2044e099d54ecd2c9fbaebd2cfe","target":"record","created_at":"2026-05-18T00:23:02Z","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":"fa9221bf5d87dacaa35e06bbed1e4fa95fc382cf54eff5fe0e0418cf93d04fd2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-02-19T15:58:24Z","title_canon_sha256":"05918d263dedcf4704808752647cc8964ff7ed45278061b13266ea0767713c60"},"schema_version":"1.0","source":{"id":"1802.06683","kind":"arxiv","version":1}},"canonical_sha256":"574ea0ae7edd13e10b7b9df9ad09a621218d938008e502d7db92bbe2fa178f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"574ea0ae7edd13e10b7b9df9ad09a621218d938008e502d7db92bbe2fa178f22","first_computed_at":"2026-05-18T00:23:02.585343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:02.585343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p+eLOdjORIchUKozNzuVLknlfGriiJmAaMK6DdmL6PIACFJliIXUFaIgnZJhmuZyDReh+/IzU0Wr4BqZifD2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:02.585958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7e1d01f83e7d33e07b348a739da33d56d37a2044e099d54ecd2c9fbaebd2cfe","sha256:5d36ad1893de960c8acd45a6f0074178816fa6649ce36a44653489fa2ba4aca0"],"state_sha256":"1447c84549b59e73971cc90b476f910c71c5c187a3a6d15fd724e2a9bee3011d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hAARBMIHzzP2tSkEbEWx0UNsUTtzFO1S2WFKmzcTl46YcWLoRxvTmDi6XEQy8pDDLXTMDh3g1Ch/vcOuk3TAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:22:52.433194Z","bundle_sha256":"0639c510c43c1f0c78791b3813c0458a61bd635b045777ffc7cd6aa8f71c4041"}}