{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EC76XWZX6UU7RHIJXIJXRD6UHK","short_pith_number":"pith:EC76XWZX","schema_version":"1.0","canonical_sha256":"20bfebdb37f529f89d09ba13788fd43aa8f3556e77b7cb54f356fcdb4a505ed3","source":{"kind":"arxiv","id":"2602.02016","version":2},"attestation_state":"computed","paper":{"title":"DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Alistarh, Erik Schultheis, Ionut-Vlad Modoranu, Mher Safaryan, Philip Zmushko","submitted_at":"2026-02-02T12:14:45Z","abstract_excerpt":"Shampoo is one of the leading approximate second-order optimizers: a variant of it has won the MLCommons AlgoPerf competition, and it has been shown to produce models with lower activation outliers that are easier to compress. Yet, applying Shampoo currently comes at the cost of significant computational slowdown, due to its expensive internal operations. In this paper, we take a significant step to address this shortcoming by proposing \\method (for \\textbf{D}istributed \\textbf{A}ccelerated \\textbf{SH}ampoo), a faster implementation of Distributed Shampoo based on two main new techniques: Firs"},"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.02016","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-02T12:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"a828e2ce0133aaa37b030cba94ecd992e34cc94d1e180e2c14512a62576cce62","abstract_canon_sha256":"49901c47790d714563a16be317c60ef4a9c7315c0bf2e4c7d1d88a2640e7c386"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:48.975969Z","signature_b64":"buUjlfz0jPDPZTxCFtBRtq/f+qg4be3zSM0Si0nVQh6k13eMvl8/Rt3paGA4dpjVzfM20sKACBwi5fa5DFc7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20bfebdb37f529f89d09ba13788fd43aa8f3556e77b7cb54f356fcdb4a505ed3","last_reissued_at":"2026-06-26T01:15:48.975460Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:48.975460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Alistarh, Erik Schultheis, Ionut-Vlad Modoranu, Mher Safaryan, Philip Zmushko","submitted_at":"2026-02-02T12:14:45Z","abstract_excerpt":"Shampoo is one of the leading approximate second-order optimizers: a variant of it has won the MLCommons AlgoPerf competition, and it has been shown to produce models with lower activation outliers that are easier to compress. Yet, applying Shampoo currently comes at the cost of significant computational slowdown, due to its expensive internal operations. In this paper, we take a significant step to address this shortcoming by proposing \\method (for \\textbf{D}istributed \\textbf{A}ccelerated \\textbf{SH}ampoo), a faster implementation of Distributed Shampoo based on two main new techniques: Firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.02016","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.02016/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.02016","created_at":"2026-06-26T01:15:48.975528+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.02016v2","created_at":"2026-06-26T01:15:48.975528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.02016","created_at":"2026-06-26T01:15:48.975528+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC76XWZX6UU7","created_at":"2026-06-26T01:15:48.975528+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC76XWZX6UU7RHIJ","created_at":"2026-06-26T01:15:48.975528+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC76XWZX","created_at":"2026-06-26T01:15:48.975528+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/EC76XWZX6UU7RHIJXIJXRD6UHK","json":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK.json","graph_json":"https://pith.science/api/pith-number/EC76XWZX6UU7RHIJXIJXRD6UHK/graph.json","events_json":"https://pith.science/api/pith-number/EC76XWZX6UU7RHIJXIJXRD6UHK/events.json","paper":"https://pith.science/paper/EC76XWZX"},"agent_actions":{"view_html":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK","download_json":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK.json","view_paper":"https://pith.science/paper/EC76XWZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.02016&json=true","fetch_graph":"https://pith.science/api/pith-number/EC76XWZX6UU7RHIJXIJXRD6UHK/graph.json","fetch_events":"https://pith.science/api/pith-number/EC76XWZX6UU7RHIJXIJXRD6UHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK/action/storage_attestation","attest_author":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK/action/author_attestation","sign_citation":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK/action/citation_signature","submit_replication":"https://pith.science/pith/EC76XWZX6UU7RHIJXIJXRD6UHK/action/replication_record"}},"created_at":"2026-06-26T01:15:48.975528+00:00","updated_at":"2026-06-26T01:15:48.975528+00:00"}