{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CMKQ2ATJXGLREJVMTMYR7CIDXX","short_pith_number":"pith:CMKQ2ATJ","schema_version":"1.0","canonical_sha256":"13150d0269b9971226ac9b311f8903bdf3d4ee221df711ab7de848a87881ee21","source":{"kind":"arxiv","id":"1711.01520","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01520","created_at":"2026-05-18T00:31:17.565587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01520v1","created_at":"2026-05-18T00:31:17.565587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01520","created_at":"2026-05-18T00:31:17.565587+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMKQ2ATJXGLR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMKQ2ATJXGLREJVM","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMKQ2ATJ","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX","json":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX.json","graph_json":"https://pith.science/api/pith-number/CMKQ2ATJXGLREJVMTMYR7CIDXX/graph.json","events_json":"https://pith.science/api/pith-number/CMKQ2ATJXGLREJVMTMYR7CIDXX/events.json","paper":"https://pith.science/paper/CMKQ2ATJ"},"agent_actions":{"view_html":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX","download_json":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX.json","view_paper":"https://pith.science/paper/CMKQ2ATJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01520&json=true","fetch_graph":"https://pith.science/api/pith-number/CMKQ2ATJXGLREJVMTMYR7CIDXX/graph.json","fetch_events":"https://pith.science/api/pith-number/CMKQ2ATJXGLREJVMTMYR7CIDXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/action/storage_attestation","attest_author":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/action/author_attestation","sign_citation":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/action/citation_signature","submit_replication":"https://pith.science/pith/CMKQ2ATJXGLREJVMTMYR7CIDXX/action/replication_record"}},"created_at":"2026-05-18T00:31:17.565587+00:00","updated_at":"2026-05-18T00:31:17.565587+00:00"}