{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RIZ2HRULWO5YJVCXD3ACDB67JI","short_pith_number":"pith:RIZ2HRUL","schema_version":"1.0","canonical_sha256":"8a33a3c68bb3bb84d4571ec02187df4a32bf65438b05608bec8e459253bd5f89","source":{"kind":"arxiv","id":"2405.20092","version":2},"attestation_state":"computed","paper":{"title":"Divide-and-Conquer Meets Consensus: Unleashing the Power of Functions in Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.CL","authors_text":"Bing Qin, Hongxuan Tang, Jingchang Chen, Ming Liu, Qianglong Chen, Zekun Wang, Zheng Chu","submitted_at":"2024-05-30T14:31:33Z","abstract_excerpt":"Despite recent progress made by large language models in code generation, they still struggle with programs that meet complex requirements. Recent work utilizes plan-and-solve decomposition to decrease the complexity and leverage self-tests to refine the generated program. Yet, planning deep-inside requirements in advance can be challenging, and the tests need to be accurate to accomplish self-improvement. To this end, we propose FunCoder, a code generation framework incorporating the divide-and-conquer strategy with functional consensus. Specifically, FunCoder recursively branches off sub-fun"},"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.20092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-05-30T14:31:33Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"7bce051c6ee0aa67b27bdbcf68f0c14fc131c8b3817b7a79e291bbd135e80c33","abstract_canon_sha256":"a64dea6a1fdfa2e6b9319ad73f16eee417629ab23675ab6d7ee8225faa782cbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:15.641637Z","signature_b64":"ks3tyM25UO0yCVdc4GcveHC9MEs7an13XaY0CW1n5MhCdnUlYCOLEqMxJUOLe1rcLSXkyyfQKprdhZx4oJJ2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a33a3c68bb3bb84d4571ec02187df4a32bf65438b05608bec8e459253bd5f89","last_reissued_at":"2026-07-05T09:30:15.641081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:15.641081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divide-and-Conquer Meets Consensus: Unleashing the Power of Functions in Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.CL","authors_text":"Bing Qin, Hongxuan Tang, Jingchang Chen, Ming Liu, Qianglong Chen, Zekun Wang, Zheng Chu","submitted_at":"2024-05-30T14:31:33Z","abstract_excerpt":"Despite recent progress made by large language models in code generation, they still struggle with programs that meet complex requirements. Recent work utilizes plan-and-solve decomposition to decrease the complexity and leverage self-tests to refine the generated program. Yet, planning deep-inside requirements in advance can be challenging, and the tests need to be accurate to accomplish self-improvement. To this end, we propose FunCoder, a code generation framework incorporating the divide-and-conquer strategy with functional consensus. Specifically, FunCoder recursively branches off sub-fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20092","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.20092/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.20092","created_at":"2026-07-05T09:30:15.641146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20092v2","created_at":"2026-07-05T09:30:15.641146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20092","created_at":"2026-07-05T09:30:15.641146+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIZ2HRULWO5Y","created_at":"2026-07-05T09:30:15.641146+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIZ2HRULWO5YJVCX","created_at":"2026-07-05T09:30:15.641146+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIZ2HRUL","created_at":"2026-07-05T09:30:15.641146+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02390","citing_title":"DecompRL: Solving Harder Problems by Learning Modular Code Generation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31511","citing_title":"Falsification, Not Exposure: An Internally Preregistered Placebo-Controlled Decomposition of Self-Repair Feedback in Frozen Small Code Models","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI","json":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI.json","graph_json":"https://pith.science/api/pith-number/RIZ2HRULWO5YJVCXD3ACDB67JI/graph.json","events_json":"https://pith.science/api/pith-number/RIZ2HRULWO5YJVCXD3ACDB67JI/events.json","paper":"https://pith.science/paper/RIZ2HRUL"},"agent_actions":{"view_html":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI","download_json":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI.json","view_paper":"https://pith.science/paper/RIZ2HRUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20092&json=true","fetch_graph":"https://pith.science/api/pith-number/RIZ2HRULWO5YJVCXD3ACDB67JI/graph.json","fetch_events":"https://pith.science/api/pith-number/RIZ2HRULWO5YJVCXD3ACDB67JI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI/action/storage_attestation","attest_author":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI/action/author_attestation","sign_citation":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI/action/citation_signature","submit_replication":"https://pith.science/pith/RIZ2HRULWO5YJVCXD3ACDB67JI/action/replication_record"}},"created_at":"2026-07-05T09:30:15.641146+00:00","updated_at":"2026-07-05T09:30:15.641146+00:00"}