{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B3BJRKHD7HKK7Y7ZI4P4RUODQD","short_pith_number":"pith:B3BJRKHD","canonical_record":{"source":{"id":"1404.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-21T11:38:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6a00438bd0f7b3569fa2f8112142abb6c50cd94d0dc250a4482354cc9e29e6c","abstract_canon_sha256":"c28aa602d9d4b73ca5c1d469b0853407dce8ac2d67d3ff5ac5390cb6e1cd4baa"},"schema_version":"1.0"},"canonical_sha256":"0ec298a8e3f9d4afe3f9471fc8d1c380c0e299ed5e44bab176d59655c894294f","source":{"kind":"arxiv","id":"1404.5173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5173","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5173v2","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5173","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"B3BJRKHD7HKK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B3BJRKHD7HKK7Y7Z","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B3BJRKHD","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B3BJRKHD7HKK7Y7ZI4P4RUODQD","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-21T11:38:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6a00438bd0f7b3569fa2f8112142abb6c50cd94d0dc250a4482354cc9e29e6c","abstract_canon_sha256":"c28aa602d9d4b73ca5c1d469b0853407dce8ac2d67d3ff5ac5390cb6e1cd4baa"},"schema_version":"1.0"},"canonical_sha256":"0ec298a8e3f9d4afe3f9471fc8d1c380c0e299ed5e44bab176d59655c894294f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:05.864549Z","signature_b64":"Ohii9GjKA4CUNL6R69WBzMlghWGb4zY9/ayAeucBkfc+fatQudm5LYr5lXy6Jh9BFAAU6M4apK9+PhijZJigAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ec298a8e3f9d4afe3f9471fc8d1c380c0e299ed5e44bab176d59655c894294f","last_reissued_at":"2026-05-18T02:52:05.863948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:05.863948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5173","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-18T02:52:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kiO+tb1aob8XIUEgJ1LG+tn+jQDj1vY1oselSasRHrz/fdW5JLj1Z5bWGaJj1qz+T7FHhEdx3V+C4IvknrzmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:02:12.273517Z"},"content_sha256":"f9baa0c64f3abc49133ae75da22075896b70f0915a1c282f86d595d5c2de0743","schema_version":"1.0","event_id":"sha256:f9baa0c64f3abc49133ae75da22075896b70f0915a1c282f86d595d5c2de0743"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B3BJRKHD7HKK7Y7ZI4P4RUODQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Ingber, Fabian Steiner, Steffen Dempfle, Tsachy Weissman","submitted_at":"2014-04-21T11:38:05Z","abstract_excerpt":"We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal compression rate and the error exponent - were found in a previous work, in this paper we focus on the nonasymptotic domain and on practical, implementable schemes. We first present a finite blocklength achievability bound based on shape-gain quantization: The gain (amplitude) of the vector is compressed via scalar quantization and the shape (the projection on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5173","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-18T02:52:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHk23RQ2kJGROXuaHyeVWdkYhu6Eco8Yhl8oMLma4TfW9fNPm3BJKOpQvLcafQGJFzElvIJ/wuu/sK8mMoPaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:02:12.273865Z"},"content_sha256":"edadc741109cdb0938ee125e83696297251647076104cba9bbfb85ee040809b6","schema_version":"1.0","event_id":"sha256:edadc741109cdb0938ee125e83696297251647076104cba9bbfb85ee040809b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD/bundle.json","state_url":"https://pith.science/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD/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-04T19:02:12Z","links":{"resolver":"https://pith.science/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD","bundle":"https://pith.science/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD/bundle.json","state":"https://pith.science/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3BJRKHD7HKK7Y7ZI4P4RUODQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B3BJRKHD7HKK7Y7ZI4P4RUODQD","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":"c28aa602d9d4b73ca5c1d469b0853407dce8ac2d67d3ff5ac5390cb6e1cd4baa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-21T11:38:05Z","title_canon_sha256":"e6a00438bd0f7b3569fa2f8112142abb6c50cd94d0dc250a4482354cc9e29e6c"},"schema_version":"1.0","source":{"id":"1404.5173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5173","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5173v2","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5173","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"B3BJRKHD7HKK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B3BJRKHD7HKK7Y7Z","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B3BJRKHD","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:edadc741109cdb0938ee125e83696297251647076104cba9bbfb85ee040809b6","target":"graph","created_at":"2026-05-18T02:52:05Z","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 study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal compression rate and the error exponent - were found in a previous work, in this paper we focus on the nonasymptotic domain and on practical, implementable schemes. We first present a finite blocklength achievability bound based on shape-gain quantization: The gain (amplitude) of the vector is compressed via scalar quantization and the shape (the projection on ","authors_text":"Amir Ingber, Fabian Steiner, Steffen Dempfle, Tsachy Weissman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-21T11:38:05Z","title":"Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5173","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:f9baa0c64f3abc49133ae75da22075896b70f0915a1c282f86d595d5c2de0743","target":"record","created_at":"2026-05-18T02:52:05Z","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":"c28aa602d9d4b73ca5c1d469b0853407dce8ac2d67d3ff5ac5390cb6e1cd4baa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-21T11:38:05Z","title_canon_sha256":"e6a00438bd0f7b3569fa2f8112142abb6c50cd94d0dc250a4482354cc9e29e6c"},"schema_version":"1.0","source":{"id":"1404.5173","kind":"arxiv","version":2}},"canonical_sha256":"0ec298a8e3f9d4afe3f9471fc8d1c380c0e299ed5e44bab176d59655c894294f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ec298a8e3f9d4afe3f9471fc8d1c380c0e299ed5e44bab176d59655c894294f","first_computed_at":"2026-05-18T02:52:05.863948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:05.863948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ohii9GjKA4CUNL6R69WBzMlghWGb4zY9/ayAeucBkfc+fatQudm5LYr5lXy6Jh9BFAAU6M4apK9+PhijZJigAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:05.864549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9baa0c64f3abc49133ae75da22075896b70f0915a1c282f86d595d5c2de0743","sha256:edadc741109cdb0938ee125e83696297251647076104cba9bbfb85ee040809b6"],"state_sha256":"b157a6997e571575f65e85aa4704ce4a8306a9f64af120b2d19add1166d63624"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3X+8m3UGtsiVQlleq3gixLODNiKseA3NuLz+7G8Ck4PAiHqzQaIR8TTfGrp2/z29E/GQwBoQr0ptCThXEVMECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:02:12.275818Z","bundle_sha256":"27e19a15d130061bd0c682edce7a0a3df4feef9d9da2092f60178e4f7159c3b4"}}