{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LNJEB4MQPS3BXFY35I7I3WSAWS","short_pith_number":"pith:LNJEB4MQ","canonical_record":{"source":{"id":"1607.04755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-16T15:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"e2eafa48aecce5a46fa7936b0aa7946f9050eff48aa88ff9bc5e4c01f934c456","abstract_canon_sha256":"b380ab15a9f03657648f689f0efd1210addd63e8dfa3b0d1bacc2fff7be96414"},"schema_version":"1.0"},"canonical_sha256":"5b5240f1907cb61b971bea3e8dda40b48ce4ec05fe3ab20ef8b380e4da216c52","source":{"kind":"arxiv","id":"1607.04755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04755","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04755v2","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04755","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"LNJEB4MQPS3B","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNJEB4MQPS3BXFY3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNJEB4MQ","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LNJEB4MQPS3BXFY35I7I3WSAWS","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-16T15:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"e2eafa48aecce5a46fa7936b0aa7946f9050eff48aa88ff9bc5e4c01f934c456","abstract_canon_sha256":"b380ab15a9f03657648f689f0efd1210addd63e8dfa3b0d1bacc2fff7be96414"},"schema_version":"1.0"},"canonical_sha256":"5b5240f1907cb61b971bea3e8dda40b48ce4ec05fe3ab20ef8b380e4da216c52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.894016Z","signature_b64":"do8hAh2dTSx9zXbwkjWJAmrfZ2LYNK/haI40RSPH//49BEtvi46tMhN2PK1bckY33QkygnMoKYrOCm95R48hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b5240f1907cb61b971bea3e8dda40b48ce4ec05fe3ab20ef8b380e4da216c52","last_reissued_at":"2026-05-18T00:44:57.893429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.893429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04755","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:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsp1TlRAiNoIhGZDzx31p1SJi4Lk6XdUY3F7Bhg2u/AyDmv9PTvDiIcsNplixtrPmvbsk8KvtGbg2DaFuS9tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:23:48.120919Z"},"content_sha256":"37341bb4d41b0b8207afb8d0fe964a189da89e886e0d6ef29bdd9a385148f7c1","schema_version":"1.0","event_id":"sha256:37341bb4d41b0b8207afb8d0fe964a189da89e886e0d6ef29bdd9a385148f7c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LNJEB4MQPS3BXFY35I7I3WSAWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional approximate $r$-nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Georgia Avarikioti, Ioannis Psarros, Ioannis Z. Emiris, Loukas Kavouras","submitted_at":"2016-07-16T15:53:07Z","abstract_excerpt":"The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean distance. For any fixed $\\epsilon>0$, the approximation factor is $1+\\epsilon$ and the complexity is polynomial in the dimension and subquadratic in the number of points. The algorithm succeeds with high probability. More specifically, the best previously known LSH-based construction of Eppstein et al.\\ \\cite{EHS15} is improved in terms of complexity by reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04755","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:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+BaBPPK0YSCkSk9rWcqdyRe47qdEP7RFHezOZFmPXvHAeHmjbDAk2AiTkM+VVwfr+6h1BF9JEB8d++vQNAmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:23:48.121443Z"},"content_sha256":"19ca5769c26ccb378bee032e515c063777007e8752d2158cc4f258f48431c746","schema_version":"1.0","event_id":"sha256:19ca5769c26ccb378bee032e515c063777007e8752d2158cc4f258f48431c746"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNJEB4MQPS3BXFY35I7I3WSAWS/bundle.json","state_url":"https://pith.science/pith/LNJEB4MQPS3BXFY35I7I3WSAWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNJEB4MQPS3BXFY35I7I3WSAWS/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-25T15:23:48Z","links":{"resolver":"https://pith.science/pith/LNJEB4MQPS3BXFY35I7I3WSAWS","bundle":"https://pith.science/pith/LNJEB4MQPS3BXFY35I7I3WSAWS/bundle.json","state":"https://pith.science/pith/LNJEB4MQPS3BXFY35I7I3WSAWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNJEB4MQPS3BXFY35I7I3WSAWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LNJEB4MQPS3BXFY35I7I3WSAWS","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":"b380ab15a9f03657648f689f0efd1210addd63e8dfa3b0d1bacc2fff7be96414","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-16T15:53:07Z","title_canon_sha256":"e2eafa48aecce5a46fa7936b0aa7946f9050eff48aa88ff9bc5e4c01f934c456"},"schema_version":"1.0","source":{"id":"1607.04755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04755","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04755v2","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04755","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"LNJEB4MQPS3B","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNJEB4MQPS3BXFY3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNJEB4MQ","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:19ca5769c26ccb378bee032e515c063777007e8752d2158cc4f258f48431c746","target":"graph","created_at":"2026-05-18T00:44: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":"The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean distance. For any fixed $\\epsilon>0$, the approximation factor is $1+\\epsilon$ and the complexity is polynomial in the dimension and subquadratic in the number of points. The algorithm succeeds with high probability. More specifically, the best previously known LSH-based construction of Eppstein et al.\\ \\cite{EHS15} is improved in terms of complexity by reduc","authors_text":"Georgia Avarikioti, Ioannis Psarros, Ioannis Z. Emiris, Loukas Kavouras","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-16T15:53:07Z","title":"High-dimensional approximate $r$-nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04755","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:37341bb4d41b0b8207afb8d0fe964a189da89e886e0d6ef29bdd9a385148f7c1","target":"record","created_at":"2026-05-18T00:44: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":"b380ab15a9f03657648f689f0efd1210addd63e8dfa3b0d1bacc2fff7be96414","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-16T15:53:07Z","title_canon_sha256":"e2eafa48aecce5a46fa7936b0aa7946f9050eff48aa88ff9bc5e4c01f934c456"},"schema_version":"1.0","source":{"id":"1607.04755","kind":"arxiv","version":2}},"canonical_sha256":"5b5240f1907cb61b971bea3e8dda40b48ce4ec05fe3ab20ef8b380e4da216c52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b5240f1907cb61b971bea3e8dda40b48ce4ec05fe3ab20ef8b380e4da216c52","first_computed_at":"2026-05-18T00:44:57.893429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:57.893429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"do8hAh2dTSx9zXbwkjWJAmrfZ2LYNK/haI40RSPH//49BEtvi46tMhN2PK1bckY33QkygnMoKYrOCm95R48hCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:57.894016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37341bb4d41b0b8207afb8d0fe964a189da89e886e0d6ef29bdd9a385148f7c1","sha256:19ca5769c26ccb378bee032e515c063777007e8752d2158cc4f258f48431c746"],"state_sha256":"6eee0a3a289f04890d1090f8b1dbb17409791ac316aca38dd791334c14eab74d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkELs4cuKZ6LJfm9NjPyjV6LBpHCpggeqL+1Ioa1dBDASPoda+NCpyoHvxfhYUchvuc4OY7ytxlXnED4fWTsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:23:48.124718Z","bundle_sha256":"f2c22672076b44387c0556981952094cf7050450994114d035e2f7b6bf687f7b"}}