{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MVAQTMVAWPOLVR23TGQKGHEU4U","short_pith_number":"pith:MVAQTMVA","schema_version":"1.0","canonical_sha256":"654109b2a0b3dcbac75b99a0a31c94e506a0d22af39aafe1fe684ff73af2fd47","source":{"kind":"arxiv","id":"1510.03278","version":1},"attestation_state":"computed","paper":{"title":"Ordered Tree-Pushdown Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Igor Walukiewicz, Lorenzo Clemente, Pawe{\\l} Parys, Sylvain Salvati","submitted_at":"2015-10-12T13:38:25Z","abstract_excerpt":"We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a decidable reachability problem. This follows from a preservation of recognizability result for the backward reachability relation of such systems. As an application, we show that our simple model can encode several formalisms generalizing pushdown systems, such as ordered multi-pushdown systems, annotated higher-order pushdown systems, the Krivine machine, and or"},"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":"1510.03278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2015-10-12T13:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"df7970ab48063957ea15b7d676dbe9b85fcee7f7fb98e7998b03364a4c0735ad","abstract_canon_sha256":"680ebd8361c4c52b990075cddb4efdebe504d92bc6810cf1462b62c7d8638ae4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:32.265186Z","signature_b64":"v3kAhUgZlULDdg82Wukh4fwja+OC8mizY8B15vBR5E9hL8aTKcBfZBwvaV6VUMpjntZookUCS7lTtIPMRm2yBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654109b2a0b3dcbac75b99a0a31c94e506a0d22af39aafe1fe684ff73af2fd47","last_reissued_at":"2026-05-18T01:30:32.264507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:32.264507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered Tree-Pushdown Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Igor Walukiewicz, Lorenzo Clemente, Pawe{\\l} Parys, Sylvain Salvati","submitted_at":"2015-10-12T13:38:25Z","abstract_excerpt":"We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a decidable reachability problem. This follows from a preservation of recognizability result for the backward reachability relation of such systems. As an application, we show that our simple model can encode several formalisms generalizing pushdown systems, such as ordered multi-pushdown systems, annotated higher-order pushdown systems, the Krivine machine, and or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03278","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":"1510.03278","created_at":"2026-05-18T01:30:32.264627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03278v1","created_at":"2026-05-18T01:30:32.264627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03278","created_at":"2026-05-18T01:30:32.264627+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVAQTMVAWPOL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVAQTMVAWPOLVR23","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVAQTMVA","created_at":"2026-05-18T12:29:32.376354+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/MVAQTMVAWPOLVR23TGQKGHEU4U","json":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U.json","graph_json":"https://pith.science/api/pith-number/MVAQTMVAWPOLVR23TGQKGHEU4U/graph.json","events_json":"https://pith.science/api/pith-number/MVAQTMVAWPOLVR23TGQKGHEU4U/events.json","paper":"https://pith.science/paper/MVAQTMVA"},"agent_actions":{"view_html":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U","download_json":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U.json","view_paper":"https://pith.science/paper/MVAQTMVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03278&json=true","fetch_graph":"https://pith.science/api/pith-number/MVAQTMVAWPOLVR23TGQKGHEU4U/graph.json","fetch_events":"https://pith.science/api/pith-number/MVAQTMVAWPOLVR23TGQKGHEU4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U/action/storage_attestation","attest_author":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U/action/author_attestation","sign_citation":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U/action/citation_signature","submit_replication":"https://pith.science/pith/MVAQTMVAWPOLVR23TGQKGHEU4U/action/replication_record"}},"created_at":"2026-05-18T01:30:32.264627+00:00","updated_at":"2026-05-18T01:30:32.264627+00:00"}