{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EGQJC6Z7VFSCXGB2UEXTCOT2DD","short_pith_number":"pith:EGQJC6Z7","schema_version":"1.0","canonical_sha256":"21a0917b3fa9642b983aa12f313a7a18fe5d6973aa94c073ef2fc93ee5c385e6","source":{"kind":"arxiv","id":"1310.2631","version":1},"attestation_state":"computed","paper":{"title":"Saturation of Concurrent Collapsible Pushdown Systems","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Matthew Hague","submitted_at":"2013-10-09T20:58:12Z","abstract_excerpt":"Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with first-order procedure calls. While, in general, reachability is undecidable, there are numerous restrictions on stack behaviour that lead to decidability. To model higher-order procedures calls, a generalisation of pushdown stacks called collapsible pushdown stacks are required. Reachability problems for multi-stack collapsible pushdown systems have been little studied. Here, we study ordered, phase-bounded and scope-bounded multi-stack collapsible pushdown systems using saturation techniques, sh"},"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":"1310.2631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.FL","submitted_at":"2013-10-09T20:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"f69d9eed1c30fbb96474ad81aec6ad31ac41152aebd00b097452f610580ef3e0","abstract_canon_sha256":"d1e5d0b6205c4eb1244e0a9e2a9f42882d4ca617cc638505f86d186b3079de82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:47.101991Z","signature_b64":"fcnz4gY9c327fxfuKml0MUpTd5z1l16kMuwTJhTFIgxUAYt6lri6lEPpRnvgjKm9Cvza/n+021riuMLfiSx5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a0917b3fa9642b983aa12f313a7a18fe5d6973aa94c073ef2fc93ee5c385e6","last_reissued_at":"2026-05-18T03:10:47.101273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:47.101273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Saturation of Concurrent Collapsible Pushdown Systems","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Matthew Hague","submitted_at":"2013-10-09T20:58:12Z","abstract_excerpt":"Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with first-order procedure calls. While, in general, reachability is undecidable, there are numerous restrictions on stack behaviour that lead to decidability. To model higher-order procedures calls, a generalisation of pushdown stacks called collapsible pushdown stacks are required. Reachability problems for multi-stack collapsible pushdown systems have been little studied. Here, we study ordered, phase-bounded and scope-bounded multi-stack collapsible pushdown systems using saturation techniques, sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2631","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":"1310.2631","created_at":"2026-05-18T03:10:47.101401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2631v1","created_at":"2026-05-18T03:10:47.101401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2631","created_at":"2026-05-18T03:10:47.101401+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGQJC6Z7VFSC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGQJC6Z7VFSCXGB2","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGQJC6Z7","created_at":"2026-05-18T12:27:43.054852+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/EGQJC6Z7VFSCXGB2UEXTCOT2DD","json":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD.json","graph_json":"https://pith.science/api/pith-number/EGQJC6Z7VFSCXGB2UEXTCOT2DD/graph.json","events_json":"https://pith.science/api/pith-number/EGQJC6Z7VFSCXGB2UEXTCOT2DD/events.json","paper":"https://pith.science/paper/EGQJC6Z7"},"agent_actions":{"view_html":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD","download_json":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD.json","view_paper":"https://pith.science/paper/EGQJC6Z7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2631&json=true","fetch_graph":"https://pith.science/api/pith-number/EGQJC6Z7VFSCXGB2UEXTCOT2DD/graph.json","fetch_events":"https://pith.science/api/pith-number/EGQJC6Z7VFSCXGB2UEXTCOT2DD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD/action/storage_attestation","attest_author":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD/action/author_attestation","sign_citation":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD/action/citation_signature","submit_replication":"https://pith.science/pith/EGQJC6Z7VFSCXGB2UEXTCOT2DD/action/replication_record"}},"created_at":"2026-05-18T03:10:47.101401+00:00","updated_at":"2026-05-18T03:10:47.101401+00:00"}