{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:36WWO25TWYGPPDMIR5URKKDUEX","short_pith_number":"pith:36WWO25T","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"},"canonical_sha256":"dfad676bb3b60cf78d888f6915287425e7fc3758b406967220066442745b870d","source":{"kind":"arxiv","id":"2601.23254","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.23254","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"arxiv_version","alias_value":"2601.23254v3","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23254","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"pith_short_12","alias_value":"36WWO25TWYGP","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"pith_short_16","alias_value":"36WWO25TWYGPPDMI","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"pith_short_8","alias_value":"36WWO25T","created_at":"2026-07-30T01:19:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:36WWO25TWYGPPDMIR5URKKDUEX","target":"record","payload":{"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"},"canonical_sha256":"dfad676bb3b60cf78d888f6915287425e7fc3758b406967220066442745b870d","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"},"source_kind":"arxiv","source_id":"2601.23254","source_version":3,"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-30T01:19:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmECYw0gKGSiDSTP2T+QvUnh1evOnenddaS7PA94IaAxJi9rav3bjI9Kh8hjywIDva1KZFoEa0lm2k6aLndvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:12:31.829816Z"},"content_sha256":"2ffa1bc577826a0bca691c307d90ba6f71aa4e8fb4973e42180e348b723fdebc","schema_version":"1.0","event_id":"sha256:2ffa1bc577826a0bca691c307d90ba6f71aa4e8fb4973e42180e348b723fdebc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:36WWO25TWYGPPDMIR5URKKDUEX","target":"graph","payload":{"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"},"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-30T01:19:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaDcwQuAtB1wcUzcrbra3yYqmQLKtPgHSUlocShmovsUJ07GAuqiN8+QYZxsYmwilTp3+w1lqBkqxsjEDz3mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:12:31.830339Z"},"content_sha256":"f64aaa9b970e11148acfc76ceb0c9d22a2a39584b28be3a60de801e185c8be47","schema_version":"1.0","event_id":"sha256:f64aaa9b970e11148acfc76ceb0c9d22a2a39584b28be3a60de801e185c8be47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/bundle.json","state_url":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36WWO25TWYGPPDMIR5URKKDUEX/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-03T20:12:31Z","links":{"resolver":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX","bundle":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/bundle.json","state":"https://pith.science/pith/36WWO25TWYGPPDMIR5URKKDUEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36WWO25TWYGPPDMIR5URKKDUEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:36WWO25TWYGPPDMIR5URKKDUEX","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":"dc7b0df96d0efb9b76b123d15e3d1fe9cb0d2c4e29a89f1ea4edff5a6d55de40","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-01-30T18:22:15Z","title_canon_sha256":"317cc26e649fc7081ec130135cee45276f4ad2f04b40f477f8dedd401e9f7852"},"schema_version":"1.0","source":{"id":"2601.23254","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.23254","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"arxiv_version","alias_value":"2601.23254v3","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23254","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"pith_short_12","alias_value":"36WWO25TWYGP","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"pith_short_16","alias_value":"36WWO25TWYGPPDMI","created_at":"2026-07-30T01:19:30Z"},{"alias_kind":"pith_short_8","alias_value":"36WWO25T","created_at":"2026-07-30T01:19:30Z"}],"graph_snapshots":[{"event_id":"sha256:f64aaa9b970e11148acfc76ceb0c9d22a2a39584b28be3a60de801e185c8be47","target":"graph","created_at":"2026-07-30T01:19:30Z","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/2601.23254/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Baoyi Wang, Chen Zhi, Guochang Li, Jianwei Yin, Junxiao Han, Nan Wang, Shuiguang Deng, Xingliang Wang, Xinkui Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-01-30T18:22:15Z","title":"Better Call Grep: Evaluating and Improving Grep-Like Lexical Retrieval for Repository-Level Code Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.23254","kind":"arxiv","version":3},"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:2ffa1bc577826a0bca691c307d90ba6f71aa4e8fb4973e42180e348b723fdebc","target":"record","created_at":"2026-07-30T01:19:30Z","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":"dc7b0df96d0efb9b76b123d15e3d1fe9cb0d2c4e29a89f1ea4edff5a6d55de40","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-01-30T18:22:15Z","title_canon_sha256":"317cc26e649fc7081ec130135cee45276f4ad2f04b40f477f8dedd401e9f7852"},"schema_version":"1.0","source":{"id":"2601.23254","kind":"arxiv","version":3}},"canonical_sha256":"dfad676bb3b60cf78d888f6915287425e7fc3758b406967220066442745b870d","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfad676bb3b60cf78d888f6915287425e7fc3758b406967220066442745b870d","first_computed_at":"2026-07-30T01:19:30.667145Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:19:30.667145Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2601.23254","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ffa1bc577826a0bca691c307d90ba6f71aa4e8fb4973e42180e348b723fdebc","sha256:f64aaa9b970e11148acfc76ceb0c9d22a2a39584b28be3a60de801e185c8be47"],"state_sha256":"d5d55eee818d1c0dd447773a1c81672bdb800bcdd2d6a6388d0cce62d20c5b4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASgWnU8dnjJbF/Kn41ulnj6T0E1yaucBnKv6GcRlrl28qJQPEP7j5uwugIJStL+GOisnq33Ab5YahjhaBb+ECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:12:31.834786Z","bundle_sha256":"3fc64c0af4bba210a42eb6eee1136bf08365d90916b80b39ac61dc9ebdaef59c"}}