{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:REY6S7QWNZAZS5UQ7FG22PFAVE","short_pith_number":"pith:REY6S7QW","canonical_record":{"source":{"id":"1308.3996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-19T12:09:44Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"05cddd6bd7be7c0f7d016194eac74465c2c2bf40d04b9f0da73f275bcbe5c062","abstract_canon_sha256":"bceadd8aa187022c4347d239189a033866f88cd9c22fb60f3713c518c33492d4"},"schema_version":"1.0"},"canonical_sha256":"8931e97e166e41997690f94dad3ca0a908db43bf3d8db4f404351ccb97c553b5","source":{"kind":"arxiv","id":"1308.3996","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3996","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3996v3","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3996","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"REY6S7QWNZAZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"REY6S7QWNZAZS5UQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"REY6S7QW","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:REY6S7QWNZAZS5UQ7FG22PFAVE","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-19T12:09:44Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"05cddd6bd7be7c0f7d016194eac74465c2c2bf40d04b9f0da73f275bcbe5c062","abstract_canon_sha256":"bceadd8aa187022c4347d239189a033866f88cd9c22fb60f3713c518c33492d4"},"schema_version":"1.0"},"canonical_sha256":"8931e97e166e41997690f94dad3ca0a908db43bf3d8db4f404351ccb97c553b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:37.910690Z","signature_b64":"a8StLrMw29GJY/gd+VA1pT9YKcitfFDAo9RdZ5cFpJtO0X6A/NZmoMDH0EKaIyT3EhaPvNupfIU8MjroYrE8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8931e97e166e41997690f94dad3ca0a908db43bf3d8db4f404351ccb97c553b5","last_reissued_at":"2026-05-18T01:37:37.910171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:37.910171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3996","source_version":3,"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:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XRBQdTtMYKnE3FXxcIpZ6YPVly3K7ij9AZ2eq6PGfvGeC0Mn5Sdd8hXERoYiVPcnsbQ033pBTGdeCLXb3rrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:12:46.236483Z"},"content_sha256":"9ecd3120a5207dff38c91f4808337b9a3fdf549bef18b20518b6c7e548b62415","schema_version":"1.0","event_id":"sha256:9ecd3120a5207dff38c91f4808337b9a3fdf549bef18b20518b6c7e548b62415"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:REY6S7QWNZAZS5UQ7FG22PFAVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability Problem for Weak Multi-Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Piotr Hofman (University of Warsaw), S{\\l}awomir Lasota (University of Warsaw), Wojciech Czerwi\\'nski (Universit\\\"at Bayreuth)","submitted_at":"2013-08-19T12:09:44Z","abstract_excerpt":"This paper is about reachability analysis in a restricted subclass of multi-pushdown automata. We assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the order. We prove decidability of the reachability problem, and computability of the backward reachability set. As the main contribution, we identify relevant subclasses where the reachability problem becomes NP-complete. This matches the complexity of the same problem for communication-free vector addition systems, a special case of stateless multi-pushdown auto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3996","kind":"arxiv","version":3},"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:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPT62tGtfsl2tZaiAdLjl+KxULJJGWIf8twbh4Nt3+2N4rgkjs+9EdfoWkB0PDTfR+JvkCDOBBKW60CXEmlADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:12:46.236828Z"},"content_sha256":"2d88c4e0f25123992be474f7b9a3bb8c5157e6fdb934c2e6cefef3f048a64c58","schema_version":"1.0","event_id":"sha256:2d88c4e0f25123992be474f7b9a3bb8c5157e6fdb934c2e6cefef3f048a64c58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REY6S7QWNZAZS5UQ7FG22PFAVE/bundle.json","state_url":"https://pith.science/pith/REY6S7QWNZAZS5UQ7FG22PFAVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REY6S7QWNZAZS5UQ7FG22PFAVE/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-24T04:12:46Z","links":{"resolver":"https://pith.science/pith/REY6S7QWNZAZS5UQ7FG22PFAVE","bundle":"https://pith.science/pith/REY6S7QWNZAZS5UQ7FG22PFAVE/bundle.json","state":"https://pith.science/pith/REY6S7QWNZAZS5UQ7FG22PFAVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REY6S7QWNZAZS5UQ7FG22PFAVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:REY6S7QWNZAZS5UQ7FG22PFAVE","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":"bceadd8aa187022c4347d239189a033866f88cd9c22fb60f3713c518c33492d4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-19T12:09:44Z","title_canon_sha256":"05cddd6bd7be7c0f7d016194eac74465c2c2bf40d04b9f0da73f275bcbe5c062"},"schema_version":"1.0","source":{"id":"1308.3996","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3996","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3996v3","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3996","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"REY6S7QWNZAZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"REY6S7QWNZAZS5UQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"REY6S7QW","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2d88c4e0f25123992be474f7b9a3bb8c5157e6fdb934c2e6cefef3f048a64c58","target":"graph","created_at":"2026-05-18T01:37:37Z","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":"This paper is about reachability analysis in a restricted subclass of multi-pushdown automata. We assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the order. We prove decidability of the reachability problem, and computability of the backward reachability set. As the main contribution, we identify relevant subclasses where the reachability problem becomes NP-complete. This matches the complexity of the same problem for communication-free vector addition systems, a special case of stateless multi-pushdown auto","authors_text":"Piotr Hofman (University of Warsaw), S{\\l}awomir Lasota (University of Warsaw), Wojciech Czerwi\\'nski (Universit\\\"at Bayreuth)","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-19T12:09:44Z","title":"Reachability Problem for Weak Multi-Pushdown Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3996","kind":"arxiv","version":3},"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:9ecd3120a5207dff38c91f4808337b9a3fdf549bef18b20518b6c7e548b62415","target":"record","created_at":"2026-05-18T01:37:37Z","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":"bceadd8aa187022c4347d239189a033866f88cd9c22fb60f3713c518c33492d4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-19T12:09:44Z","title_canon_sha256":"05cddd6bd7be7c0f7d016194eac74465c2c2bf40d04b9f0da73f275bcbe5c062"},"schema_version":"1.0","source":{"id":"1308.3996","kind":"arxiv","version":3}},"canonical_sha256":"8931e97e166e41997690f94dad3ca0a908db43bf3d8db4f404351ccb97c553b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8931e97e166e41997690f94dad3ca0a908db43bf3d8db4f404351ccb97c553b5","first_computed_at":"2026-05-18T01:37:37.910171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:37.910171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a8StLrMw29GJY/gd+VA1pT9YKcitfFDAo9RdZ5cFpJtO0X6A/NZmoMDH0EKaIyT3EhaPvNupfIU8MjroYrE8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:37.910690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3996","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ecd3120a5207dff38c91f4808337b9a3fdf549bef18b20518b6c7e548b62415","sha256:2d88c4e0f25123992be474f7b9a3bb8c5157e6fdb934c2e6cefef3f048a64c58"],"state_sha256":"f5e3147e6b2fd6e93ead2302c15d36d850332d838a00a8da6acb3852eed8a0f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X22wa12UX9gf9k5eMGDQPKfFYehVOrKDs7U7NpUtefsam95oEYzrw901FT9y9FJ4wwyrmUBpBft8iXWlfiTeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:12:46.238826Z","bundle_sha256":"7bfdfc1cf1704b40b83d7b443faef90b8e0bf254866053a4d9aa8f6c445b2ed7"}}