{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:A6FKDEENY6TO4UTXIDYDPSRNCX","short_pith_number":"pith:A6FKDEEN","canonical_record":{"source":{"id":"1205.6928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-31T09:10:22Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"c9eeb7c519dae581428a69612e4706787fed5efa5c03a54cb8bb9cb2c4bb0d4b","abstract_canon_sha256":"dfce2f76489b22235566e6fbd810fcaa450520390fcc85470f191ce4f6823606"},"schema_version":"1.0"},"canonical_sha256":"078aa1908dc7a6ee527740f037ca2d15fc272eea991b651ce9d3b94af557a2ca","source":{"kind":"arxiv","id":"1205.6928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6928","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6928v1","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6928","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"A6FKDEENY6TO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A6FKDEENY6TO4UTX","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A6FKDEEN","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:A6FKDEENY6TO4UTXIDYDPSRNCX","target":"record","payload":{"canonical_record":{"source":{"id":"1205.6928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-31T09:10:22Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"c9eeb7c519dae581428a69612e4706787fed5efa5c03a54cb8bb9cb2c4bb0d4b","abstract_canon_sha256":"dfce2f76489b22235566e6fbd810fcaa450520390fcc85470f191ce4f6823606"},"schema_version":"1.0"},"canonical_sha256":"078aa1908dc7a6ee527740f037ca2d15fc272eea991b651ce9d3b94af557a2ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:36.563078Z","signature_b64":"7fOGcpmctkdGCdm4LciohjnIS/2aDarGVexne4lCo9HX3gckqIfmDSrN6XVdjUcIZA7Vn7Cd8hfor6KPM3eyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"078aa1908dc7a6ee527740f037ca2d15fc272eea991b651ce9d3b94af557a2ca","last_reissued_at":"2026-05-18T03:54:36.562419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:36.562419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.6928","source_version":1,"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-18T03:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Jn6dStOZm+mQ9cAKtwyopISCvoWgyYAY1fa9Idcoa5Qc4uK4BcgJgy7wTCQIYGG6HTkKbBeLa1bclHjYdDaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:57:54.058466Z"},"content_sha256":"501325b679a8df0c2b246bf9172e47384d48cbdd8ebd196d3bb8bef3b2ceafbc","schema_version":"1.0","event_id":"sha256:501325b679a8df0c2b246bf9172e47384d48cbdd8ebd196d3bb8bef3b2ceafbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:A6FKDEENY6TO4UTXIDYDPSRNCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Ahmed Bouajjani, K. Narayan Kumar, Mohamed Faouzi Atig, Prakash Saivasan","submitted_at":"2012-05-31T09:10:22Z","abstract_excerpt":"We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complexity of this problem under the assumption of bounded context-switching defined by Qadeer and Rehof, and of phase-boundedness proposed by La Torre et al. On the model checking of such systems against temporal logics and in particular branching t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6928","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"},"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-18T03:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bANuH4M86m7W1NBj0Hrg9wn0CsfyzcU2ELvc2yuYuZepeLw3aDWAySoX0zpfXsW9RhofeGiJfrb+nq6Mb2onBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:57:54.059154Z"},"content_sha256":"14e079ef549c778c8e04f4f66c6333afbbf5c09e7fa4f190247978ce05329886","schema_version":"1.0","event_id":"sha256:14e079ef549c778c8e04f4f66c6333afbbf5c09e7fa4f190247978ce05329886"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6FKDEENY6TO4UTXIDYDPSRNCX/bundle.json","state_url":"https://pith.science/pith/A6FKDEENY6TO4UTXIDYDPSRNCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6FKDEENY6TO4UTXIDYDPSRNCX/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-05-25T05:57:54Z","links":{"resolver":"https://pith.science/pith/A6FKDEENY6TO4UTXIDYDPSRNCX","bundle":"https://pith.science/pith/A6FKDEENY6TO4UTXIDYDPSRNCX/bundle.json","state":"https://pith.science/pith/A6FKDEENY6TO4UTXIDYDPSRNCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6FKDEENY6TO4UTXIDYDPSRNCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A6FKDEENY6TO4UTXIDYDPSRNCX","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":"dfce2f76489b22235566e6fbd810fcaa450520390fcc85470f191ce4f6823606","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-31T09:10:22Z","title_canon_sha256":"c9eeb7c519dae581428a69612e4706787fed5efa5c03a54cb8bb9cb2c4bb0d4b"},"schema_version":"1.0","source":{"id":"1205.6928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6928","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6928v1","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6928","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"A6FKDEENY6TO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A6FKDEENY6TO4UTX","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A6FKDEEN","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:14e079ef549c778c8e04f4f66c6333afbbf5c09e7fa4f190247978ce05329886","target":"graph","created_at":"2026-05-18T03:54:36Z","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":"We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complexity of this problem under the assumption of bounded context-switching defined by Qadeer and Rehof, and of phase-boundedness proposed by La Torre et al. On the model checking of such systems against temporal logics and in particular branching t","authors_text":"Ahmed Bouajjani, K. Narayan Kumar, Mohamed Faouzi Atig, Prakash Saivasan","cross_cats":["cs.FL","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-31T09:10:22Z","title":"Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6928","kind":"arxiv","version":1},"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:501325b679a8df0c2b246bf9172e47384d48cbdd8ebd196d3bb8bef3b2ceafbc","target":"record","created_at":"2026-05-18T03:54:36Z","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":"dfce2f76489b22235566e6fbd810fcaa450520390fcc85470f191ce4f6823606","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-31T09:10:22Z","title_canon_sha256":"c9eeb7c519dae581428a69612e4706787fed5efa5c03a54cb8bb9cb2c4bb0d4b"},"schema_version":"1.0","source":{"id":"1205.6928","kind":"arxiv","version":1}},"canonical_sha256":"078aa1908dc7a6ee527740f037ca2d15fc272eea991b651ce9d3b94af557a2ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"078aa1908dc7a6ee527740f037ca2d15fc272eea991b651ce9d3b94af557a2ca","first_computed_at":"2026-05-18T03:54:36.562419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:36.562419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7fOGcpmctkdGCdm4LciohjnIS/2aDarGVexne4lCo9HX3gckqIfmDSrN6XVdjUcIZA7Vn7Cd8hfor6KPM3eyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:36.563078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:501325b679a8df0c2b246bf9172e47384d48cbdd8ebd196d3bb8bef3b2ceafbc","sha256:14e079ef549c778c8e04f4f66c6333afbbf5c09e7fa4f190247978ce05329886"],"state_sha256":"ed01be8d20e2a59bc65a6f6a55298168795450213033fbf5b84851ed344a2e7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3XnX5DWzrSWsA+ARU8u+QV3sIlyN5RzR9OYCDjSPLgp+NE3mvILtArDIk21A4W0hK6moPsMoH2VC50zKn4XAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:57:54.063278Z","bundle_sha256":"40cc97f5d58878930aa1cd802cafb9579fc8455a42914c723a084a0941362e2e"}}