{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UMYNIU7LRVELH43XGPN7RGRJRP","short_pith_number":"pith:UMYNIU7L","canonical_record":{"source":{"id":"1606.08707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-28T13:58:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"eb613308faf86deadcaf191a6655f8c3932047b13227a05dacb0bce3a1f9deb6","abstract_canon_sha256":"5dd38568de5825fd884f1351986bd60933db6cacdcacd8a19355a05cf756191a"},"schema_version":"1.0"},"canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","source":{"kind":"arxiv","id":"1606.08707","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08707","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08707v2","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08707","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"UMYNIU7LRVEL","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMYNIU7LRVELH43X","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMYNIU7L","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UMYNIU7LRVELH43XGPN7RGRJRP","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-28T13:58:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"eb613308faf86deadcaf191a6655f8c3932047b13227a05dacb0bce3a1f9deb6","abstract_canon_sha256":"5dd38568de5825fd884f1351986bd60933db6cacdcacd8a19355a05cf756191a"},"schema_version":"1.0"},"canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:58.846542Z","signature_b64":"RWk28KBlNqbKU2O62IN0qTVVHByFaGpThPTQ9GJ74tPwjm2u5ZqJIz1JEYCyPgBxEt1mZEr7YypeGNLJxGyACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","last_reissued_at":"2026-05-18T01:10:58.846021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:58.846021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08707","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNas57rsPYkxdgP1NQyi5SiNCwuILEFgdHHSoa+JuUb/z7pU1OhHQEkGidBLfjU0RwHoFFTcel7AaMtgv/4iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:23:39.578797Z"},"content_sha256":"be078d62bfa012e754f6532625d3fab99da53223385453ad3b777446dc54afba","schema_version":"1.0","event_id":"sha256:be078d62bfa012e754f6532625d3fab99da53223385453ad3b777446dc54afba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UMYNIU7LRVELH43XGPN7RGRJRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On parametrized verification of asynchronous, shared-memory pushdown systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Anca Muscholl, Igor Walukiewicz, Marie Fortin","submitted_at":"2016-06-28T13:58:20Z","abstract_excerpt":"We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [Esparza, Ganty, Majumdar'13] and that liveness is decidable in NEXPTIME [Durand-Gasselin, Esparza, Ganty, Majumdar'15]. We show here that the liveness problem is PSPACE-complete. We also introduce the universal reachability problem. We show that it is decidable, and coNEXPTIME-complete. Finally, using these results, we prove that the verifying regular properties of traces of executions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08707","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LB532mEm+j5s9s+wSrNrkwJRx1u9QsrFuhdUojODBFZZ5cO3/deLdya29HAt3UfgSjOecyGs6HyqhRGVD/lMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:23:39.579468Z"},"content_sha256":"7b7f76135e1937709763b691d15c5bdee1c9713a699b8c69a9105937b5838485","schema_version":"1.0","event_id":"sha256:7b7f76135e1937709763b691d15c5bdee1c9713a699b8c69a9105937b5838485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/bundle.json","state_url":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMYNIU7LRVELH43XGPN7RGRJRP/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-31T19:23:39Z","links":{"resolver":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP","bundle":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/bundle.json","state":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMYNIU7LRVELH43XGPN7RGRJRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UMYNIU7LRVELH43XGPN7RGRJRP","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":"5dd38568de5825fd884f1351986bd60933db6cacdcacd8a19355a05cf756191a","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-28T13:58:20Z","title_canon_sha256":"eb613308faf86deadcaf191a6655f8c3932047b13227a05dacb0bce3a1f9deb6"},"schema_version":"1.0","source":{"id":"1606.08707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08707","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08707v2","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08707","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"UMYNIU7LRVEL","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMYNIU7LRVELH43X","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMYNIU7L","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:7b7f76135e1937709763b691d15c5bdee1c9713a699b8c69a9105937b5838485","target":"graph","created_at":"2026-05-18T01:10:58Z","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":"We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [Esparza, Ganty, Majumdar'13] and that liveness is decidable in NEXPTIME [Durand-Gasselin, Esparza, Ganty, Majumdar'15]. We show here that the liveness problem is PSPACE-complete. We also introduce the universal reachability problem. We show that it is decidable, and coNEXPTIME-complete. Finally, using these results, we prove that the verifying regular properties of traces of executions,","authors_text":"Anca Muscholl, Igor Walukiewicz, Marie Fortin","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-28T13:58:20Z","title":"On parametrized verification of asynchronous, shared-memory pushdown systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08707","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:be078d62bfa012e754f6532625d3fab99da53223385453ad3b777446dc54afba","target":"record","created_at":"2026-05-18T01:10:58Z","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":"5dd38568de5825fd884f1351986bd60933db6cacdcacd8a19355a05cf756191a","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-28T13:58:20Z","title_canon_sha256":"eb613308faf86deadcaf191a6655f8c3932047b13227a05dacb0bce3a1f9deb6"},"schema_version":"1.0","source":{"id":"1606.08707","kind":"arxiv","version":2}},"canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","first_computed_at":"2026-05-18T01:10:58.846021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:58.846021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWk28KBlNqbKU2O62IN0qTVVHByFaGpThPTQ9GJ74tPwjm2u5ZqJIz1JEYCyPgBxEt1mZEr7YypeGNLJxGyACg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:58.846542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be078d62bfa012e754f6532625d3fab99da53223385453ad3b777446dc54afba","sha256:7b7f76135e1937709763b691d15c5bdee1c9713a699b8c69a9105937b5838485"],"state_sha256":"214a8e205eaaae9059855313f2901ec20b7a7b818c3f3952c95e9a971f09cccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEmL+7i0odd1PZy344Bt32G3OcyjPAP7vXXWvvzN0hbhH/ISlsBTYIs0zay1f4wQstpOQVcbkYbp8KkKKF6WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:23:39.584125Z","bundle_sha256":"70707c4475e21b1a7494f8cc98a2a479db538e2f13012b6a5711b5c05ac6af64"}}