{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6YGO7YE4BJ37SP6EN7CT3HP37R","short_pith_number":"pith:6YGO7YE4","schema_version":"1.0","canonical_sha256":"f60cefe09c0a77f93fc46fc53d9dfbfc519e220e18e13dd0a237c4d5ffeb6807","source":{"kind":"arxiv","id":"2410.10209","version":4},"attestation_state":"computed","paper":{"title":"EffiCoder: Enhancing Code Generation in Large Language Models through Efficiency-Aware Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.CL","authors_text":"Dong Huang, Guangtao Zeng, Han Weng, Heming Cui, Jianbo Dai, Jie M. Zhang, Meng Luo, Yuhao Qing, Zhijiang Guo","submitted_at":"2024-10-14T07:05:51Z","abstract_excerpt":"As large language models (LLMs) play an increasingly important role in code generation, enhancing both correctness and efficiency has become crucial. Current methods primarily focus on correctness, often overlooking efficiency. To address this gap, we introduce EffiCoder to improve both aspects by fine-tuning LLMs on a high-quality dataset comprising correct and efficient code samples. Our methodology involves leveraging multiple LLMs to generate diverse candidate code solutions for various tasks across different programming languages. We then evaluate these solutions by measuring their execut"},"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":"2410.10209","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-14T07:05:51Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"1b618a0f8a02710fb1bd5699cede51ef1c8778f3e1b4662369d5764f0711b782","abstract_canon_sha256":"fd7d860ff0dc69ab440615bbaa73a4c8c4458e54f790e12352f3a1f137a87bd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:36.975466Z","signature_b64":"XV6ouTKyLakyhcnGh9egQNCBwXNgMMkp1PejUyOlhAkjljlVkFi4SYhx6PG2/7bnm9BgtA0ZIQ0Fq7o94Oz3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60cefe09c0a77f93fc46fc53d9dfbfc519e220e18e13dd0a237c4d5ffeb6807","last_reissued_at":"2026-07-05T11:21:36.974916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:36.974916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EffiCoder: Enhancing Code Generation in Large Language Models through Efficiency-Aware Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.CL","authors_text":"Dong Huang, Guangtao Zeng, Han Weng, Heming Cui, Jianbo Dai, Jie M. Zhang, Meng Luo, Yuhao Qing, Zhijiang Guo","submitted_at":"2024-10-14T07:05:51Z","abstract_excerpt":"As large language models (LLMs) play an increasingly important role in code generation, enhancing both correctness and efficiency has become crucial. Current methods primarily focus on correctness, often overlooking efficiency. To address this gap, we introduce EffiCoder to improve both aspects by fine-tuning LLMs on a high-quality dataset comprising correct and efficient code samples. Our methodology involves leveraging multiple LLMs to generate diverse candidate code solutions for various tasks across different programming languages. We then evaluate these solutions by measuring their execut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10209","kind":"arxiv","version":4},"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/2410.10209/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":"2410.10209","created_at":"2026-07-05T11:21:36.974975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10209v4","created_at":"2026-07-05T11:21:36.974975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10209","created_at":"2026-07-05T11:21:36.974975+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YGO7YE4BJ37","created_at":"2026-07-05T11:21:36.974975+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YGO7YE4BJ37SP6E","created_at":"2026-07-05T11:21:36.974975+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YGO7YE4","created_at":"2026-07-05T11:21:36.974975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.14018","citing_title":"PerfCoder: Large Language Models for Interpretable Code Performance Optimization","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R","json":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R.json","graph_json":"https://pith.science/api/pith-number/6YGO7YE4BJ37SP6EN7CT3HP37R/graph.json","events_json":"https://pith.science/api/pith-number/6YGO7YE4BJ37SP6EN7CT3HP37R/events.json","paper":"https://pith.science/paper/6YGO7YE4"},"agent_actions":{"view_html":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R","download_json":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R.json","view_paper":"https://pith.science/paper/6YGO7YE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10209&json=true","fetch_graph":"https://pith.science/api/pith-number/6YGO7YE4BJ37SP6EN7CT3HP37R/graph.json","fetch_events":"https://pith.science/api/pith-number/6YGO7YE4BJ37SP6EN7CT3HP37R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R/action/storage_attestation","attest_author":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R/action/author_attestation","sign_citation":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R/action/citation_signature","submit_replication":"https://pith.science/pith/6YGO7YE4BJ37SP6EN7CT3HP37R/action/replication_record"}},"created_at":"2026-07-05T11:21:36.974975+00:00","updated_at":"2026-07-05T11:21:36.974975+00:00"}