{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A3W3WLYVZ4E4BAIPDLPUYGWP7D","short_pith_number":"pith:A3W3WLYV","schema_version":"1.0","canonical_sha256":"06edbb2f15cf09c0810f1adf4c1acff8f676c86c8f9b44942ae7256c06a506e6","source":{"kind":"arxiv","id":"1612.08654","version":2},"attestation_state":"computed","paper":{"title":"Metric 1-median selection with fewer queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ching-Lueh Chang","submitted_at":"2016-12-27T15:19:59Z","abstract_excerpt":"Let $h\\colon\\mathbb{Z}^+\\to\\mathbb{Z}^+\\setminus\\{1\\}$ be any function such that $h(n)$ and $\\lceil n^{1/h(n)}\\rceil$ are computable from $n$ in $O(h(n)\\cdot n^{1+1/h(n)})$ time. We show that given any $n$-point metric space $(M,d)$, the problem of finding $\\mathop{\\mathrm{argmin}}_{i\\in M}\\,\\sum_{j\\in M}\\,d(i,j)$ (breaking ties arbitrarily) has a deterministic, $O(h(n)\\cdot n^{1+1/h(n)})$-time, $O(n^{1+1/h(n)})$-query, $(2\\,h(n))$-approximation and nonadaptive algorithm. Our proofs modify those of Chang~\\cite{Cha15, Cha15CMCT} with the following improvements: (1) We improve Chang's~\\cite{Cha1"},"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":"1612.08654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-27T15:19:59Z","cross_cats_sorted":[],"title_canon_sha256":"16df6240998d56ea1ee6adc1e35d1bc8160db2465422a9cfbce3d4b1ca4ae7a7","abstract_canon_sha256":"84a64b0b6faf45221b45c951f6fa14c03ddf1cfdfbd1b2595a61b743deb413da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:36.751058Z","signature_b64":"EmElUNRCUyYGa5HYrlYHo3pNpeSkNl494hVFuhclqFT7q5isksARrEvbEqjXwlNfCONrp6BzIsjI3BFpf4k4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06edbb2f15cf09c0810f1adf4c1acff8f676c86c8f9b44942ae7256c06a506e6","last_reissued_at":"2026-05-18T00:09:36.750534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:36.750534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric 1-median selection with fewer queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ching-Lueh Chang","submitted_at":"2016-12-27T15:19:59Z","abstract_excerpt":"Let $h\\colon\\mathbb{Z}^+\\to\\mathbb{Z}^+\\setminus\\{1\\}$ be any function such that $h(n)$ and $\\lceil n^{1/h(n)}\\rceil$ are computable from $n$ in $O(h(n)\\cdot n^{1+1/h(n)})$ time. We show that given any $n$-point metric space $(M,d)$, the problem of finding $\\mathop{\\mathrm{argmin}}_{i\\in M}\\,\\sum_{j\\in M}\\,d(i,j)$ (breaking ties arbitrarily) has a deterministic, $O(h(n)\\cdot n^{1+1/h(n)})$-time, $O(n^{1+1/h(n)})$-query, $(2\\,h(n))$-approximation and nonadaptive algorithm. Our proofs modify those of Chang~\\cite{Cha15, Cha15CMCT} with the following improvements: (1) We improve Chang's~\\cite{Cha1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08654","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.08654","created_at":"2026-05-18T00:09:36.750619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08654v2","created_at":"2026-05-18T00:09:36.750619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08654","created_at":"2026-05-18T00:09:36.750619+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3W3WLYVZ4E4","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3W3WLYVZ4E4BAIP","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3W3WLYV","created_at":"2026-05-18T12:30:04.600751+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/A3W3WLYVZ4E4BAIPDLPUYGWP7D","json":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D.json","graph_json":"https://pith.science/api/pith-number/A3W3WLYVZ4E4BAIPDLPUYGWP7D/graph.json","events_json":"https://pith.science/api/pith-number/A3W3WLYVZ4E4BAIPDLPUYGWP7D/events.json","paper":"https://pith.science/paper/A3W3WLYV"},"agent_actions":{"view_html":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D","download_json":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D.json","view_paper":"https://pith.science/paper/A3W3WLYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08654&json=true","fetch_graph":"https://pith.science/api/pith-number/A3W3WLYVZ4E4BAIPDLPUYGWP7D/graph.json","fetch_events":"https://pith.science/api/pith-number/A3W3WLYVZ4E4BAIPDLPUYGWP7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D/action/storage_attestation","attest_author":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D/action/author_attestation","sign_citation":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D/action/citation_signature","submit_replication":"https://pith.science/pith/A3W3WLYVZ4E4BAIPDLPUYGWP7D/action/replication_record"}},"created_at":"2026-05-18T00:09:36.750619+00:00","updated_at":"2026-05-18T00:09:36.750619+00:00"}