{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:INVSCSWTW6T7VSEO5TYG7J7L5R","short_pith_number":"pith:INVSCSWT","schema_version":"1.0","canonical_sha256":"436b214ad3b7a7fac88eecf06fa7ebec7d23c94c58902f626637de820fa3a634","source":{"kind":"arxiv","id":"2506.07261","version":1},"attestation_state":"computed","paper":{"title":"RADAR: Recall Augmentation through Deferred Asynchronous Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Ajantha Ramineni, Amit Jaspal, Qian Dang","submitted_at":"2025-06-08T19:21:46Z","abstract_excerpt":"Modern large-scale recommender systems employ multi-stage ranking funnel (Retrieval, Pre-ranking, Ranking) to balance engagement and computational constraints (latency, CPU). However, the initial retrieval stage, often relying on efficient but less precise methods like K-Nearest Neighbors (KNN), struggles to effectively surface the most engaging items from billion-scale catalogs, particularly distinguishing highly relevant and engaging candidates from merely relevant ones. We introduce Recall Augmentation through Deferred Asynchronous Retrieval (RADAR), a novel framework that leverages asynchr"},"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":"2506.07261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-08T19:21:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c3d857c86c581f51951ab302fe20790883d4a943273b2e6a934117517f844e3a","abstract_canon_sha256":"06286e978a8e874b6d2e32d8882adfba44a07aae01b728267a3c6c8a71acfa87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:04.360274Z","signature_b64":"AdvEQNoZk2jxoIa+scsbZMwrCdlBKBnZMcBH13UwlVv4tvl9JSFVys0yAw4gWj2HZKmZ00K9T/4PyIUO//gvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"436b214ad3b7a7fac88eecf06fa7ebec7d23c94c58902f626637de820fa3a634","last_reissued_at":"2026-07-05T11:18:04.359759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:04.359759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RADAR: Recall Augmentation through Deferred Asynchronous Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Ajantha Ramineni, Amit Jaspal, Qian Dang","submitted_at":"2025-06-08T19:21:46Z","abstract_excerpt":"Modern large-scale recommender systems employ multi-stage ranking funnel (Retrieval, Pre-ranking, Ranking) to balance engagement and computational constraints (latency, CPU). However, the initial retrieval stage, often relying on efficient but less precise methods like K-Nearest Neighbors (KNN), struggles to effectively surface the most engaging items from billion-scale catalogs, particularly distinguishing highly relevant and engaging candidates from merely relevant ones. We introduce Recall Augmentation through Deferred Asynchronous Retrieval (RADAR), a novel framework that leverages asynchr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07261","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/2506.07261/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":"2506.07261","created_at":"2026-07-05T11:18:04.359813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07261v1","created_at":"2026-07-05T11:18:04.359813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07261","created_at":"2026-07-05T11:18:04.359813+00:00"},{"alias_kind":"pith_short_12","alias_value":"INVSCSWTW6T7","created_at":"2026-07-05T11:18:04.359813+00:00"},{"alias_kind":"pith_short_16","alias_value":"INVSCSWTW6T7VSEO","created_at":"2026-07-05T11:18:04.359813+00:00"},{"alias_kind":"pith_short_8","alias_value":"INVSCSWT","created_at":"2026-07-05T11:18:04.359813+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/INVSCSWTW6T7VSEO5TYG7J7L5R","json":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R.json","graph_json":"https://pith.science/api/pith-number/INVSCSWTW6T7VSEO5TYG7J7L5R/graph.json","events_json":"https://pith.science/api/pith-number/INVSCSWTW6T7VSEO5TYG7J7L5R/events.json","paper":"https://pith.science/paper/INVSCSWT"},"agent_actions":{"view_html":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R","download_json":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R.json","view_paper":"https://pith.science/paper/INVSCSWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07261&json=true","fetch_graph":"https://pith.science/api/pith-number/INVSCSWTW6T7VSEO5TYG7J7L5R/graph.json","fetch_events":"https://pith.science/api/pith-number/INVSCSWTW6T7VSEO5TYG7J7L5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R/action/storage_attestation","attest_author":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R/action/author_attestation","sign_citation":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R/action/citation_signature","submit_replication":"https://pith.science/pith/INVSCSWTW6T7VSEO5TYG7J7L5R/action/replication_record"}},"created_at":"2026-07-05T11:18:04.359813+00:00","updated_at":"2026-07-05T11:18:04.359813+00:00"}