{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AENOPH4KGN6TQ5DCVOBAJN4VBY","short_pith_number":"pith:AENOPH4K","schema_version":"1.0","canonical_sha256":"011ae79f8a337d387462ab8204b7950e3cee80e217c4e31d019385e8e687cacf","source":{"kind":"arxiv","id":"2406.12502","version":2},"attestation_state":"computed","paper":{"title":"Code-Optimise: Self-Generated Preference Data for Correctness and Efficiency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Gerasimos Lampouras, Ignacio Iacobacci, Leonidas Gee, Milan Gritta","submitted_at":"2024-06-18T11:05:37Z","abstract_excerpt":"Code Language Models have been trained to generate accurate solutions, typically with no regard for runtime. On the other hand, previous works that explored execution optimisation have observed corresponding drops in functional correctness. To that end, we introduce Code-Optimise, a framework that incorporates both correctness (passed, failed) and runtime (quick, slow) as learning signals via self-generated preference data. Our framework is both lightweight and robust as it dynamically selects solutions to reduce overfitting while avoiding a reliance on larger models for learning signals. Code"},"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":"2406.12502","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-18T11:05:37Z","cross_cats_sorted":[],"title_canon_sha256":"11489f7ff4f68e91b948a3429bd52ac0e61f2b66832a383b475c31cf568ece22","abstract_canon_sha256":"431a8cbc0dd17a4955c77940830c95ab6d8e3701bd253d1c4bb0399513e38984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:44.895553Z","signature_b64":"fs7HQNsGxvfy0lK/34/vIN+MVeUC6UTc11RIz5JfpmYV5rXI7nLG77LY4ReUl5wl7d+RvypNPfOUu7XDZR5YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"011ae79f8a337d387462ab8204b7950e3cee80e217c4e31d019385e8e687cacf","last_reissued_at":"2026-07-05T10:09:44.895050Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:44.895050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code-Optimise: Self-Generated Preference Data for Correctness and Efficiency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Gerasimos Lampouras, Ignacio Iacobacci, Leonidas Gee, Milan Gritta","submitted_at":"2024-06-18T11:05:37Z","abstract_excerpt":"Code Language Models have been trained to generate accurate solutions, typically with no regard for runtime. On the other hand, previous works that explored execution optimisation have observed corresponding drops in functional correctness. To that end, we introduce Code-Optimise, a framework that incorporates both correctness (passed, failed) and runtime (quick, slow) as learning signals via self-generated preference data. Our framework is both lightweight and robust as it dynamically selects solutions to reduce overfitting while avoiding a reliance on larger models for learning signals. Code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12502","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/2406.12502/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":"2406.12502","created_at":"2026-07-05T10:09:44.895109+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12502v2","created_at":"2026-07-05T10:09:44.895109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12502","created_at":"2026-07-05T10:09:44.895109+00:00"},{"alias_kind":"pith_short_12","alias_value":"AENOPH4KGN6T","created_at":"2026-07-05T10:09:44.895109+00:00"},{"alias_kind":"pith_short_16","alias_value":"AENOPH4KGN6TQ5DC","created_at":"2026-07-05T10:09:44.895109+00:00"},{"alias_kind":"pith_short_8","alias_value":"AENOPH4K","created_at":"2026-07-05T10:09:44.895109+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17683","citing_title":"Bridging Functional Correctness and Runtime Efficiency Gaps in LLM-Based Code Translation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06826","citing_title":"SkelDPO: A Skeleton-Guided Direct Preference Optimization Framework for Efficient Code Generation","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2601.00376","citing_title":"In Line with Context: Repository-Level Code Generation via Context Inlining","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12545","citing_title":"CROP: Expert-Aligned Image Cropping via Compositional Reasoning and Optimizing Preference","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY","json":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY.json","graph_json":"https://pith.science/api/pith-number/AENOPH4KGN6TQ5DCVOBAJN4VBY/graph.json","events_json":"https://pith.science/api/pith-number/AENOPH4KGN6TQ5DCVOBAJN4VBY/events.json","paper":"https://pith.science/paper/AENOPH4K"},"agent_actions":{"view_html":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY","download_json":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY.json","view_paper":"https://pith.science/paper/AENOPH4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12502&json=true","fetch_graph":"https://pith.science/api/pith-number/AENOPH4KGN6TQ5DCVOBAJN4VBY/graph.json","fetch_events":"https://pith.science/api/pith-number/AENOPH4KGN6TQ5DCVOBAJN4VBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY/action/storage_attestation","attest_author":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY/action/author_attestation","sign_citation":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY/action/citation_signature","submit_replication":"https://pith.science/pith/AENOPH4KGN6TQ5DCVOBAJN4VBY/action/replication_record"}},"created_at":"2026-07-05T10:09:44.895109+00:00","updated_at":"2026-07-05T10:09:44.895109+00:00"}