{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FMKW5TWVSOCHJ7IYIHEDDUZ6GS","short_pith_number":"pith:FMKW5TWV","schema_version":"1.0","canonical_sha256":"2b156eced5938474fd1841c831d33e34bdbff6995ab4ce420ae7294ffbd798ee","source":{"kind":"arxiv","id":"2410.03234","version":1},"attestation_state":"computed","paper":{"title":"Showing LLM-Generated Code Selectively Based on Confidence of LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Ge Li, Jia Li, Yongmin Li, Yuqi Zhu, Zhi Jin","submitted_at":"2024-10-04T08:51:31Z","abstract_excerpt":"Large Language Models (LLMs) have shown impressive abilities in code generation, but they may generate erroneous programs. Reading a program takes ten times longer than writing it. Showing these erroneous programs to developers will waste developers' energies and introduce security risks to software.\n  To address the above limitations, we propose HonestCoder, a novel LLM-based code generation approach. HonestCoder selectively shows the generated programs to developers based on LLMs' confidence. The confidence provides valuable insights into the correctness of generated programs. To achieve thi"},"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.03234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-10-04T08:51:31Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6d6593922857c68b738b19d1b73369c204053ccfd70b890bae415a8681d5df9e","abstract_canon_sha256":"91e8ed99c0616dbb9b9c29a27c8f6879eaebe9e6e3a0009200ab87a76f587336"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:46.640298Z","signature_b64":"VwXDpsxmjvqi/xboHLHdQuvStKttvFn2PfQ+zyvggTGjTaiAXdgbwLKlD+OJ/geheYKgwCXfZIU1aARIwvnxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b156eced5938474fd1841c831d33e34bdbff6995ab4ce420ae7294ffbd798ee","last_reissued_at":"2026-07-05T09:15:46.639866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:46.639866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Showing LLM-Generated Code Selectively Based on Confidence of LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Ge Li, Jia Li, Yongmin Li, Yuqi Zhu, Zhi Jin","submitted_at":"2024-10-04T08:51:31Z","abstract_excerpt":"Large Language Models (LLMs) have shown impressive abilities in code generation, but they may generate erroneous programs. Reading a program takes ten times longer than writing it. Showing these erroneous programs to developers will waste developers' energies and introduce security risks to software.\n  To address the above limitations, we propose HonestCoder, a novel LLM-based code generation approach. HonestCoder selectively shows the generated programs to developers based on LLMs' confidence. The confidence provides valuable insights into the correctness of generated programs. To achieve thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03234","kind":"arxiv","version":1},"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.03234/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.03234","created_at":"2026-07-05T09:15:46.639925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03234v1","created_at":"2026-07-05T09:15:46.639925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03234","created_at":"2026-07-05T09:15:46.639925+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMKW5TWVSOCH","created_at":"2026-07-05T09:15:46.639925+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMKW5TWVSOCHJ7IY","created_at":"2026-07-05T09:15:46.639925+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMKW5TWV","created_at":"2026-07-05T09:15:46.639925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09023","citing_title":"Using Semantic Distance to Estimate Uncertainty in LLM-Based Code Generation","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS","json":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS.json","graph_json":"https://pith.science/api/pith-number/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/graph.json","events_json":"https://pith.science/api/pith-number/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/events.json","paper":"https://pith.science/paper/FMKW5TWV"},"agent_actions":{"view_html":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS","download_json":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS.json","view_paper":"https://pith.science/paper/FMKW5TWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03234&json=true","fetch_graph":"https://pith.science/api/pith-number/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/graph.json","fetch_events":"https://pith.science/api/pith-number/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/action/storage_attestation","attest_author":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/action/author_attestation","sign_citation":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/action/citation_signature","submit_replication":"https://pith.science/pith/FMKW5TWVSOCHJ7IYIHEDDUZ6GS/action/replication_record"}},"created_at":"2026-07-05T09:15:46.639925+00:00","updated_at":"2026-07-05T09:15:46.639925+00:00"}