{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2MPMVH6VCLKGYCUOZDMZ3PTGPZ","short_pith_number":"pith:2MPMVH6V","schema_version":"1.0","canonical_sha256":"d31eca9fd512d46c0a8ec8d99dbe667e4d2506c9792e65efe84918c5ae3b9608","source":{"kind":"arxiv","id":"2510.19315","version":3},"attestation_state":"computed","paper":{"title":"Transformers are Inherently Succinct","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.FL","authors_text":"Anthony W. Lin, Pascal Bergstr\\\"a{\\ss}er, Ryan Cotterell","submitted_at":"2025-10-22T07:25:54Z","abstract_excerpt":"We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that fixed-precision transformers are remarkably succinct: they can be exponentially more succinct than both linear temporal logic (LTL) and recurrent neural networks, and, by extension, state-space models, and doubly exponentially more succinct than finite automata. In other words, there exist families of languages describable by polynomial-size transformers who"},"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":"2510.19315","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-10-22T07:25:54Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"57bc3d9acd79e9b34e658b6059d4a44d093a5b7f7658009e412d750586b92afd","abstract_canon_sha256":"511e6b81b1a78900541cac53631a87a13b2e7929b0e0a0fe2736e5ce4a07e912"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:26.430491Z","signature_b64":"4uKXYRLjEb42wUJQ8vQ7xykvOMJKm9/2OQuyzgCDNdvG3qtkwMDhI7m9bcZGU345zDypveJAYnGZFIyRsydCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d31eca9fd512d46c0a8ec8d99dbe667e4d2506c9792e65efe84918c5ae3b9608","last_reissued_at":"2026-05-20T00:00:26.429720Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:26.429720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformers are Inherently Succinct","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.FL","authors_text":"Anthony W. Lin, Pascal Bergstr\\\"a{\\ss}er, Ryan Cotterell","submitted_at":"2025-10-22T07:25:54Z","abstract_excerpt":"We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that fixed-precision transformers are remarkably succinct: they can be exponentially more succinct than both linear temporal logic (LTL) and recurrent neural networks, and, by extension, state-space models, and doubly exponentially more succinct than finite automata. In other words, there exist families of languages describable by polynomial-size transformers who"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.19315","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/2510.19315/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":"2510.19315","created_at":"2026-05-20T00:00:26.429849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.19315v3","created_at":"2026-05-20T00:00:26.429849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.19315","created_at":"2026-05-20T00:00:26.429849+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MPMVH6VCLKG","created_at":"2026-05-20T00:00:26.429849+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MPMVH6VCLKGYCUO","created_at":"2026-05-20T00:00:26.429849+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MPMVH6V","created_at":"2026-05-20T00:00:26.429849+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/2MPMVH6VCLKGYCUOZDMZ3PTGPZ","json":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ.json","graph_json":"https://pith.science/api/pith-number/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/graph.json","events_json":"https://pith.science/api/pith-number/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/events.json","paper":"https://pith.science/paper/2MPMVH6V"},"agent_actions":{"view_html":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ","download_json":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ.json","view_paper":"https://pith.science/paper/2MPMVH6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.19315&json=true","fetch_graph":"https://pith.science/api/pith-number/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/action/storage_attestation","attest_author":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/action/author_attestation","sign_citation":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/action/citation_signature","submit_replication":"https://pith.science/pith/2MPMVH6VCLKGYCUOZDMZ3PTGPZ/action/replication_record"}},"created_at":"2026-05-20T00:00:26.429849+00:00","updated_at":"2026-05-20T00:00:26.429849+00:00"}