{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YD2R7N272W54J57H7HS2VUB2EH","short_pith_number":"pith:YD2R7N27","schema_version":"1.0","canonical_sha256":"c0f51fb75fd5bbc4f7e7f9e5aad03a21e0818b9fd96eb6dc58eb3e00cc7c3ee8","source":{"kind":"arxiv","id":"2505.20189","version":1},"attestation_state":"computed","paper":{"title":"Private Geometric Median in Nearly-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Chutong Yang, Daogao Liu, Kevin Tian, Syamantak Kumar","submitted_at":"2025-05-26T16:32:49Z","abstract_excerpt":"Estimating the geometric median of a dataset is a robust counterpart to mean estimation, and is a fundamental problem in computational geometry. Recently, [HSU24] gave an $(\\varepsilon, \\delta)$-differentially private algorithm obtaining an $\\alpha$-multiplicative approximation to the geometric median objective, $\\frac 1 n \\sum_{i \\in [n]} \\|\\cdot - \\mathbf{x}_i\\|$, given a dataset $\\mathcal{D} := \\{\\mathbf{x}_i\\}_{i \\in [n]} \\subset \\mathbb{R}^d$. Their algorithm requires $n \\gtrsim \\sqrt d \\cdot \\frac 1 {\\alpha\\varepsilon}$ samples, which they prove is information-theoretically optimal. This"},"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":"2505.20189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-26T16:32:49Z","cross_cats_sorted":["cs.CR","cs.LG","stat.ML"],"title_canon_sha256":"02f70099a3c34c9e760f474667ceb83ca75ff95cb9eadc29acec562a07a3194b","abstract_canon_sha256":"996017663d889179f131b02fc951137601cfe252ddbdc3804fa952f948013dbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:53.933245Z","signature_b64":"++NC3cxgxRqx2UuoZQtzsdNIAUANF0LFrcJldDLcT360XM6fi3LmSZcQzcVQcEVAyhjcHNCRwLMIZJVrBQvxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0f51fb75fd5bbc4f7e7f9e5aad03a21e0818b9fd96eb6dc58eb3e00cc7c3ee8","last_reissued_at":"2026-07-05T11:09:53.932769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:53.932769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Geometric Median in Nearly-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Chutong Yang, Daogao Liu, Kevin Tian, Syamantak Kumar","submitted_at":"2025-05-26T16:32:49Z","abstract_excerpt":"Estimating the geometric median of a dataset is a robust counterpart to mean estimation, and is a fundamental problem in computational geometry. Recently, [HSU24] gave an $(\\varepsilon, \\delta)$-differentially private algorithm obtaining an $\\alpha$-multiplicative approximation to the geometric median objective, $\\frac 1 n \\sum_{i \\in [n]} \\|\\cdot - \\mathbf{x}_i\\|$, given a dataset $\\mathcal{D} := \\{\\mathbf{x}_i\\}_{i \\in [n]} \\subset \\mathbb{R}^d$. Their algorithm requires $n \\gtrsim \\sqrt d \\cdot \\frac 1 {\\alpha\\varepsilon}$ samples, which they prove is information-theoretically optimal. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20189","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/2505.20189/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":"2505.20189","created_at":"2026-07-05T11:09:53.932824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20189v1","created_at":"2026-07-05T11:09:53.932824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20189","created_at":"2026-07-05T11:09:53.932824+00:00"},{"alias_kind":"pith_short_12","alias_value":"YD2R7N272W54","created_at":"2026-07-05T11:09:53.932824+00:00"},{"alias_kind":"pith_short_16","alias_value":"YD2R7N272W54J57H","created_at":"2026-07-05T11:09:53.932824+00:00"},{"alias_kind":"pith_short_8","alias_value":"YD2R7N27","created_at":"2026-07-05T11:09:53.932824+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/YD2R7N272W54J57H7HS2VUB2EH","json":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH.json","graph_json":"https://pith.science/api/pith-number/YD2R7N272W54J57H7HS2VUB2EH/graph.json","events_json":"https://pith.science/api/pith-number/YD2R7N272W54J57H7HS2VUB2EH/events.json","paper":"https://pith.science/paper/YD2R7N27"},"agent_actions":{"view_html":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH","download_json":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH.json","view_paper":"https://pith.science/paper/YD2R7N27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20189&json=true","fetch_graph":"https://pith.science/api/pith-number/YD2R7N272W54J57H7HS2VUB2EH/graph.json","fetch_events":"https://pith.science/api/pith-number/YD2R7N272W54J57H7HS2VUB2EH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH/action/storage_attestation","attest_author":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH/action/author_attestation","sign_citation":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH/action/citation_signature","submit_replication":"https://pith.science/pith/YD2R7N272W54J57H7HS2VUB2EH/action/replication_record"}},"created_at":"2026-07-05T11:09:53.932824+00:00","updated_at":"2026-07-05T11:09:53.932824+00:00"}