{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JZOIFPCRTERZNNYY3Y4DNMGOSP","short_pith_number":"pith:JZOIFPCR","schema_version":"1.0","canonical_sha256":"4e5c82bc51992396b718de3836b0ce93d38d1487cc1090cc9b1fc08df633c8b3","source":{"kind":"arxiv","id":"2201.07917","version":1},"attestation_state":"computed","paper":{"title":"Similarity search on neighbor's graphs with automatic Pareto optimal performance and minimum expected quality setups based on hyperparameter optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Eric S. Tellez, Guillermo Ruiz","submitted_at":"2022-01-19T23:35:46Z","abstract_excerpt":"This manuscript introduces an autotuned algorithm for searching nearest neighbors based on neighbor graphs and optimization metaheuristics to produce Pareto-optimal searches for quality and search speed automatically; the same strategy is also used to produce indexes that achieve a minimum quality. Our approach is described and benchmarked with other state-of-the-art similarity search methods, showing convenience and competitiveness."},"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":"2201.07917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-01-19T23:35:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a014bd756e9fdebdf79d80f2fcacd7463a1cbea3675d512215df01b6fee045b6","abstract_canon_sha256":"6b9fb7df8a5dfea7c7bf39fc26e6ff8dab6663e7f09d5bdef149cbeb6ef74afc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:06.549938Z","signature_b64":"lE0cLvrp3C+7whet4RHrTCaagEDKrJms0KBVfrzzwD9e4oaq+0bvnh2N7dDwycpM0Fi6VI+iI6KtaSSuOXoiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e5c82bc51992396b718de3836b0ce93d38d1487cc1090cc9b1fc08df633c8b3","last_reissued_at":"2026-07-05T03:50:06.549538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:06.549538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Similarity search on neighbor's graphs with automatic Pareto optimal performance and minimum expected quality setups based on hyperparameter optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Eric S. Tellez, Guillermo Ruiz","submitted_at":"2022-01-19T23:35:46Z","abstract_excerpt":"This manuscript introduces an autotuned algorithm for searching nearest neighbors based on neighbor graphs and optimization metaheuristics to produce Pareto-optimal searches for quality and search speed automatically; the same strategy is also used to produce indexes that achieve a minimum quality. Our approach is described and benchmarked with other state-of-the-art similarity search methods, showing convenience and competitiveness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.07917","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/2201.07917/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":"2201.07917","created_at":"2026-07-05T03:50:06.549598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.07917v1","created_at":"2026-07-05T03:50:06.549598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.07917","created_at":"2026-07-05T03:50:06.549598+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZOIFPCRTERZ","created_at":"2026-07-05T03:50:06.549598+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZOIFPCRTERZNNYY","created_at":"2026-07-05T03:50:06.549598+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZOIFPCR","created_at":"2026-07-05T03:50:06.549598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP","json":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP.json","graph_json":"https://pith.science/api/pith-number/JZOIFPCRTERZNNYY3Y4DNMGOSP/graph.json","events_json":"https://pith.science/api/pith-number/JZOIFPCRTERZNNYY3Y4DNMGOSP/events.json","paper":"https://pith.science/paper/JZOIFPCR"},"agent_actions":{"view_html":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP","download_json":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP.json","view_paper":"https://pith.science/paper/JZOIFPCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.07917&json=true","fetch_graph":"https://pith.science/api/pith-number/JZOIFPCRTERZNNYY3Y4DNMGOSP/graph.json","fetch_events":"https://pith.science/api/pith-number/JZOIFPCRTERZNNYY3Y4DNMGOSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/action/storage_attestation","attest_author":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/action/author_attestation","sign_citation":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/action/citation_signature","submit_replication":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/action/replication_record"}},"created_at":"2026-07-05T03:50:06.549598+00:00","updated_at":"2026-07-05T03:50:06.549598+00:00"}