{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G74FGTKSMT27OXNTJB6WNX23CL","short_pith_number":"pith:G74FGTKS","schema_version":"1.0","canonical_sha256":"37f8534d5264f5f75db3487d66df5b12c575bd8e35beefea4c6e54965f1b2d26","source":{"kind":"arxiv","id":"2402.14925","version":2},"attestation_state":"computed","paper":{"title":"Efficient Unbiased Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Benjamin Howard, Daniel Scheinerman, Emma Cohen, Fred Kochman, Jeffrey VanderKam, Keith Frankston, Leighton Barnes, Stephen Cameron, Timothy Chow","submitted_at":"2024-02-22T19:15:50Z","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"},"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":"2402.14925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-22T19:15:50Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"22f463ae3f5e9a529d96a2ed746f3147d695c34f1e75b5f8ded8155d7beec5a2","abstract_canon_sha256":"26863c2117d6576f620d1b71ebaf33d13899115b893c13ec65e123f7e96133ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:50.075712Z","signature_b64":"yAyv/uFLTbsOuQyIZrrA1dBaljQdX8a/x4uLhgcuJdUnfi4kkPKnYBgvmndSfjMEKV0WW44omtWVkOAI8o2OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f8534d5264f5f75db3487d66df5b12c575bd8e35beefea4c6e54965f1b2d26","last_reissued_at":"2026-07-05T08:47:50.075260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:50.075260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Unbiased Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Benjamin Howard, Daniel Scheinerman, Emma Cohen, Fred Kochman, Jeffrey VanderKam, Keith Frankston, Leighton Barnes, Stephen Cameron, Timothy Chow","submitted_at":"2024-02-22T19:15:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14925","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/2402.14925/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":"2402.14925","created_at":"2026-07-05T08:47:50.075327+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.14925v2","created_at":"2026-07-05T08:47:50.075327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14925","created_at":"2026-07-05T08:47:50.075327+00:00"},{"alias_kind":"pith_short_12","alias_value":"G74FGTKSMT27","created_at":"2026-07-05T08:47:50.075327+00:00"},{"alias_kind":"pith_short_16","alias_value":"G74FGTKSMT27OXNT","created_at":"2026-07-05T08:47:50.075327+00:00"},{"alias_kind":"pith_short_8","alias_value":"G74FGTKS","created_at":"2026-07-05T08:47:50.075327+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18300","citing_title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL","json":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL.json","graph_json":"https://pith.science/api/pith-number/G74FGTKSMT27OXNTJB6WNX23CL/graph.json","events_json":"https://pith.science/api/pith-number/G74FGTKSMT27OXNTJB6WNX23CL/events.json","paper":"https://pith.science/paper/G74FGTKS"},"agent_actions":{"view_html":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL","download_json":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL.json","view_paper":"https://pith.science/paper/G74FGTKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.14925&json=true","fetch_graph":"https://pith.science/api/pith-number/G74FGTKSMT27OXNTJB6WNX23CL/graph.json","fetch_events":"https://pith.science/api/pith-number/G74FGTKSMT27OXNTJB6WNX23CL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL/action/storage_attestation","attest_author":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL/action/author_attestation","sign_citation":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL/action/citation_signature","submit_replication":"https://pith.science/pith/G74FGTKSMT27OXNTJB6WNX23CL/action/replication_record"}},"created_at":"2026-07-05T08:47:50.075327+00:00","updated_at":"2026-07-05T08:47:50.075327+00:00"}