{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XUEYWEWPJL435MRDQ6TOYTXTLG","short_pith_number":"pith:XUEYWEWP","canonical_record":{"source":{"id":"1811.10907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-27T10:52:26Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"53f739c522d6d0f185652ec23581abf4844fd7e1fdb0cd29d43acaea212045cd","abstract_canon_sha256":"cab051003b5a021f02b1bdac3afc548a8c47c7fc75584c86437d3d791de641f2"},"schema_version":"1.0"},"canonical_sha256":"bd098b12cf4af9beb22387a6ec4ef35999867330e5e71d74d004df5db9e37c67","source":{"kind":"arxiv","id":"1811.10907","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10907","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10907v2","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10907","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"XUEYWEWPJL43","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XUEYWEWPJL435MRD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XUEYWEWP","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XUEYWEWPJL435MRDQ6TOYTXTLG","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-27T10:52:26Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"53f739c522d6d0f185652ec23581abf4844fd7e1fdb0cd29d43acaea212045cd","abstract_canon_sha256":"cab051003b5a021f02b1bdac3afc548a8c47c7fc75584c86437d3d791de641f2"},"schema_version":"1.0"},"canonical_sha256":"bd098b12cf4af9beb22387a6ec4ef35999867330e5e71d74d004df5db9e37c67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:58.059775Z","signature_b64":"CnyJSnJNPEmrMmExuA/9N2qmpbs0zdtxOKUUHbcdsS3FLAFNBP8dvOoZakARRZ2h2iPhIYpc8804oZ4f11JgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd098b12cf4af9beb22387a6ec4ef35999867330e5e71d74d004df5db9e37c67","last_reissued_at":"2026-05-17T23:56:58.059053Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:58.059053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10907","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-17T23:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOwPw7g6H5lg+/Hoguy+/2R8D4iuWZAaRFXELARwH1+f1iRTNSmLoxutryff+1svsjZZ0d+dkZ0C27htKknzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:01.357952Z"},"content_sha256":"3a0f967c18f117c93b4554c4fa41d8c74bece74fdb6eb19d530dcf3483a50742","schema_version":"1.0","event_id":"sha256:3a0f967c18f117c93b4554c4fa41d8c74bece74fdb6eb19d530dcf3483a50742"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XUEYWEWPJL435MRDQ6TOYTXTLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CV","authors_text":"Fan Yang, Ryota Hinami, Shin'ichi Satoh, Steven Ly, Yusuke Matsui","submitted_at":"2018-11-27T10:52:26Z","abstract_excerpt":"Diffusion is commonly used as a ranking or re-ranking method in retrieval tasks to achieve higher retrieval performance, and has attracted lots of attention in recent years. A downside to diffusion is that it performs slowly in comparison to the naive k-NN search, which causes a non-trivial online computational cost on large datasets. To overcome this weakness, we propose a novel diffusion technique in this paper. In our work, instead of applying diffusion to the query, we pre-compute the diffusion results of each element in the database, making the online search a simple linear combination on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10907","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-17T23:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vMtGea45zPKfjLZuqaNpRAU6wC0qokMJ1iHUVYBtlRTCTs+zkeCbYehbZMM1XX0VcgZ0/B28CJD/mWFh0lYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:01.358302Z"},"content_sha256":"825ab561d443b7a31e248d82af5fe520eefcdca5cafa2750a732d13256f4bbf9","schema_version":"1.0","event_id":"sha256:825ab561d443b7a31e248d82af5fe520eefcdca5cafa2750a732d13256f4bbf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUEYWEWPJL435MRDQ6TOYTXTLG/bundle.json","state_url":"https://pith.science/pith/XUEYWEWPJL435MRDQ6TOYTXTLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUEYWEWPJL435MRDQ6TOYTXTLG/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-01T22:22:01Z","links":{"resolver":"https://pith.science/pith/XUEYWEWPJL435MRDQ6TOYTXTLG","bundle":"https://pith.science/pith/XUEYWEWPJL435MRDQ6TOYTXTLG/bundle.json","state":"https://pith.science/pith/XUEYWEWPJL435MRDQ6TOYTXTLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUEYWEWPJL435MRDQ6TOYTXTLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XUEYWEWPJL435MRDQ6TOYTXTLG","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":"cab051003b5a021f02b1bdac3afc548a8c47c7fc75584c86437d3d791de641f2","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-27T10:52:26Z","title_canon_sha256":"53f739c522d6d0f185652ec23581abf4844fd7e1fdb0cd29d43acaea212045cd"},"schema_version":"1.0","source":{"id":"1811.10907","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10907","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10907v2","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10907","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"XUEYWEWPJL43","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XUEYWEWPJL435MRD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XUEYWEWP","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:825ab561d443b7a31e248d82af5fe520eefcdca5cafa2750a732d13256f4bbf9","target":"graph","created_at":"2026-05-17T23:56:58Z","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":"Diffusion is commonly used as a ranking or re-ranking method in retrieval tasks to achieve higher retrieval performance, and has attracted lots of attention in recent years. A downside to diffusion is that it performs slowly in comparison to the naive k-NN search, which causes a non-trivial online computational cost on large datasets. To overcome this weakness, we propose a novel diffusion technique in this paper. In our work, instead of applying diffusion to the query, we pre-compute the diffusion results of each element in the database, making the online search a simple linear combination on","authors_text":"Fan Yang, Ryota Hinami, Shin'ichi Satoh, Steven Ly, Yusuke Matsui","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-27T10:52:26Z","title":"Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10907","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:3a0f967c18f117c93b4554c4fa41d8c74bece74fdb6eb19d530dcf3483a50742","target":"record","created_at":"2026-05-17T23:56:58Z","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":"cab051003b5a021f02b1bdac3afc548a8c47c7fc75584c86437d3d791de641f2","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-27T10:52:26Z","title_canon_sha256":"53f739c522d6d0f185652ec23581abf4844fd7e1fdb0cd29d43acaea212045cd"},"schema_version":"1.0","source":{"id":"1811.10907","kind":"arxiv","version":2}},"canonical_sha256":"bd098b12cf4af9beb22387a6ec4ef35999867330e5e71d74d004df5db9e37c67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd098b12cf4af9beb22387a6ec4ef35999867330e5e71d74d004df5db9e37c67","first_computed_at":"2026-05-17T23:56:58.059053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:58.059053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CnyJSnJNPEmrMmExuA/9N2qmpbs0zdtxOKUUHbcdsS3FLAFNBP8dvOoZakARRZ2h2iPhIYpc8804oZ4f11JgAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:58.059775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10907","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a0f967c18f117c93b4554c4fa41d8c74bece74fdb6eb19d530dcf3483a50742","sha256:825ab561d443b7a31e248d82af5fe520eefcdca5cafa2750a732d13256f4bbf9"],"state_sha256":"542554380deb016c378c10e818822ac2de5204b7dbd1b6f09e8b57c867fb526e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ib4DwOATk5XvLB5EVwSknqxRGdlwAHXs6CtAmA01WQLERpaLkpnC4FNPitLNN9TwL6J/eSroTjq60JbQS0dpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:01.360283Z","bundle_sha256":"2fa18f73ea02f984da918243a3412ba381939787567f1d56d91f30a2b584d11b"}}