{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N7CH2VBCLWTO6JINOKDWB5CQNW","short_pith_number":"pith:N7CH2VBC","schema_version":"1.0","canonical_sha256":"6fc47d54225da6ef250d728760f4506dafbed3b585fd57746cc05ef07db2c5e6","source":{"kind":"arxiv","id":"2310.04408","version":1},"attestation_state":"computed","paper":{"title":"RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eunsol Choi, Fangyuan Xu, Weijia Shi","submitted_at":"2023-10-06T17:55:36Z","abstract_excerpt":"Retrieving documents and prepending them in-context at inference time improves performance of language model (LMs) on a wide range of tasks. However, these documents, often spanning hundreds of words, make inference substantially more expensive. We propose compressing the retrieved documents into textual summaries prior to in-context integration. This not only reduces the computational costs but also relieves the burden of LMs to identify relevant information in long retrieved documents. We present two compressors -- an extractive compressor which selects useful sentences from retrieved docume"},"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":"2310.04408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-06T17:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"d16e182223df7cbca62c7f707ecd294962ca62ada097bccb2f58b23e136130af","abstract_canon_sha256":"96e460dbd4bd6c17504af41408118b8004e977e07af35b28a057549ec0d08746"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:02.524908Z","signature_b64":"SiP+oPnAjxT7fc7D8Ce6X8UYSfgQiiL0MEeogFM5f+A4OJznMQJNPo4A59fkBVOv+QqOPM7AtBnEgOOpDm/aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc47d54225da6ef250d728760f4506dafbed3b585fd57746cc05ef07db2c5e6","last_reissued_at":"2026-07-05T06:58:02.524474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:02.524474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eunsol Choi, Fangyuan Xu, Weijia Shi","submitted_at":"2023-10-06T17:55:36Z","abstract_excerpt":"Retrieving documents and prepending them in-context at inference time improves performance of language model (LMs) on a wide range of tasks. However, these documents, often spanning hundreds of words, make inference substantially more expensive. We propose compressing the retrieved documents into textual summaries prior to in-context integration. This not only reduces the computational costs but also relieves the burden of LMs to identify relevant information in long retrieved documents. We present two compressors -- an extractive compressor which selects useful sentences from retrieved docume"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04408","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/2310.04408/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":"2310.04408","created_at":"2026-07-05T06:58:02.524535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04408v1","created_at":"2026-07-05T06:58:02.524535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04408","created_at":"2026-07-05T06:58:02.524535+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7CH2VBCLWTO","created_at":"2026-07-05T06:58:02.524535+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7CH2VBCLWTO6JIN","created_at":"2026-07-05T06:58:02.524535+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7CH2VBC","created_at":"2026-07-05T06:58:02.524535+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":23,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2607.07827","citing_title":"Open Models, Open Risks: Measuring Unsafe Generation in Text-to-Image Models In the Wild","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2607.08180","citing_title":"Out of Sight: Compression-Aware Content Protection against Agentic Crawlers","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2607.08032","citing_title":"What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents","ref_index":131,"is_internal_anchor":true},{"citing_arxiv_id":"2607.01916","citing_title":"ContextSniper: AntTrail's Token-Efficient Code Memory for Repository-Level Program Repair","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06906","citing_title":"EASE-TTT: Evidence-Aligned Selective Test-Time Training for Long-Context Question Answering","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05875","citing_title":"QCFuse: Query-Aware Cache Fusion via Compressed View for Efficient RAG Serving","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30838","citing_title":"COMPASS: Cognitive MCTS-Guided Process Alignment for Safe Search Agents","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28349","citing_title":"HMARS: A Hierarchical Multi-Agent Memory System for Long-Context Reasoning","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27494","citing_title":"Grounded Cache Routing for Retrieval-Augmented Generation: When Is It Safe to Reuse an Answer?","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28713","citing_title":"Thinking as Compression: Your Reasoning Model is Secretly a Context Compressor","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2312.10997","citing_title":"Retrieval-Augmented Generation for Large Language Models: A Survey","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2404.10981","citing_title":"A Survey on Retrieval-Augmented Text Generation for Large Language Models","ref_index":154,"is_internal_anchor":false},{"citing_arxiv_id":"2407.13193","citing_title":"Retrieval-Augmented Generation for Natural Language Processing: A Survey","ref_index":187,"is_internal_anchor":false},{"citing_arxiv_id":"2409.01579","citing_title":"AdaComp: Extractive Context Compression with Adaptive Predictor for Retrieval-Augmented Large Language Models","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2504.02181","citing_title":"A Survey of Scaling in Large Language Model Reasoning","ref_index":234,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18769","citing_title":"ClusterRAG: Cluster-Based Collaborative Filtering for Personalized Retrieval-Augmented Generation","ref_index":102,"is_internal_anchor":false},{"citing_arxiv_id":"2506.04565","citing_title":"From Standalone LLMs to Integrated Intelligence: A Survey of Compound Al Systems","ref_index":201,"is_internal_anchor":false},{"citing_arxiv_id":"2404.14294","citing_title":"A Survey on Efficient Inference for Large Language Models","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14503","citing_title":"Not All RAGs Are Created Equal: A Component-Wise Empirical Study for Software Engineering Tasks","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2501.05366","citing_title":"Search-o1: Agentic Search-Enhanced Large Reasoning Models","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2310.11511","citing_title":"Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22261","citing_title":"Bridging the Long-Tail Gap: Robust Retrieval-Augmented Relation Completion via Multi-Stage Paraphrase Infusion","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00702","citing_title":"Learning How and What to Memorize: Cognition-Inspired Two-Stage Optimization for Evolving Memory","ref_index":166,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW","json":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW.json","graph_json":"https://pith.science/api/pith-number/N7CH2VBCLWTO6JINOKDWB5CQNW/graph.json","events_json":"https://pith.science/api/pith-number/N7CH2VBCLWTO6JINOKDWB5CQNW/events.json","paper":"https://pith.science/paper/N7CH2VBC"},"agent_actions":{"view_html":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW","download_json":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW.json","view_paper":"https://pith.science/paper/N7CH2VBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04408&json=true","fetch_graph":"https://pith.science/api/pith-number/N7CH2VBCLWTO6JINOKDWB5CQNW/graph.json","fetch_events":"https://pith.science/api/pith-number/N7CH2VBCLWTO6JINOKDWB5CQNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW/action/storage_attestation","attest_author":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW/action/author_attestation","sign_citation":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW/action/citation_signature","submit_replication":"https://pith.science/pith/N7CH2VBCLWTO6JINOKDWB5CQNW/action/replication_record"}},"created_at":"2026-07-05T06:58:02.524535+00:00","updated_at":"2026-07-05T06:58:02.524535+00:00"}