{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EQUA4ZNWZKAYGWQ7FIIZ5X4O7C","short_pith_number":"pith:EQUA4ZNW","canonical_record":{"source":{"id":"1602.05547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-17T19:43:04Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a81eb856d2c0e5026ba5d15a5314f170dcf6ebc0633274d5027ace31f1695b91","abstract_canon_sha256":"bdf7790705444135ab0bb1e3037c36d703582d5f4af2a24eed5a4e751c082035"},"schema_version":"1.0"},"canonical_sha256":"24280e65b6ca81835a1f2a119edf8ef886b8b9c4fafc45dcad8e495814e7fed6","source":{"kind":"arxiv","id":"1602.05547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05547","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05547v2","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05547","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"EQUA4ZNWZKAY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQUA4ZNWZKAYGWQ7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQUA4ZNW","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EQUA4ZNWZKAYGWQ7FIIZ5X4O7C","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-17T19:43:04Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a81eb856d2c0e5026ba5d15a5314f170dcf6ebc0633274d5027ace31f1695b91","abstract_canon_sha256":"bdf7790705444135ab0bb1e3037c36d703582d5f4af2a24eed5a4e751c082035"},"schema_version":"1.0"},"canonical_sha256":"24280e65b6ca81835a1f2a119edf8ef886b8b9c4fafc45dcad8e495814e7fed6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:32.020471Z","signature_b64":"7uuSeey0vVFmKH/CY1iaSMkoAg5CmolnzFA/8+KIfSVEIQAjBpWeYa57JAlAkoiiPQnbSwkRgZ5pfRtmjoMcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24280e65b6ca81835a1f2a119edf8ef886b8b9c4fafc45dcad8e495814e7fed6","last_reissued_at":"2026-05-18T01:15:32.019731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:32.019731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05547","source_version":2,"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-18T01:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMzh5URwHseJmJXHgj3PRFa6UAHyfqMBs5iFgeWs7/a7e0hpfpKeJeJ3iMpZcgU1uSrvRWnMxQu+WmHg3tpvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:43:18.550918Z"},"content_sha256":"1fc7a4260b00c29a8b613c22cf7bac4fbb3787ba594b7a864bf081f2aae5c8a6","schema_version":"1.0","event_id":"sha256:1fc7a4260b00c29a8b613c22cf7bac4fbb3787ba594b7a864bf081f2aae5c8a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EQUA4ZNWZKAYGWQ7FIIZ5X4O7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Christoph Haase, Patrick Totzke, Ranko Lazi\\'c, Stefan G\\\"oller","submitted_at":"2016-02-17T19:43:04Z","abstract_excerpt":"Branching VASS (BVASS) generalise vector addition systems with states by allowing for special branching transitions that can non-deterministically distribute a counter value between two control states. A run of a BVASS consequently becomes a tree, and reachability is to decide whether a given configuration is the root of a reachability tree. This paper shows P-completeness of reachability in BVASS in dimension one, the first decidability result for reachability in a subclass of BVASS known so far. Moreover, we show that coverability and boundedness in BVASS in dimension one are P-complete as w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05547","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"},"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-18T01:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfpUsrZ6wAC2MVTVGses+RIOLW4/y9fw0aKVj3LOcVkFeGu1Ho+IgQA3q7KyY76pjy9fxxzUhqRcSdMe/Nt1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:43:18.551620Z"},"content_sha256":"1d3315490a5d1597c86adaa4d64a426bd0ce688c1041549a50ab2d5cb76ade5e","schema_version":"1.0","event_id":"sha256:1d3315490a5d1597c86adaa4d64a426bd0ce688c1041549a50ab2d5cb76ade5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C/bundle.json","state_url":"https://pith.science/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C/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-06-09T08:43:18Z","links":{"resolver":"https://pith.science/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C","bundle":"https://pith.science/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C/bundle.json","state":"https://pith.science/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQUA4ZNWZKAYGWQ7FIIZ5X4O7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EQUA4ZNWZKAYGWQ7FIIZ5X4O7C","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":"bdf7790705444135ab0bb1e3037c36d703582d5f4af2a24eed5a4e751c082035","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-17T19:43:04Z","title_canon_sha256":"a81eb856d2c0e5026ba5d15a5314f170dcf6ebc0633274d5027ace31f1695b91"},"schema_version":"1.0","source":{"id":"1602.05547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05547","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05547v2","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05547","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"EQUA4ZNWZKAY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQUA4ZNWZKAYGWQ7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQUA4ZNW","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1d3315490a5d1597c86adaa4d64a426bd0ce688c1041549a50ab2d5cb76ade5e","target":"graph","created_at":"2026-05-18T01:15:32Z","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":"Branching VASS (BVASS) generalise vector addition systems with states by allowing for special branching transitions that can non-deterministically distribute a counter value between two control states. A run of a BVASS consequently becomes a tree, and reachability is to decide whether a given configuration is the root of a reachability tree. This paper shows P-completeness of reachability in BVASS in dimension one, the first decidability result for reachability in a subclass of BVASS known so far. Moreover, we show that coverability and boundedness in BVASS in dimension one are P-complete as w","authors_text":"Christoph Haase, Patrick Totzke, Ranko Lazi\\'c, Stefan G\\\"oller","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-17T19:43:04Z","title":"A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05547","kind":"arxiv","version":2},"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:1fc7a4260b00c29a8b613c22cf7bac4fbb3787ba594b7a864bf081f2aae5c8a6","target":"record","created_at":"2026-05-18T01:15:32Z","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":"bdf7790705444135ab0bb1e3037c36d703582d5f4af2a24eed5a4e751c082035","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-17T19:43:04Z","title_canon_sha256":"a81eb856d2c0e5026ba5d15a5314f170dcf6ebc0633274d5027ace31f1695b91"},"schema_version":"1.0","source":{"id":"1602.05547","kind":"arxiv","version":2}},"canonical_sha256":"24280e65b6ca81835a1f2a119edf8ef886b8b9c4fafc45dcad8e495814e7fed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24280e65b6ca81835a1f2a119edf8ef886b8b9c4fafc45dcad8e495814e7fed6","first_computed_at":"2026-05-18T01:15:32.019731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:32.019731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7uuSeey0vVFmKH/CY1iaSMkoAg5CmolnzFA/8+KIfSVEIQAjBpWeYa57JAlAkoiiPQnbSwkRgZ5pfRtmjoMcCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:32.020471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fc7a4260b00c29a8b613c22cf7bac4fbb3787ba594b7a864bf081f2aae5c8a6","sha256:1d3315490a5d1597c86adaa4d64a426bd0ce688c1041549a50ab2d5cb76ade5e"],"state_sha256":"11eed2f157c9eeb28c1f226c01ce79714a90768538021349d090ff84292a0187"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yelCU3/yiQYUPkGEjXyQ1Hsd2JaRoFw0kkUK39ISYmxzcINKJ9zF+kGCy4ArLSODwn2Gz4Y9ac8Uzay7LpzfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:43:18.555588Z","bundle_sha256":"c6ad7a8d45903e0639e494b57c92fc1a3f4825593d96049dbc6e0c437db0670f"}}