{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:36WWO25TWYGPPDMIR5URKKDUEX","short_pith_number":"pith:36WWO25T","schema_version":"1.0","canonical_sha256":"dfad676bb3b60cf78d888f6915287425e7fc3758b406967220066442745b870d","source":{"kind":"arxiv","id":"2601.23254","version":3},"attestation_state":"computed","paper":{"title":"Better Call Grep: Evaluating and Improving Grep-Like Lexical Retrieval for Repository-Level Code Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Baoyi Wang, Chen Zhi, Guochang Li, Jianwei Yin, Junxiao Han, Nan Wang, Shuiguang Deng, Xingliang Wang, Xinkui Zhao","submitted_at":"2026-01-30T18:22:15Z","abstract_excerpt":"Repository-level code completion remains challenging for large language models (LLMs) due to cross-file dependencies and limited context windows. Prior work addresses this challenge using Retrieval-Augmented Generation (RAG) frameworks based on semantic indexing or structure-aware graph analysis, but these approaches incur substantial computational overhead for index construction and maintenance. Motivated by common developer workflows that rely on lightweight search utilities (e.g., ripgrep), we revisit a fundamental yet underexplored question: how far can simple, index-free lexical retrieval"},"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":"2601.23254","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-01-30T18:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"317cc26e649fc7081ec130135cee45276f4ad2f04b40f477f8dedd401e9f7852","abstract_canon_sha256":"dc7b0df96d0efb9b76b123d15e3d1fe9cb0d2c4e29a89f1ea4edff5a6d55de40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfad676bb3b60cf78d888f6915287425e7fc3758b406967220066442745b870d","last_reissued_at":"2026-07-30T01:19:30.667145Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:19:30.667145Z"},"graph_snapshot":{"paper":{"title":"Better Call Grep: Evaluating and Improving Grep-Like Lexical Retrieval for Repository-Level Code Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Baoyi Wang, Chen Zhi, Guochang Li, Jianwei Yin, Junxiao Han, Nan Wang, Shuiguang Deng, Xingliang Wang, Xinkui Zhao","submitted_at":"2026-01-30T18:22:15Z","abstract_excerpt":"Repository-level code completion remains challenging for large language models (LLMs) due to cross-file dependencies and limited context windows. Prior work addresses this challenge using Retrieval-Augmented Generation (RAG) frameworks based on semantic indexing or structure-aware graph analysis, but these approaches incur substantial computational overhead for index construction and maintenance. Motivated by common developer workflows that rely on lightweight search utilities (e.g., ripgrep), we revisit a fundamental yet underexplored question: how far can simple, index-free lexical retrieval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.23254","kind":"arxiv","version":3},"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/2601.23254/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":"2601.23254","created_at":"2026-07-30T01:19:30.672337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.23254v3","created_at":"2026-07-30T01:19:30.672337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23254","created_at":"2026-07-30T01:19:30.672337+00:00"},{"alias_kind":"pith_short_12","alias_value":"36WWO25TWYGP","created_at":"2026-07-30T01:19:30.672337+00:00"},{"alias_kind":"pith_short_16","alias_value":"36WWO25TWYGPPDMI","created_at":"2026-07-30T01:19:30.672337+00:00"},{"alias_kind":"pith_short_8","alias_value":"36WWO25T","created_at":"2026-07-30T01:19:30.672337+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/36WWO25TWYGPPDMIR5URKKDUEX","json":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX.json","graph_json":"https://pith.science/api/pith-number/36WWO25TWYGPPDMIR5URKKDUEX/graph.json","events_json":"https://pith.science/api/pith-number/36WWO25TWYGPPDMIR5URKKDUEX/events.json","paper":"https://pith.science/paper/36WWO25T"},"agent_actions":{"view_html":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX","download_json":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX.json","view_paper":"https://pith.science/paper/36WWO25T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.23254&json=true","fetch_graph":"https://pith.science/api/pith-number/36WWO25TWYGPPDMIR5URKKDUEX/graph.json","fetch_events":"https://pith.science/api/pith-number/36WWO25TWYGPPDMIR5URKKDUEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/action/storage_attestation","attest_author":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/action/author_attestation","sign_citation":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/action/citation_signature","submit_replication":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/action/replication_record"}},"created_at":"2026-07-30T01:19:30.672337+00:00","updated_at":"2026-07-30T01:19:30.672337+00:00"}