{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RJ7NF5IFTWDCJJLPZUZVVFQSTB","short_pith_number":"pith:RJ7NF5IF","schema_version":"1.0","canonical_sha256":"8a7ed2f5059d8624a56fcd335a9612986b3a2d20e98bf29c689f31c286be6e7d","source":{"kind":"arxiv","id":"1509.05662","version":1},"attestation_state":"computed","paper":{"title":"Metric $1$-median selection: Query complexity vs. approximation ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ching-Lueh Chang","submitted_at":"2015-09-18T15:23:32Z","abstract_excerpt":"Consider the problem of finding a point in a metric space $(\\{1,2,\\ldots,n\\},d)$ with the minimum average distance to other points. We show that this problem has no deterministic $o(n^{1+1/(h-1)})$-query $(2h-\\Omega(1))$-approximation algorithms for any constant $h\\in\\mathbb{Z}^+\\setminus\\{1\\}$."},"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":"1509.05662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-18T15:23:32Z","cross_cats_sorted":[],"title_canon_sha256":"916d36c0dcf3bb24f6b2eafb69effd08b8001b9a26225b3072cf7a3515d75a5f","abstract_canon_sha256":"a6ee53101f1e1d7038fcbbab0c531a7cb9472ca84ef4751cbc2c424e235da188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.660348Z","signature_b64":"O0PnHZdKHNFIuHeXUd0vW7O2z6S4hW4BvGktGzUGV0Z+hReG9b7H4w5hPwUmHJ0WGJ46Ikafaa53Jb+BbrC2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a7ed2f5059d8624a56fcd335a9612986b3a2d20e98bf29c689f31c286be6e7d","last_reissued_at":"2026-05-18T01:32:42.659943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.659943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric $1$-median selection: Query complexity vs. approximation ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ching-Lueh Chang","submitted_at":"2015-09-18T15:23:32Z","abstract_excerpt":"Consider the problem of finding a point in a metric space $(\\{1,2,\\ldots,n\\},d)$ with the minimum average distance to other points. We show that this problem has no deterministic $o(n^{1+1/(h-1)})$-query $(2h-\\Omega(1))$-approximation algorithms for any constant $h\\in\\mathbb{Z}^+\\setminus\\{1\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05662","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05662","created_at":"2026-05-18T01:32:42.660008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05662v1","created_at":"2026-05-18T01:32:42.660008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05662","created_at":"2026-05-18T01:32:42.660008+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJ7NF5IFTWDC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJ7NF5IFTWDCJJLP","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJ7NF5IF","created_at":"2026-05-18T12:29:39.896362+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/RJ7NF5IFTWDCJJLPZUZVVFQSTB","json":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB.json","graph_json":"https://pith.science/api/pith-number/RJ7NF5IFTWDCJJLPZUZVVFQSTB/graph.json","events_json":"https://pith.science/api/pith-number/RJ7NF5IFTWDCJJLPZUZVVFQSTB/events.json","paper":"https://pith.science/paper/RJ7NF5IF"},"agent_actions":{"view_html":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB","download_json":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB.json","view_paper":"https://pith.science/paper/RJ7NF5IF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05662&json=true","fetch_graph":"https://pith.science/api/pith-number/RJ7NF5IFTWDCJJLPZUZVVFQSTB/graph.json","fetch_events":"https://pith.science/api/pith-number/RJ7NF5IFTWDCJJLPZUZVVFQSTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB/action/storage_attestation","attest_author":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB/action/author_attestation","sign_citation":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB/action/citation_signature","submit_replication":"https://pith.science/pith/RJ7NF5IFTWDCJJLPZUZVVFQSTB/action/replication_record"}},"created_at":"2026-05-18T01:32:42.660008+00:00","updated_at":"2026-05-18T01:32:42.660008+00:00"}