{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:U2XRTVER3XFE5HB6ETFDMQR2TH","short_pith_number":"pith:U2XRTVER","schema_version":"1.0","canonical_sha256":"a6af19d491ddca4e9c3e24ca36423a99f816914fe900b78ba7ede5bc26b2919a","source":{"kind":"arxiv","id":"0811.1103","version":2},"attestation_state":"computed","paper":{"title":"Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"C.-H. Luke Ong, Matthew Hague","submitted_at":"2008-11-07T10:29:11Z","abstract_excerpt":"Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested \"stack of stacks\" structure. These systems may be used to model higher-order programs and are closely related to the Caucal hierarchy of infinite graphs and safe higher-order recursion schemes.\n  We consider the backwards-reachability problem over higher-order Alternating PDSs (APDSs), a generalisation of higher-order PDSs. This builds on and extends previous work on pushdown systems and context-free higher-order processes in a non-trivial manner. In particular, we show th"},"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":"0811.1103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-11-07T10:29:11Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"daf8a8d961c2d01af599a72326c27a4537d1b4143548654e75675b6b5a8a8b17","abstract_canon_sha256":"b72ddaddc717df75f9b64b61957171b7b96b5aa1dfe1ab8080870375b90bcd89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.648441Z","signature_b64":"tcy4y7FYe7pWKuMoqhpOPDPQoWQXTYWwKS8w7qJvthgRplLY66VIO96mLjW+s86fC9E1e37MpOdgElbXxtC5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6af19d491ddca4e9c3e24ca36423a99f816914fe900b78ba7ede5bc26b2919a","last_reissued_at":"2026-05-18T01:37:40.647861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.647861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"C.-H. Luke Ong, Matthew Hague","submitted_at":"2008-11-07T10:29:11Z","abstract_excerpt":"Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested \"stack of stacks\" structure. These systems may be used to model higher-order programs and are closely related to the Caucal hierarchy of infinite graphs and safe higher-order recursion schemes.\n  We consider the backwards-reachability problem over higher-order Alternating PDSs (APDSs), a generalisation of higher-order PDSs. This builds on and extends previous work on pushdown systems and context-free higher-order processes in a non-trivial manner. In particular, we show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1103","kind":"arxiv","version":2},"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":"0811.1103","created_at":"2026-05-18T01:37:40.647937+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.1103v2","created_at":"2026-05-18T01:37:40.647937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1103","created_at":"2026-05-18T01:37:40.647937+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2XRTVER3XFE","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2XRTVER3XFE5HB6","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2XRTVER","created_at":"2026-05-18T12:25:58.018023+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/U2XRTVER3XFE5HB6ETFDMQR2TH","json":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH.json","graph_json":"https://pith.science/api/pith-number/U2XRTVER3XFE5HB6ETFDMQR2TH/graph.json","events_json":"https://pith.science/api/pith-number/U2XRTVER3XFE5HB6ETFDMQR2TH/events.json","paper":"https://pith.science/paper/U2XRTVER"},"agent_actions":{"view_html":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH","download_json":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH.json","view_paper":"https://pith.science/paper/U2XRTVER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.1103&json=true","fetch_graph":"https://pith.science/api/pith-number/U2XRTVER3XFE5HB6ETFDMQR2TH/graph.json","fetch_events":"https://pith.science/api/pith-number/U2XRTVER3XFE5HB6ETFDMQR2TH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH/action/storage_attestation","attest_author":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH/action/author_attestation","sign_citation":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH/action/citation_signature","submit_replication":"https://pith.science/pith/U2XRTVER3XFE5HB6ETFDMQR2TH/action/replication_record"}},"created_at":"2026-05-18T01:37:40.647937+00:00","updated_at":"2026-05-18T01:37:40.647937+00:00"}