{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JVKXCE7RMH2VMHGNYCWGDXDZK7","short_pith_number":"pith:JVKXCE7R","canonical_record":{"source":{"id":"2412.13875","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-18T14:16:40Z","cross_cats_sorted":[],"title_canon_sha256":"23d6f9a1748d4c3864051dc84a893577416751c5dab8cb584ee928e18fa5d9de","abstract_canon_sha256":"a1814f677a6a05b44d73b47e37cba5b7ba508a873cc4f8c20e110cf8d42a63ea"},"schema_version":"1.0"},"canonical_sha256":"4d557113f161f5561ccdc0ac61dc7957fd0a04e6114152aeb34571565dcd489d","source":{"kind":"arxiv","id":"2412.13875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13875","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13875v2","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13875","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"JVKXCE7RMH2V","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JVKXCE7RMH2VMHGN","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JVKXCE7R","created_at":"2026-07-05T11:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JVKXCE7RMH2VMHGNYCWGDXDZK7","target":"record","payload":{"canonical_record":{"source":{"id":"2412.13875","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-18T14:16:40Z","cross_cats_sorted":[],"title_canon_sha256":"23d6f9a1748d4c3864051dc84a893577416751c5dab8cb584ee928e18fa5d9de","abstract_canon_sha256":"a1814f677a6a05b44d73b47e37cba5b7ba508a873cc4f8c20e110cf8d42a63ea"},"schema_version":"1.0"},"canonical_sha256":"4d557113f161f5561ccdc0ac61dc7957fd0a04e6114152aeb34571565dcd489d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:18.536410Z","signature_b64":"uveSBBSXSihNy7VDCquyW+1m91RrQFy5rQOaVAOGXrALkLEkChH4eiEJG5ZjZI/LF0nPwM9UY6LyjkTa/t9mCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d557113f161f5561ccdc0ac61dc7957fd0a04e6114152aeb34571565dcd489d","last_reissued_at":"2026-07-05T11:33:18.535942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:18.535942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.13875","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-07-05T11:33:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5K407pQi4qHP6JPDyeE4L1gfXqEQt3vMCk6r0vGZDeAiL3hiS2tTUNTLt5D6Az8MA5XpMNFXf3NaD20Oxls9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:10:03.175791Z"},"content_sha256":"67f3d21cf1f5f0554258cc50ac600b3dc1a32932cdf3f4e3e6b2b28d0ecf3ce5","schema_version":"1.0","event_id":"sha256:67f3d21cf1f5f0554258cc50ac600b3dc1a32932cdf3f4e3e6b2b28d0ecf3ce5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JVKXCE7RMH2VMHGNYCWGDXDZK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Visual Re-ranking through Denoising Nearest Neighbor Graph via Continuous CRF","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jaeyoon Kim, Sung-Eui Yoon, Taeyoung Kim, Yoonki Cho","submitted_at":"2024-12-18T14:16:40Z","abstract_excerpt":"Nearest neighbor (NN) graph based visual re-ranking has emerged as a powerful approach for improving retrieval accuracy, offering the advantages of effectively exploring high-dimensional manifolds without requiring additional fine-tuning. However, the effectiveness of NN graph-based re-ranking is fundamentally constrained by the quality of its edge connectivity, as incorrect connections between dissimilar (negative) images frequently occur. This is known as a noisy edge problem, which hinders the re-ranking performance of existing techniques and limits their potential. To remedy this issue, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13875","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.13875/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:33:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tb9gWj69sVASuBoicCsPRRx6fwH+dcGi9eM7ATS59rGjcus//DqJqGhsWnoO9OFnWF4SRln/KEoTzT9qHzyvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:10:03.176498Z"},"content_sha256":"5a18e81b5e17b657df5ec7725e7a2edd14b2a80d021ea43700af72fa0af4cee7","schema_version":"1.0","event_id":"sha256:5a18e81b5e17b657df5ec7725e7a2edd14b2a80d021ea43700af72fa0af4cee7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7/bundle.json","state_url":"https://pith.science/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7/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-15T02:10:03Z","links":{"resolver":"https://pith.science/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7","bundle":"https://pith.science/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7/bundle.json","state":"https://pith.science/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVKXCE7RMH2VMHGNYCWGDXDZK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JVKXCE7RMH2VMHGNYCWGDXDZK7","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":"a1814f677a6a05b44d73b47e37cba5b7ba508a873cc4f8c20e110cf8d42a63ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-18T14:16:40Z","title_canon_sha256":"23d6f9a1748d4c3864051dc84a893577416751c5dab8cb584ee928e18fa5d9de"},"schema_version":"1.0","source":{"id":"2412.13875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13875","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13875v2","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13875","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"JVKXCE7RMH2V","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JVKXCE7RMH2VMHGN","created_at":"2026-07-05T11:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JVKXCE7R","created_at":"2026-07-05T11:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:5a18e81b5e17b657df5ec7725e7a2edd14b2a80d021ea43700af72fa0af4cee7","target":"graph","created_at":"2026-07-05T11:33:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.13875/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nearest neighbor (NN) graph based visual re-ranking has emerged as a powerful approach for improving retrieval accuracy, offering the advantages of effectively exploring high-dimensional manifolds without requiring additional fine-tuning. However, the effectiveness of NN graph-based re-ranking is fundamentally constrained by the quality of its edge connectivity, as incorrect connections between dissimilar (negative) images frequently occur. This is known as a noisy edge problem, which hinders the re-ranking performance of existing techniques and limits their potential. To remedy this issue, we","authors_text":"Jaeyoon Kim, Sung-Eui Yoon, Taeyoung Kim, Yoonki Cho","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-18T14:16:40Z","title":"Enhancing Visual Re-ranking through Denoising Nearest Neighbor Graph via Continuous CRF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13875","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:67f3d21cf1f5f0554258cc50ac600b3dc1a32932cdf3f4e3e6b2b28d0ecf3ce5","target":"record","created_at":"2026-07-05T11:33:18Z","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":"a1814f677a6a05b44d73b47e37cba5b7ba508a873cc4f8c20e110cf8d42a63ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-18T14:16:40Z","title_canon_sha256":"23d6f9a1748d4c3864051dc84a893577416751c5dab8cb584ee928e18fa5d9de"},"schema_version":"1.0","source":{"id":"2412.13875","kind":"arxiv","version":2}},"canonical_sha256":"4d557113f161f5561ccdc0ac61dc7957fd0a04e6114152aeb34571565dcd489d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d557113f161f5561ccdc0ac61dc7957fd0a04e6114152aeb34571565dcd489d","first_computed_at":"2026-07-05T11:33:18.535942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:18.535942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uveSBBSXSihNy7VDCquyW+1m91RrQFy5rQOaVAOGXrALkLEkChH4eiEJG5ZjZI/LF0nPwM9UY6LyjkTa/t9mCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:18.536410Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.13875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67f3d21cf1f5f0554258cc50ac600b3dc1a32932cdf3f4e3e6b2b28d0ecf3ce5","sha256:5a18e81b5e17b657df5ec7725e7a2edd14b2a80d021ea43700af72fa0af4cee7"],"state_sha256":"27aaad6acd44690dcd59af6d3c2975da81c1d1538195d828d392be6edcecf2ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65AkeIOkoZ8scNfCJ/H7WyCRRLhc6ZdAnbZ5qAQ52B6HZC3tpI5yb6Ow/T+y3BER7ayCs+EfYK4j6bPQnKFUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T02:10:03.187826Z","bundle_sha256":"0fc9901aa445fd7a316972ac5cdb8e0c7b18286df0d1c44abf09cd73bf5735d0"}}