{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LF4RV56RSIGN3M4MKR6IQ5CLB7","short_pith_number":"pith:LF4RV56R","schema_version":"1.0","canonical_sha256":"59791af7d1920cddb38c547c88744b0fc9defc6225ff4a954a2e6aa79d4bd476","source":{"kind":"arxiv","id":"2608.01927","version":1},"attestation_state":"computed","paper":{"title":"Effective and Efficient Context Retrieval via Partial Dependency Graph for Repository-Level Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Haoye Wang, Jiakun Liu, Xiaoxue Ren, Zhifan Ye, Zhonghao Jiang, Zhongxin Liu","submitted_at":"2026-08-03T09:00:49Z","abstract_excerpt":"LLM-based repository-level code generation aims to generate code using the context available in a software repository, requiring LLMs to reason over complex code dependencies. Due to limited context windows and insufficient repository-specific understanding, LLMs typically rely on retrieval-augmented generation (RAG) to incorporate relevant code. Early RAG approaches primarily employ similarity-based retrieval, which often fails to retrieve code snippets that the target function depends on. Recent work introduces graph-based retrieval to model such dependencies, but typically relies on manuall"},"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":"2608.01927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-08-03T09:00:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f52137b321f3edc6394abfc397881e78b1d5446cc7a5bd941fac895f271adb9c","abstract_canon_sha256":"23aa810a6b8ab7d454f5508d9c5f8fa953759af2b8ad4e2fd105fb393c3ab32d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:07:45.486829Z","signature_b64":"E3C5PRzQjYcah3ifTWAv3DI5oECpXlAIgCBBK72KXu93xYugThcx8ZgHzWFXDnV1OH3Ey3bKWzx7gNmqQeJuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59791af7d1920cddb38c547c88744b0fc9defc6225ff4a954a2e6aa79d4bd476","last_reissued_at":"2026-08-04T02:07:45.485215Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:07:45.485215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective and Efficient Context Retrieval via Partial Dependency Graph for Repository-Level Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Haoye Wang, Jiakun Liu, Xiaoxue Ren, Zhifan Ye, Zhonghao Jiang, Zhongxin Liu","submitted_at":"2026-08-03T09:00:49Z","abstract_excerpt":"LLM-based repository-level code generation aims to generate code using the context available in a software repository, requiring LLMs to reason over complex code dependencies. Due to limited context windows and insufficient repository-specific understanding, LLMs typically rely on retrieval-augmented generation (RAG) to incorporate relevant code. Early RAG approaches primarily employ similarity-based retrieval, which often fails to retrieve code snippets that the target function depends on. Recent work introduces graph-based retrieval to model such dependencies, but typically relies on manuall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01927","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/2608.01927/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":"2608.01927","created_at":"2026-08-04T02:07:45.486717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01927v1","created_at":"2026-08-04T02:07:45.486717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01927","created_at":"2026-08-04T02:07:45.486717+00:00"},{"alias_kind":"pith_short_12","alias_value":"LF4RV56RSIGN","created_at":"2026-08-04T02:07:45.486717+00:00"},{"alias_kind":"pith_short_16","alias_value":"LF4RV56RSIGN3M4M","created_at":"2026-08-04T02:07:45.486717+00:00"},{"alias_kind":"pith_short_8","alias_value":"LF4RV56R","created_at":"2026-08-04T02:07:45.486717+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/LF4RV56RSIGN3M4MKR6IQ5CLB7","json":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7.json","graph_json":"https://pith.science/api/pith-number/LF4RV56RSIGN3M4MKR6IQ5CLB7/graph.json","events_json":"https://pith.science/api/pith-number/LF4RV56RSIGN3M4MKR6IQ5CLB7/events.json","paper":"https://pith.science/paper/LF4RV56R"},"agent_actions":{"view_html":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7","download_json":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7.json","view_paper":"https://pith.science/paper/LF4RV56R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01927&json=true","fetch_graph":"https://pith.science/api/pith-number/LF4RV56RSIGN3M4MKR6IQ5CLB7/graph.json","fetch_events":"https://pith.science/api/pith-number/LF4RV56RSIGN3M4MKR6IQ5CLB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7/action/storage_attestation","attest_author":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7/action/author_attestation","sign_citation":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7/action/citation_signature","submit_replication":"https://pith.science/pith/LF4RV56RSIGN3M4MKR6IQ5CLB7/action/replication_record"}},"created_at":"2026-08-04T02:07:45.486717+00:00","updated_at":"2026-08-04T02:07:45.486717+00:00"}