{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4V7TP64CR6IUCYPJUTMO74AABK","short_pith_number":"pith:4V7TP64C","schema_version":"1.0","canonical_sha256":"e57f37fb828f914161e9a4d8eff0000aba2f3d624a3009bce516fa68287a6efb","source":{"kind":"arxiv","id":"1212.1485","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.1485","created_at":"2026-05-18T03:38:57.059842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1485v1","created_at":"2026-05-18T03:38:57.059842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1485","created_at":"2026-05-18T03:38:57.059842+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V7TP64CR6IU","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V7TP64CR6IUCYPJ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V7TP64C","created_at":"2026-05-18T12:26:53.410803+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/4V7TP64CR6IUCYPJUTMO74AABK","json":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK.json","graph_json":"https://pith.science/api/pith-number/4V7TP64CR6IUCYPJUTMO74AABK/graph.json","events_json":"https://pith.science/api/pith-number/4V7TP64CR6IUCYPJUTMO74AABK/events.json","paper":"https://pith.science/paper/4V7TP64C"},"agent_actions":{"view_html":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK","download_json":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK.json","view_paper":"https://pith.science/paper/4V7TP64C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1485&json=true","fetch_graph":"https://pith.science/api/pith-number/4V7TP64CR6IUCYPJUTMO74AABK/graph.json","fetch_events":"https://pith.science/api/pith-number/4V7TP64CR6IUCYPJUTMO74AABK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/action/storage_attestation","attest_author":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/action/author_attestation","sign_citation":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/action/citation_signature","submit_replication":"https://pith.science/pith/4V7TP64CR6IUCYPJUTMO74AABK/action/replication_record"}},"created_at":"2026-05-18T03:38:57.059842+00:00","updated_at":"2026-05-18T03:38:57.059842+00:00"}