{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LN5OBGBT6ZYEXBAKEOZVMGRXFD","short_pith_number":"pith:LN5OBGBT","schema_version":"1.0","canonical_sha256":"5b7ae09833f6704b840a23b3561a3728fe2c9e0315a7aca128b210b6f257e6c9","source":{"kind":"arxiv","id":"2605.18379","version":1},"attestation_state":"computed","paper":{"title":"Beyond Square Roots: Explicit Memory-Efficient Factorization for Multi-Epoch Private Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aki Rehn, Antti Honkela, Christoph H. Lampert, Joel Daniel Andersson, Nikita P. Kalinin","submitted_at":"2026-05-18T13:25:56Z","abstract_excerpt":"Correlated-noise mechanisms are among the most promising approaches for improving the utility of differentially private model training, but rigorous guarantees require explicit, analyzable factorizations, and practical deployment requires memory efficiency. Recent works have developed banded inverse factorizations, which address both requirements by exploiting a banded structure in the correlation matrix. The bandwidth controls the size of the noise buffer used to correlate noise across iterations, and thus governs the tradeoff between utility and memory cost. Existing factorizations highlight"},"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":"2605.18379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T13:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"af3feca840bc3bf5d1759018d47810a57218fff1018755418ac5b2f59a9a521f","abstract_canon_sha256":"1cbaa5802a453f2d9ccac2cde85a9422cb66453e97b1acefea4513acce1a2ecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:57.981295Z","signature_b64":"nDuMezAiHKLEfzPaIY0ljnzkILcOLB4zdiu6GwUHukJTjQp0jJlRJfa2MPmS7sA8JlnrkzRwzkkbAeb+GzZoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b7ae09833f6704b840a23b3561a3728fe2c9e0315a7aca128b210b6f257e6c9","last_reissued_at":"2026-05-20T00:05:57.980546Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:57.980546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Square Roots: Explicit Memory-Efficient Factorization for Multi-Epoch Private Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aki Rehn, Antti Honkela, Christoph H. Lampert, Joel Daniel Andersson, Nikita P. Kalinin","submitted_at":"2026-05-18T13:25:56Z","abstract_excerpt":"Correlated-noise mechanisms are among the most promising approaches for improving the utility of differentially private model training, but rigorous guarantees require explicit, analyzable factorizations, and practical deployment requires memory efficiency. Recent works have developed banded inverse factorizations, which address both requirements by exploiting a banded structure in the correlation matrix. The bandwidth controls the size of the noise buffer used to correlate noise across iterations, and thus governs the tradeoff between utility and memory cost. Existing factorizations highlight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18379","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/2605.18379/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"citation_quote_validity","ran_at":"2026-05-19T23:50:04.477908Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:29.999440Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:47.317063Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.762575Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8d3688b45351eda4a8a10f0189331a3174de36d661afd7c5eeaccbeb05a72410"},"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":"2605.18379","created_at":"2026-05-20T00:05:57.980667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18379v1","created_at":"2026-05-20T00:05:57.980667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18379","created_at":"2026-05-20T00:05:57.980667+00:00"},{"alias_kind":"pith_short_12","alias_value":"LN5OBGBT6ZYE","created_at":"2026-05-20T00:05:57.980667+00:00"},{"alias_kind":"pith_short_16","alias_value":"LN5OBGBT6ZYEXBAK","created_at":"2026-05-20T00:05:57.980667+00:00"},{"alias_kind":"pith_short_8","alias_value":"LN5OBGBT","created_at":"2026-05-20T00:05:57.980667+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/LN5OBGBT6ZYEXBAKEOZVMGRXFD","json":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD.json","graph_json":"https://pith.science/api/pith-number/LN5OBGBT6ZYEXBAKEOZVMGRXFD/graph.json","events_json":"https://pith.science/api/pith-number/LN5OBGBT6ZYEXBAKEOZVMGRXFD/events.json","paper":"https://pith.science/paper/LN5OBGBT"},"agent_actions":{"view_html":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD","download_json":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD.json","view_paper":"https://pith.science/paper/LN5OBGBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18379&json=true","fetch_graph":"https://pith.science/api/pith-number/LN5OBGBT6ZYEXBAKEOZVMGRXFD/graph.json","fetch_events":"https://pith.science/api/pith-number/LN5OBGBT6ZYEXBAKEOZVMGRXFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD/action/storage_attestation","attest_author":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD/action/author_attestation","sign_citation":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD/action/citation_signature","submit_replication":"https://pith.science/pith/LN5OBGBT6ZYEXBAKEOZVMGRXFD/action/replication_record"}},"created_at":"2026-05-20T00:05:57.980667+00:00","updated_at":"2026-05-20T00:05:57.980667+00:00"}