{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2CSSBT7Q57KD7A5EDDYUOVCQ5Z","short_pith_number":"pith:2CSSBT7Q","canonical_record":{"source":{"id":"2502.11444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T05:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"77c2e99e9d1541950a66f6d78b2b97d43ac5776e9bf239cd8fa7b4bd5eeef0e5","abstract_canon_sha256":"e73d57d6bcaa18789a9b1bd808cd21aac8b0dc79f8f0e944851e4ffaef6bfab0"},"schema_version":"1.0"},"canonical_sha256":"d0a520cff0efd43f83a418f1475450ee4067c0ea4d27bce26139a4668ad7d7fb","source":{"kind":"arxiv","id":"2502.11444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11444","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11444v1","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11444","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"2CSSBT7Q57KD","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"pith_short_16","alias_value":"2CSSBT7Q57KD7A5E","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"pith_short_8","alias_value":"2CSSBT7Q","created_at":"2026-07-05T10:15:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2CSSBT7Q57KD7A5EDDYUOVCQ5Z","target":"record","payload":{"canonical_record":{"source":{"id":"2502.11444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T05:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"77c2e99e9d1541950a66f6d78b2b97d43ac5776e9bf239cd8fa7b4bd5eeef0e5","abstract_canon_sha256":"e73d57d6bcaa18789a9b1bd808cd21aac8b0dc79f8f0e944851e4ffaef6bfab0"},"schema_version":"1.0"},"canonical_sha256":"d0a520cff0efd43f83a418f1475450ee4067c0ea4d27bce26139a4668ad7d7fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:28.796559Z","signature_b64":"vmoz5RHC6uRjZ2qi+U7hbVgNIq4cSf/MudLjZEa9TFtv3ahnbpHKomA8aZjsbaNf4SClwivc1t7tZXrchJNMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a520cff0efd43f83a418f1475450ee4067c0ea4d27bce26139a4668ad7d7fb","last_reissued_at":"2026-07-05T10:15:28.796080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:28.796080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.11444","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-05T10:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSEfDOkcLjOt2Xa49sOvGsRD3ky82MxpkPEkDMdI6NPVSdAtBiuzrBUB3S6ubKbJ4y5fL+4BcH/wliCTxuJUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:28:59.633051Z"},"content_sha256":"9221b9198bb822a5fbf3ba9abcc69f6b84fa98398add381577e1f66823ac988c","schema_version":"1.0","event_id":"sha256:9221b9198bb822a5fbf3ba9abcc69f6b84fa98398add381577e1f66823ac988c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2CSSBT7Q57KD7A5EDDYUOVCQ5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Does RAG Really Perform Bad For Long-Context Processing?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hongjin Qian, Jun Zhao, Kang Liu, Kun Luo, Peitian Zhang, Zheng Liu","submitted_at":"2025-02-17T05:02:25Z","abstract_excerpt":"The efficient processing of long context poses a serious challenge for large language models (LLMs). Recently, retrieval-augmented generation (RAG) has emerged as a promising strategy for this problem, as it enables LLMs to make selective use of the long context for efficient computation. However, existing RAG approaches lag behind other long-context processing methods due to inherent limitations on inaccurate retrieval and fragmented contexts. To address these challenges, we introduce RetroLM, a novel RAG framework for long-context processing. Unlike traditional methods, RetroLM employs KV-le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11444","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/2502.11444/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-05T10:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/25g77xT0o/1FpniTX4IYUciOBs7LebxeZJe64pOo6sssoalY4ZrXTFzqJ56wEazSn3A7xM98UorR79Q5htFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:28:59.633546Z"},"content_sha256":"baf233a2588c0da31c90e4804b48dd8576e115ff9dc8e016b61ad70c668ec21c","schema_version":"1.0","event_id":"sha256:baf233a2588c0da31c90e4804b48dd8576e115ff9dc8e016b61ad70c668ec21c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z/bundle.json","state_url":"https://pith.science/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z/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-07T22:28:59Z","links":{"resolver":"https://pith.science/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z","bundle":"https://pith.science/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z/bundle.json","state":"https://pith.science/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CSSBT7Q57KD7A5EDDYUOVCQ5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2CSSBT7Q57KD7A5EDDYUOVCQ5Z","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":"e73d57d6bcaa18789a9b1bd808cd21aac8b0dc79f8f0e944851e4ffaef6bfab0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T05:02:25Z","title_canon_sha256":"77c2e99e9d1541950a66f6d78b2b97d43ac5776e9bf239cd8fa7b4bd5eeef0e5"},"schema_version":"1.0","source":{"id":"2502.11444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11444","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11444v1","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11444","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"2CSSBT7Q57KD","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"pith_short_16","alias_value":"2CSSBT7Q57KD7A5E","created_at":"2026-07-05T10:15:28Z"},{"alias_kind":"pith_short_8","alias_value":"2CSSBT7Q","created_at":"2026-07-05T10:15:28Z"}],"graph_snapshots":[{"event_id":"sha256:baf233a2588c0da31c90e4804b48dd8576e115ff9dc8e016b61ad70c668ec21c","target":"graph","created_at":"2026-07-05T10:15:28Z","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/2502.11444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The efficient processing of long context poses a serious challenge for large language models (LLMs). Recently, retrieval-augmented generation (RAG) has emerged as a promising strategy for this problem, as it enables LLMs to make selective use of the long context for efficient computation. However, existing RAG approaches lag behind other long-context processing methods due to inherent limitations on inaccurate retrieval and fragmented contexts. To address these challenges, we introduce RetroLM, a novel RAG framework for long-context processing. Unlike traditional methods, RetroLM employs KV-le","authors_text":"Hongjin Qian, Jun Zhao, Kang Liu, Kun Luo, Peitian Zhang, Zheng Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T05:02:25Z","title":"Does RAG Really Perform Bad For Long-Context Processing?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11444","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:9221b9198bb822a5fbf3ba9abcc69f6b84fa98398add381577e1f66823ac988c","target":"record","created_at":"2026-07-05T10:15:28Z","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":"e73d57d6bcaa18789a9b1bd808cd21aac8b0dc79f8f0e944851e4ffaef6bfab0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T05:02:25Z","title_canon_sha256":"77c2e99e9d1541950a66f6d78b2b97d43ac5776e9bf239cd8fa7b4bd5eeef0e5"},"schema_version":"1.0","source":{"id":"2502.11444","kind":"arxiv","version":1}},"canonical_sha256":"d0a520cff0efd43f83a418f1475450ee4067c0ea4d27bce26139a4668ad7d7fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0a520cff0efd43f83a418f1475450ee4067c0ea4d27bce26139a4668ad7d7fb","first_computed_at":"2026-07-05T10:15:28.796080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:28.796080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vmoz5RHC6uRjZ2qi+U7hbVgNIq4cSf/MudLjZEa9TFtv3ahnbpHKomA8aZjsbaNf4SClwivc1t7tZXrchJNMCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:28.796559Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9221b9198bb822a5fbf3ba9abcc69f6b84fa98398add381577e1f66823ac988c","sha256:baf233a2588c0da31c90e4804b48dd8576e115ff9dc8e016b61ad70c668ec21c"],"state_sha256":"9ccd09625c02781cbc72b51ad1586836bf13992d0d86f94f4456ad72b4d64c7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbriHOuPalX4stlE5hawTmTgReF2g4hwIz+5aBbH6e8cM5dNnX7+rRk0zYDEV3i3+YW4PEAgVgAzTlwVfx4DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:28:59.637167Z","bundle_sha256":"acbcb0c33221febdfb234523199ad53af838f57a850ff6c7884e7fa2735486ac"}}