{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4DWHEF2JS54E5N7XDESMHEKEPK","short_pith_number":"pith:4DWHEF2J","schema_version":"1.0","canonical_sha256":"e0ec72174997784eb7f71924c391447a8f1e4d93d9f8c9c7dfeebf12cb7310e5","source":{"kind":"arxiv","id":"1401.6325","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6325","created_at":"2026-05-18T03:01:12.479740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6325v1","created_at":"2026-05-18T03:01:12.479740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6325","created_at":"2026-05-18T03:01:12.479740+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DWHEF2JS54E","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DWHEF2JS54E5N7X","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DWHEF2J","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK","json":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK.json","graph_json":"https://pith.science/api/pith-number/4DWHEF2JS54E5N7XDESMHEKEPK/graph.json","events_json":"https://pith.science/api/pith-number/4DWHEF2JS54E5N7XDESMHEKEPK/events.json","paper":"https://pith.science/paper/4DWHEF2J"},"agent_actions":{"view_html":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK","download_json":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK.json","view_paper":"https://pith.science/paper/4DWHEF2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6325&json=true","fetch_graph":"https://pith.science/api/pith-number/4DWHEF2JS54E5N7XDESMHEKEPK/graph.json","fetch_events":"https://pith.science/api/pith-number/4DWHEF2JS54E5N7XDESMHEKEPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/action/storage_attestation","attest_author":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/action/author_attestation","sign_citation":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/action/citation_signature","submit_replication":"https://pith.science/pith/4DWHEF2JS54E5N7XDESMHEKEPK/action/replication_record"}},"created_at":"2026-05-18T03:01:12.479740+00:00","updated_at":"2026-05-18T03:01:12.479740+00:00"}