{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4I4UGPDYEA26LAOH2P5JQ2MMZC","short_pith_number":"pith:4I4UGPDY","schema_version":"1.0","canonical_sha256":"e239433c782035e581c7d3fa98698cc8914b060cea14ac0ae7c0af7cc808c1a0","source":{"kind":"arxiv","id":"2605.22041","version":1},"attestation_state":"computed","paper":{"title":"RADAR: Defending RAG Dynamically against Retrieval Corruption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Caifeng Shan, Jing Dong, Tieniu Tan, Weixiang Han, Yi Liu, Yueming Lyu, Ziyuan Chen","submitted_at":"2026-05-21T06:25:46Z","abstract_excerpt":"While RAG systems are increasingly deployed in dynamic web search, temporal volatility amplifies their vulnerability to adversarial attacks. Existing static-oriented defenses struggle to handle evolving threats and incur prohibitive storage costs in dynamic settings. We propose RADAR, a framework that models reliable context selection as a graph-based energy minimization problem, solved exactly via Max-Flow Min-Cut. By incorporating a Bayesian memory node, RADAR recursively updates a belief state instead of archiving raw historical documents, effectively balancing stability against attacks wit"},"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":"2605.22041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-21T06:25:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f8a2be1d67ac7556766c381effaec1c71939a29ff42c97c86d006b0c1e47a0bb","abstract_canon_sha256":"2312f188830f99d0998d96d86477a0c257c5a6e135647742d4cf401c81440f72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:21.953663Z","signature_b64":"LMTPhncW66Hy1fa7M84DHez6yH/KYLy11Dcc0qZ1X3n+vlFqbfej1AV+uASCLpVIots/ArsUaAZsTp8YC7S8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e239433c782035e581c7d3fa98698cc8914b060cea14ac0ae7c0af7cc808c1a0","last_reissued_at":"2026-05-22T01:04:21.952645Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:21.952645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RADAR: Defending RAG Dynamically against Retrieval Corruption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Caifeng Shan, Jing Dong, Tieniu Tan, Weixiang Han, Yi Liu, Yueming Lyu, Ziyuan Chen","submitted_at":"2026-05-21T06:25:46Z","abstract_excerpt":"While RAG systems are increasingly deployed in dynamic web search, temporal volatility amplifies their vulnerability to adversarial attacks. Existing static-oriented defenses struggle to handle evolving threats and incur prohibitive storage costs in dynamic settings. We propose RADAR, a framework that models reliable context selection as a graph-based energy minimization problem, solved exactly via Max-Flow Min-Cut. By incorporating a Bayesian memory node, RADAR recursively updates a belief state instead of archiving raw historical documents, effectively balancing stability against attacks wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22041","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/2605.22041/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":"2605.22041","created_at":"2026-05-22T01:04:21.952776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22041v1","created_at":"2026-05-22T01:04:21.952776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22041","created_at":"2026-05-22T01:04:21.952776+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I4UGPDYEA26","created_at":"2026-05-22T01:04:21.952776+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I4UGPDYEA26LAOH","created_at":"2026-05-22T01:04:21.952776+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I4UGPDY","created_at":"2026-05-22T01:04:21.952776+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/4I4UGPDYEA26LAOH2P5JQ2MMZC","json":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC.json","graph_json":"https://pith.science/api/pith-number/4I4UGPDYEA26LAOH2P5JQ2MMZC/graph.json","events_json":"https://pith.science/api/pith-number/4I4UGPDYEA26LAOH2P5JQ2MMZC/events.json","paper":"https://pith.science/paper/4I4UGPDY"},"agent_actions":{"view_html":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC","download_json":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC.json","view_paper":"https://pith.science/paper/4I4UGPDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22041&json=true","fetch_graph":"https://pith.science/api/pith-number/4I4UGPDYEA26LAOH2P5JQ2MMZC/graph.json","fetch_events":"https://pith.science/api/pith-number/4I4UGPDYEA26LAOH2P5JQ2MMZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC/action/storage_attestation","attest_author":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC/action/author_attestation","sign_citation":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC/action/citation_signature","submit_replication":"https://pith.science/pith/4I4UGPDYEA26LAOH2P5JQ2MMZC/action/replication_record"}},"created_at":"2026-05-22T01:04:21.952776+00:00","updated_at":"2026-05-22T01:04:21.952776+00:00"}