{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JF5M2MQVX5WUUTRUPHTNI3MGRJ","short_pith_number":"pith:JF5M2MQV","canonical_record":{"source":{"id":"1507.01442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-06T13:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"ad9c21fc0805a29d6707e1aa09d3503886fb45a173785b470c159a3bfde63b6d","abstract_canon_sha256":"459e6b360c626a8c3ffac82a76a7a5d5464f0e92bd0706c133c76ce44ef0ba53"},"schema_version":"1.0"},"canonical_sha256":"497acd3215bf6d4a4e3479e6d46d868a7a4891487890031a73a238369c48df13","source":{"kind":"arxiv","id":"1507.01442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01442","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01442v1","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01442","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"JF5M2MQVX5WU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JF5M2MQVX5WUUTRU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JF5M2MQV","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JF5M2MQVX5WUUTRUPHTNI3MGRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-06T13:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"ad9c21fc0805a29d6707e1aa09d3503886fb45a173785b470c159a3bfde63b6d","abstract_canon_sha256":"459e6b360c626a8c3ffac82a76a7a5d5464f0e92bd0706c133c76ce44ef0ba53"},"schema_version":"1.0"},"canonical_sha256":"497acd3215bf6d4a4e3479e6d46d868a7a4891487890031a73a238369c48df13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:16.931114Z","signature_b64":"3Kj6YegL20YErAH5rima1/FRJRhuodO3PN7+vdO8G7y6bECftozzY7AboclnaaxNNqyBfJb1bf0QWFfgA7eLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497acd3215bf6d4a4e3479e6d46d868a7a4891487890031a73a238369c48df13","last_reissued_at":"2026-05-18T01:37:16.930665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:16.930665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01442","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:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjk2KpMjBCzvCNBPAB13IMk3FFoNqlM3RW+H5j3MHMRGai0aK5GJ2NKe/GO3HRrswcTZ2W52TsuIoNbYdHE7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:03:41.775669Z"},"content_sha256":"52772ecc954a19313eddb8cb0a676a0b064d8d5b35de4280ce2abb22b30f48ea","schema_version":"1.0","event_id":"sha256:52772ecc954a19313eddb8cb0a676a0b064d8d5b35de4280ce2abb22b30f48ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JF5M2MQVX5WUUTRUPHTNI3MGRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Better Encoding for Approximate Nearest Neighbor Search with Dictionary Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongtao Lu, Shicong Liu","submitted_at":"2015-07-06T13:25:35Z","abstract_excerpt":"We introduce a novel dictionary optimization method for high-dimensional vector quantization employed in approximate nearest neighbor (ANN) search. Vector quantization methods first seek a series of dictionaries, then approximate each vector by a sum of elements selected from these dictionaries. An optimal series of dictionaries should be mutually independent, and each dictionary should generate a balanced encoding for the target dataset. Existing methods did not explicitly consider this. To achieve these goals along with minimizing the quantization error (residue), we propose a novel dictiona"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01442","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:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQyc1fXAHCarV13B0/jT1sJNpyljQ63qK+6HJvxjsHoLkQjCvIoa5+nQ1FoVHNh0gG4BmDsDHR2xwVvCacnuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:03:41.776007Z"},"content_sha256":"423aff63cf632af3f6f4ad64b6782ef057ed118d0bf2c88131d6cbe151f89abf","schema_version":"1.0","event_id":"sha256:423aff63cf632af3f6f4ad64b6782ef057ed118d0bf2c88131d6cbe151f89abf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ/bundle.json","state_url":"https://pith.science/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ/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-26T20:03:41Z","links":{"resolver":"https://pith.science/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ","bundle":"https://pith.science/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ/bundle.json","state":"https://pith.science/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF5M2MQVX5WUUTRUPHTNI3MGRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JF5M2MQVX5WUUTRUPHTNI3MGRJ","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":"459e6b360c626a8c3ffac82a76a7a5d5464f0e92bd0706c133c76ce44ef0ba53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-06T13:25:35Z","title_canon_sha256":"ad9c21fc0805a29d6707e1aa09d3503886fb45a173785b470c159a3bfde63b6d"},"schema_version":"1.0","source":{"id":"1507.01442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01442","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01442v1","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01442","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"JF5M2MQVX5WU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JF5M2MQVX5WUUTRU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JF5M2MQV","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:423aff63cf632af3f6f4ad64b6782ef057ed118d0bf2c88131d6cbe151f89abf","target":"graph","created_at":"2026-05-18T01:37:16Z","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 novel dictionary optimization method for high-dimensional vector quantization employed in approximate nearest neighbor (ANN) search. Vector quantization methods first seek a series of dictionaries, then approximate each vector by a sum of elements selected from these dictionaries. An optimal series of dictionaries should be mutually independent, and each dictionary should generate a balanced encoding for the target dataset. Existing methods did not explicitly consider this. To achieve these goals along with minimizing the quantization error (residue), we propose a novel dictiona","authors_text":"Hongtao Lu, Shicong Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-06T13:25:35Z","title":"Learning Better Encoding for Approximate Nearest Neighbor Search with Dictionary Annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01442","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:52772ecc954a19313eddb8cb0a676a0b064d8d5b35de4280ce2abb22b30f48ea","target":"record","created_at":"2026-05-18T01:37:16Z","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":"459e6b360c626a8c3ffac82a76a7a5d5464f0e92bd0706c133c76ce44ef0ba53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-06T13:25:35Z","title_canon_sha256":"ad9c21fc0805a29d6707e1aa09d3503886fb45a173785b470c159a3bfde63b6d"},"schema_version":"1.0","source":{"id":"1507.01442","kind":"arxiv","version":1}},"canonical_sha256":"497acd3215bf6d4a4e3479e6d46d868a7a4891487890031a73a238369c48df13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"497acd3215bf6d4a4e3479e6d46d868a7a4891487890031a73a238369c48df13","first_computed_at":"2026-05-18T01:37:16.930665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:16.930665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Kj6YegL20YErAH5rima1/FRJRhuodO3PN7+vdO8G7y6bECftozzY7AboclnaaxNNqyBfJb1bf0QWFfgA7eLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:16.931114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52772ecc954a19313eddb8cb0a676a0b064d8d5b35de4280ce2abb22b30f48ea","sha256:423aff63cf632af3f6f4ad64b6782ef057ed118d0bf2c88131d6cbe151f89abf"],"state_sha256":"d78c19086f702a2c4a148d09e8fddd45d93bbe2dc8dd742f30d2f6217e8799e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+AEZr+sYUbWcQv6vu1mrY46Y80tOOL7xtwgzgTQ+RHi2tiotLvpe5alCvb6is7Var3OXBEGWZVGHyBbHXPdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:03:41.777863Z","bundle_sha256":"59b0c40215b492d0af8a5ab2439b340780686f1a476038ccfd4e1a900a0d8657"}}