{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5J6SG3MQSO7NYKKJEN6PUS2X3F","short_pith_number":"pith:5J6SG3MQ","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"},"canonical_sha256":"ea7d236d9093bedc2949237cfa4b57d97b019520a7151dad567b44d601172917","source":{"kind":"arxiv","id":"2608.11394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11394","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11394v1","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11394","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"5J6SG3MQSO7N","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"pith_short_16","alias_value":"5J6SG3MQSO7NYKKJ","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"pith_short_8","alias_value":"5J6SG3MQ","created_at":"2026-08-13T00:21:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5J6SG3MQSO7NYKKJEN6PUS2X3F","target":"record","payload":{"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"},"canonical_sha256":"ea7d236d9093bedc2949237cfa4b57d97b019520a7151dad567b44d601172917","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"},"source_kind":"arxiv","source_id":"2608.11394","source_version":1,"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-08-13T00:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kwhh05t5IAuYzmCk5f1WZVycP8qdEX5aWrWUbcFZWQcNKwZI8fmjojV73C7mNveMa+s7VInFEtT0j23qznUVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:35:57.574982Z"},"content_sha256":"f196a2d72f2a8576b5c55419328f3f1a26ccb5a6b32c625d81507b7278766d7f","schema_version":"1.0","event_id":"sha256:f196a2d72f2a8576b5c55419328f3f1a26ccb5a6b32c625d81507b7278766d7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5J6SG3MQSO7NYKKJEN6PUS2X3F","target":"graph","payload":{"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"},"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-08-13T00:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffLvagS9Z/3+GVX5V3ui7I8+HOGwxjv+6SAyi+zOqTKEJp/dHIUYs2xHbSBqGwUseY3JX92ajFS8++4bDoB1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:35:57.575475Z"},"content_sha256":"5327f9c327f05f7da3df68838723d49663ca80be9a66de47eb1625bff3838946","schema_version":"1.0","event_id":"sha256:5327f9c327f05f7da3df68838723d49663ca80be9a66de47eb1625bff3838946"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/bundle.json","state_url":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/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-19T09:35:57Z","links":{"resolver":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F","bundle":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/bundle.json","state":"https://pith.science/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5J6SG3MQSO7NYKKJEN6PUS2X3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5J6SG3MQSO7NYKKJEN6PUS2X3F","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":"ea623d2ff05e094502cdd406d412b940bdf4e88a3436ae1b60ece79cb0e4c274","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-11T20:01:08Z","title_canon_sha256":"cccce9369618d7d943cffc282f8bed898fbe587d60e39742a69211ab7d21c834"},"schema_version":"1.0","source":{"id":"2608.11394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11394","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11394v1","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11394","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"5J6SG3MQSO7N","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"pith_short_16","alias_value":"5J6SG3MQSO7NYKKJ","created_at":"2026-08-13T00:21:45Z"},{"alias_kind":"pith_short_8","alias_value":"5J6SG3MQ","created_at":"2026-08-13T00:21:45Z"}],"graph_snapshots":[{"event_id":"sha256:5327f9c327f05f7da3df68838723d49663ca80be9a66de47eb1625bff3838946","target":"graph","created_at":"2026-08-13T00:21:45Z","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/2608.11394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kevin Leach, Yueke Zhang, Yu Huang, Zihan Fang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-11T20:01:08Z","title":"GraphAlignCoder: Aligning Program and Proof Graphs for Code Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11394","kind":"arxiv","version":1},"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:f196a2d72f2a8576b5c55419328f3f1a26ccb5a6b32c625d81507b7278766d7f","target":"record","created_at":"2026-08-13T00:21:45Z","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":"ea623d2ff05e094502cdd406d412b940bdf4e88a3436ae1b60ece79cb0e4c274","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-11T20:01:08Z","title_canon_sha256":"cccce9369618d7d943cffc282f8bed898fbe587d60e39742a69211ab7d21c834"},"schema_version":"1.0","source":{"id":"2608.11394","kind":"arxiv","version":1}},"canonical_sha256":"ea7d236d9093bedc2949237cfa4b57d97b019520a7151dad567b44d601172917","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea7d236d9093bedc2949237cfa4b57d97b019520a7151dad567b44d601172917","first_computed_at":"2026-08-13T00:21:45.316518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-13T00:21:45.316518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9KUkXSm0Btsq3ZHdTMznSwSRzI/Kw9b8fxv/bKtccJcgLy0Mjf1Xgrc5Vpi/BrUyR8hC6A5uquhPoXo6wIiMCw==","signature_status":"signed_v1","signed_at":"2026-08-13T00:21:45.318020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f196a2d72f2a8576b5c55419328f3f1a26ccb5a6b32c625d81507b7278766d7f","sha256:5327f9c327f05f7da3df68838723d49663ca80be9a66de47eb1625bff3838946"],"state_sha256":"83a4546f266357353dfffd18f29f0e7f4cfd642a65cc1e50e01496dd468f2337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOyKnY3llehA6svuFSkfuqGQ6xJZguQZoX+pBVooYU5ViuhPnzMgsz95aGW6gRCV4iBt077sScXdsTRWPbXOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T09:35:57.579017Z","bundle_sha256":"74e1aa6a23116bdfd6a2d503af18cdd377ca3a3e300cf55b374eee081d6e1721"}}