{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DUSVJ37QIIWEQHTAVVM5XYQYO7","short_pith_number":"pith:DUSVJ37Q","schema_version":"1.0","canonical_sha256":"1d2554eff0422c481e60ad59dbe21877e938842d04cb255b0a0a34b85d695853","source":{"kind":"arxiv","id":"2412.20195","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds on transformers with infinite precision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Kozachinskiy","submitted_at":"2024-12-28T16:09:25Z","abstract_excerpt":"In this note, we use the VC dimension technique to prove the first lower bound against one-layer softmax transformers with infinite precision. We do so for two tasks: function composition, considered by Peng, Narayanan, and Papadimitriou, and the SUM$_2$ task, considered by Sanford, Hsu, and Telgarsky."},"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":"2412.20195","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-28T16:09:25Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"b7f15d9a19f94e43b52dbb5564bdeae41b5297cfdc4e19d6423fa21e1c5ef562","abstract_canon_sha256":"c8ff66aec750ddec37341423fe4624e1642b68d310ea16cd5a3cca8292c71c25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:55.863921Z","signature_b64":"JUjLrU7rS6X9B9hNWLqvtaF3Ijqt3ONywTBlYprm28yjBu8W4RLNas4zFjoz4Vz0/xwMjjhdxLv7darOAOiTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2554eff0422c481e60ad59dbe21877e938842d04cb255b0a0a34b85d695853","last_reissued_at":"2026-07-05T09:54:55.863437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:55.863437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on transformers with infinite precision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Kozachinskiy","submitted_at":"2024-12-28T16:09:25Z","abstract_excerpt":"In this note, we use the VC dimension technique to prove the first lower bound against one-layer softmax transformers with infinite precision. We do so for two tasks: function composition, considered by Peng, Narayanan, and Papadimitriou, and the SUM$_2$ task, considered by Sanford, Hsu, and Telgarsky."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20195","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.20195/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":"2412.20195","created_at":"2026-07-05T09:54:55.863497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20195v1","created_at":"2026-07-05T09:54:55.863497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20195","created_at":"2026-07-05T09:54:55.863497+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUSVJ37QIIWE","created_at":"2026-07-05T09:54:55.863497+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUSVJ37QIIWEQHTA","created_at":"2026-07-05T09:54:55.863497+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUSVJ37Q","created_at":"2026-07-05T09:54:55.863497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04243","citing_title":"Attention-based representations for multi-task computation","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7","json":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7.json","graph_json":"https://pith.science/api/pith-number/DUSVJ37QIIWEQHTAVVM5XYQYO7/graph.json","events_json":"https://pith.science/api/pith-number/DUSVJ37QIIWEQHTAVVM5XYQYO7/events.json","paper":"https://pith.science/paper/DUSVJ37Q"},"agent_actions":{"view_html":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7","download_json":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7.json","view_paper":"https://pith.science/paper/DUSVJ37Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20195&json=true","fetch_graph":"https://pith.science/api/pith-number/DUSVJ37QIIWEQHTAVVM5XYQYO7/graph.json","fetch_events":"https://pith.science/api/pith-number/DUSVJ37QIIWEQHTAVVM5XYQYO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7/action/storage_attestation","attest_author":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7/action/author_attestation","sign_citation":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7/action/citation_signature","submit_replication":"https://pith.science/pith/DUSVJ37QIIWEQHTAVVM5XYQYO7/action/replication_record"}},"created_at":"2026-07-05T09:54:55.863497+00:00","updated_at":"2026-07-05T09:54:55.863497+00:00"}