{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JZOIFPCRTERZNNYY3Y4DNMGOSP","short_pith_number":"pith:JZOIFPCR","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"},"canonical_sha256":"4e5c82bc51992396b718de3836b0ce93d38d1487cc1090cc9b1fc08df633c8b3","source":{"kind":"arxiv","id":"2201.07917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.07917","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"arxiv_version","alias_value":"2201.07917v1","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.07917","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"pith_short_12","alias_value":"JZOIFPCRTERZ","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"pith_short_16","alias_value":"JZOIFPCRTERZNNYY","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"pith_short_8","alias_value":"JZOIFPCR","created_at":"2026-07-05T03:50:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JZOIFPCRTERZNNYY3Y4DNMGOSP","target":"record","payload":{"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"},"canonical_sha256":"4e5c82bc51992396b718de3836b0ce93d38d1487cc1090cc9b1fc08df633c8b3","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"},"source_kind":"arxiv","source_id":"2201.07917","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-07-05T03:50:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NPu/Cm8p+kqRtA0L3X+Jl8cEeTCFK6GLpqv2zorSE9H3dBYDPwrT+JbVnzM+EURL1/jZcgLQj/lqIys1I7/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:52:59.425447Z"},"content_sha256":"4e99948c68cfe3a2e809d78efbdd1acd0b3f7d400d668cd8b686d3df3b919b78","schema_version":"1.0","event_id":"sha256:4e99948c68cfe3a2e809d78efbdd1acd0b3f7d400d668cd8b686d3df3b919b78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JZOIFPCRTERZNNYY3Y4DNMGOSP","target":"graph","payload":{"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"},"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-05T03:50:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aRN+ilwzDXg4CK9+OqQl833sF35LP+B2x5y50XfXWfqmaJSMJKkpDdH8vR/UWYK2MX6zJdW8qJSsBP7ZJ4oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:52:59.425896Z"},"content_sha256":"0cd13a1ea21d6650503a1b04b2861b59487395a1fed1557220a56c5b00b2e1f3","schema_version":"1.0","event_id":"sha256:0cd13a1ea21d6650503a1b04b2861b59487395a1fed1557220a56c5b00b2e1f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/bundle.json","state_url":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/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-07-05T13:52:59Z","links":{"resolver":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP","bundle":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/bundle.json","state":"https://pith.science/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZOIFPCRTERZNNYY3Y4DNMGOSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JZOIFPCRTERZNNYY3Y4DNMGOSP","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":"6b9fb7df8a5dfea7c7bf39fc26e6ff8dab6663e7f09d5bdef149cbeb6ef74afc","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-01-19T23:35:46Z","title_canon_sha256":"a014bd756e9fdebdf79d80f2fcacd7463a1cbea3675d512215df01b6fee045b6"},"schema_version":"1.0","source":{"id":"2201.07917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.07917","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"arxiv_version","alias_value":"2201.07917v1","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.07917","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"pith_short_12","alias_value":"JZOIFPCRTERZ","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"pith_short_16","alias_value":"JZOIFPCRTERZNNYY","created_at":"2026-07-05T03:50:06Z"},{"alias_kind":"pith_short_8","alias_value":"JZOIFPCR","created_at":"2026-07-05T03:50:06Z"}],"graph_snapshots":[{"event_id":"sha256:0cd13a1ea21d6650503a1b04b2861b59487395a1fed1557220a56c5b00b2e1f3","target":"graph","created_at":"2026-07-05T03:50:06Z","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/2201.07917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Eric S. Tellez, Guillermo Ruiz","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-01-19T23:35:46Z","title":"Similarity search on neighbor's graphs with automatic Pareto optimal performance and minimum expected quality setups based on hyperparameter optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.07917","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:4e99948c68cfe3a2e809d78efbdd1acd0b3f7d400d668cd8b686d3df3b919b78","target":"record","created_at":"2026-07-05T03:50:06Z","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":"6b9fb7df8a5dfea7c7bf39fc26e6ff8dab6663e7f09d5bdef149cbeb6ef74afc","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-01-19T23:35:46Z","title_canon_sha256":"a014bd756e9fdebdf79d80f2fcacd7463a1cbea3675d512215df01b6fee045b6"},"schema_version":"1.0","source":{"id":"2201.07917","kind":"arxiv","version":1}},"canonical_sha256":"4e5c82bc51992396b718de3836b0ce93d38d1487cc1090cc9b1fc08df633c8b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e5c82bc51992396b718de3836b0ce93d38d1487cc1090cc9b1fc08df633c8b3","first_computed_at":"2026-07-05T03:50:06.549538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:06.549538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lE0cLvrp3C+7whet4RHrTCaagEDKrJms0KBVfrzzwD9e4oaq+0bvnh2N7dDwycpM0Fi6VI+iI6KtaSSuOXoiDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:06.549938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.07917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e99948c68cfe3a2e809d78efbdd1acd0b3f7d400d668cd8b686d3df3b919b78","sha256:0cd13a1ea21d6650503a1b04b2861b59487395a1fed1557220a56c5b00b2e1f3"],"state_sha256":"d3b72ab130c1cd76f5f65d0f6d644ce66462d56928ce410234df9421f9e0d7b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tv4srK8PguUUqJDxx9DMztZoA3lH/uw4pO6wrkfYl4/bpZduJAhXPi3D1j0TtfpeQPppWcl1j5WpaS3fJ20oAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:52:59.428149Z","bundle_sha256":"3281c56dcb27490c78c8f66fd9948ef69fc5d7965e592b567bb2940549963ef0"}}