{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CUPB2KUCZZKM5J4MSP5UETCLVX","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":"a75fdc9b45a13d75175d2e1a4e212ac1c0dbd368a262a3b47cb0beb5fef13b11","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-27T03:07:34Z","title_canon_sha256":"79397225d84a9ac4a9526c03c4a93fa999653c1e5612ac53e4e358d873e7eaec"},"schema_version":"1.0","source":{"id":"2604.23989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.23989","created_at":"2026-06-24T01:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"2604.23989v2","created_at":"2026-06-24T01:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23989","created_at":"2026-06-24T01:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"CUPB2KUCZZKM","created_at":"2026-06-24T01:15:03Z"},{"alias_kind":"pith_short_16","alias_value":"CUPB2KUCZZKM5J4M","created_at":"2026-06-24T01:15:03Z"},{"alias_kind":"pith_short_8","alias_value":"CUPB2KUC","created_at":"2026-06-24T01:15:03Z"}],"graph_snapshots":[{"event_id":"sha256:1baca533e1420ee251cdd82ea8a7428793b53702aec251ee7167a90eb7d9c806","target":"graph","created_at":"2026-06-24T01:15:03Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experiments on several code generation benchmarks suggest that IRTD achieves inference performance comparable to state-of-the-art methods. Because of the simplicity of IRTD, we theoretically establish the safety of IRTD using Oracle-Guided Inductive Synthesis (OGIS)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the theoretical safety proof via Oracle-Guided Inductive Synthesis applies directly to the practical IRTD implementation and that benchmark results generalize without detailed statistical controls or error analysis."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"IRTD fixes initial codes and iteratively refines textual directions to achieve safe multi-turn code correction with performance comparable to the more complex Scattered Forest Search method."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Fixing initial codes and iteratively refining textual directions achieves comparable performance to state-of-the-art code correction methods and permits a formal safety proof."}],"snapshot_sha256":"3735d478e983e498c896a6e990915b33afb289bfd3e373174b325fcc73793ff6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T07:41:10.237904Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:32:58.359341Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.23989/integrity.json","findings":[],"snapshot_sha256":"6ea6f06892288e887af5e3d0c40818f3c7b698e2a2adb04304aa6cbdf0a62a0b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work on large language models (LLMs) has emphasized the importance of scaling inference compute. From this perspective, the state-of-the-art method Scattered Forest Search (SFS) has been proposed, employing Monte Carlo Tree Search with carefully crafted initial seeds and textual optimization for multi-turn program correction. However, its complexity makes it unclear what factors contribute to improvements in inference performance. To address this problem, we analyze SFS and propose a simpler method, \\textsc{Iterative Refinement of Repair Instructions} (IRRI), which fixes initial program","authors_text":"Issei Sato, Yuto Tanaka","cross_cats":["cs.AI"],"headline":"Fixing initial codes and iteratively refining textual directions achieves comparable performance to state-of-the-art code correction methods and permits a formal safety proof.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-27T03:07:34Z","title":"Fix Initial Programs and Iteratively Refine Repair Instructions Toward Non-Elimination Multi-Turn Program Correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.23989","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T04:25:09.839754Z","id":"feeed88d-b22f-434d-9c4e-501a2edeb61a","model_set":{"reader":"grok-4.3"},"one_line_summary":"IRTD fixes initial codes and iteratively refines textual directions to achieve safe multi-turn code correction with performance comparable to the more complex Scattered Forest Search method.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Fixing initial codes and iteratively refining textual directions achieves comparable performance to state-of-the-art code correction methods and permits a formal safety proof.","strongest_claim":"Experiments on several code generation benchmarks suggest that IRTD achieves inference performance comparable to state-of-the-art methods. Because of the simplicity of IRTD, we theoretically establish the safety of IRTD using Oracle-Guided Inductive Synthesis (OGIS).","weakest_assumption":"That the theoretical safety proof via Oracle-Guided Inductive Synthesis applies directly to the practical IRTD implementation and that benchmark results generalize without detailed statistical controls or error analysis."}},"verdict_id":"feeed88d-b22f-434d-9c4e-501a2edeb61a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b26cdb876c924e33091da546e3c0e6b74dd909d5453dd881b0dbc469b95e7d2b","target":"record","created_at":"2026-06-24T01:15:03Z","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":"a75fdc9b45a13d75175d2e1a4e212ac1c0dbd368a262a3b47cb0beb5fef13b11","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-27T03:07:34Z","title_canon_sha256":"79397225d84a9ac4a9526c03c4a93fa999653c1e5612ac53e4e358d873e7eaec"},"schema_version":"1.0","source":{"id":"2604.23989","kind":"arxiv","version":2}},"canonical_sha256":"151e1d2a82ce54cea78c93fb424c4badf7cdd05c20ac517259c992554d10e6de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"151e1d2a82ce54cea78c93fb424c4badf7cdd05c20ac517259c992554d10e6de","first_computed_at":"2026-06-24T01:15:03.049046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:03.049046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hmggSIBvUpIhYjNt1tppUBJeMr3fLHaV4QyxMDJOZysS8EPaThaC8NPdUuVYGOrlXBlJ9ZgS+d9YEzeYmKLbCA==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:03.049472Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.23989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b26cdb876c924e33091da546e3c0e6b74dd909d5453dd881b0dbc469b95e7d2b","sha256:1baca533e1420ee251cdd82ea8a7428793b53702aec251ee7167a90eb7d9c806"],"state_sha256":"360fbe7c9e55672a15bf450e49f8122b99863a345dc351d070a3b4bbbc25cd6f"}