{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KPXX3D74DQB23ZHFQIGVRBIDMI","short_pith_number":"pith:KPXX3D74","schema_version":"1.0","canonical_sha256":"53ef7d8ffc1c03ade4e5820d5885036219956d8ea840d14e86de3db24522fa7f","source":{"kind":"arxiv","id":"2406.18294","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiaming Li, Jiaxi Yang, Junhao Liu, Lei Zhang, Longze Chen, Min Yang, Minzheng Wang, Run Luo, Xiaobo Xia, Yunshui Li","submitted_at":"2024-06-26T12:26:16Z","abstract_excerpt":"Some recently developed code large language models (Code LLMs) have been pre-trained on repository-level code data (Repo-Code LLMs), enabling these models to recognize repository structures and utilize cross-file information for code completion. However, in real-world development scenarios, simply concatenating the entire code repository often exceeds the context window limits of these Repo-Code LLMs, leading to significant performance degradation. In this study, we conducted extensive preliminary experiments and analyses on six Repo-Code LLMs. The results indicate that maintaining the topolog"},"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":"2406.18294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-26T12:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"6d7e61203dd0d6ebd86103598ddde10004a8755b335fb5aab774196654ea2b22","abstract_canon_sha256":"20f030f8d97a57283d7b4653e71fe4eb3d130825eea9c56a62f999862eae427d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:21.621028Z","signature_b64":"plJQ5FIkRC363yWOCIr2ofW6/uXdN0PWx++ZB8J0nOqn5fzLdxu75o8PTrx9AVaWuch4iB/p+ESAyr0UMyyJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53ef7d8ffc1c03ade4e5820d5885036219956d8ea840d14e86de3db24522fa7f","last_reissued_at":"2026-07-05T08:37:21.620650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:21.620650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiaming Li, Jiaxi Yang, Junhao Liu, Lei Zhang, Longze Chen, Min Yang, Minzheng Wang, Run Luo, Xiaobo Xia, Yunshui Li","submitted_at":"2024-06-26T12:26:16Z","abstract_excerpt":"Some recently developed code large language models (Code LLMs) have been pre-trained on repository-level code data (Repo-Code LLMs), enabling these models to recognize repository structures and utilize cross-file information for code completion. However, in real-world development scenarios, simply concatenating the entire code repository often exceeds the context window limits of these Repo-Code LLMs, leading to significant performance degradation. In this study, we conducted extensive preliminary experiments and analyses on six Repo-Code LLMs. The results indicate that maintaining the topolog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18294","kind":"arxiv","version":2},"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/2406.18294/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":"2406.18294","created_at":"2026-07-05T08:37:21.620706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18294v2","created_at":"2026-07-05T08:37:21.620706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18294","created_at":"2026-07-05T08:37:21.620706+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPXX3D74DQB2","created_at":"2026-07-05T08:37:21.620706+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPXX3D74DQB23ZHF","created_at":"2026-07-05T08:37:21.620706+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPXX3D74","created_at":"2026-07-05T08:37:21.620706+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/KPXX3D74DQB23ZHFQIGVRBIDMI","json":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI.json","graph_json":"https://pith.science/api/pith-number/KPXX3D74DQB23ZHFQIGVRBIDMI/graph.json","events_json":"https://pith.science/api/pith-number/KPXX3D74DQB23ZHFQIGVRBIDMI/events.json","paper":"https://pith.science/paper/KPXX3D74"},"agent_actions":{"view_html":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI","download_json":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI.json","view_paper":"https://pith.science/paper/KPXX3D74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18294&json=true","fetch_graph":"https://pith.science/api/pith-number/KPXX3D74DQB23ZHFQIGVRBIDMI/graph.json","fetch_events":"https://pith.science/api/pith-number/KPXX3D74DQB23ZHFQIGVRBIDMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI/action/storage_attestation","attest_author":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI/action/author_attestation","sign_citation":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI/action/citation_signature","submit_replication":"https://pith.science/pith/KPXX3D74DQB23ZHFQIGVRBIDMI/action/replication_record"}},"created_at":"2026-07-05T08:37:21.620706+00:00","updated_at":"2026-07-05T08:37:21.620706+00:00"}