{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EY7RUS4Y2YUZROVV5H3UKNV2D5","short_pith_number":"pith:EY7RUS4Y","schema_version":"1.0","canonical_sha256":"263f1a4b98d62998bab5e9f74536ba1f7117d2a20b72a82d587e888b78c1c5e5","source":{"kind":"arxiv","id":"1606.00234","version":1},"attestation_state":"computed","paper":{"title":"Two-Way Visibly Pushdown Automata and Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Jean-Marc Talbot, Luc Dartois, Pierre-Alain Reynier","submitted_at":"2016-06-01T11:32:35Z","abstract_excerpt":"Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three following models are equivalent: deterministic two-way transducers, monadic second-order (MSO) transducers, and deterministic one-way automata equipped with a finite number of registers. Nested words are words with a nesting structure, allowing to model unranked trees as their depth-first-search linearisations. In this paper, we consider transformations from ne"},"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":"1606.00234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-01T11:32:35Z","cross_cats_sorted":[],"title_canon_sha256":"228943efd51b6010e56de29a699ddd5b19f9bb027212460396a3dc1c6ba5919b","abstract_canon_sha256":"fc23695c636fdfd9e6effcbb2218cda64c7da48a6f10825159cc0ed4fc1f9791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.709192Z","signature_b64":"yJnd62hjuwT/vj5CYs46slLBXu/6fZiZR+DBPgPcrI6QDlgtIJYFAzDgAP4lfLbaUAWoFbmblc+adoa2TufRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263f1a4b98d62998bab5e9f74536ba1f7117d2a20b72a82d587e888b78c1c5e5","last_reissued_at":"2026-05-18T01:13:05.708822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.708822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Way Visibly Pushdown Automata and Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Jean-Marc Talbot, Luc Dartois, Pierre-Alain Reynier","submitted_at":"2016-06-01T11:32:35Z","abstract_excerpt":"Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three following models are equivalent: deterministic two-way transducers, monadic second-order (MSO) transducers, and deterministic one-way automata equipped with a finite number of registers. Nested words are words with a nesting structure, allowing to model unranked trees as their depth-first-search linearisations. In this paper, we consider transformations from ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00234","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":"1606.00234","created_at":"2026-05-18T01:13:05.708881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00234v1","created_at":"2026-05-18T01:13:05.708881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00234","created_at":"2026-05-18T01:13:05.708881+00:00"},{"alias_kind":"pith_short_12","alias_value":"EY7RUS4Y2YUZ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EY7RUS4Y2YUZROVV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EY7RUS4Y","created_at":"2026-05-18T12:30:15.759754+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/EY7RUS4Y2YUZROVV5H3UKNV2D5","json":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5.json","graph_json":"https://pith.science/api/pith-number/EY7RUS4Y2YUZROVV5H3UKNV2D5/graph.json","events_json":"https://pith.science/api/pith-number/EY7RUS4Y2YUZROVV5H3UKNV2D5/events.json","paper":"https://pith.science/paper/EY7RUS4Y"},"agent_actions":{"view_html":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5","download_json":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5.json","view_paper":"https://pith.science/paper/EY7RUS4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00234&json=true","fetch_graph":"https://pith.science/api/pith-number/EY7RUS4Y2YUZROVV5H3UKNV2D5/graph.json","fetch_events":"https://pith.science/api/pith-number/EY7RUS4Y2YUZROVV5H3UKNV2D5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5/action/storage_attestation","attest_author":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5/action/author_attestation","sign_citation":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5/action/citation_signature","submit_replication":"https://pith.science/pith/EY7RUS4Y2YUZROVV5H3UKNV2D5/action/replication_record"}},"created_at":"2026-05-18T01:13:05.708881+00:00","updated_at":"2026-05-18T01:13:05.708881+00:00"}