{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MF4PRBEBGO2RTTBLQM6JY7HXJB","short_pith_number":"pith:MF4PRBEB","schema_version":"1.0","canonical_sha256":"6178f8848133b519cc2b833c9c7cf7486da8a3f8ad69cd9106ca250c09654920","source":{"kind":"arxiv","id":"1311.2400","version":3},"attestation_state":"computed","paper":{"title":"Look-Ahead Removal for Top-Down Tree Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Helmut Seidl, Joost Engelfriet, Sebastian Maneth","submitted_at":"2013-11-11T10:07:56Z","abstract_excerpt":"Top-down tree transducers are a convenient formalism for describing tree transformations. They can be equipped with regular look-ahead, which allows them to inspect a subtree before processing it. In certain cases, such a look-ahead can be avoided and the transformation can be realized by a transducer without look-ahead. Removing the look-ahead from a transducer, if possible, is technically highly challenging. For a restricted class of transducers with look-ahead, namely those that are total, deterministic, ultralinear, and bounded erasing, we present an algorithm that, for a given transducer "},"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":"1311.2400","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-11-11T10:07:56Z","cross_cats_sorted":[],"title_canon_sha256":"abeaaba6207bb2fbb97a9eacec24d5da20571e348710c2d5f08ece59f9eecdd1","abstract_canon_sha256":"ab72c52e8a5e12eded554e062fc7260d35d8a71786e9e7e7f6af3942fce4d6fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.820289Z","signature_b64":"kZb73wQuxvyMQo7RDxJoJXvzfLA2mVkUDz/80ZfMRwCw5AhXnn/bSJ9Jd65ERHd7wrc9oj69H8JAwOk442rLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6178f8848133b519cc2b833c9c7cf7486da8a3f8ad69cd9106ca250c09654920","last_reissued_at":"2026-05-18T01:25:24.819799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.819799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Look-Ahead Removal for Top-Down Tree Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Helmut Seidl, Joost Engelfriet, Sebastian Maneth","submitted_at":"2013-11-11T10:07:56Z","abstract_excerpt":"Top-down tree transducers are a convenient formalism for describing tree transformations. They can be equipped with regular look-ahead, which allows them to inspect a subtree before processing it. In certain cases, such a look-ahead can be avoided and the transformation can be realized by a transducer without look-ahead. Removing the look-ahead from a transducer, if possible, is technically highly challenging. For a restricted class of transducers with look-ahead, namely those that are total, deterministic, ultralinear, and bounded erasing, we present an algorithm that, for a given transducer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2400","kind":"arxiv","version":3},"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":"1311.2400","created_at":"2026-05-18T01:25:24.819871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2400v3","created_at":"2026-05-18T01:25:24.819871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2400","created_at":"2026-05-18T01:25:24.819871+00:00"},{"alias_kind":"pith_short_12","alias_value":"MF4PRBEBGO2R","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MF4PRBEBGO2RTTBL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MF4PRBEB","created_at":"2026-05-18T12:27:52.871228+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/MF4PRBEBGO2RTTBLQM6JY7HXJB","json":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB.json","graph_json":"https://pith.science/api/pith-number/MF4PRBEBGO2RTTBLQM6JY7HXJB/graph.json","events_json":"https://pith.science/api/pith-number/MF4PRBEBGO2RTTBLQM6JY7HXJB/events.json","paper":"https://pith.science/paper/MF4PRBEB"},"agent_actions":{"view_html":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB","download_json":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB.json","view_paper":"https://pith.science/paper/MF4PRBEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2400&json=true","fetch_graph":"https://pith.science/api/pith-number/MF4PRBEBGO2RTTBLQM6JY7HXJB/graph.json","fetch_events":"https://pith.science/api/pith-number/MF4PRBEBGO2RTTBLQM6JY7HXJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB/action/storage_attestation","attest_author":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB/action/author_attestation","sign_citation":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB/action/citation_signature","submit_replication":"https://pith.science/pith/MF4PRBEBGO2RTTBLQM6JY7HXJB/action/replication_record"}},"created_at":"2026-05-18T01:25:24.819871+00:00","updated_at":"2026-05-18T01:25:24.819871+00:00"}