{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q7KTLZK342L6JLOC2YQMKJKSZR","short_pith_number":"pith:Q7KTLZK3","canonical_record":{"source":{"id":"1609.01882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-07T08:45:19Z","cross_cats_sorted":["cs.DB","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a34665ca81ca2c3a99f69ba5c4b4166bf7b88bc474bdecf92627da99799eaae1","abstract_canon_sha256":"53859ca504896fcddc09847e1208ca591bc99fef2b0285faf40293dd13d7f09c"},"schema_version":"1.0"},"canonical_sha256":"87d535e55be697e4adc2d620c52552cc60fb39e898397b31e2e446c6065d9bd0","source":{"kind":"arxiv","id":"1609.01882","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01882","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01882v2","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01882","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q7KTLZK342L6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7KTLZK342L6JLOC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7KTLZK3","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q7KTLZK342L6JLOC2YQMKJKSZR","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-07T08:45:19Z","cross_cats_sorted":["cs.DB","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a34665ca81ca2c3a99f69ba5c4b4166bf7b88bc474bdecf92627da99799eaae1","abstract_canon_sha256":"53859ca504896fcddc09847e1208ca591bc99fef2b0285faf40293dd13d7f09c"},"schema_version":"1.0"},"canonical_sha256":"87d535e55be697e4adc2d620c52552cc60fb39e898397b31e2e446c6065d9bd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:07.009045Z","signature_b64":"Qaw6CUtdfnOaqzt6NvzcLoxYS25elK8kcOmkHc35+8hmpeyCbRX5dzYlKbU4JzOfZMBZlVkL+ViwFe1oJf7jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87d535e55be697e4adc2d620c52552cc60fb39e898397b31e2e446c6065d9bd0","last_reissued_at":"2026-05-18T00:14:07.008341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:07.008341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01882","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:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdQpwo84jLzfxi84Z0DUZ2DwWpfhjf/WREqSRSlky+oErTxiCS6y0rpvA66JvVPWMUf0PESN6vr3Ogw5A4dWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:44:51.609345Z"},"content_sha256":"d7f210a827ca76b789d013c7099849fde9cccd22a2fce44c310b266ff53b02bd","schema_version":"1.0","event_id":"sha256:d7f210a827ca76b789d013c7099849fde9cccd22a2fce44c310b266ff53b02bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q7KTLZK342L6JLOC2YQMKJKSZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polysemous codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CV","authors_text":"Florent Perronnin, Herv\\'e J\\'egou, Matthijs Douze","submitted_at":"2016-09-07T08:45:19Z","abstract_excerpt":"This paper considers the problem of approximate nearest neighbor search in the compressed domain. We introduce polysemous codes, which offer both the distance estimation quality of product quantization and the efficient comparison of binary codes with Hamming distance. Their design is inspired by algorithms introduced in the 90's to construct channel-optimized vector quantizers. At search time, this dual interpretation accelerates the search. Most of the indexed vectors are filtered out with Hamming distance, letting only a fraction of the vectors to be ranked with an asymmetric distance estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01882","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:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSBKmcZZkHIEJXtL1GOON1MgDX9dojIpaOE2i3eCwPQYvWMgMhumOxm9unPQGPAQb8bO3W+cHlqKg7E+p/C2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:44:51.610175Z"},"content_sha256":"931e04cfd83969dacf8fa013db5720b8a8293c85c774fd0fdfb129bf0620624d","schema_version":"1.0","event_id":"sha256:931e04cfd83969dacf8fa013db5720b8a8293c85c774fd0fdfb129bf0620624d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7KTLZK342L6JLOC2YQMKJKSZR/bundle.json","state_url":"https://pith.science/pith/Q7KTLZK342L6JLOC2YQMKJKSZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7KTLZK342L6JLOC2YQMKJKSZR/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-08-04T15:44:51Z","links":{"resolver":"https://pith.science/pith/Q7KTLZK342L6JLOC2YQMKJKSZR","bundle":"https://pith.science/pith/Q7KTLZK342L6JLOC2YQMKJKSZR/bundle.json","state":"https://pith.science/pith/Q7KTLZK342L6JLOC2YQMKJKSZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7KTLZK342L6JLOC2YQMKJKSZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q7KTLZK342L6JLOC2YQMKJKSZR","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":"53859ca504896fcddc09847e1208ca591bc99fef2b0285faf40293dd13d7f09c","cross_cats_sorted":["cs.DB","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-07T08:45:19Z","title_canon_sha256":"a34665ca81ca2c3a99f69ba5c4b4166bf7b88bc474bdecf92627da99799eaae1"},"schema_version":"1.0","source":{"id":"1609.01882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01882","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01882v2","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01882","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q7KTLZK342L6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7KTLZK342L6JLOC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7KTLZK3","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:931e04cfd83969dacf8fa013db5720b8a8293c85c774fd0fdfb129bf0620624d","target":"graph","created_at":"2026-05-18T00:14:07Z","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":"This paper considers the problem of approximate nearest neighbor search in the compressed domain. We introduce polysemous codes, which offer both the distance estimation quality of product quantization and the efficient comparison of binary codes with Hamming distance. Their design is inspired by algorithms introduced in the 90's to construct channel-optimized vector quantizers. At search time, this dual interpretation accelerates the search. Most of the indexed vectors are filtered out with Hamming distance, letting only a fraction of the vectors to be ranked with an asymmetric distance estim","authors_text":"Florent Perronnin, Herv\\'e J\\'egou, Matthijs Douze","cross_cats":["cs.DB","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-07T08:45:19Z","title":"Polysemous codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01882","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:d7f210a827ca76b789d013c7099849fde9cccd22a2fce44c310b266ff53b02bd","target":"record","created_at":"2026-05-18T00:14:07Z","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":"53859ca504896fcddc09847e1208ca591bc99fef2b0285faf40293dd13d7f09c","cross_cats_sorted":["cs.DB","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-07T08:45:19Z","title_canon_sha256":"a34665ca81ca2c3a99f69ba5c4b4166bf7b88bc474bdecf92627da99799eaae1"},"schema_version":"1.0","source":{"id":"1609.01882","kind":"arxiv","version":2}},"canonical_sha256":"87d535e55be697e4adc2d620c52552cc60fb39e898397b31e2e446c6065d9bd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87d535e55be697e4adc2d620c52552cc60fb39e898397b31e2e446c6065d9bd0","first_computed_at":"2026-05-18T00:14:07.008341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:07.008341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qaw6CUtdfnOaqzt6NvzcLoxYS25elK8kcOmkHc35+8hmpeyCbRX5dzYlKbU4JzOfZMBZlVkL+ViwFe1oJf7jCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:07.009045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7f210a827ca76b789d013c7099849fde9cccd22a2fce44c310b266ff53b02bd","sha256:931e04cfd83969dacf8fa013db5720b8a8293c85c774fd0fdfb129bf0620624d"],"state_sha256":"9d7bf6d3ca8bcbea1c4b3aa9e559e5197f6dc74099924c794c6ab60758d64fe4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKQpdQ7RfmkrpxVERekPjPZ/bGYMSIZl8X4SVWl0NbumXvrAvFxXGbjDs+9vq8uYzPznZN05PKSuE96Ec9MMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:44:51.615360Z","bundle_sha256":"7f53fa69aff9a1a1c40660ae06bc1bc80cac574a92c6689e4098d0c8c39714e0"}}