{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DWHEF2JS54E5N7XDESMHEKEPK","short_pith_number":"pith:4DWHEF2J","canonical_record":{"source":{"id":"1401.6325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T12:26:27Z","cross_cats_sorted":["cs.FL","cs.PL"],"title_canon_sha256":"f0337483420827c236989c639eb5d85f94df1953a81e71cf71c13801b7f8c824","abstract_canon_sha256":"43e9c2f16019e0d231db2538daea4c9b2b432c1e9ac67e43c82a95c447532b3c"},"schema_version":"1.0"},"canonical_sha256":"e0ec72174997784eb7f71924c391447a8f1e4d93d9f8c9c7dfeebf12cb7310e5","source":{"kind":"arxiv","id":"1401.6325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6325","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6325v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6325","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"4DWHEF2JS54E","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DWHEF2JS54E5N7X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DWHEF2J","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DWHEF2JS54E5N7XDESMHEKEPK","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T12:26:27Z","cross_cats_sorted":["cs.FL","cs.PL"],"title_canon_sha256":"f0337483420827c236989c639eb5d85f94df1953a81e71cf71c13801b7f8c824","abstract_canon_sha256":"43e9c2f16019e0d231db2538daea4c9b2b432c1e9ac67e43c82a95c447532b3c"},"schema_version":"1.0"},"canonical_sha256":"e0ec72174997784eb7f71924c391447a8f1e4d93d9f8c9c7dfeebf12cb7310e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.480371Z","signature_b64":"MuDBER4g0PMKhF+1FLT4WpxWMDruJ5fuzOEoDhj8BtvP0nNTznJo9ssQ6AjNbhwIURXOhZ2c1gpfA+Q9Ru2PCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0ec72174997784eb7f71924c391447a8f1e4d93d9f8c9c7dfeebf12cb7310e5","last_reissued_at":"2026-05-18T03:01:12.479581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.479581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6325","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sMxf1h/iUYTGji1oVFlYpnlCH9L+sDvz0/qqqoCK3Ngrxx3X+JNVmJzltvdGqx8PPHcjWfVPdU22BVY/sI5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:11:32.168604Z"},"content_sha256":"1eaa9fb028c58f209bb66490fcbddca899e7523194c21d9216528e79d38e5fbc","schema_version":"1.0","event_id":"sha256:1eaa9fb028c58f209bb66490fcbddca899e7523194c21d9216528e79d38e5fbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DWHEF2JS54E5N7XDESMHEKEPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safety verification of asynchronous pushdown systems with shaped stacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.PL"],"primary_cat":"cs.LO","authors_text":"C-H Luke Ong, Jonathan Kochems","submitted_at":"2014-01-24T12:26:27Z","abstract_excerpt":"In this paper, we study the program-point reachability problem of concurrent pushdown systems that communicate via unbounded and unordered message buffers. Our goal is to relax the common restriction that messages can only be retrieved by a pushdown process when its stack is empty. We use the notion of partially commutative context-free grammars to describe a new class of asynchronously communicating pushdown systems with a mild shape constraint on the stacks for which the program-point coverability problem remains decidable. Stacks that fit the shape constraint may reach arbitrary heights; fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6325","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HUgf6f1YPWumPbGPlW5Bj2VUoDTWN0AWuNOWMzdgQtHYqY0rUvIMCCvqSAVIan4htiRwe7cL1eqHSO3CUWaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:11:32.168956Z"},"content_sha256":"a55988cb863640e0716e3e7f06aadfaac779819bb3f35603fff09f48150d995e","schema_version":"1.0","event_id":"sha256:a55988cb863640e0716e3e7f06aadfaac779819bb3f35603fff09f48150d995e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/bundle.json","state_url":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DWHEF2JS54E5N7XDESMHEKEPK/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-24T07:11:32Z","links":{"resolver":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK","bundle":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/bundle.json","state":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DWHEF2JS54E5N7XDESMHEKEPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DWHEF2JS54E5N7XDESMHEKEPK","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":"43e9c2f16019e0d231db2538daea4c9b2b432c1e9ac67e43c82a95c447532b3c","cross_cats_sorted":["cs.FL","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T12:26:27Z","title_canon_sha256":"f0337483420827c236989c639eb5d85f94df1953a81e71cf71c13801b7f8c824"},"schema_version":"1.0","source":{"id":"1401.6325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6325","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6325v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6325","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"4DWHEF2JS54E","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DWHEF2JS54E5N7X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DWHEF2J","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:a55988cb863640e0716e3e7f06aadfaac779819bb3f35603fff09f48150d995e","target":"graph","created_at":"2026-05-18T03:01:12Z","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":"In this paper, we study the program-point reachability problem of concurrent pushdown systems that communicate via unbounded and unordered message buffers. Our goal is to relax the common restriction that messages can only be retrieved by a pushdown process when its stack is empty. We use the notion of partially commutative context-free grammars to describe a new class of asynchronously communicating pushdown systems with a mild shape constraint on the stacks for which the program-point coverability problem remains decidable. Stacks that fit the shape constraint may reach arbitrary heights; fu","authors_text":"C-H Luke Ong, Jonathan Kochems","cross_cats":["cs.FL","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T12:26:27Z","title":"Safety verification of asynchronous pushdown systems with shaped stacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6325","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:1eaa9fb028c58f209bb66490fcbddca899e7523194c21d9216528e79d38e5fbc","target":"record","created_at":"2026-05-18T03:01:12Z","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":"43e9c2f16019e0d231db2538daea4c9b2b432c1e9ac67e43c82a95c447532b3c","cross_cats_sorted":["cs.FL","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T12:26:27Z","title_canon_sha256":"f0337483420827c236989c639eb5d85f94df1953a81e71cf71c13801b7f8c824"},"schema_version":"1.0","source":{"id":"1401.6325","kind":"arxiv","version":1}},"canonical_sha256":"e0ec72174997784eb7f71924c391447a8f1e4d93d9f8c9c7dfeebf12cb7310e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0ec72174997784eb7f71924c391447a8f1e4d93d9f8c9c7dfeebf12cb7310e5","first_computed_at":"2026-05-18T03:01:12.479581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:12.479581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MuDBER4g0PMKhF+1FLT4WpxWMDruJ5fuzOEoDhj8BtvP0nNTznJo9ssQ6AjNbhwIURXOhZ2c1gpfA+Q9Ru2PCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:12.480371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eaa9fb028c58f209bb66490fcbddca899e7523194c21d9216528e79d38e5fbc","sha256:a55988cb863640e0716e3e7f06aadfaac779819bb3f35603fff09f48150d995e"],"state_sha256":"75a67a184805075d604d398dc9eab2f6fff723c400d401aa0254b26bd2b942e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpnzSYf4WfGIfWrZwQ1LWZLjbPD2BL605SJqJLLpmHGZnVLSyvGbzfqbZmuBXGvWhIRs4JyWR8S+K3NKhRbECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:11:32.171097Z","bundle_sha256":"9851d125aba1a06374f3d310ca16e9a284f06914e00639f6c1bad9930f02f1c4"}}