{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:V2HVCKOORCCJHIEJ6WTESR6M5Z","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5093d0f0e9ba463cb4be5369fa3e04276e01fe1791c1dbd14e4898ace465fb14","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:59:26Z","title_canon_sha256":"8afc6aea63fda48a49767a60fbfc6e89d4c2a22468ae4b510ed73d342aa7b9e1"},"schema_version":"1.0","source":{"id":"2605.13473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13473","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13473v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13473","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"V2HVCKOORCCJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V2HVCKOORCCJHIEJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V2HVCKOO","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3c0f01559987decde80142df02980345771184b0f28122cf2c63cc7e2a0d38f2","target":"graph","created_at":"2026-05-18T02:44:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By exploiting the exact-quadratic structure of the inner regression loss, we establish super-geometric convergence against a right-Newton comparator and prove an algorithm-aligned token-local residual contraction bound; at 1.3B parameters OSDN achieves a 39% reduction in the recall residual ratio."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The inner objective remains exactly quadratic and the online hypergradient update for the diagonal preconditioner can be maintained without breaking the chunkwise parallel pipeline or requiring high-dimensional state."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"OSDN adds online diagonal preconditioning to the Delta Rule, preserving chunkwise parallelism while proving super-geometric convergence and delivering 32-39% recall gains at 340M-1.3B scales."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"OSDN augments the Delta Rule with an online diagonal preconditioner equivalent to per-feature key scaling, delivering super-geometric convergence and 39% lower recall residual at 1.3B parameters."}],"snapshot_sha256":"f76df0f9d6254453bc369ab5be0b1c7dfd479f2e502f474059bd423ac56db383"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Linear attention and state-space models offer constant-memory alternatives to softmax attention, but often struggle with in-context associative recall. The Delta Rule mitigates this by writing each token via one step of online gradient descent. However, its step size relies on a single scalar gate that ignores the feature-wise curvature of the inner objective. We propose Online Scaled DeltaNet (OSDN), which augments the scalar gate with a diagonal preconditioner updated online via hypergradient feedback. Crucially, this right-preconditioning is algebraically equivalent to a per-feature scaling","authors_text":"Chenyu Zhou, Dongdong Ge, Hongpei Li, Jianghao Lin, Yinyu Ye, Yuerou Liu","cross_cats":["cs.CL"],"headline":"OSDN augments the Delta Rule with an online diagonal preconditioner equivalent to per-feature key scaling, delivering super-geometric convergence and 39% lower recall residual at 1.3B parameters.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:59:26Z","title":"OSDN: Improving Delta Rule with Provable Online Preconditioning in Linear Attention"},"references":{"count":73,"internal_anchors":5,"resolved_work":73,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"What learning algorithm is in-context learning? investigations with linear models","work_id":"79950075-a669-4e48-8bc9-28cc29e8d753","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Zoology: Measuring and improving recall in efficient language models","work_id":"a51e0ddf-22e2-4d3c-9759-7201f7d9a699","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Simple linear attention language models balance the recall-throughput tradeoff","work_id":"c542bc4f-de21-42d2-812b-b46f5fa9b434","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Just read twice: closing the recall gap for recurrent language models, 2024 b","work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Hinton, V olodymyr Mnih, Joel Z","work_id":"2acf842b-c183-4bfb-8391-2b456d531aa2","year":2016}],"snapshot_sha256":"8fbc836eb1ff49d3919ad7ba3273ee946089009a486517d6162d19a767f6e859"},"source":{"id":"2605.13473","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:04:37.167670Z","id":"414a0e29-9c84-4451-8f0b-a5440e79128a","model_set":{"reader":"grok-4.3"},"one_line_summary":"OSDN adds online diagonal preconditioning to the Delta Rule, preserving chunkwise parallelism while proving super-geometric convergence and delivering 32-39% recall gains at 340M-1.3B scales.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"OSDN augments the Delta Rule with an online diagonal preconditioner equivalent to per-feature key scaling, delivering super-geometric convergence and 39% lower recall residual at 1.3B parameters.","strongest_claim":"By exploiting the exact-quadratic structure of the inner regression loss, we establish super-geometric convergence against a right-Newton comparator and prove an algorithm-aligned token-local residual contraction bound; at 1.3B parameters OSDN achieves a 39% reduction in the recall residual ratio.","weakest_assumption":"The inner objective remains exactly quadratic and the online hypergradient update for the diagonal preconditioner can be maintained without breaking the chunkwise parallel pipeline or requiring high-dimensional state."}},"verdict_id":"414a0e29-9c84-4451-8f0b-a5440e79128a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f1544a85b9f3aad7a0e1849cd97b3abda1927a1d38152dd41e175fabbf638bf2","target":"record","created_at":"2026-05-18T02:44:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5093d0f0e9ba463cb4be5369fa3e04276e01fe1791c1dbd14e4898ace465fb14","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T12:59:26Z","title_canon_sha256":"8afc6aea63fda48a49767a60fbfc6e89d4c2a22468ae4b510ed73d342aa7b9e1"},"schema_version":"1.0","source":{"id":"2605.13473","kind":"arxiv","version":1}},"canonical_sha256":"ae8f5129ce888493a089f5a64947ccee65eaccf648772ff79bf2e6f538521557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae8f5129ce888493a089f5a64947ccee65eaccf648772ff79bf2e6f538521557","first_computed_at":"2026-05-18T02:44:41.519789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.519789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4FEgFnswv04kJkrGl1b7qIKg5uHnm5g6GiwggBU6mQgVMjF23cEG193S09JDePbHyAJAUP7hx26EdbmKp0gAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.520401Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1544a85b9f3aad7a0e1849cd97b3abda1927a1d38152dd41e175fabbf638bf2","sha256:3c0f01559987decde80142df02980345771184b0f28122cf2c63cc7e2a0d38f2","sha256:a5089a3c640f95ced82079ecc8f955d897a51872df2b9ef42a79b3f72af9f837"],"state_sha256":"2dfa24d13ecc4e8de887a71e582541e4816d922cf367378e2d670ed1d7af6eb3"}