{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7I63E3ZYLCZ2IIRVE7O2PDLKL6","short_pith_number":"pith:7I63E3ZY","canonical_record":{"source":{"id":"1702.03106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T09:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"b69a08ed017f9340e2e47c6959a7fd83535a851ac43bfce6fd2d4b882f9a31db","abstract_canon_sha256":"2eaecc466ad890f422594b9396397702f44b9b7b9495c7d1af252f62ffb5a6c9"},"schema_version":"1.0"},"canonical_sha256":"fa3db26f3858b3a4223527dda78d6a5f97e162c7fe6e0f56f35dc642ab3585d4","source":{"kind":"arxiv","id":"1702.03106","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7I63E3ZYLCZ2IIRVE7O2PDLKL6","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T09:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"b69a08ed017f9340e2e47c6959a7fd83535a851ac43bfce6fd2d4b882f9a31db","abstract_canon_sha256":"2eaecc466ad890f422594b9396397702f44b9b7b9495c7d1af252f62ffb5a6c9"},"schema_version":"1.0"},"canonical_sha256":"fa3db26f3858b3a4223527dda78d6a5f97e162c7fe6e0f56f35dc642ab3585d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:57.506981Z","signature_b64":"T9+5862HGqpWpIjdD8TpVU2c5aFwC62FMwcIFjn+MqBN6d3UJBekjXnE2Lp9Iw8zdArVs0/ZfpmlsCUMBad/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3db26f3858b3a4223527dda78d6a5f97e162c7fe6e0f56f35dc642ab3585d4","last_reissued_at":"2026-05-18T00:49:57.506289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:57.506289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03106","source_version":2,"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-18T00:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7Z1arLvj0szDQTXBBOpwhh4xLqizkNlezoIjhONLAhDCA+DbMRTSNaU+0tVccGc3C6bOQBlq2K6JMtDhMTADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:50:47.460146Z"},"content_sha256":"c105fc8051a9a6d09f6dc3a20db6227fd56f06dd4a3dafe9d0ef478d2807d861","schema_version":"1.0","event_id":"sha256:c105fc8051a9a6d09f6dc3a20db6227fd56f06dd4a3dafe9d0ef478d2807d861"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7I63E3ZYLCZ2IIRVE7O2PDLKL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Las Vegas approximation algorithm for metric $1$-median selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ching-Lueh Chang","submitted_at":"2017-02-10T09:11:18Z","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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03106","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":""},"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-18T00:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpob6xrDBcDfakR6KJOJ8FN4ZwO4oG+UtCsrR0tEHuNg2/7DeurMxXMwapm1GQioi7vwSrQwqFZB5ZNTrJoRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:50:47.460503Z"},"content_sha256":"d2d824e84c1f34f9392aadc4e22fc47943ce1ab21a79f85074606a19a5d72afb","schema_version":"1.0","event_id":"sha256:d2d824e84c1f34f9392aadc4e22fc47943ce1ab21a79f85074606a19a5d72afb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6/bundle.json","state_url":"https://pith.science/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6/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-07-03T21:50:47Z","links":{"resolver":"https://pith.science/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6","bundle":"https://pith.science/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6/bundle.json","state":"https://pith.science/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I63E3ZYLCZ2IIRVE7O2PDLKL6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6YmUOZsI1l/GefFdAotkya2FE3HPBwTpd5m8m7Ll2z7qccLeZk9oldKejsv+4Q4dngGtWmFyPLZR/iSl6G0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:50:47.462406Z","bundle_sha256":"a8bdb8b9825cf4fb9bb084711cf1ff1f238d8d6f52cdd607fde4e434568afbd5"}}