{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G74FGTKSMT27OXNTJB6WNX23CL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"26863c2117d6576f620d1b71ebaf33d13899115b893c13ec65e123f7e96133ee","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-22T19:15:50Z","title_canon_sha256":"22f463ae3f5e9a529d96a2ed746f3147d695c34f1e75b5f8ded8155d7beec5a2"},"schema_version":"1.0","source":{"id":"2402.14925","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14925","created_at":"2026-07-05T08:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14925v2","created_at":"2026-07-05T08:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14925","created_at":"2026-07-05T08:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"G74FGTKSMT27","created_at":"2026-07-05T08:47:50Z"},{"alias_kind":"pith_short_16","alias_value":"G74FGTKSMT27OXNT","created_at":"2026-07-05T08:47:50Z"},{"alias_kind":"pith_short_8","alias_value":"G74FGTKS","created_at":"2026-07-05T08:47:50Z"}],"graph_snapshots":[{"event_id":"sha256:97a57467d07765dafc0e83ad448d3b1615ebd570f68d38e1480f5fd3e7f6a10e","target":"graph","created_at":"2026-07-05T08:47:50Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.14925/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An unbiased $m$-sparsification of a vector $p\\in \\mathbb{R}^n$ is a random vector $Q\\in \\mathbb{R}^n$ with mean $p$ that has at most $m<n$ nonzero coordinates. Unbiased sparsification compresses the original vector without introducing bias; it arises in various contexts, such as in federated learning and sampling sparse probability distributions. Ideally, unbiased sparsification should also minimize the expected value of a divergence function $\\mathsf{Div}(Q,p)$ that measures how far away $Q$ is from the original $p$. If $Q$ is optimal in this sense, then we call it efficient. Our main results","authors_text":"Benjamin Howard, Daniel Scheinerman, Emma Cohen, Fred Kochman, Jeffrey VanderKam, Keith Frankston, Leighton Barnes, Stephen Cameron, Timothy Chow","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-22T19:15:50Z","title":"Efficient Unbiased Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14925","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5672e565b00826ae9d7b8cfabaf6bb0f87e5a1954fd0b019e99b72190079be48","target":"record","created_at":"2026-07-05T08:47:50Z","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":"26863c2117d6576f620d1b71ebaf33d13899115b893c13ec65e123f7e96133ee","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-22T19:15:50Z","title_canon_sha256":"22f463ae3f5e9a529d96a2ed746f3147d695c34f1e75b5f8ded8155d7beec5a2"},"schema_version":"1.0","source":{"id":"2402.14925","kind":"arxiv","version":2}},"canonical_sha256":"37f8534d5264f5f75db3487d66df5b12c575bd8e35beefea4c6e54965f1b2d26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37f8534d5264f5f75db3487d66df5b12c575bd8e35beefea4c6e54965f1b2d26","first_computed_at":"2026-07-05T08:47:50.075260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:47:50.075260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yAyv/uFLTbsOuQyIZrrA1dBaljQdX8a/x4uLhgcuJdUnfi4kkPKnYBgvmndSfjMEKV0WW44omtWVkOAI8o2OBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:47:50.075712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.14925","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5672e565b00826ae9d7b8cfabaf6bb0f87e5a1954fd0b019e99b72190079be48","sha256:97a57467d07765dafc0e83ad448d3b1615ebd570f68d38e1480f5fd3e7f6a10e"],"state_sha256":"2d641735c824a49271e14fe5c4ba56ce1385185aa1098a245b25e47f4ef0e293"}