{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2P6SSOOCY63G5ASO52ODBJB5YG","short_pith_number":"pith:2P6SSOOC","schema_version":"1.0","canonical_sha256":"d3fd2939c2c7b66e824eee9c30a43dc1bf36da4c4ebc5d4bde14171bb4c50616","source":{"kind":"arxiv","id":"2607.16692","version":1},"attestation_state":"computed","paper":{"title":"Dependency-Guided Code Generation: Structured Matrix Decomposition and Consistency-Guided Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Guangyuan Dong, Hao Zhang, Kai Shu, Mingqiao Mo, Wenhua Nie, Xiaodong Fan, Xin Xiao, Yangchen Zeng, Zhaolu Kang, Zikai Xiao","submitted_at":"2026-07-18T08:01:49Z","abstract_excerpt":"The increasing complexity of modern software systems has made automated code generation a fundamental task in software engineering. However, existing approaches often fail to adequately capture the intricate, multi-level dependencies among code entities, leading to generated code that is logically incomplete or difficult to integrate into real-world systems. To address this limitation, we propose a dependency-aware code generation framework that explicitly models interactions among code entities through a graph-based representation. We decompose dependencies into two complementary components: "},"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":"2607.16692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-07-18T08:01:49Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"5e062b63f146136b226a6fbf7a95c3635712125d4d2486b395e557168954db22","abstract_canon_sha256":"b60ba7b760ee710c90010ad7a80c981c3d336be62a54145ff524e9c00a35d941"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:20:22.256178Z","signature_b64":"Eb0++CP3G7XSULPHrvas6ItgD8YJkYnamL52kY0t0X9V8soyutFCpcc4z5wnkwWjdh7ZF2qmRrDY3Hr33fEoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3fd2939c2c7b66e824eee9c30a43dc1bf36da4c4ebc5d4bde14171bb4c50616","last_reissued_at":"2026-07-21T01:20:22.255353Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:20:22.255353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dependency-Guided Code Generation: Structured Matrix Decomposition and Consistency-Guided Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Guangyuan Dong, Hao Zhang, Kai Shu, Mingqiao Mo, Wenhua Nie, Xiaodong Fan, Xin Xiao, Yangchen Zeng, Zhaolu Kang, Zikai Xiao","submitted_at":"2026-07-18T08:01:49Z","abstract_excerpt":"The increasing complexity of modern software systems has made automated code generation a fundamental task in software engineering. However, existing approaches often fail to adequately capture the intricate, multi-level dependencies among code entities, leading to generated code that is logically incomplete or difficult to integrate into real-world systems. To address this limitation, we propose a dependency-aware code generation framework that explicitly models interactions among code entities through a graph-based representation. We decompose dependencies into two complementary components: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16692","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/2607.16692/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":"2607.16692","created_at":"2026-07-21T01:20:22.255770+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16692v1","created_at":"2026-07-21T01:20:22.255770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16692","created_at":"2026-07-21T01:20:22.255770+00:00"},{"alias_kind":"pith_short_12","alias_value":"2P6SSOOCY63G","created_at":"2026-07-21T01:20:22.255770+00:00"},{"alias_kind":"pith_short_16","alias_value":"2P6SSOOCY63G5ASO","created_at":"2026-07-21T01:20:22.255770+00:00"},{"alias_kind":"pith_short_8","alias_value":"2P6SSOOC","created_at":"2026-07-21T01:20:22.255770+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/2P6SSOOCY63G5ASO52ODBJB5YG","json":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG.json","graph_json":"https://pith.science/api/pith-number/2P6SSOOCY63G5ASO52ODBJB5YG/graph.json","events_json":"https://pith.science/api/pith-number/2P6SSOOCY63G5ASO52ODBJB5YG/events.json","paper":"https://pith.science/paper/2P6SSOOC"},"agent_actions":{"view_html":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG","download_json":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG.json","view_paper":"https://pith.science/paper/2P6SSOOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16692&json=true","fetch_graph":"https://pith.science/api/pith-number/2P6SSOOCY63G5ASO52ODBJB5YG/graph.json","fetch_events":"https://pith.science/api/pith-number/2P6SSOOCY63G5ASO52ODBJB5YG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG/action/storage_attestation","attest_author":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG/action/author_attestation","sign_citation":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG/action/citation_signature","submit_replication":"https://pith.science/pith/2P6SSOOCY63G5ASO52ODBJB5YG/action/replication_record"}},"created_at":"2026-07-21T01:20:22.255770+00:00","updated_at":"2026-07-21T01:20:22.255770+00:00"}