{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7I63E3ZYLCZ2IIRVE7O2PDLKL6","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":"2eaecc466ad890f422594b9396397702f44b9b7b9495c7d1af252f62ffb5a6c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T09:11:18Z","title_canon_sha256":"b69a08ed017f9340e2e47c6959a7fd83535a851ac43bfce6fd2d4b882f9a31db"},"schema_version":"1.0","source":{"id":"1702.03106","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03106","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03106v2","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03106","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"7I63E3ZYLCZ2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7I63E3ZYLCZ2IIRV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7I63E3ZY","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:d2d824e84c1f34f9392aadc4e22fc47943ce1ab21a79f85074606a19a5d72afb","target":"graph","created_at":"2026-05-18T00:49:57Z","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":"Given an $n$-point metric space, consider the problem of finding a point with the minimum sum of distances to all points. We show that this problem has a randomized algorithm that {\\em always} outputs a $(2+\\epsilon)$-approximate solution in an expected $O(n/\\epsilon^2)$ time for each constant $\\epsilon>0$. Inheriting Indyk's algorithm, our algorithm outputs a $(1+\\epsilon)$-approximate $1$-median in $O(n/\\epsilon^2)$ time with probability $\\Omega(1)$.","authors_text":"Ching-Lueh Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T09:11:18Z","title":"A Las Vegas approximation algorithm for metric $1$-median selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03106","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:c105fc8051a9a6d09f6dc3a20db6227fd56f06dd4a3dafe9d0ef478d2807d861","target":"record","created_at":"2026-05-18T00:49:57Z","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":"2eaecc466ad890f422594b9396397702f44b9b7b9495c7d1af252f62ffb5a6c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T09:11:18Z","title_canon_sha256":"b69a08ed017f9340e2e47c6959a7fd83535a851ac43bfce6fd2d4b882f9a31db"},"schema_version":"1.0","source":{"id":"1702.03106","kind":"arxiv","version":2}},"canonical_sha256":"fa3db26f3858b3a4223527dda78d6a5f97e162c7fe6e0f56f35dc642ab3585d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3db26f3858b3a4223527dda78d6a5f97e162c7fe6e0f56f35dc642ab3585d4","first_computed_at":"2026-05-18T00:49:57.506289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:57.506289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T9+5862HGqpWpIjdD8TpVU2c5aFwC62FMwcIFjn+MqBN6d3UJBekjXnE2Lp9Iw8zdArVs0/ZfpmlsCUMBad/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:57.506981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03106","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c105fc8051a9a6d09f6dc3a20db6227fd56f06dd4a3dafe9d0ef478d2807d861","sha256:d2d824e84c1f34f9392aadc4e22fc47943ce1ab21a79f85074606a19a5d72afb"],"state_sha256":"317a028c4945c97cfbcf0b12b8c870252093478f58992b3f6b6cd21cc1fe2116"}