{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ORU2U7FG673XO63NELU7R5MKGM","short_pith_number":"pith:ORU2U7FG","canonical_record":{"source":{"id":"2607.03515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-03T17:41:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"25985ec8e2faf50746d8c8efe3618a4afb3a35abf1ee8f7883545f572c1d1cac","abstract_canon_sha256":"0b6a63d2f6445c18bb9b229649edc00548dcb543554170a16936a8b2713197fd"},"schema_version":"1.0"},"canonical_sha256":"7469aa7ca6f7f7777b6d22e9f8f58a331ee258f813f1742c77943cacd996e252","source":{"kind":"arxiv","id":"2607.03515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03515","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03515v1","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03515","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"ORU2U7FG673X","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"pith_short_16","alias_value":"ORU2U7FG673XO63N","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"pith_short_8","alias_value":"ORU2U7FG","created_at":"2026-07-07T02:17:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ORU2U7FG673XO63NELU7R5MKGM","target":"record","payload":{"canonical_record":{"source":{"id":"2607.03515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-03T17:41:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"25985ec8e2faf50746d8c8efe3618a4afb3a35abf1ee8f7883545f572c1d1cac","abstract_canon_sha256":"0b6a63d2f6445c18bb9b229649edc00548dcb543554170a16936a8b2713197fd"},"schema_version":"1.0"},"canonical_sha256":"7469aa7ca6f7f7777b6d22e9f8f58a331ee258f813f1742c77943cacd996e252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:51.274012Z","signature_b64":"6cofFYinY6X3BFJUKzlxhpEp0v7d24PvJ3WknmMWJCtApQOYfi6YWgdIaQVJ11p0Z2dfdg9WvKHjESWpdsXMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7469aa7ca6f7f7777b6d22e9f8f58a331ee258f813f1742c77943cacd996e252","last_reissued_at":"2026-07-07T02:17:51.273238Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:51.273238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.03515","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-07T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMYCi9aqMalfnqKwp2hQlWxBjgl2AmFDFQx/iFyF8e/SBkAPC6pLByAqnNZ8UBuJ0zXxTRbBQnIihjgTPbGBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:26:05.516244Z"},"content_sha256":"44fc7c078519c6cb90a7bb092419887176785dd9fd0266e951a18ec628d18164","schema_version":"1.0","event_id":"sha256:44fc7c078519c6cb90a7bb092419887176785dd9fd0266e951a18ec628d18164"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ORU2U7FG673XO63NELU7R5MKGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Andrey Ploskonosov, Kirill Shevkunov, Liudmila Prokhorenkova","submitted_at":"2026-07-03T17:41:37Z","abstract_excerpt":"In many machine learning applications, the most relevant items for a query should be efficiently retrieved. The relevance function is usually an expensive similarity model, making the exhaustive search infeasible. A typical solution is to train another model that separately embeds queries and items to a vector space, where similarity is defined via the dot product or cosine similarity. This allows one to search the relevant items through fast approximate nearest neighbor search at the cost of some reduction in quality. To compensate for this reduction, the found items (candidates) are re-ranke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03515","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/2607.03515/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-07T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aa57BwztvoUUfibjxnE1/XRypIby9c2Iu+kkl+MoOFU3Lp+hXIHPG39TJSYAJK3tS33QjB3Hzhb4QW9PKVlZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:26:05.516744Z"},"content_sha256":"7c300fc046a770395b04887423f84dd8c73108005836c36937ecdc68ef8165f4","schema_version":"1.0","event_id":"sha256:7c300fc046a770395b04887423f84dd8c73108005836c36937ecdc68ef8165f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORU2U7FG673XO63NELU7R5MKGM/bundle.json","state_url":"https://pith.science/pith/ORU2U7FG673XO63NELU7R5MKGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORU2U7FG673XO63NELU7R5MKGM/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-06T01:26:05Z","links":{"resolver":"https://pith.science/pith/ORU2U7FG673XO63NELU7R5MKGM","bundle":"https://pith.science/pith/ORU2U7FG673XO63NELU7R5MKGM/bundle.json","state":"https://pith.science/pith/ORU2U7FG673XO63NELU7R5MKGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORU2U7FG673XO63NELU7R5MKGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ORU2U7FG673XO63NELU7R5MKGM","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":"0b6a63d2f6445c18bb9b229649edc00548dcb543554170a16936a8b2713197fd","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-03T17:41:37Z","title_canon_sha256":"25985ec8e2faf50746d8c8efe3618a4afb3a35abf1ee8f7883545f572c1d1cac"},"schema_version":"1.0","source":{"id":"2607.03515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03515","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03515v1","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03515","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"ORU2U7FG673X","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"pith_short_16","alias_value":"ORU2U7FG673XO63N","created_at":"2026-07-07T02:17:51Z"},{"alias_kind":"pith_short_8","alias_value":"ORU2U7FG","created_at":"2026-07-07T02:17:51Z"}],"graph_snapshots":[{"event_id":"sha256:7c300fc046a770395b04887423f84dd8c73108005836c36937ecdc68ef8165f4","target":"graph","created_at":"2026-07-07T02:17:51Z","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/2607.03515/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many machine learning applications, the most relevant items for a query should be efficiently retrieved. The relevance function is usually an expensive similarity model, making the exhaustive search infeasible. A typical solution is to train another model that separately embeds queries and items to a vector space, where similarity is defined via the dot product or cosine similarity. This allows one to search the relevant items through fast approximate nearest neighbor search at the cost of some reduction in quality. To compensate for this reduction, the found items (candidates) are re-ranke","authors_text":"Andrey Ploskonosov, Kirill Shevkunov, Liudmila Prokhorenkova","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-03T17:41:37Z","title":"Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03515","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:44fc7c078519c6cb90a7bb092419887176785dd9fd0266e951a18ec628d18164","target":"record","created_at":"2026-07-07T02:17:51Z","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":"0b6a63d2f6445c18bb9b229649edc00548dcb543554170a16936a8b2713197fd","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-03T17:41:37Z","title_canon_sha256":"25985ec8e2faf50746d8c8efe3618a4afb3a35abf1ee8f7883545f572c1d1cac"},"schema_version":"1.0","source":{"id":"2607.03515","kind":"arxiv","version":1}},"canonical_sha256":"7469aa7ca6f7f7777b6d22e9f8f58a331ee258f813f1742c77943cacd996e252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7469aa7ca6f7f7777b6d22e9f8f58a331ee258f813f1742c77943cacd996e252","first_computed_at":"2026-07-07T02:17:51.273238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:17:51.273238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6cofFYinY6X3BFJUKzlxhpEp0v7d24PvJ3WknmMWJCtApQOYfi6YWgdIaQVJ11p0Z2dfdg9WvKHjESWpdsXMDA==","signature_status":"signed_v1","signed_at":"2026-07-07T02:17:51.274012Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.03515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44fc7c078519c6cb90a7bb092419887176785dd9fd0266e951a18ec628d18164","sha256:7c300fc046a770395b04887423f84dd8c73108005836c36937ecdc68ef8165f4"],"state_sha256":"15a84210eaa989cd8f45bfc15299dcc419c13ba7127b65d34565416b45f356ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXZL/cu28L5++2YiVBUDtSwka9iiGXveE5WoX/iXSYa/JY3yFzZLTrHIW8UZ5e1oGZ17p8u2m7ZyKmYezSK2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:26:05.520583Z","bundle_sha256":"61380d61cf9382681be437708f1963b3b0d4421bf9eecc2a90a5c820b50f28c6"}}