{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","short_pith_number":"pith:TSRT5MDE","schema_version":"1.0","canonical_sha256":"9ca33eb0640cdb0dc3ed577269aa9b467e737cd52faba917d27c3cca03b74b3c","source":{"kind":"arxiv","id":"1209.0359","version":3},"attestation_state":"computed","paper":{"title":"Reachability Analysis of Communicating Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Alexander Heussner (LaBRI, Anca Muscholl (LaBRI, CNRS, France), Gr\\'egoire Sutre (LaBRI, J\\'er\\^ome Leroux (LaBRI, Universit\\'e de Bordeaux","submitted_at":"2012-09-03T13:58:57Z","abstract_excerpt":"The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability problem restricted to eager runs (i.e., runs where messages are either received immediately after being sent, or never received). The problem is EXPTIME-complete in the decidable case. The second result is a doubly exponential time algorithm for bounded context analysis in this setting, together with a matching lower bound. Both results extend and improve p"},"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":"1209.0359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-09-03T13:58:57Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7d92a10be5cb78585d5cd1c0427261fd0260bb95b19dc02fad461497b23593d8","abstract_canon_sha256":"4f2862c0908f56f457d906972ced4b742d868d9be2a6edd739557fd7bbf644d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.545004Z","signature_b64":"MTNszyuJhnCnvjYr02cH4J6wIv1vIPq2UnUnzBHkF0g6DD0HPSMF/aegQUg4W5yp+6DtveZFOR0xPW2xyfReAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ca33eb0640cdb0dc3ed577269aa9b467e737cd52faba917d27c3cca03b74b3c","last_reissued_at":"2026-05-18T01:37:38.544370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.544370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability Analysis of Communicating Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Alexander Heussner (LaBRI, Anca Muscholl (LaBRI, CNRS, France), Gr\\'egoire Sutre (LaBRI, J\\'er\\^ome Leroux (LaBRI, Universit\\'e de Bordeaux","submitted_at":"2012-09-03T13:58:57Z","abstract_excerpt":"The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability problem restricted to eager runs (i.e., runs where messages are either received immediately after being sent, or never received). The problem is EXPTIME-complete in the decidable case. The second result is a doubly exponential time algorithm for bounded context analysis in this setting, together with a matching lower bound. Both results extend and improve p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0359","kind":"arxiv","version":3},"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":"1209.0359","created_at":"2026-05-18T01:37:38.544461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0359v3","created_at":"2026-05-18T01:37:38.544461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0359","created_at":"2026-05-18T01:37:38.544461+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSRT5MDEBTNQ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSRT5MDEBTNQ3Q7N","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSRT5MDE","created_at":"2026-05-18T12:27:23.164592+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/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","json":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ.json","graph_json":"https://pith.science/api/pith-number/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/graph.json","events_json":"https://pith.science/api/pith-number/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/events.json","paper":"https://pith.science/paper/TSRT5MDE"},"agent_actions":{"view_html":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","download_json":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ.json","view_paper":"https://pith.science/paper/TSRT5MDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0359&json=true","fetch_graph":"https://pith.science/api/pith-number/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/action/storage_attestation","attest_author":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/action/author_attestation","sign_citation":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/action/citation_signature","submit_replication":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/action/replication_record"}},"created_at":"2026-05-18T01:37:38.544461+00:00","updated_at":"2026-05-18T01:37:38.544461+00:00"}