{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:STZLAI57TAFX4QYT6RLLSXFIHL","short_pith_number":"pith:STZLAI57","canonical_record":{"source":{"id":"1412.1683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-04T14:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"03e54a6016e0d3c12c22269d0cc58b817b41820ed64d12dcb0180a609b0b42ab","abstract_canon_sha256":"e761e3f108ad61d2b7992c706011cd1d3f4251b491bda97e55dfe68f3e74842d"},"schema_version":"1.0"},"canonical_sha256":"94f2b023bf980b7e4313f456b95ca83aefd9c56ea7f9d23f1cd920a4a05ef0f4","source":{"kind":"arxiv","id":"1412.1683","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1683","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1683v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1683","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"STZLAI57TAFX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"STZLAI57TAFX4QYT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"STZLAI57","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:STZLAI57TAFX4QYT6RLLSXFIHL","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-04T14:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"03e54a6016e0d3c12c22269d0cc58b817b41820ed64d12dcb0180a609b0b42ab","abstract_canon_sha256":"e761e3f108ad61d2b7992c706011cd1d3f4251b491bda97e55dfe68f3e74842d"},"schema_version":"1.0"},"canonical_sha256":"94f2b023bf980b7e4313f456b95ca83aefd9c56ea7f9d23f1cd920a4a05ef0f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.663587Z","signature_b64":"jmKeQOsiPvdVU3bfmkmTIaEAxg7c34v7fEmNY/o3enois5WXwBKUgRegsbxx4jMSUMmN6rC1X2GW4Tih6SRmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94f2b023bf980b7e4313f456b95ca83aefd9c56ea7f9d23f1cd920a4a05ef0f4","last_reissued_at":"2026-05-18T00:55:58.662866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.662866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1683","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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBeBJyOnbmbP/bjuhHJLiM0HokUWrkr2jlF1QTaE9d7PdFpFqb22T0mndRKL2VRiS47H0+oFQkgLJixmq365Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:11:39.014365Z"},"content_sha256":"b18e573a11c0c4aeb6f539a19f04be460f8b742fd4d2528049fe260137624f97","schema_version":"1.0","event_id":"sha256:b18e573a11c0c4aeb6f539a19f04be460f8b742fd4d2528049fe260137624f97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:STZLAI57TAFX4QYT6RLLSXFIHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized embeddings with slack, and high-dimensional Approximate Nearest Neighbor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Evangelos Anagnostopoulos, Ioannis Psarros, Ioannis Z. Emiris","submitted_at":"2014-12-04T14:46:29Z","abstract_excerpt":"The approximate nearest neighbor problem ($\\epsilon$-ANN) in high dimensional Euclidean space has been mainly addressed by Locality Sensitive Hashing (LSH), which has polynomial dependence in the dimension, sublinear query time, but subquadratic space requirement. In this paper, we introduce a new definition of \"low-quality\" embeddings for metric spaces. It requires that, for some query point $q$, there exists an approximate nearest neighbor among the pre-images of the $k>1$ approximate nearest neighbors in the target space. Focusing on Euclidean spaces, we employ random projections in order t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1683","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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VOB5ePuJEWO80jbZLPwFER8JzZ78J9KiXE8u2hT6obOxBV6EttIhfrgEtII5mwfKLCmd6LFsAbQQxvK2JK3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:11:39.015047Z"},"content_sha256":"6d7c74bf98b5495c4e00f92800aba0fa18e0c9425b8be58b3f4ca0eb3a124678","schema_version":"1.0","event_id":"sha256:6d7c74bf98b5495c4e00f92800aba0fa18e0c9425b8be58b3f4ca0eb3a124678"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STZLAI57TAFX4QYT6RLLSXFIHL/bundle.json","state_url":"https://pith.science/pith/STZLAI57TAFX4QYT6RLLSXFIHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STZLAI57TAFX4QYT6RLLSXFIHL/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-25T20:11:39Z","links":{"resolver":"https://pith.science/pith/STZLAI57TAFX4QYT6RLLSXFIHL","bundle":"https://pith.science/pith/STZLAI57TAFX4QYT6RLLSXFIHL/bundle.json","state":"https://pith.science/pith/STZLAI57TAFX4QYT6RLLSXFIHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STZLAI57TAFX4QYT6RLLSXFIHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:STZLAI57TAFX4QYT6RLLSXFIHL","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":"e761e3f108ad61d2b7992c706011cd1d3f4251b491bda97e55dfe68f3e74842d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-04T14:46:29Z","title_canon_sha256":"03e54a6016e0d3c12c22269d0cc58b817b41820ed64d12dcb0180a609b0b42ab"},"schema_version":"1.0","source":{"id":"1412.1683","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1683","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1683v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1683","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"STZLAI57TAFX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"STZLAI57TAFX4QYT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"STZLAI57","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:6d7c74bf98b5495c4e00f92800aba0fa18e0c9425b8be58b3f4ca0eb3a124678","target":"graph","created_at":"2026-05-18T00:55:58Z","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 approximate nearest neighbor problem ($\\epsilon$-ANN) in high dimensional Euclidean space has been mainly addressed by Locality Sensitive Hashing (LSH), which has polynomial dependence in the dimension, sublinear query time, but subquadratic space requirement. In this paper, we introduce a new definition of \"low-quality\" embeddings for metric spaces. It requires that, for some query point $q$, there exists an approximate nearest neighbor among the pre-images of the $k>1$ approximate nearest neighbors in the target space. Focusing on Euclidean spaces, we employ random projections in order t","authors_text":"Evangelos Anagnostopoulos, Ioannis Psarros, Ioannis Z. Emiris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-04T14:46:29Z","title":"Randomized embeddings with slack, and high-dimensional Approximate Nearest Neighbor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1683","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:b18e573a11c0c4aeb6f539a19f04be460f8b742fd4d2528049fe260137624f97","target":"record","created_at":"2026-05-18T00:55:58Z","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":"e761e3f108ad61d2b7992c706011cd1d3f4251b491bda97e55dfe68f3e74842d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-04T14:46:29Z","title_canon_sha256":"03e54a6016e0d3c12c22269d0cc58b817b41820ed64d12dcb0180a609b0b42ab"},"schema_version":"1.0","source":{"id":"1412.1683","kind":"arxiv","version":2}},"canonical_sha256":"94f2b023bf980b7e4313f456b95ca83aefd9c56ea7f9d23f1cd920a4a05ef0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94f2b023bf980b7e4313f456b95ca83aefd9c56ea7f9d23f1cd920a4a05ef0f4","first_computed_at":"2026-05-18T00:55:58.662866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:58.662866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jmKeQOsiPvdVU3bfmkmTIaEAxg7c34v7fEmNY/o3enois5WXwBKUgRegsbxx4jMSUMmN6rC1X2GW4Tih6SRmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:58.663587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1683","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b18e573a11c0c4aeb6f539a19f04be460f8b742fd4d2528049fe260137624f97","sha256:6d7c74bf98b5495c4e00f92800aba0fa18e0c9425b8be58b3f4ca0eb3a124678"],"state_sha256":"2c365c42e782695a557a8081d7d34ddfdc8bbf0bfea08a1bb0912f26db564bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/M9drqB23DEPD0iEVrSCVlgbbRZ1Z7pZ9XHv6IlHvX2gY/yCGpFp8Hq1ufq3Wy1Wiwk6bW3lcmINf8B9iO2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:11:39.019058Z","bundle_sha256":"3565e2c4cd20940326c8c4ef1ce154976c1a046053e228a5027cab21a30388d9"}}