{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KRJSEIOP7PEAVIW2KBSIEOAFMC","short_pith_number":"pith:KRJSEIOP","schema_version":"1.0","canonical_sha256":"54532221cffbc80aa2da506482380560bdbf2f43814106c4a07eeaf8a75ea429","source":{"kind":"arxiv","id":"2405.17057","version":2},"attestation_state":"computed","paper":{"title":"ReflectionCoder: Learning from Reflection Sequence for Enhanced One-off Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Aojun Zhou, Hongsheng Li, Houxing Ren, Junting Pan, Mingjie Zhan, Zhongyuan Wu","submitted_at":"2024-05-27T11:27:00Z","abstract_excerpt":"Code generation plays a crucial role in various tasks, such as code auto-completion and mathematical reasoning. Previous work has proposed numerous methods to enhance code generation performance, including integrating feedback from the compiler. Inspired by this, we present ReflectionCoder, a novel approach that effectively leverages reflection sequences constructed by integrating compiler feedback to improve one-off code generation performance. Furthermore, we propose reflection self-distillation and dynamically masked distillation to effectively utilize these reflection sequences. Extensive "},"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":"2405.17057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-05-27T11:27:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ae3a0c7380b05df732cdfaef2f7292612371992792b02f32bb98725c3fa5f9f8","abstract_canon_sha256":"32c268d46b317d29aa6689f2e95f86c338492c76db7ba2095c15e3411eecc745"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:32.235173Z","signature_b64":"MiXDqIRp4z5TimmfYMxkZB3z7dEKeCXXtNqnXHP+K3MIH/QlWEyAzK6tvn6pBxE7mEzbbQ7aNmnaaagzOQrLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54532221cffbc80aa2da506482380560bdbf2f43814106c4a07eeaf8a75ea429","last_reissued_at":"2026-07-05T11:11:32.234659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:32.234659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReflectionCoder: Learning from Reflection Sequence for Enhanced One-off Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Aojun Zhou, Hongsheng Li, Houxing Ren, Junting Pan, Mingjie Zhan, Zhongyuan Wu","submitted_at":"2024-05-27T11:27:00Z","abstract_excerpt":"Code generation plays a crucial role in various tasks, such as code auto-completion and mathematical reasoning. Previous work has proposed numerous methods to enhance code generation performance, including integrating feedback from the compiler. Inspired by this, we present ReflectionCoder, a novel approach that effectively leverages reflection sequences constructed by integrating compiler feedback to improve one-off code generation performance. Furthermore, we propose reflection self-distillation and dynamically masked distillation to effectively utilize these reflection sequences. Extensive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17057","kind":"arxiv","version":2},"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/2405.17057/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":"2405.17057","created_at":"2026-07-05T11:11:32.234720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17057v2","created_at":"2026-07-05T11:11:32.234720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17057","created_at":"2026-07-05T11:11:32.234720+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRJSEIOP7PEA","created_at":"2026-07-05T11:11:32.234720+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRJSEIOP7PEAVIW2","created_at":"2026-07-05T11:11:32.234720+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRJSEIOP","created_at":"2026-07-05T11:11:32.234720+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07748","citing_title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC","json":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC.json","graph_json":"https://pith.science/api/pith-number/KRJSEIOP7PEAVIW2KBSIEOAFMC/graph.json","events_json":"https://pith.science/api/pith-number/KRJSEIOP7PEAVIW2KBSIEOAFMC/events.json","paper":"https://pith.science/paper/KRJSEIOP"},"agent_actions":{"view_html":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC","download_json":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC.json","view_paper":"https://pith.science/paper/KRJSEIOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17057&json=true","fetch_graph":"https://pith.science/api/pith-number/KRJSEIOP7PEAVIW2KBSIEOAFMC/graph.json","fetch_events":"https://pith.science/api/pith-number/KRJSEIOP7PEAVIW2KBSIEOAFMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC/action/storage_attestation","attest_author":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC/action/author_attestation","sign_citation":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC/action/citation_signature","submit_replication":"https://pith.science/pith/KRJSEIOP7PEAVIW2KBSIEOAFMC/action/replication_record"}},"created_at":"2026-07-05T11:11:32.234720+00:00","updated_at":"2026-07-05T11:11:32.234720+00:00"}