{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DA62CGORE3VRNSVYC6T4DGPA3X","short_pith_number":"pith:DA62CGOR","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"},"canonical_sha256":"183da119d126eb16cab817a7c199e0dddb99daf63ae15a6241cd93397749cb03","source":{"kind":"arxiv","id":"1703.10868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10868","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10868v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10868","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"DA62CGORE3VR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DA62CGORE3VRNSVY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DA62CGOR","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DA62CGORE3VRNSVYC6T4DGPA3X","target":"record","payload":{"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"},"canonical_sha256":"183da119d126eb16cab817a7c199e0dddb99daf63ae15a6241cd93397749cb03","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"},"source_kind":"arxiv","source_id":"1703.10868","source_version":1,"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:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThEqNosE/U/yQzaB0r7+z5gBp5gtTFZ/6JZVxpMpTMDzKbvtYEKLZD9AK5+eCh2jITzG6Tguit0BjiywXORtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:10:57.531297Z"},"content_sha256":"159c9afb723b8619721535eb109cd4780b88f1ea8a617b21f9909be4c67d79d5","schema_version":"1.0","event_id":"sha256:159c9afb723b8619721535eb109cd4780b88f1ea8a617b21f9909be4c67d79d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DA62CGORE3VRNSVYC6T4DGPA3X","target":"graph","payload":{"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"},"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:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAYGoQVSruKCuVHo+GJj0KYfoqp3FCADwqsp1guu6qbMV28s6yRvvXqNKCt+ccsNEo7ORLO7C7y/BqCCpNLnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:10:57.531992Z"},"content_sha256":"8100c0dbfd5faabc10f9f58ba70b70966ad7326191c61d2bd3ee2bf4ba35e8aa","schema_version":"1.0","event_id":"sha256:8100c0dbfd5faabc10f9f58ba70b70966ad7326191c61d2bd3ee2bf4ba35e8aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/bundle.json","state_url":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DA62CGORE3VRNSVYC6T4DGPA3X/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-05-29T15:10:57Z","links":{"resolver":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X","bundle":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/bundle.json","state":"https://pith.science/pith/DA62CGORE3VRNSVYC6T4DGPA3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DA62CGORE3VRNSVYC6T4DGPA3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DA62CGORE3VRNSVYC6T4DGPA3X","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":"3582a9712d12e72fdf8c8b8f1cb911191dbf0fb4b45e5838faf3d2e8cfbc878a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-03-31T11:54:29Z","title_canon_sha256":"9ab15f3e3a0bf7b3eba846a521040a271ffe83bb580c775d4f7034c2ae74f364"},"schema_version":"1.0","source":{"id":"1703.10868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10868","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10868v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10868","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"DA62CGORE3VR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DA62CGORE3VRNSVY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DA62CGOR","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:8100c0dbfd5faabc10f9f58ba70b70966ad7326191c61d2bd3ee2bf4ba35e8aa","target":"graph","created_at":"2026-05-18T00:47:32Z","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":"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","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-03-31T11:54:29Z","title":"Near-Optimal $\\varepsilon$-Kernel Construction and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10868","kind":"arxiv","version":1},"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:159c9afb723b8619721535eb109cd4780b88f1ea8a617b21f9909be4c67d79d5","target":"record","created_at":"2026-05-18T00:47:32Z","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":"3582a9712d12e72fdf8c8b8f1cb911191dbf0fb4b45e5838faf3d2e8cfbc878a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-03-31T11:54:29Z","title_canon_sha256":"9ab15f3e3a0bf7b3eba846a521040a271ffe83bb580c775d4f7034c2ae74f364"},"schema_version":"1.0","source":{"id":"1703.10868","kind":"arxiv","version":1}},"canonical_sha256":"183da119d126eb16cab817a7c199e0dddb99daf63ae15a6241cd93397749cb03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"183da119d126eb16cab817a7c199e0dddb99daf63ae15a6241cd93397749cb03","first_computed_at":"2026-05-18T00:47:32.460831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:32.460831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O2XB05isY/6GwL9fVuCCmcq1wxQL8CybOpF0OShXow/YLyeSKqnSNMUU+a2MlA9pCztK7r4qV36ZsTJG82t5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:32.461451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:159c9afb723b8619721535eb109cd4780b88f1ea8a617b21f9909be4c67d79d5","sha256:8100c0dbfd5faabc10f9f58ba70b70966ad7326191c61d2bd3ee2bf4ba35e8aa"],"state_sha256":"623b87143ea05604be39e6c1492c172ee366a54157b858f52b4186cdc28e692c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1in2LY8u6Z3IR67oPRIocq/w11t5jSV6DpYki9B5vRYFF3I+eqzyV4dSWkMwIMvleONUKTgFJMwVwpwdI8a8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:10:57.536169Z","bundle_sha256":"ca74f0d10e2193b323741f3eb976bc7dcd4adf93c3789f4a1a57f20f0dd4ed42"}}