{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5J6SG3MQSO7NYKKJEN6PUS2X3F","short_pith_number":"pith:5J6SG3MQ","schema_version":"1.0","canonical_sha256":"ea7d236d9093bedc2949237cfa4b57d97b019520a7151dad567b44d601172917","source":{"kind":"arxiv","id":"2608.11394","version":1},"attestation_state":"computed","paper":{"title":"GraphAlignCoder: Aligning Program and Proof Graphs for Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Kevin Leach, Yueke Zhang, Yu Huang, Zihan Fang","submitted_at":"2026-08-11T20:01:08Z","abstract_excerpt":"Code large language models (LLMs) can generate syntactically plausible programs that nevertheless violate hidden semantic constraints. Existing execution-feedback training methods identify whether a completed program fails, but provide limited supervision about how a correct solution should be organized. We introduce GraphAlignCoder, a training framework that transfers explicit correctness structure into code generation.\n  GraphAlignCoder constructs an implementation graph that captures control and dependence among program regions. In parallel, a constrained Lean pipeline produces proof traces"},"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.11394","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-11T20:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"cccce9369618d7d943cffc282f8bed898fbe587d60e39742a69211ab7d21c834","abstract_canon_sha256":"ea623d2ff05e094502cdd406d412b940bdf4e88a3436ae1b60ece79cb0e4c274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T00:21:45.318020Z","signature_b64":"9KUkXSm0Btsq3ZHdTMznSwSRzI/Kw9b8fxv/bKtccJcgLy0Mjf1Xgrc5Vpi/BrUyR8hC6A5uquhPoXo6wIiMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea7d236d9093bedc2949237cfa4b57d97b019520a7151dad567b44d601172917","last_reissued_at":"2026-08-13T00:21:45.316518Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T00:21:45.316518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphAlignCoder: Aligning Program and Proof Graphs for Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Kevin Leach, Yueke Zhang, Yu Huang, Zihan Fang","submitted_at":"2026-08-11T20:01:08Z","abstract_excerpt":"Code large language models (LLMs) can generate syntactically plausible programs that nevertheless violate hidden semantic constraints. Existing execution-feedback training methods identify whether a completed program fails, but provide limited supervision about how a correct solution should be organized. We introduce GraphAlignCoder, a training framework that transfers explicit correctness structure into code generation.\n  GraphAlignCoder constructs an implementation graph that captures control and dependence among program regions. In parallel, a constrained Lean pipeline produces proof traces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11394","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.11394/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.11394","created_at":"2026-08-13T00:21:45.316829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.11394v1","created_at":"2026-08-13T00:21:45.316829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11394","created_at":"2026-08-13T00:21:45.316829+00:00"},{"alias_kind":"pith_short_12","alias_value":"5J6SG3MQSO7N","created_at":"2026-08-13T00:21:45.316829+00:00"},{"alias_kind":"pith_short_16","alias_value":"5J6SG3MQSO7NYKKJ","created_at":"2026-08-13T00:21:45.316829+00:00"},{"alias_kind":"pith_short_8","alias_value":"5J6SG3MQ","created_at":"2026-08-13T00:21:45.316829+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/5J6SG3MQSO7NYKKJEN6PUS2X3F","json":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F.json","graph_json":"https://pith.science/api/pith-number/5J6SG3MQSO7NYKKJEN6PUS2X3F/graph.json","events_json":"https://pith.science/api/pith-number/5J6SG3MQSO7NYKKJEN6PUS2X3F/events.json","paper":"https://pith.science/paper/5J6SG3MQ"},"agent_actions":{"view_html":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F","download_json":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F.json","view_paper":"https://pith.science/paper/5J6SG3MQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.11394&json=true","fetch_graph":"https://pith.science/api/pith-number/5J6SG3MQSO7NYKKJEN6PUS2X3F/graph.json","fetch_events":"https://pith.science/api/pith-number/5J6SG3MQSO7NYKKJEN6PUS2X3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/action/storage_attestation","attest_author":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/action/author_attestation","sign_citation":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/action/citation_signature","submit_replication":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/action/replication_record"}},"created_at":"2026-08-13T00:21:45.316829+00:00","updated_at":"2026-08-13T00:21:45.316829+00:00"}