{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XTVICAYWP44OTRYK5DTN4DD3XX","short_pith_number":"pith:XTVICAYW","schema_version":"1.0","canonical_sha256":"bcea8103167f38e9c70ae8e6de0c7bbdc464f2d786771841f56b20a24f80710e","source":{"kind":"arxiv","id":"2602.16473","version":2},"attestation_state":"computed","paper":{"title":"Synthesis and Verification of Transformer Programs (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.LG","authors_text":"Anthony Widjaja Lin, Hongjian Jiang, Matthew Hague, Philipp R\\\"ummer","submitted_at":"2026-02-18T14:04:02Z","abstract_excerpt":"C-RASP is a simple programming language that was recently shown to capture concepts expressible by transformers. In this paper, we develop new algorithmic techniques for automatically verifying C-RASPs. To this end, we establish a connection to the verification of synchronous dataflow programs in Lustre, which enables us to exploit state-of-the-art model checkers utilizing highly optimized SMT-solvers. Our second contribution addresses learning a C-RASP program in the first place. To this end, we provide a new algorithm for learning a C-RASP from examples using local search. We demonstrate eff"},"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":"2602.16473","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-18T14:04:02Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"13ec7a69a0871f6ad8f7237efb33915e6770f73c2433793bb49fa10b795604eb","abstract_canon_sha256":"e819142b238ceffc69cd20c29c7db8e777ec93a83a9abaeb89c4641aafaf916e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:09.848890Z","signature_b64":"kq+TITh6ZnkhMtoTf8QEIOTI1rRwDuXM7j9G2BVKTuXW7Sk77g1u+RCcx5nvUFGzJ4U7jmv7IFPs3u+vlZjuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcea8103167f38e9c70ae8e6de0c7bbdc464f2d786771841f56b20a24f80710e","last_reissued_at":"2026-05-20T00:02:09.848126Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:09.848126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis and Verification of Transformer Programs (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.LG","authors_text":"Anthony Widjaja Lin, Hongjian Jiang, Matthew Hague, Philipp R\\\"ummer","submitted_at":"2026-02-18T14:04:02Z","abstract_excerpt":"C-RASP is a simple programming language that was recently shown to capture concepts expressible by transformers. In this paper, we develop new algorithmic techniques for automatically verifying C-RASPs. To this end, we establish a connection to the verification of synchronous dataflow programs in Lustre, which enables us to exploit state-of-the-art model checkers utilizing highly optimized SMT-solvers. Our second contribution addresses learning a C-RASP program in the first place. To this end, we provide a new algorithm for learning a C-RASP from examples using local search. We demonstrate eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16473","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.16473/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":"2602.16473","created_at":"2026-05-20T00:02:09.848248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.16473v2","created_at":"2026-05-20T00:02:09.848248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16473","created_at":"2026-05-20T00:02:09.848248+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTVICAYWP44O","created_at":"2026-05-20T00:02:09.848248+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTVICAYWP44OTRYK","created_at":"2026-05-20T00:02:09.848248+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTVICAYW","created_at":"2026-05-20T00:02:09.848248+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/XTVICAYWP44OTRYK5DTN4DD3XX","json":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX.json","graph_json":"https://pith.science/api/pith-number/XTVICAYWP44OTRYK5DTN4DD3XX/graph.json","events_json":"https://pith.science/api/pith-number/XTVICAYWP44OTRYK5DTN4DD3XX/events.json","paper":"https://pith.science/paper/XTVICAYW"},"agent_actions":{"view_html":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX","download_json":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX.json","view_paper":"https://pith.science/paper/XTVICAYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.16473&json=true","fetch_graph":"https://pith.science/api/pith-number/XTVICAYWP44OTRYK5DTN4DD3XX/graph.json","fetch_events":"https://pith.science/api/pith-number/XTVICAYWP44OTRYK5DTN4DD3XX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX/action/storage_attestation","attest_author":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX/action/author_attestation","sign_citation":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX/action/citation_signature","submit_replication":"https://pith.science/pith/XTVICAYWP44OTRYK5DTN4DD3XX/action/replication_record"}},"created_at":"2026-05-20T00:02:09.848248+00:00","updated_at":"2026-05-20T00:02:09.848248+00:00"}