{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DA62CGORE3VRNSVYC6T4DGPA3X","short_pith_number":"pith:DA62CGOR","schema_version":"1.0","canonical_sha256":"183da119d126eb16cab817a7c199e0dddb99daf63ae15a6241cd93397749cb03","source":{"kind":"arxiv","id":"1703.10868","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal $\\varepsilon$-Kernel Construction and Related Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","submitted_at":"2017-03-31T11:54:29Z","abstract_excerpt":"The computation of (i) $\\varepsilon$-kernels, (ii) approximate diameter, and (iii) approximate bichromatic closest pair are fundamental problems in geometric approximation. In this paper, we describe new algorithms that offer significant improvements to their running times. In each case the input is a set of $n$ points in $R^d$ for a constant dimension $d \\geq 3$ and an approximation parameter $\\varepsilon > 0$. We reduce the respective running times (i) from $O((n + 1/\\varepsilon^{d-2})\\log(1/\\varepsilon))$ to $O(n \\log(1/\\varepsilon) + 1/\\varepsilon^{(d-1)/2+\\alpha})$, (ii) from $O((n + 1/\\v"},"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":"1703.10868","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-03-31T11:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"9ab15f3e3a0bf7b3eba846a521040a271ffe83bb580c775d4f7034c2ae74f364","abstract_canon_sha256":"3582a9712d12e72fdf8c8b8f1cb911191dbf0fb4b45e5838faf3d2e8cfbc878a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:32.461451Z","signature_b64":"O2XB05isY/6GwL9fVuCCmcq1wxQL8CybOpF0OShXow/YLyeSKqnSNMUU+a2MlA9pCztK7r4qV36ZsTJG82t5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183da119d126eb16cab817a7c199e0dddb99daf63ae15a6241cd93397749cb03","last_reissued_at":"2026-05-18T00:47:32.460831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:32.460831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal $\\varepsilon$-Kernel Construction and Related Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","submitted_at":"2017-03-31T11:54:29Z","abstract_excerpt":"The computation of (i) $\\varepsilon$-kernels, (ii) approximate diameter, and (iii) approximate bichromatic closest pair are fundamental problems in geometric approximation. In this paper, we describe new algorithms that offer significant improvements to their running times. In each case the input is a set of $n$ points in $R^d$ for a constant dimension $d \\geq 3$ and an approximation parameter $\\varepsilon > 0$. We reduce the respective running times (i) from $O((n + 1/\\varepsilon^{d-2})\\log(1/\\varepsilon))$ to $O(n \\log(1/\\varepsilon) + 1/\\varepsilon^{(d-1)/2+\\alpha})$, (ii) from $O((n + 1/\\v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10868","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":"1703.10868","created_at":"2026-05-18T00:47:32.460926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10868v1","created_at":"2026-05-18T00:47:32.460926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10868","created_at":"2026-05-18T00:47:32.460926+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA62CGORE3VR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA62CGORE3VRNSVY","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA62CGOR","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.18929","citing_title":"On the Duality of Coverings in Hilbert Geometry","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X","json":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X.json","graph_json":"https://pith.science/api/pith-number/DA62CGORE3VRNSVYC6T4DGPA3X/graph.json","events_json":"https://pith.science/api/pith-number/DA62CGORE3VRNSVYC6T4DGPA3X/events.json","paper":"https://pith.science/paper/DA62CGOR"},"agent_actions":{"view_html":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X","download_json":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X.json","view_paper":"https://pith.science/paper/DA62CGOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10868&json=true","fetch_graph":"https://pith.science/api/pith-number/DA62CGORE3VRNSVYC6T4DGPA3X/graph.json","fetch_events":"https://pith.science/api/pith-number/DA62CGORE3VRNSVYC6T4DGPA3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/action/storage_attestation","attest_author":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/action/author_attestation","sign_citation":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/action/citation_signature","submit_replication":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/action/replication_record"}},"created_at":"2026-05-18T00:47:32.460926+00:00","updated_at":"2026-05-18T00:47:32.460926+00:00"}