{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ADHTHG7HNMRVYUE2MKRNUNZMQZ","short_pith_number":"pith:ADHTHG7H","schema_version":"1.0","canonical_sha256":"00cf339be76b235c509a62a2da372c8643ef75d816339b8a3e9260f00dafa0b8","source":{"kind":"arxiv","id":"2606.29593","version":1},"attestation_state":"computed","paper":{"title":"How AI settled the complexity of the oldest SGD algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Micha{\\l} Derezi\\'nski, Xiaoyu Dong","submitted_at":"2026-06-28T20:27:52Z","abstract_excerpt":"In 1937, Stefan Kaczmarz proposed a simple algorithm for solving systems of linear equations. This algorithm turned out to be the earliest known example of stochastic gradient descent, a ubiquitous computing paradigm that drives the training of modern AI models such as ChatGPT and Gemini. Now, those AI models have joined forces to discover the worst-case complexity of the Kaczmarz algorithm. This paper tells the story of how it happened."},"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":"2606.29593","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-28T20:27:52Z","cross_cats_sorted":["cs.AI","cs.NA","math.NA","math.OC","stat.ML"],"title_canon_sha256":"45b561ca6a6a0aa95341f186228e477af0ba3e813121ccf0b23c17d0afc2de61","abstract_canon_sha256":"83748aaa71ba697a49a199e0707c1898493f849bb7fd401115f840316dbaa4c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:13.367690Z","signature_b64":"QBROFAukqTZEqVNnKS0b+miuRkN43et5p6rEwiXdIaKModSCwsjeflMDI7RpT7Q6Dl/GiY+NXN2cHfU3Fy4SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00cf339be76b235c509a62a2da372c8643ef75d816339b8a3e9260f00dafa0b8","last_reissued_at":"2026-06-30T01:18:13.367230Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:13.367230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How AI settled the complexity of the oldest SGD algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Micha{\\l} Derezi\\'nski, Xiaoyu Dong","submitted_at":"2026-06-28T20:27:52Z","abstract_excerpt":"In 1937, Stefan Kaczmarz proposed a simple algorithm for solving systems of linear equations. This algorithm turned out to be the earliest known example of stochastic gradient descent, a ubiquitous computing paradigm that drives the training of modern AI models such as ChatGPT and Gemini. Now, those AI models have joined forces to discover the worst-case complexity of the Kaczmarz algorithm. This paper tells the story of how it happened."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29593","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/2606.29593/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":"2606.29593","created_at":"2026-06-30T01:18:13.367294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29593v1","created_at":"2026-06-30T01:18:13.367294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29593","created_at":"2026-06-30T01:18:13.367294+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADHTHG7HNMRV","created_at":"2026-06-30T01:18:13.367294+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADHTHG7HNMRVYUE2","created_at":"2026-06-30T01:18:13.367294+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADHTHG7H","created_at":"2026-06-30T01:18:13.367294+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/ADHTHG7HNMRVYUE2MKRNUNZMQZ","json":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ.json","graph_json":"https://pith.science/api/pith-number/ADHTHG7HNMRVYUE2MKRNUNZMQZ/graph.json","events_json":"https://pith.science/api/pith-number/ADHTHG7HNMRVYUE2MKRNUNZMQZ/events.json","paper":"https://pith.science/paper/ADHTHG7H"},"agent_actions":{"view_html":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ","download_json":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ.json","view_paper":"https://pith.science/paper/ADHTHG7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29593&json=true","fetch_graph":"https://pith.science/api/pith-number/ADHTHG7HNMRVYUE2MKRNUNZMQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ADHTHG7HNMRVYUE2MKRNUNZMQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ/action/storage_attestation","attest_author":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ/action/author_attestation","sign_citation":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ/action/citation_signature","submit_replication":"https://pith.science/pith/ADHTHG7HNMRVYUE2MKRNUNZMQZ/action/replication_record"}},"created_at":"2026-06-30T01:18:13.367294+00:00","updated_at":"2026-06-30T01:18:13.367294+00:00"}