{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D2COL52ATW2AI6XL667Z3YG5QI","short_pith_number":"pith:D2COL52A","canonical_record":{"source":{"id":"1804.10985","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T20:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"315a30257981e6a5bcf963ed71d89bfa25798bcef1b4ed2a1d26487f2591a0f8","abstract_canon_sha256":"026a9afeb80ec4adac08882b7c8db3967141d475b97ec18db783d4396c2eab46"},"schema_version":"1.0"},"canonical_sha256":"1e84e5f7409db4047aebf7bf9de0dd823758a394cb81533dea6cdc1d9165fdc5","source":{"kind":"arxiv","id":"1804.10985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10985","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10985v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10985","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"D2COL52ATW2A","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D2COL52ATW2AI6XL","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D2COL52A","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D2COL52ATW2AI6XL667Z3YG5QI","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10985","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T20:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"315a30257981e6a5bcf963ed71d89bfa25798bcef1b4ed2a1d26487f2591a0f8","abstract_canon_sha256":"026a9afeb80ec4adac08882b7c8db3967141d475b97ec18db783d4396c2eab46"},"schema_version":"1.0"},"canonical_sha256":"1e84e5f7409db4047aebf7bf9de0dd823758a394cb81533dea6cdc1d9165fdc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.979743Z","signature_b64":"zWpD18Zk/Zv0KOwH1ES0VxhzoDp2obk45m4NiI8GJ9QtmbwzEfDHHTtrPrfRTnR5AjYYIZE0X6Z9/ZkqSk8EAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e84e5f7409db4047aebf7bf9de0dd823758a394cb81533dea6cdc1d9165fdc5","last_reissued_at":"2026-05-18T00:17:14.979133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.979133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10985","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:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpsI5cxiWQ4rVrTIsPySMYsgwm1BiDhJesO16Y+2bDVp/SNGnQBFPAlFSm/+aRDU0V6zYx7S0iFy4xudAIDMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:44:09.295020Z"},"content_sha256":"cd7a7a1a53f4a536c556e31fc6688f23e39c2c92acd3505ab0881a483e913fe0","schema_version":"1.0","event_id":"sha256:cd7a7a1a53f4a536c556e31fc6688f23e39c2c92acd3505ab0881a483e913fe0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D2COL52ATW2AI6XL667Z3YG5QI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anton\\'in Ku\\v{c}era, Dominik Velan, Florian Zuleger, Krishnendu Chatterjee, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2018-04-29T20:01:00Z","abstract_excerpt":"Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10985","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:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csBbPGQCF2swtSu7KvbZ7OHJ8glj0P99RvOskpQWCdpWm2CJN+dNFhZxQRqIJn3Mus5wJuU4Fe/LO4s0tHVeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:44:09.295731Z"},"content_sha256":"32cddd3867cc025e9c8b4e90d6e7ea88cc1d109a1980d7f3b21097ab02fda7b8","schema_version":"1.0","event_id":"sha256:32cddd3867cc025e9c8b4e90d6e7ea88cc1d109a1980d7f3b21097ab02fda7b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2COL52ATW2AI6XL667Z3YG5QI/bundle.json","state_url":"https://pith.science/pith/D2COL52ATW2AI6XL667Z3YG5QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2COL52ATW2AI6XL667Z3YG5QI/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-25T20:44:09Z","links":{"resolver":"https://pith.science/pith/D2COL52ATW2AI6XL667Z3YG5QI","bundle":"https://pith.science/pith/D2COL52ATW2AI6XL667Z3YG5QI/bundle.json","state":"https://pith.science/pith/D2COL52ATW2AI6XL667Z3YG5QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2COL52ATW2AI6XL667Z3YG5QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D2COL52ATW2AI6XL667Z3YG5QI","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":"026a9afeb80ec4adac08882b7c8db3967141d475b97ec18db783d4396c2eab46","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T20:01:00Z","title_canon_sha256":"315a30257981e6a5bcf963ed71d89bfa25798bcef1b4ed2a1d26487f2591a0f8"},"schema_version":"1.0","source":{"id":"1804.10985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10985","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10985v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10985","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"D2COL52ATW2A","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D2COL52ATW2AI6XL","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D2COL52A","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:32cddd3867cc025e9c8b4e90d6e7ea88cc1d109a1980d7f3b21097ab02fda7b8","target":"graph","created_at":"2026-05-18T00:17:14Z","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":"Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. ","authors_text":"Anton\\'in Ku\\v{c}era, Dominik Velan, Florian Zuleger, Krishnendu Chatterjee, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T20:01:00Z","title":"Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10985","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:cd7a7a1a53f4a536c556e31fc6688f23e39c2c92acd3505ab0881a483e913fe0","target":"record","created_at":"2026-05-18T00:17:14Z","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":"026a9afeb80ec4adac08882b7c8db3967141d475b97ec18db783d4396c2eab46","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T20:01:00Z","title_canon_sha256":"315a30257981e6a5bcf963ed71d89bfa25798bcef1b4ed2a1d26487f2591a0f8"},"schema_version":"1.0","source":{"id":"1804.10985","kind":"arxiv","version":1}},"canonical_sha256":"1e84e5f7409db4047aebf7bf9de0dd823758a394cb81533dea6cdc1d9165fdc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e84e5f7409db4047aebf7bf9de0dd823758a394cb81533dea6cdc1d9165fdc5","first_computed_at":"2026-05-18T00:17:14.979133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:14.979133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWpD18Zk/Zv0KOwH1ES0VxhzoDp2obk45m4NiI8GJ9QtmbwzEfDHHTtrPrfRTnR5AjYYIZE0X6Z9/ZkqSk8EAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:14.979743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd7a7a1a53f4a536c556e31fc6688f23e39c2c92acd3505ab0881a483e913fe0","sha256:32cddd3867cc025e9c8b4e90d6e7ea88cc1d109a1980d7f3b21097ab02fda7b8"],"state_sha256":"db80a08d6625a26b767b543973bf2112dae376accf41bca564236dc5c62cecc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6a2MaBT9k5DaeP0kz6n+1TUVGkEoUfxzQGjpbO0wlKOksKGS+sP426tIGdNnYvjTFITY+b/niiTnA3l09dMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:44:09.299190Z","bundle_sha256":"f7cab43184106d5de1d1cbaa9221732cacc8e10a408aa97cb9bfe8faa42c33fa"}}