{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SCTZGRFW5GRS737JLVLNM5G3CE","short_pith_number":"pith:SCTZGRFW","canonical_record":{"source":{"id":"1905.10987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T06:08:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f261c92023f6c9136d3d8c4731e3452e4fd1bf7086261a420531403d2a8cdff1","abstract_canon_sha256":"377e27353c401def889a3363de24e799dfa5293e9e64a4b19b8c2a3d0c228a99"},"schema_version":"1.0"},"canonical_sha256":"90a79344b6e9a32fefe95d56d674db1113570b1c9e0e24418485473a39777c95","source":{"kind":"arxiv","id":"1905.10987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10987","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10987v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10987","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"SCTZGRFW5GRS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SCTZGRFW5GRS737J","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SCTZGRFW","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SCTZGRFW5GRS737JLVLNM5G3CE","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T06:08:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f261c92023f6c9136d3d8c4731e3452e4fd1bf7086261a420531403d2a8cdff1","abstract_canon_sha256":"377e27353c401def889a3363de24e799dfa5293e9e64a4b19b8c2a3d0c228a99"},"schema_version":"1.0"},"canonical_sha256":"90a79344b6e9a32fefe95d56d674db1113570b1c9e0e24418485473a39777c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.213467Z","signature_b64":"WUr8Yy30xIVqoR4Q4j2qj3fvfuYahuhbr6eSBadk06zX+vBTZVw2at5BsHVXj4/uh8zU/Sau8sfw1S8VtQJnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90a79344b6e9a32fefe95d56d674db1113570b1c9e0e24418485473a39777c95","last_reissued_at":"2026-05-17T23:45:03.212787Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.212787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10987","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-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxASEpiTVMysuxC99Wfz4clmngFlRvrtDY6/4bu8z1/n0IIv0yDEQX/dLlloPr6S+3TsTq9pCYFz818Yj7iTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:36:04.601077Z"},"content_sha256":"2c57c737361a458bfc3dd8fda46bbd1f820d8d4c58de7fba3857820cc9372ac3","schema_version":"1.0","event_id":"sha256:2c57c737361a458bfc3dd8fda46bbd1f820d8d4c58de7fba3857820cc9372ac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SCTZGRFW5GRS737JLVLNM5G3CE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Route in Similarity Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anton Sinitsin, Artem Babenko, Dmitry Baranchuk, Dmitry Persiyanov","submitted_at":"2019-05-27T06:08:20Z","abstract_excerpt":"Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform the search via greedy routing: a query traverses the graph and in each vertex moves to the adjacent vertex that is the closest to this query. In practice, similarity graphs are often susceptible to local minima, when queries do not reach its nearest neighbors, getting stuck in suboptimal vertices. In this paper we propose to learn the routing function that overcomes local minima via incorporating information about th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10987","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":""},"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:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4poRtESnh+lJv+xjAhMHb83b1j9dItmbryxILDlq10H+3bX1FLv6/83jii7/OVZt7ajK2XxTo2e11nY68LlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:36:04.601452Z"},"content_sha256":"a692a02b33c7b5a4d556afc2511ab915116a7a29b4a5e4ea260b66d7bea0b073","schema_version":"1.0","event_id":"sha256:a692a02b33c7b5a4d556afc2511ab915116a7a29b4a5e4ea260b66d7bea0b073"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCTZGRFW5GRS737JLVLNM5G3CE/bundle.json","state_url":"https://pith.science/pith/SCTZGRFW5GRS737JLVLNM5G3CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCTZGRFW5GRS737JLVLNM5G3CE/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-05-31T23:36:04Z","links":{"resolver":"https://pith.science/pith/SCTZGRFW5GRS737JLVLNM5G3CE","bundle":"https://pith.science/pith/SCTZGRFW5GRS737JLVLNM5G3CE/bundle.json","state":"https://pith.science/pith/SCTZGRFW5GRS737JLVLNM5G3CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCTZGRFW5GRS737JLVLNM5G3CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SCTZGRFW5GRS737JLVLNM5G3CE","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":"377e27353c401def889a3363de24e799dfa5293e9e64a4b19b8c2a3d0c228a99","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T06:08:20Z","title_canon_sha256":"f261c92023f6c9136d3d8c4731e3452e4fd1bf7086261a420531403d2a8cdff1"},"schema_version":"1.0","source":{"id":"1905.10987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10987","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10987v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10987","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"SCTZGRFW5GRS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SCTZGRFW5GRS737J","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SCTZGRFW","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:a692a02b33c7b5a4d556afc2511ab915116a7a29b4a5e4ea260b66d7bea0b073","target":"graph","created_at":"2026-05-17T23:45:03Z","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":"Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform the search via greedy routing: a query traverses the graph and in each vertex moves to the adjacent vertex that is the closest to this query. In practice, similarity graphs are often susceptible to local minima, when queries do not reach its nearest neighbors, getting stuck in suboptimal vertices. In this paper we propose to learn the routing function that overcomes local minima via incorporating information about th","authors_text":"Anton Sinitsin, Artem Babenko, Dmitry Baranchuk, Dmitry Persiyanov","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T06:08:20Z","title":"Learning to Route in Similarity Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10987","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:2c57c737361a458bfc3dd8fda46bbd1f820d8d4c58de7fba3857820cc9372ac3","target":"record","created_at":"2026-05-17T23:45:03Z","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":"377e27353c401def889a3363de24e799dfa5293e9e64a4b19b8c2a3d0c228a99","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T06:08:20Z","title_canon_sha256":"f261c92023f6c9136d3d8c4731e3452e4fd1bf7086261a420531403d2a8cdff1"},"schema_version":"1.0","source":{"id":"1905.10987","kind":"arxiv","version":1}},"canonical_sha256":"90a79344b6e9a32fefe95d56d674db1113570b1c9e0e24418485473a39777c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90a79344b6e9a32fefe95d56d674db1113570b1c9e0e24418485473a39777c95","first_computed_at":"2026-05-17T23:45:03.212787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.212787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WUr8Yy30xIVqoR4Q4j2qj3fvfuYahuhbr6eSBadk06zX+vBTZVw2at5BsHVXj4/uh8zU/Sau8sfw1S8VtQJnAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.213467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c57c737361a458bfc3dd8fda46bbd1f820d8d4c58de7fba3857820cc9372ac3","sha256:a692a02b33c7b5a4d556afc2511ab915116a7a29b4a5e4ea260b66d7bea0b073"],"state_sha256":"8fc2f092bf5465ec65f2a8cc68b7af14cbfca8cc70190cc7fb929d979c717180"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"246sFjoXci6255MTv7+iWcUR7nHNZpSKhsU6AYF8QAOmJKRfPYfb6THOnMNPGaO0ccV8YmJn2EosouKwj8AyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:36:04.603948Z","bundle_sha256":"c116db6f9ae9885f45c0440ff324e6c6e332f8690f4abaea418c579b1ed6ed0b"}}