{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2SHR4ER3ENT7TRFKBCAG575QGP","short_pith_number":"pith:2SHR4ER3","canonical_record":{"source":{"id":"1410.8852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-31T19:01:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e0aab91f7b60682eeb91123d09e89bd4ae8ef20e89cc59a7c09983eca247d0b6","abstract_canon_sha256":"504a1ba91b52f9c124c58975282acd9f1f4468badba399b2f6427186bcdc9f01"},"schema_version":"1.0"},"canonical_sha256":"d48f1e123b2367f9c4aa08806effb033c080cd67bd8fb06b18af3040fd304621","source":{"kind":"arxiv","id":"1410.8852","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8852","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8852v2","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8852","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"2SHR4ER3ENT7","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2SHR4ER3ENT7TRFK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2SHR4ER3","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2SHR4ER3ENT7TRFKBCAG575QGP","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-31T19:01:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e0aab91f7b60682eeb91123d09e89bd4ae8ef20e89cc59a7c09983eca247d0b6","abstract_canon_sha256":"504a1ba91b52f9c124c58975282acd9f1f4468badba399b2f6427186bcdc9f01"},"schema_version":"1.0"},"canonical_sha256":"d48f1e123b2367f9c4aa08806effb033c080cd67bd8fb06b18af3040fd304621","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:10.404704Z","signature_b64":"dfGJanWN0voNOv8uJ/3i2gaX6nQbF7ICsUUcpJyjQSA8qCizLhX+8K0MSbErqm6U2EhrWC0TYreHyJgPDCT4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d48f1e123b2367f9c4aa08806effb033c080cd67bd8fb06b18af3040fd304621","last_reissued_at":"2026-05-18T02:29:10.403988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:10.403988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8852","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-18T02:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMU4z+TfIgRaddptkmxfWvvcUMgtTALOaE8LXBiMXKBux2N+pnCcSNXaJ+U4RHiCpEKt/YctJYMJzoiHEnxkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:01:37.219977Z"},"content_sha256":"8deaf3222dc0e59429b202df5cb6ea804a04cad1ac46cbce9a0437ed531141f0","schema_version":"1.0","event_id":"sha256:8deaf3222dc0e59429b202df5cb6ea804a04cad1ac46cbce9a0437ed531141f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2SHR4ER3ENT7TRFKBCAG575QGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decidable Models of Recursive Asynchronous Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"C.-H. Luke Ong, Jonathan Kochems","submitted_at":"2014-10-31T19:01:39Z","abstract_excerpt":"Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic procedure calls. We study a relaxation of the empty-stack constraint for ACPS that permits concurrency and communication actions at any stack height, called the shaped stack constraint, thus enabling a larger class of concurrent programs to be modelled. We establish a close connection between ACPS with shaped stacks and a novel extension of Petri nets: Nets with Ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8852","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-18T02:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGM5yZFs3ci7qg22FCFMdJysYHSNShdSFdac00Y3Yw7H6Qk4k1jL5Gw1vIg1uM4bx9r03O9xX5bMAlKI/jo6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:01:37.220352Z"},"content_sha256":"2dafa496967ee66312a5fc0b74370e11e8a6be914273343ec04282c0d25e0f3b","schema_version":"1.0","event_id":"sha256:2dafa496967ee66312a5fc0b74370e11e8a6be914273343ec04282c0d25e0f3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SHR4ER3ENT7TRFKBCAG575QGP/bundle.json","state_url":"https://pith.science/pith/2SHR4ER3ENT7TRFKBCAG575QGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SHR4ER3ENT7TRFKBCAG575QGP/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-06T16:01:37Z","links":{"resolver":"https://pith.science/pith/2SHR4ER3ENT7TRFKBCAG575QGP","bundle":"https://pith.science/pith/2SHR4ER3ENT7TRFKBCAG575QGP/bundle.json","state":"https://pith.science/pith/2SHR4ER3ENT7TRFKBCAG575QGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SHR4ER3ENT7TRFKBCAG575QGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2SHR4ER3ENT7TRFKBCAG575QGP","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":"504a1ba91b52f9c124c58975282acd9f1f4468badba399b2f6427186bcdc9f01","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-31T19:01:39Z","title_canon_sha256":"e0aab91f7b60682eeb91123d09e89bd4ae8ef20e89cc59a7c09983eca247d0b6"},"schema_version":"1.0","source":{"id":"1410.8852","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8852","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8852v2","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8852","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"2SHR4ER3ENT7","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2SHR4ER3ENT7TRFK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2SHR4ER3","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:2dafa496967ee66312a5fc0b74370e11e8a6be914273343ec04282c0d25e0f3b","target":"graph","created_at":"2026-05-18T02:29:10Z","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":"Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic procedure calls. We study a relaxation of the empty-stack constraint for ACPS that permits concurrency and communication actions at any stack height, called the shaped stack constraint, thus enabling a larger class of concurrent programs to be modelled. We establish a close connection between ACPS with shaped stacks and a novel extension of Petri nets: Nets with Ne","authors_text":"C.-H. Luke Ong, Jonathan Kochems","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-31T19:01:39Z","title":"Decidable Models of Recursive Asynchronous Concurrency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8852","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:8deaf3222dc0e59429b202df5cb6ea804a04cad1ac46cbce9a0437ed531141f0","target":"record","created_at":"2026-05-18T02:29:10Z","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":"504a1ba91b52f9c124c58975282acd9f1f4468badba399b2f6427186bcdc9f01","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-31T19:01:39Z","title_canon_sha256":"e0aab91f7b60682eeb91123d09e89bd4ae8ef20e89cc59a7c09983eca247d0b6"},"schema_version":"1.0","source":{"id":"1410.8852","kind":"arxiv","version":2}},"canonical_sha256":"d48f1e123b2367f9c4aa08806effb033c080cd67bd8fb06b18af3040fd304621","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d48f1e123b2367f9c4aa08806effb033c080cd67bd8fb06b18af3040fd304621","first_computed_at":"2026-05-18T02:29:10.403988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:10.403988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dfGJanWN0voNOv8uJ/3i2gaX6nQbF7ICsUUcpJyjQSA8qCizLhX+8K0MSbErqm6U2EhrWC0TYreHyJgPDCT4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:10.404704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8852","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8deaf3222dc0e59429b202df5cb6ea804a04cad1ac46cbce9a0437ed531141f0","sha256:2dafa496967ee66312a5fc0b74370e11e8a6be914273343ec04282c0d25e0f3b"],"state_sha256":"01a8333a3571ba5d290d40a3de092cb3bc6a5f65fda331318607857724a55d95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlGGc1CFP+YZrUAIeOXxRvwGrzPRWh1wEFOumQabzE3gQH/R89aQfZzEwLGu7QO6CV6IDFXnMOHELY9rxIl1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:01:37.222610Z","bundle_sha256":"6ca283e913a8a7ed9deacfe8e4c758109619a27b0b4289a769cca5f2400c5b46"}}