{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:35RP37FKDL5AASV4P5IRZGGCC7","short_pith_number":"pith:35RP37FK","canonical_record":{"source":{"id":"1603.04614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-15T09:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"f03ebf11bbff0835dc7e3473462354b23a6753a45d119f5b9033c78affe10b6e","abstract_canon_sha256":"d7f5f15192efdb84e5081b7154cc832ade229b8909c8a0f505817d3ff73d522e"},"schema_version":"1.0"},"canonical_sha256":"df62fdfcaa1afa004abc7f511c98c217f4a43f9778ad2db0d4b7964bf15ad86d","source":{"kind":"arxiv","id":"1603.04614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04614","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04614v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04614","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"35RP37FKDL5A","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35RP37FKDL5AASV4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35RP37FK","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:35RP37FKDL5AASV4P5IRZGGCC7","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-15T09:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"f03ebf11bbff0835dc7e3473462354b23a6753a45d119f5b9033c78affe10b6e","abstract_canon_sha256":"d7f5f15192efdb84e5081b7154cc832ade229b8909c8a0f505817d3ff73d522e"},"schema_version":"1.0"},"canonical_sha256":"df62fdfcaa1afa004abc7f511c98c217f4a43f9778ad2db0d4b7964bf15ad86d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.365088Z","signature_b64":"1CEOP5I7S9mI60771/DB+gruPVhur1PQAzoAnHHNpjRW4rsgJWyLz7oSBjX18UkT9/saELRnEDYLm09MdwF+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df62fdfcaa1afa004abc7f511c98c217f4a43f9778ad2db0d4b7964bf15ad86d","last_reissued_at":"2026-05-18T01:19:04.364461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.364461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04614","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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LulYWSEnYS2XwMvP9vU2aEphYxaWZHGEu9B8Jyv9KI3K+ehDag1SH426MxEDWGFGXPNoswE5Y5eJCSGrkPC8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:36:49.468550Z"},"content_sha256":"41b9aa588ac2a37beb42467a0f22bfd24ad21254d552da22219174460a17f7e3","schema_version":"1.0","event_id":"sha256:41b9aa588ac2a37beb42467a0f22bfd24ad21254d552da22219174460a17f7e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:35RP37FKDL5AASV4P5IRZGGCC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Image Retrieval by Sparse Product Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chun Chen, Jianke Zhu, Qingqun Ning, Steven C.H. Hoi, Zhiyuan Zhong","submitted_at":"2016-03-15T09:53:32Z","abstract_excerpt":"Fast Approximate Nearest Neighbor (ANN) search technique for high-dimensional feature indexing and retrieval is the crux of large-scale image retrieval. A recent promising technique is Product Quantization, which attempts to index high-dimensional image features by decomposing the feature space into a Cartesian product of low dimensional subspaces and quantizing each of them separately. Despite the promising results reported, their quantization approach follows the typical hard assignment of traditional quantization methods, which may result in large quantization errors and thus inferior searc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04614","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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGuoQCEhfbNn7iOy5WXr5EYhShmQPx/K9sL1t2AdhDneF9rLl8J2z2SasrOrZ38F6v/zsjdz++pgmnB6ssQzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:36:49.468897Z"},"content_sha256":"2552500b8ad865f996effa07524527812410f618a8bed22db6a87bf9cca12ef5","schema_version":"1.0","event_id":"sha256:2552500b8ad865f996effa07524527812410f618a8bed22db6a87bf9cca12ef5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35RP37FKDL5AASV4P5IRZGGCC7/bundle.json","state_url":"https://pith.science/pith/35RP37FKDL5AASV4P5IRZGGCC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35RP37FKDL5AASV4P5IRZGGCC7/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-03T03:36:49Z","links":{"resolver":"https://pith.science/pith/35RP37FKDL5AASV4P5IRZGGCC7","bundle":"https://pith.science/pith/35RP37FKDL5AASV4P5IRZGGCC7/bundle.json","state":"https://pith.science/pith/35RP37FKDL5AASV4P5IRZGGCC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35RP37FKDL5AASV4P5IRZGGCC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:35RP37FKDL5AASV4P5IRZGGCC7","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":"d7f5f15192efdb84e5081b7154cc832ade229b8909c8a0f505817d3ff73d522e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-15T09:53:32Z","title_canon_sha256":"f03ebf11bbff0835dc7e3473462354b23a6753a45d119f5b9033c78affe10b6e"},"schema_version":"1.0","source":{"id":"1603.04614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04614","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04614v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04614","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"35RP37FKDL5A","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35RP37FKDL5AASV4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35RP37FK","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:2552500b8ad865f996effa07524527812410f618a8bed22db6a87bf9cca12ef5","target":"graph","created_at":"2026-05-18T01:19:04Z","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":"Fast Approximate Nearest Neighbor (ANN) search technique for high-dimensional feature indexing and retrieval is the crux of large-scale image retrieval. A recent promising technique is Product Quantization, which attempts to index high-dimensional image features by decomposing the feature space into a Cartesian product of low dimensional subspaces and quantizing each of them separately. Despite the promising results reported, their quantization approach follows the typical hard assignment of traditional quantization methods, which may result in large quantization errors and thus inferior searc","authors_text":"Chun Chen, Jianke Zhu, Qingqun Ning, Steven C.H. Hoi, Zhiyuan Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-15T09:53:32Z","title":"Scalable Image Retrieval by Sparse Product Quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04614","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:41b9aa588ac2a37beb42467a0f22bfd24ad21254d552da22219174460a17f7e3","target":"record","created_at":"2026-05-18T01:19:04Z","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":"d7f5f15192efdb84e5081b7154cc832ade229b8909c8a0f505817d3ff73d522e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-15T09:53:32Z","title_canon_sha256":"f03ebf11bbff0835dc7e3473462354b23a6753a45d119f5b9033c78affe10b6e"},"schema_version":"1.0","source":{"id":"1603.04614","kind":"arxiv","version":1}},"canonical_sha256":"df62fdfcaa1afa004abc7f511c98c217f4a43f9778ad2db0d4b7964bf15ad86d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df62fdfcaa1afa004abc7f511c98c217f4a43f9778ad2db0d4b7964bf15ad86d","first_computed_at":"2026-05-18T01:19:04.364461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.364461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1CEOP5I7S9mI60771/DB+gruPVhur1PQAzoAnHHNpjRW4rsgJWyLz7oSBjX18UkT9/saELRnEDYLm09MdwF+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.365088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41b9aa588ac2a37beb42467a0f22bfd24ad21254d552da22219174460a17f7e3","sha256:2552500b8ad865f996effa07524527812410f618a8bed22db6a87bf9cca12ef5"],"state_sha256":"7cbae66dc1a1b4328f1c292da2bf2fa8ba2e9b52ff8500a0da38cf950685a121"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ohgSeqNj7W903EmDhSDR6NuVLvkkOATZBrJuoIs9viFP0ds3m6/cLTwwfBHT+cjmoEfAUXwOLA7iyqaTyWsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:36:49.470838Z","bundle_sha256":"5e199446bb98462c0d2c0e66df0910a2e941ab5ed39064a5729ad3b41ba32994"}}