{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XEYQNDNZJRN7IV4QEVPOF37OH2","short_pith_number":"pith:XEYQNDNZ","schema_version":"1.0","canonical_sha256":"b931068db94c5bf45790255ee2efee3e806d12b17f3248580d7d9daacdeee258","source":{"kind":"arxiv","id":"2409.12699","version":1},"attestation_state":"computed","paper":{"title":"PromSec: Prompt Optimization for Secure Generation of Functional Source Code with Large Language Models (LLMs)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Abdallah Khreishah, Issa Khalil, Mahmoud Nazzal, NHatHai Phan","submitted_at":"2024-09-19T12:14:10Z","abstract_excerpt":"The capability of generating high-quality source code using large language models (LLMs) reduces software development time and costs. However, they often introduce security vulnerabilities due to training on insecure open-source data. This highlights the need for ensuring secure and functional code generation. This paper introduces PromSec, an algorithm for prom optimization for secure and functioning code generation using LLMs. In PromSec, we combine 1) code vulnerability clearing using a generative adversarial graph neural network, dubbed as gGAN, to fix and reduce security vulnerabilities i"},"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":"2409.12699","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-09-19T12:14:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cf81765244372a1849457a2a90b0c75bbfa4a6a399142b7e93caecb8a41db0b6","abstract_canon_sha256":"90c95ecdeccaeac2cc037d5e7e8eab9fdd33c3a765a0ca3f30051c33e2a42548"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:10.892718Z","signature_b64":"sn6EIcBHnGdisO83IcQwXKaQbRA6qO/S7eWKdGvObvsi+nJcD35LgpvTOvlpPakDDvK+px1KzMmqolWRLCOmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b931068db94c5bf45790255ee2efee3e806d12b17f3248580d7d9daacdeee258","last_reissued_at":"2026-07-05T09:09:10.892204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:10.892204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PromSec: Prompt Optimization for Secure Generation of Functional Source Code with Large Language Models (LLMs)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Abdallah Khreishah, Issa Khalil, Mahmoud Nazzal, NHatHai Phan","submitted_at":"2024-09-19T12:14:10Z","abstract_excerpt":"The capability of generating high-quality source code using large language models (LLMs) reduces software development time and costs. However, they often introduce security vulnerabilities due to training on insecure open-source data. This highlights the need for ensuring secure and functional code generation. This paper introduces PromSec, an algorithm for prom optimization for secure and functioning code generation using LLMs. In PromSec, we combine 1) code vulnerability clearing using a generative adversarial graph neural network, dubbed as gGAN, to fix and reduce security vulnerabilities i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12699","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/2409.12699/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":"2409.12699","created_at":"2026-07-05T09:09:10.892265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12699v1","created_at":"2026-07-05T09:09:10.892265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12699","created_at":"2026-07-05T09:09:10.892265+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEYQNDNZJRN7","created_at":"2026-07-05T09:09:10.892265+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEYQNDNZJRN7IV4Q","created_at":"2026-07-05T09:09:10.892265+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEYQNDNZ","created_at":"2026-07-05T09:09:10.892265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09740","citing_title":"Security Tests as Executable Specifications for LLM Code Generation: Benefits, Trade-offs, and Coverage Limits","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2","json":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2.json","graph_json":"https://pith.science/api/pith-number/XEYQNDNZJRN7IV4QEVPOF37OH2/graph.json","events_json":"https://pith.science/api/pith-number/XEYQNDNZJRN7IV4QEVPOF37OH2/events.json","paper":"https://pith.science/paper/XEYQNDNZ"},"agent_actions":{"view_html":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2","download_json":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2.json","view_paper":"https://pith.science/paper/XEYQNDNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12699&json=true","fetch_graph":"https://pith.science/api/pith-number/XEYQNDNZJRN7IV4QEVPOF37OH2/graph.json","fetch_events":"https://pith.science/api/pith-number/XEYQNDNZJRN7IV4QEVPOF37OH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2/action/storage_attestation","attest_author":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2/action/author_attestation","sign_citation":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2/action/citation_signature","submit_replication":"https://pith.science/pith/XEYQNDNZJRN7IV4QEVPOF37OH2/action/replication_record"}},"created_at":"2026-07-05T09:09:10.892265+00:00","updated_at":"2026-07-05T09:09:10.892265+00:00"}