{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4V7TP64CR6IUCYPJUTMO74AABK","short_pith_number":"pith:4V7TP64C","canonical_record":{"source":{"id":"1212.1485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-06T22:02:22Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"cadae27e545d15fa37dd6e6377c20a2969b7f97421854440a476913eb2c55f78","abstract_canon_sha256":"c777082a2aedb585e640263f5e7ce911d8e695df7d1bddb8928d6708e7727d09"},"schema_version":"1.0"},"canonical_sha256":"e57f37fb828f914161e9a4d8eff0000aba2f3d624a3009bce516fa68287a6efb","source":{"kind":"arxiv","id":"1212.1485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1485","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1485v1","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1485","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"4V7TP64CR6IU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4V7TP64CR6IUCYPJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4V7TP64C","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4V7TP64CR6IUCYPJUTMO74AABK","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-06T22:02:22Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"cadae27e545d15fa37dd6e6377c20a2969b7f97421854440a476913eb2c55f78","abstract_canon_sha256":"c777082a2aedb585e640263f5e7ce911d8e695df7d1bddb8928d6708e7727d09"},"schema_version":"1.0"},"canonical_sha256":"e57f37fb828f914161e9a4d8eff0000aba2f3d624a3009bce516fa68287a6efb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:57.060430Z","signature_b64":"KCq3TH3+FEjkrblZvsJkMxmUBDs5zX8VBemdLtn2MEDPxsp6uxi2OyyLgzcc4JRESo7NS/lOMI42FKz7xY4BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57f37fb828f914161e9a4d8eff0000aba2f3d624a3009bce516fa68287a6efb","last_reissued_at":"2026-05-18T03:38:57.059703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:57.059703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1485","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:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMrKPIYaMgBtVTjkYUAaL7xyqVUjv1xYvBTwH+sI54kWVijuBkLIEQu61uxhS02rBom0R8DyHrGOo8Nr+fiFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:03:28.097587Z"},"content_sha256":"5156e3402e51b998d017e606573762d4f5247322036f17f70e4217bca5f4b882","schema_version":"1.0","event_id":"sha256:5156e3402e51b998d017e606573762d4f5247322036f17f70e4217bca5f4b882"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4V7TP64CR6IUCYPJUTMO74AABK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"2) ((1) New York University, (2) LSV, CNRS, France), Kshitij Bansal (1), St\\'ephane Demri (1, USA","submitted_at":"2012-12-06T22:02:22Z","abstract_excerpt":"In this note, we provide complexity characterizations of model checking multi-pushdown systems. Multi-pushdown systems model recursive concurrent programs in which any sequential process has a finite control. We consider three standard notions for boundedness: context boundedness, phase boundedness and stack ordering. The logical formalism is a linear-time temporal logic extending well-known logic CaRet but dedicated to multi-pushdown systems in which abstract operators (related to calls and returns) such as those for next-time and until are parameterized by stacks. We show that the problem is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1485","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:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3djTkJINgWcDE59eEtgsbAA8SGVCuQdeRXUMq57L+l3+c2MCmtVb2Pu0urjmWEqeikCfRoPivTVgUmxDgbYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:03:28.097935Z"},"content_sha256":"19cf689080a7b25dcb2abcf9237ee6b1e6daaa16d13893aaef7bdd9c2de2c19c","schema_version":"1.0","event_id":"sha256:19cf689080a7b25dcb2abcf9237ee6b1e6daaa16d13893aaef7bdd9c2de2c19c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/bundle.json","state_url":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4V7TP64CR6IUCYPJUTMO74AABK/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-27T17:03:28Z","links":{"resolver":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK","bundle":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/bundle.json","state":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4V7TP64CR6IUCYPJUTMO74AABK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4V7TP64CR6IUCYPJUTMO74AABK","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":"c777082a2aedb585e640263f5e7ce911d8e695df7d1bddb8928d6708e7727d09","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-06T22:02:22Z","title_canon_sha256":"cadae27e545d15fa37dd6e6377c20a2969b7f97421854440a476913eb2c55f78"},"schema_version":"1.0","source":{"id":"1212.1485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1485","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1485v1","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1485","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"4V7TP64CR6IU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4V7TP64CR6IUCYPJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4V7TP64C","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:19cf689080a7b25dcb2abcf9237ee6b1e6daaa16d13893aaef7bdd9c2de2c19c","target":"graph","created_at":"2026-05-18T03:38:57Z","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":"In this note, we provide complexity characterizations of model checking multi-pushdown systems. Multi-pushdown systems model recursive concurrent programs in which any sequential process has a finite control. We consider three standard notions for boundedness: context boundedness, phase boundedness and stack ordering. The logical formalism is a linear-time temporal logic extending well-known logic CaRet but dedicated to multi-pushdown systems in which abstract operators (related to calls and returns) such as those for next-time and until are parameterized by stacks. We show that the problem is","authors_text":"2) ((1) New York University, (2) LSV, CNRS, France), Kshitij Bansal (1), St\\'ephane Demri (1, USA","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-06T22:02:22Z","title":"A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1485","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:5156e3402e51b998d017e606573762d4f5247322036f17f70e4217bca5f4b882","target":"record","created_at":"2026-05-18T03:38:57Z","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":"c777082a2aedb585e640263f5e7ce911d8e695df7d1bddb8928d6708e7727d09","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-06T22:02:22Z","title_canon_sha256":"cadae27e545d15fa37dd6e6377c20a2969b7f97421854440a476913eb2c55f78"},"schema_version":"1.0","source":{"id":"1212.1485","kind":"arxiv","version":1}},"canonical_sha256":"e57f37fb828f914161e9a4d8eff0000aba2f3d624a3009bce516fa68287a6efb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e57f37fb828f914161e9a4d8eff0000aba2f3d624a3009bce516fa68287a6efb","first_computed_at":"2026-05-18T03:38:57.059703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:57.059703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KCq3TH3+FEjkrblZvsJkMxmUBDs5zX8VBemdLtn2MEDPxsp6uxi2OyyLgzcc4JRESo7NS/lOMI42FKz7xY4BAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:57.060430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5156e3402e51b998d017e606573762d4f5247322036f17f70e4217bca5f4b882","sha256:19cf689080a7b25dcb2abcf9237ee6b1e6daaa16d13893aaef7bdd9c2de2c19c"],"state_sha256":"fcebad50ebc3483d10cd865acd27860c24c751fda31ca5ab079df549b2a4e143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BK9hvROL9K+AOojiclrM6pkxZRyHyAMm0ix52nvWA2kxLNVpqhVU8eGhU5hnBUcgp+d2lrk8kpVNBskgpvXHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:03:28.099956Z","bundle_sha256":"870941211d7de817c939a32a37fa1f721fa11ec08795903c881869d83b856f5f"}}