{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PIVC3THEAR2KAIO52HBVUEZ4LU","short_pith_number":"pith:PIVC3THE","schema_version":"1.0","canonical_sha256":"7a2a2dcce40474a021ddd1c35a133c5d3a06e97a658b27a59eba53fb02e0c080","source":{"kind":"arxiv","id":"2404.02040","version":3},"attestation_state":"computed","paper":{"title":"Transformers as Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.FL","authors_text":"Ashish Sabharwal, Dana Angluin, David Chiang, Jonathan Rawski, Lena Strobl","submitted_at":"2024-04-02T15:34:47Z","abstract_excerpt":"We study the sequence-to-sequence mapping capacity of transformers by relating them to finite transducers, and find that they can express surprisingly large classes of transductions. We do so using variants of RASP, a programming language designed to help people \"think like transformers,\" as an intermediate representation. We extend the existing Boolean variant B-RASP to sequence-to-sequence functions and show that it computes exactly the first-order rational functions (such as string rotation). Then, we introduce two new extensions. B-RASP[pos] enables calculations on positions (such as copyi"},"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":"2404.02040","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2024-04-02T15:34:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"53235f96d3917f089c716dbbda1b25e0aa6d4169d1a2642860af814be96e31b0","abstract_canon_sha256":"2da60ced136e9043dda71b5ede9120ebfe6a9ea3edc04c09ee1bd7f244b7e200"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:29.600215Z","signature_b64":"Ym3fMXBxNbwOT213qlRAdtk6JinsY7f481PG1GYyuO4ifyYOr6WcrT51nG/vvJvqn68QneC9ldYrjFVBj8hQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a2a2dcce40474a021ddd1c35a133c5d3a06e97a658b27a59eba53fb02e0c080","last_reissued_at":"2026-07-05T09:31:29.599736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:29.599736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformers as Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.FL","authors_text":"Ashish Sabharwal, Dana Angluin, David Chiang, Jonathan Rawski, Lena Strobl","submitted_at":"2024-04-02T15:34:47Z","abstract_excerpt":"We study the sequence-to-sequence mapping capacity of transformers by relating them to finite transducers, and find that they can express surprisingly large classes of transductions. We do so using variants of RASP, a programming language designed to help people \"think like transformers,\" as an intermediate representation. We extend the existing Boolean variant B-RASP to sequence-to-sequence functions and show that it computes exactly the first-order rational functions (such as string rotation). Then, we introduce two new extensions. B-RASP[pos] enables calculations on positions (such as copyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02040","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.02040/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.02040","created_at":"2026-07-05T09:31:29.599797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.02040v3","created_at":"2026-07-05T09:31:29.599797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02040","created_at":"2026-07-05T09:31:29.599797+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIVC3THEAR2K","created_at":"2026-07-05T09:31:29.599797+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIVC3THEAR2KAIO5","created_at":"2026-07-05T09:31:29.599797+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIVC3THE","created_at":"2026-07-05T09:31:29.599797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09925","citing_title":"Simulating Hard Attention Using Soft Attention","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU","json":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU.json","graph_json":"https://pith.science/api/pith-number/PIVC3THEAR2KAIO52HBVUEZ4LU/graph.json","events_json":"https://pith.science/api/pith-number/PIVC3THEAR2KAIO52HBVUEZ4LU/events.json","paper":"https://pith.science/paper/PIVC3THE"},"agent_actions":{"view_html":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU","download_json":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU.json","view_paper":"https://pith.science/paper/PIVC3THE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.02040&json=true","fetch_graph":"https://pith.science/api/pith-number/PIVC3THEAR2KAIO52HBVUEZ4LU/graph.json","fetch_events":"https://pith.science/api/pith-number/PIVC3THEAR2KAIO52HBVUEZ4LU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU/action/storage_attestation","attest_author":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU/action/author_attestation","sign_citation":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU/action/citation_signature","submit_replication":"https://pith.science/pith/PIVC3THEAR2KAIO52HBVUEZ4LU/action/replication_record"}},"created_at":"2026-07-05T09:31:29.599797+00:00","updated_at":"2026-07-05T09:31:29.599797+00:00"}