{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P5EDPO37CPTQ4BCMIRQ5BAQT7W","short_pith_number":"pith:P5EDPO37","canonical_record":{"source":{"id":"1608.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-10T22:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"8bb2281bba40b7441ff88981d35c0c5fbda493258691d74ee1a0ba7bfab50d3d","abstract_canon_sha256":"aff4b43f9491642f4695f38b8b563562c70fcba632a84629bd58d35de6d45626"},"schema_version":"1.0"},"canonical_sha256":"7f4837bb7f13e70e044c4461d08213fdaef2f3324b01c91e42e183d1ad40eb1d","source":{"kind":"arxiv","id":"1608.03308","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03308","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03308v1","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03308","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"P5EDPO37CPTQ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P5EDPO37CPTQ4BCM","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P5EDPO37","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P5EDPO37CPTQ4BCMIRQ5BAQT7W","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-10T22:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"8bb2281bba40b7441ff88981d35c0c5fbda493258691d74ee1a0ba7bfab50d3d","abstract_canon_sha256":"aff4b43f9491642f4695f38b8b563562c70fcba632a84629bd58d35de6d45626"},"schema_version":"1.0"},"canonical_sha256":"7f4837bb7f13e70e044c4461d08213fdaef2f3324b01c91e42e183d1ad40eb1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:29.227013Z","signature_b64":"iyX5GVHkM55hO/idWo0X/V5IoWmUWwZqIfCfzaNCJXGPC8YiP6bDf5vZQFpneom0DD8Glu59hJz5QJSkg9jOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4837bb7f13e70e044c4461d08213fdaef2f3324b01c91e42e183d1ad40eb1d","last_reissued_at":"2026-05-18T01:09:29.226486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:29.226486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03308","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-18T01:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFXI1W5hwyC9aQ81ZDGdJZfKGWYi2XYd0VEzXOdCMx78OJfU/9qXrUknbx/MGClUgub/CV9OiTppCSs7rZppDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:58:50.254139Z"},"content_sha256":"9daf2c5dd92a3ad3b27c19c39b74209c79b372ee58d309f34a62b3c498bd088f","schema_version":"1.0","event_id":"sha256:9daf2c5dd92a3ad3b27c19c39b74209c79b372ee58d309f34a62b3c498bd088f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P5EDPO37CPTQ4BCMIRQ5BAQT7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate search with quantized sparse representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Herv\\'e J\\'egou, Himalaya Jain, Joaquin Zepeda, Patrick P\\'erez, R\\'emi Gribonval","submitted_at":"2016-08-10T22:00:00Z","abstract_excerpt":"This paper tackles the task of storing a large collection of vectors, such as visual descriptors, and of searching in it. To this end, we propose to approximate database vectors by constrained sparse coding, where possible atom weights are restricted to belong to a finite subset. This formulation encompasses, as particular cases, previous state-of-the-art methods such as product or residual quantization. As opposed to traditional sparse coding methods, quantized sparse coding includes memory usage as a design constraint, thereby allowing us to index a large collection such as the BIGANN billio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03308","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-18T01:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2BhtiGzecnb0LyatzITZeIcg5ZHxW1gRZDH2rP+imhg3JsfSBVBz23N0biXawsNhgUiqKlhvZMw7kpJSJTBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:58:50.254511Z"},"content_sha256":"6d639010a7576a24d7b9a4bd7d6d7c884ea768a0a40ec30703b1362642a4f850","schema_version":"1.0","event_id":"sha256:6d639010a7576a24d7b9a4bd7d6d7c884ea768a0a40ec30703b1362642a4f850"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W/bundle.json","state_url":"https://pith.science/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W/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-02T22:58:50Z","links":{"resolver":"https://pith.science/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W","bundle":"https://pith.science/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W/bundle.json","state":"https://pith.science/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5EDPO37CPTQ4BCMIRQ5BAQT7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P5EDPO37CPTQ4BCMIRQ5BAQT7W","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":"aff4b43f9491642f4695f38b8b563562c70fcba632a84629bd58d35de6d45626","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-10T22:00:00Z","title_canon_sha256":"8bb2281bba40b7441ff88981d35c0c5fbda493258691d74ee1a0ba7bfab50d3d"},"schema_version":"1.0","source":{"id":"1608.03308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03308","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03308v1","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03308","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"P5EDPO37CPTQ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P5EDPO37CPTQ4BCM","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P5EDPO37","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:6d639010a7576a24d7b9a4bd7d6d7c884ea768a0a40ec30703b1362642a4f850","target":"graph","created_at":"2026-05-18T01:09:29Z","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 tackles the task of storing a large collection of vectors, such as visual descriptors, and of searching in it. To this end, we propose to approximate database vectors by constrained sparse coding, where possible atom weights are restricted to belong to a finite subset. This formulation encompasses, as particular cases, previous state-of-the-art methods such as product or residual quantization. As opposed to traditional sparse coding methods, quantized sparse coding includes memory usage as a design constraint, thereby allowing us to index a large collection such as the BIGANN billio","authors_text":"Herv\\'e J\\'egou, Himalaya Jain, Joaquin Zepeda, Patrick P\\'erez, R\\'emi Gribonval","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-10T22:00:00Z","title":"Approximate search with quantized sparse representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03308","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:9daf2c5dd92a3ad3b27c19c39b74209c79b372ee58d309f34a62b3c498bd088f","target":"record","created_at":"2026-05-18T01:09:29Z","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":"aff4b43f9491642f4695f38b8b563562c70fcba632a84629bd58d35de6d45626","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-10T22:00:00Z","title_canon_sha256":"8bb2281bba40b7441ff88981d35c0c5fbda493258691d74ee1a0ba7bfab50d3d"},"schema_version":"1.0","source":{"id":"1608.03308","kind":"arxiv","version":1}},"canonical_sha256":"7f4837bb7f13e70e044c4461d08213fdaef2f3324b01c91e42e183d1ad40eb1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f4837bb7f13e70e044c4461d08213fdaef2f3324b01c91e42e183d1ad40eb1d","first_computed_at":"2026-05-18T01:09:29.226486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:29.226486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iyX5GVHkM55hO/idWo0X/V5IoWmUWwZqIfCfzaNCJXGPC8YiP6bDf5vZQFpneom0DD8Glu59hJz5QJSkg9jOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:29.227013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9daf2c5dd92a3ad3b27c19c39b74209c79b372ee58d309f34a62b3c498bd088f","sha256:6d639010a7576a24d7b9a4bd7d6d7c884ea768a0a40ec30703b1362642a4f850"],"state_sha256":"695b02680dfe1fe33568d7eb31d99f0bec542f1284bccad7cd8125659994ed42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1kCytL8SdpEmsg/EfOAukNSezuFn9PKksK+0+wWzDPH90qGu8UOxXXyKeXzWXAymA0ICtQlqqobsYZXYYrzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:58:50.256478Z","bundle_sha256":"207fccb8ce47bed028a8e4da67037783e6826668d6f027fdb9d654b9904be790"}}