{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:COR6D6XBY6V2JUKHOLCBV5DYS2","short_pith_number":"pith:COR6D6XB","schema_version":"1.0","canonical_sha256":"13a3e1fae1c7aba4d14772c41af47896b3fec721a01a274c434e291411a09556","source":{"kind":"arxiv","id":"2210.02401","version":1},"attestation_state":"computed","paper":{"title":"Medical Image Retrieval via Nearest Neighbor Search on Pre-trained Image Features","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Deepak Gupta, Dina Demner-Fushman, Russell Loane, Soumya Gayen","submitted_at":"2022-10-05T17:21:11Z","abstract_excerpt":"Nearest neighbor search (NNS) aims to locate the points in high-dimensional space that is closest to the query point. The brute-force approach for finding the nearest neighbor becomes computationally infeasible when the number of points is large. The NNS has multiple applications in medicine, such as searching large medical imaging databases, disease classification, diagnosis, etc. With a focus on medical imaging, this paper proposes DenseLinkSearch an effective and efficient algorithm that searches and retrieves the relevant images from heterogeneous sources of medical images. Towards this, g"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2210.02401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2022-10-05T17:21:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9a4fb9a7cfbc5f75e8392c390c31912ec98f9daeb0383126fe465c2a0fb460a3","abstract_canon_sha256":"69749b5d502349f931b1679847e6a2b76fb03971d317ad6a2affe55ca91c81e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:47.706860Z","signature_b64":"DDCIll7A2zOp8+rQpucaKEky3wb73dFod1h64D3khsBkQyeXMxaIytdBKbMQU2bEfVHXeCyn4rnavqPR1iHsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13a3e1fae1c7aba4d14772c41af47896b3fec721a01a274c434e291411a09556","last_reissued_at":"2026-07-05T05:03:47.706403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:47.706403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Medical Image Retrieval via Nearest Neighbor Search on Pre-trained Image Features","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Deepak Gupta, Dina Demner-Fushman, Russell Loane, Soumya Gayen","submitted_at":"2022-10-05T17:21:11Z","abstract_excerpt":"Nearest neighbor search (NNS) aims to locate the points in high-dimensional space that is closest to the query point. The brute-force approach for finding the nearest neighbor becomes computationally infeasible when the number of points is large. The NNS has multiple applications in medicine, such as searching large medical imaging databases, disease classification, diagnosis, etc. With a focus on medical imaging, this paper proposes DenseLinkSearch an effective and efficient algorithm that searches and retrieves the relevant images from heterogeneous sources of medical images. Towards this, g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02401","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.02401/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.02401","created_at":"2026-07-05T05:03:47.706462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.02401v1","created_at":"2026-07-05T05:03:47.706462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02401","created_at":"2026-07-05T05:03:47.706462+00:00"},{"alias_kind":"pith_short_12","alias_value":"COR6D6XBY6V2","created_at":"2026-07-05T05:03:47.706462+00:00"},{"alias_kind":"pith_short_16","alias_value":"COR6D6XBY6V2JUKH","created_at":"2026-07-05T05:03:47.706462+00:00"},{"alias_kind":"pith_short_8","alias_value":"COR6D6XB","created_at":"2026-07-05T05:03:47.706462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19395","citing_title":"Concept-driven Off Policy Evaluation","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2","json":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2.json","graph_json":"https://pith.science/api/pith-number/COR6D6XBY6V2JUKHOLCBV5DYS2/graph.json","events_json":"https://pith.science/api/pith-number/COR6D6XBY6V2JUKHOLCBV5DYS2/events.json","paper":"https://pith.science/paper/COR6D6XB"},"agent_actions":{"view_html":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2","download_json":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2.json","view_paper":"https://pith.science/paper/COR6D6XB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.02401&json=true","fetch_graph":"https://pith.science/api/pith-number/COR6D6XBY6V2JUKHOLCBV5DYS2/graph.json","fetch_events":"https://pith.science/api/pith-number/COR6D6XBY6V2JUKHOLCBV5DYS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2/action/storage_attestation","attest_author":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2/action/author_attestation","sign_citation":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2/action/citation_signature","submit_replication":"https://pith.science/pith/COR6D6XBY6V2JUKHOLCBV5DYS2/action/replication_record"}},"created_at":"2026-07-05T05:03:47.706462+00:00","updated_at":"2026-07-05T05:03:47.706462+00:00"}