{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","short_pith_number":"pith:TSRT5MDE","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"},"canonical_sha256":"9ca33eb0640cdb0dc3ed577269aa9b467e737cd52faba917d27c3cca03b74b3c","source":{"kind":"arxiv","id":"1209.0359","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0359","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0359v3","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0359","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"TSRT5MDEBTNQ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TSRT5MDEBTNQ3Q7N","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TSRT5MDE","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","target":"record","payload":{"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"},"canonical_sha256":"9ca33eb0640cdb0dc3ed577269aa9b467e737cd52faba917d27c3cca03b74b3c","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"},"source_kind":"arxiv","source_id":"1209.0359","source_version":3,"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMqpRt5mVk+fFlydMrJwucDRplFTrzZrJvVEu7F3km8zfZAxROBkGQcForFPPUe0rZ16vdTP81NEyXQzJKaIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:42:33.546532Z"},"content_sha256":"d1d12b46bef357efe6d5a02c0aa0b9c6be8292a2ab21f11ca2ed6a388c875af8","schema_version":"1.0","event_id":"sha256:d1d12b46bef357efe6d5a02c0aa0b9c6be8292a2ab21f11ca2ed6a388c875af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","target":"graph","payload":{"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"},"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlMD4gjdYYJ6OIxh/aKRmDf58Q84eVtdrikEw5FJ1o1NzzBmAUrjmtakqE1ww2vDgGHe8CbmOAniET1oSYJkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:42:33.546876Z"},"content_sha256":"e42c1c792f8a81f17a8058a966b4708862d808b20d38a5358e7c7656244c6e98","schema_version":"1.0","event_id":"sha256:e42c1c792f8a81f17a8058a966b4708862d808b20d38a5358e7c7656244c6e98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/bundle.json","state_url":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/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-24T22:42:33Z","links":{"resolver":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","bundle":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/bundle.json","state":"https://pith.science/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TSRT5MDEBTNQ3Q7NK5ZGTKU3IZ","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":"4f2862c0908f56f457d906972ced4b742d868d9be2a6edd739557fd7bbf644d4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-09-03T13:58:57Z","title_canon_sha256":"7d92a10be5cb78585d5cd1c0427261fd0260bb95b19dc02fad461497b23593d8"},"schema_version":"1.0","source":{"id":"1209.0359","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0359","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0359v3","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0359","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"TSRT5MDEBTNQ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TSRT5MDEBTNQ3Q7N","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TSRT5MDE","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:e42c1c792f8a81f17a8058a966b4708862d808b20d38a5358e7c7656244c6e98","target":"graph","created_at":"2026-05-18T01:37:38Z","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":"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","authors_text":"Alexander Heussner (LaBRI, Anca Muscholl (LaBRI, CNRS, France), Gr\\'egoire Sutre (LaBRI, J\\'er\\^ome Leroux (LaBRI, Universit\\'e de Bordeaux","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-09-03T13:58:57Z","title":"Reachability Analysis of Communicating Pushdown Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0359","kind":"arxiv","version":3},"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:d1d12b46bef357efe6d5a02c0aa0b9c6be8292a2ab21f11ca2ed6a388c875af8","target":"record","created_at":"2026-05-18T01:37:38Z","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":"4f2862c0908f56f457d906972ced4b742d868d9be2a6edd739557fd7bbf644d4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-09-03T13:58:57Z","title_canon_sha256":"7d92a10be5cb78585d5cd1c0427261fd0260bb95b19dc02fad461497b23593d8"},"schema_version":"1.0","source":{"id":"1209.0359","kind":"arxiv","version":3}},"canonical_sha256":"9ca33eb0640cdb0dc3ed577269aa9b467e737cd52faba917d27c3cca03b74b3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ca33eb0640cdb0dc3ed577269aa9b467e737cd52faba917d27c3cca03b74b3c","first_computed_at":"2026-05-18T01:37:38.544370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:38.544370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MTNszyuJhnCnvjYr02cH4J6wIv1vIPq2UnUnzBHkF0g6DD0HPSMF/aegQUg4W5yp+6DtveZFOR0xPW2xyfReAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:38.545004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0359","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1d12b46bef357efe6d5a02c0aa0b9c6be8292a2ab21f11ca2ed6a388c875af8","sha256:e42c1c792f8a81f17a8058a966b4708862d808b20d38a5358e7c7656244c6e98"],"state_sha256":"1dfa74af5046ed97d6f0265a7dff058a095a80dfacb80bcc31f25b62854dee64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNrxYfxZCm64Mu8w/SDU5PwvR6YBJMdgEA7srkTAnJb3VOrKCNhCX/n5Re+IV8X63533ic4F9jdjFWLk8LNmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:42:33.548726Z","bundle_sha256":"19a7dc7877df06ed282bd79726c6d26c4f22449a8aa7f3fbbd8aa06b2f24ea0a"}}