{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CMKQ2ATJXGLREJVMTMYR7CIDXX","short_pith_number":"pith:CMKQ2ATJ","canonical_record":{"source":{"id":"1711.01520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T02:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"c24faa6ee99a073335d8db8d56dcbf623a65907f0cd60e484b58f1ebe58983d7","abstract_canon_sha256":"04cd20fa7453856193befddf9a557dd2e335696c7f4fb9a489895d5eabb0e174"},"schema_version":"1.0"},"canonical_sha256":"13150d0269b9971226ac9b311f8903bdf3d4ee221df711ab7de848a87881ee21","source":{"kind":"arxiv","id":"1711.01520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01520","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01520v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01520","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"CMKQ2ATJXGLR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMKQ2ATJXGLREJVM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMKQ2ATJ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CMKQ2ATJXGLREJVMTMYR7CIDXX","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T02:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"c24faa6ee99a073335d8db8d56dcbf623a65907f0cd60e484b58f1ebe58983d7","abstract_canon_sha256":"04cd20fa7453856193befddf9a557dd2e335696c7f4fb9a489895d5eabb0e174"},"schema_version":"1.0"},"canonical_sha256":"13150d0269b9971226ac9b311f8903bdf3d4ee221df711ab7de848a87881ee21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.566064Z","signature_b64":"fikHN2/okWfPag7xJ6kRCD073mYIF6AoTV/6N3sAz0AsV+g4W4arkMLbwPXz2cyfCnDhY5nuLw/k0yh+UOs8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13150d0269b9971226ac9b311f8903bdf3d4ee221df711ab7de848a87881ee21","last_reissued_at":"2026-05-18T00:31:17.565496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.565496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01520","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:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5OkX7gNdFEBbHgW2S3HDdENsiizWPp1lDhTkIHnl4JKBeRq/y/U2weQAfkmLQwMMU+QFXwgJS43WtpS0lxvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:50:14.407797Z"},"content_sha256":"e8ee6729549ebeaab2ab0f03e6f0169860aaf14edb62afc1ab299e29988df0d8","schema_version":"1.0","event_id":"sha256:e8ee6729549ebeaab2ab0f03e6f0169860aaf14edb62afc1ab299e29988df0d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CMKQ2ATJXGLREJVMTMYR7CIDXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Data-Dependent Metric Compression with Provable Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ilya Razenshteyn, Piotr Indyk, Tal Wagner","submitted_at":"2017-11-05T02:33:17Z","abstract_excerpt":"We introduce a new distance-preserving compact representation of multi-dimensional point-sets. Given $n$ points in a $d$-dimensional space where each coordinate is represented using $B$ bits (i.e., $dB$ bits per point), it produces a representation of size $O( d \\log(d B/\\epsilon) + \\log n)$ bits per point from which one can approximate the distances up to a factor of $1 \\pm \\epsilon$. Our algorithm almost matches the recent bound of~\\cite{indyk2017near} while being much simpler. We compare our algorithm to Product Quantization (PQ)~\\cite{jegou2011product}, a state of the art heuristic metric "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01520","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:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEmXPb3W/FHYBZqa1t422NPYXnnElfhhCjw55E7oyJQG7pLeDvZaxmn9qGOlvAOhDfC9fTkfsVir/ZAwl0bFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:50:14.408130Z"},"content_sha256":"f4f8a182587c5f6bf4e6bfe8d840e8e38e31adc3f765e5c3ed51c04478b05003","schema_version":"1.0","event_id":"sha256:f4f8a182587c5f6bf4e6bfe8d840e8e38e31adc3f765e5c3ed51c04478b05003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/bundle.json","state_url":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/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-06-03T02:50:14Z","links":{"resolver":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX","bundle":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/bundle.json","state":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CMKQ2ATJXGLREJVMTMYR7CIDXX","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":"04cd20fa7453856193befddf9a557dd2e335696c7f4fb9a489895d5eabb0e174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T02:33:17Z","title_canon_sha256":"c24faa6ee99a073335d8db8d56dcbf623a65907f0cd60e484b58f1ebe58983d7"},"schema_version":"1.0","source":{"id":"1711.01520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01520","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01520v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01520","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"CMKQ2ATJXGLR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMKQ2ATJXGLREJVM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMKQ2ATJ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f4f8a182587c5f6bf4e6bfe8d840e8e38e31adc3f765e5c3ed51c04478b05003","target":"graph","created_at":"2026-05-18T00:31:17Z","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":"We introduce a new distance-preserving compact representation of multi-dimensional point-sets. Given $n$ points in a $d$-dimensional space where each coordinate is represented using $B$ bits (i.e., $dB$ bits per point), it produces a representation of size $O( d \\log(d B/\\epsilon) + \\log n)$ bits per point from which one can approximate the distances up to a factor of $1 \\pm \\epsilon$. Our algorithm almost matches the recent bound of~\\cite{indyk2017near} while being much simpler. We compare our algorithm to Product Quantization (PQ)~\\cite{jegou2011product}, a state of the art heuristic metric ","authors_text":"Ilya Razenshteyn, Piotr Indyk, Tal Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T02:33:17Z","title":"Practical Data-Dependent Metric Compression with Provable Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01520","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:e8ee6729549ebeaab2ab0f03e6f0169860aaf14edb62afc1ab299e29988df0d8","target":"record","created_at":"2026-05-18T00:31:17Z","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":"04cd20fa7453856193befddf9a557dd2e335696c7f4fb9a489895d5eabb0e174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T02:33:17Z","title_canon_sha256":"c24faa6ee99a073335d8db8d56dcbf623a65907f0cd60e484b58f1ebe58983d7"},"schema_version":"1.0","source":{"id":"1711.01520","kind":"arxiv","version":1}},"canonical_sha256":"13150d0269b9971226ac9b311f8903bdf3d4ee221df711ab7de848a87881ee21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13150d0269b9971226ac9b311f8903bdf3d4ee221df711ab7de848a87881ee21","first_computed_at":"2026-05-18T00:31:17.565496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:17.565496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fikHN2/okWfPag7xJ6kRCD073mYIF6AoTV/6N3sAz0AsV+g4W4arkMLbwPXz2cyfCnDhY5nuLw/k0yh+UOs8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:17.566064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8ee6729549ebeaab2ab0f03e6f0169860aaf14edb62afc1ab299e29988df0d8","sha256:f4f8a182587c5f6bf4e6bfe8d840e8e38e31adc3f765e5c3ed51c04478b05003"],"state_sha256":"672bcb100eecaae7d38032f31e62026292ee8cdf1cba9ba8672fffffe9a3afa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3fb/8UuwWgT6W1d2y+Cik6B3nUZhkNAzjwp1CJZY3fj9WZGerGFPYV47mOXhHuVPGQSz4Z6p1eFuff1ZGInAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:50:14.410062Z","bundle_sha256":"c63cc626e769df1cd9c93588a645091285ade3b06795b463524b1b09a88974a2"}}