{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2HCTZXT45C7BMKMKGP6QRQRDLB","short_pith_number":"pith:2HCTZXT4","schema_version":"1.0","canonical_sha256":"d1c53cde7ce8be16298a33fd08c2235871494c52326185be359d1944192ab432","source":{"kind":"arxiv","id":"2504.04702","version":1},"attestation_state":"computed","paper":{"title":"Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LG","authors_text":"Bo Chen, Jiahao Zhang, Zhao Song, Zhenmei Shi","submitted_at":"2025-04-07T03:08:12Z","abstract_excerpt":"Recent advancements in Transformer-based architectures have led to impressive breakthroughs in natural language processing tasks, with models such as GPT-4, Claude, and Gemini demonstrating human-level reasoning abilities. However, despite their high performance, concerns remain about the inherent limitations of these models, especially when it comes to learning basic logical functions. While complexity-theoretic analyses indicate that Transformers can represent simple logic functions (e.g., $\\mathsf{AND}$, $\\mathsf{OR}$, and majority gates) by its nature of belonging to the $\\mathsf{TC}^0$ cl"},"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":"2504.04702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-07T03:08:12Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"d41e9c21859bbc806552e981c1b3f229b602b9a597fe7f58ccbd28f52da08d23","abstract_canon_sha256":"8534ce347f3a1f0afcf024196bac7cb60d646f976a92b8d5866743384e2bdd24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:28.638841Z","signature_b64":"2dUGHdWNhjm/1+E48TUIdWB4sEmJfeQiSb3r9jcsr1Um93dJN6873b0AlQN5CuQ6DkFWL1dn44np5Ygiwn0wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c53cde7ce8be16298a33fd08c2235871494c52326185be359d1944192ab432","last_reissued_at":"2026-07-05T10:45:28.638284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:28.638284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LG","authors_text":"Bo Chen, Jiahao Zhang, Zhao Song, Zhenmei Shi","submitted_at":"2025-04-07T03:08:12Z","abstract_excerpt":"Recent advancements in Transformer-based architectures have led to impressive breakthroughs in natural language processing tasks, with models such as GPT-4, Claude, and Gemini demonstrating human-level reasoning abilities. However, despite their high performance, concerns remain about the inherent limitations of these models, especially when it comes to learning basic logical functions. While complexity-theoretic analyses indicate that Transformers can represent simple logic functions (e.g., $\\mathsf{AND}$, $\\mathsf{OR}$, and majority gates) by its nature of belonging to the $\\mathsf{TC}^0$ cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04702","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/2504.04702/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":"2504.04702","created_at":"2026-07-05T10:45:28.638355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04702v1","created_at":"2026-07-05T10:45:28.638355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04702","created_at":"2026-07-05T10:45:28.638355+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HCTZXT45C7B","created_at":"2026-07-05T10:45:28.638355+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HCTZXT45C7BMKMK","created_at":"2026-07-05T10:45:28.638355+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HCTZXT4","created_at":"2026-07-05T10:45:28.638355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19531","citing_title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB","json":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB.json","graph_json":"https://pith.science/api/pith-number/2HCTZXT45C7BMKMKGP6QRQRDLB/graph.json","events_json":"https://pith.science/api/pith-number/2HCTZXT45C7BMKMKGP6QRQRDLB/events.json","paper":"https://pith.science/paper/2HCTZXT4"},"agent_actions":{"view_html":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB","download_json":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB.json","view_paper":"https://pith.science/paper/2HCTZXT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04702&json=true","fetch_graph":"https://pith.science/api/pith-number/2HCTZXT45C7BMKMKGP6QRQRDLB/graph.json","fetch_events":"https://pith.science/api/pith-number/2HCTZXT45C7BMKMKGP6QRQRDLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB/action/storage_attestation","attest_author":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB/action/author_attestation","sign_citation":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB/action/citation_signature","submit_replication":"https://pith.science/pith/2HCTZXT45C7BMKMKGP6QRQRDLB/action/replication_record"}},"created_at":"2026-07-05T10:45:28.638355+00:00","updated_at":"2026-07-05T10:45:28.638355+00:00"}