{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2ZODQHPPEZAOUNPAXGHQSY7ZPI","short_pith_number":"pith:2ZODQHPP","canonical_record":{"source":{"id":"1606.05225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T15:34:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0765ebd695ed836bb1d63796830a5101d51735bf02c801ccee06086bf1a644e4","abstract_canon_sha256":"b919167fa04f3f5e7c8ee09fa127b4dbf77800e1ab65f70dd22ba693d573b5ce"},"schema_version":"1.0"},"canonical_sha256":"d65c381def2640ea35e0b98f0963f97a1ce1ec456d9e57d2aef6c21ebe7a3558","source":{"kind":"arxiv","id":"1606.05225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05225","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05225v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05225","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"2ZODQHPPEZAO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZODQHPPEZAOUNPA","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZODQHPP","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2ZODQHPPEZAOUNPAXGHQSY7ZPI","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T15:34:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0765ebd695ed836bb1d63796830a5101d51735bf02c801ccee06086bf1a644e4","abstract_canon_sha256":"b919167fa04f3f5e7c8ee09fa127b4dbf77800e1ab65f70dd22ba693d573b5ce"},"schema_version":"1.0"},"canonical_sha256":"d65c381def2640ea35e0b98f0963f97a1ce1ec456d9e57d2aef6c21ebe7a3558","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:21.778658Z","signature_b64":"riDvQf/wJJbYEo5Pf8FjhytvddS23BBxclWetSjR7OCrNG920U1UCZzPXlvFYeRjOcCbCAJGVR/U4a91UlgGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d65c381def2640ea35e0b98f0963f97a1ce1ec456d9e57d2aef6c21ebe7a3558","last_reissued_at":"2026-05-18T01:12:21.778324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:21.778324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05225","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"43WavkyjYI7ShrA9/AZGVEEeVRCA4iu0USCywpSdLDjpEbO/TXZob0XD9tYA7IJvic8lRf/TWZ3tQkpRf5MnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:47.384301Z"},"content_sha256":"011376b8612bdbe4320015a078f95118df4dff2f7368b77903ab4e08662d9113","schema_version":"1.0","event_id":"sha256:011376b8612bdbe4320015a078f95118df4dff2f7368b77903ab4e08662d9113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2ZODQHPPEZAOUNPAXGHQSY7ZPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Median in Nearly Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Gary Miller, Jakub Pachocki, Michael B. Cohen, Yin Tat Lee","submitted_at":"2016-06-16T15:34:58Z","abstract_excerpt":"In this paper we provide faster algorithms for solving the geometric median problem: given $n$ points in $\\mathbb{R}^{d}$ compute a point that minimizes the sum of Euclidean distances to the points. This is one of the oldest non-trivial problems in computational geometry yet despite an abundance of research the previous fastest algorithms for computing a $(1+\\epsilon)$-approximate geometric median were $O(d\\cdot n^{4/3}\\epsilon^{-8/3})$ by Chin et. al, $\\tilde{O}(d\\exp{\\epsilon^{-4}\\log\\epsilon^{-1}})$ by Badoiu et. al, $O(nd+\\mathrm{poly}(d,\\epsilon^{-1})$ by Feldman and Langberg, and $O((nd)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05225","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpJEQbGPSaK/Ztf3rZIST3XUP3ZTffAHf9lHmeR9q59+HYwKbbcHkYKPkdTT7eYPh3q5fIVnVP/0TQToSkqhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:47.384973Z"},"content_sha256":"d748c5d44c0c368c44b8795e2b6dbd82702ec316892c95009cd02199c2ff6975","schema_version":"1.0","event_id":"sha256:d748c5d44c0c368c44b8795e2b6dbd82702ec316892c95009cd02199c2ff6975"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI/bundle.json","state_url":"https://pith.science/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:28:47Z","links":{"resolver":"https://pith.science/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI","bundle":"https://pith.science/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI/bundle.json","state":"https://pith.science/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZODQHPPEZAOUNPAXGHQSY7ZPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2ZODQHPPEZAOUNPAXGHQSY7ZPI","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":"b919167fa04f3f5e7c8ee09fa127b4dbf77800e1ab65f70dd22ba693d573b5ce","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T15:34:58Z","title_canon_sha256":"0765ebd695ed836bb1d63796830a5101d51735bf02c801ccee06086bf1a644e4"},"schema_version":"1.0","source":{"id":"1606.05225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05225","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05225v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05225","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"2ZODQHPPEZAO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZODQHPPEZAOUNPA","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZODQHPP","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:d748c5d44c0c368c44b8795e2b6dbd82702ec316892c95009cd02199c2ff6975","target":"graph","created_at":"2026-05-18T01:12:21Z","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"},"paper":{"abstract_excerpt":"In this paper we provide faster algorithms for solving the geometric median problem: given $n$ points in $\\mathbb{R}^{d}$ compute a point that minimizes the sum of Euclidean distances to the points. This is one of the oldest non-trivial problems in computational geometry yet despite an abundance of research the previous fastest algorithms for computing a $(1+\\epsilon)$-approximate geometric median were $O(d\\cdot n^{4/3}\\epsilon^{-8/3})$ by Chin et. al, $\\tilde{O}(d\\exp{\\epsilon^{-4}\\log\\epsilon^{-1}})$ by Badoiu et. al, $O(nd+\\mathrm{poly}(d,\\epsilon^{-1})$ by Feldman and Langberg, and $O((nd)","authors_text":"Aaron Sidford, Gary Miller, Jakub Pachocki, Michael B. Cohen, Yin Tat Lee","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T15:34:58Z","title":"Geometric Median in Nearly Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05225","kind":"arxiv","version":1},"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:011376b8612bdbe4320015a078f95118df4dff2f7368b77903ab4e08662d9113","target":"record","created_at":"2026-05-18T01:12:21Z","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":"b919167fa04f3f5e7c8ee09fa127b4dbf77800e1ab65f70dd22ba693d573b5ce","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T15:34:58Z","title_canon_sha256":"0765ebd695ed836bb1d63796830a5101d51735bf02c801ccee06086bf1a644e4"},"schema_version":"1.0","source":{"id":"1606.05225","kind":"arxiv","version":1}},"canonical_sha256":"d65c381def2640ea35e0b98f0963f97a1ce1ec456d9e57d2aef6c21ebe7a3558","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d65c381def2640ea35e0b98f0963f97a1ce1ec456d9e57d2aef6c21ebe7a3558","first_computed_at":"2026-05-18T01:12:21.778324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:21.778324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"riDvQf/wJJbYEo5Pf8FjhytvddS23BBxclWetSjR7OCrNG920U1UCZzPXlvFYeRjOcCbCAJGVR/U4a91UlgGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:21.778658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:011376b8612bdbe4320015a078f95118df4dff2f7368b77903ab4e08662d9113","sha256:d748c5d44c0c368c44b8795e2b6dbd82702ec316892c95009cd02199c2ff6975"],"state_sha256":"024004561f7ad014c86a19e5706476edd7bf3948d98d609d308d10e9bdcbd621"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z34VRH2lfO9EznacqWqpoIUMFh+zRbygHKdfWkRQ1IN2tncWsTktVqZnTcTZwAV/9sDU2bFJG6SzChuJZCvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:28:47.388112Z","bundle_sha256":"a21115992dbd84bc1e8370fea9ea5bdd1b6295a4692f16ac102f8b801326736c"}}