{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2IEONRGWHMPXR5DTXETJADWX3C","short_pith_number":"pith:2IEONRGW","schema_version":"1.0","canonical_sha256":"d208e6c4d63b1f78f473b926900ed7d896dc504e15069fbafd7c5290d38ba5eb","source":{"kind":"arxiv","id":"2406.04379","version":1},"attestation_state":"computed","paper":{"title":"VHDL-Eval: A Framework for Evaluating Large Language Models in VHDL Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.SE","authors_text":"Apoorva Nitsure, Charles Mackin, David Beymer, Ehsan Degan, Luyao Shi, Prashanth Vijayaraghavan, Stefano Ambrogio","submitted_at":"2024-06-06T00:06:50Z","abstract_excerpt":"With the unprecedented advancements in Large Language Models (LLMs), their application domains have expanded to include code generation tasks across various programming languages. While significant progress has been made in enhancing LLMs for popular programming languages, there exists a notable gap in comprehensive evaluation frameworks tailored for Hardware Description Languages (HDLs), particularly VHDL. This paper addresses this gap by introducing a comprehensive evaluation framework designed specifically for assessing LLM performance in VHDL code generation task. We construct a dataset fo"},"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.04379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-06-06T00:06:50Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"1f5305b4398f5661d7daf975e624740c962b3a5c4f113188c97a7ac10269b33c","abstract_canon_sha256":"96aaaa5c58c745a989da7ced8a5cdcef6ad69497a3dd67d2a45be215bb71f206"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:43.249357Z","signature_b64":"/sdry71L03Ut+B3zjI0sWogfoMBJFQkJNAMVzmOVSNCkyG8PjCO9kaJTRoBUzYotEcRyYVK1mFfQ8XabWL20AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d208e6c4d63b1f78f473b926900ed7d896dc504e15069fbafd7c5290d38ba5eb","last_reissued_at":"2026-07-05T08:28:43.248864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:43.248864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VHDL-Eval: A Framework for Evaluating Large Language Models in VHDL Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.SE","authors_text":"Apoorva Nitsure, Charles Mackin, David Beymer, Ehsan Degan, Luyao Shi, Prashanth Vijayaraghavan, Stefano Ambrogio","submitted_at":"2024-06-06T00:06:50Z","abstract_excerpt":"With the unprecedented advancements in Large Language Models (LLMs), their application domains have expanded to include code generation tasks across various programming languages. While significant progress has been made in enhancing LLMs for popular programming languages, there exists a notable gap in comprehensive evaluation frameworks tailored for Hardware Description Languages (HDLs), particularly VHDL. This paper addresses this gap by introducing a comprehensive evaluation framework designed specifically for assessing LLM performance in VHDL code generation task. We construct a dataset fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04379","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/2406.04379/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.04379","created_at":"2026-07-05T08:28:43.248931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.04379v1","created_at":"2026-07-05T08:28:43.248931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04379","created_at":"2026-07-05T08:28:43.248931+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IEONRGWHMPX","created_at":"2026-07-05T08:28:43.248931+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IEONRGWHMPXR5DT","created_at":"2026-07-05T08:28:43.248931+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IEONRGW","created_at":"2026-07-05T08:28:43.248931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04246","citing_title":"StepPRM-RTL: Stepwise Process-Reward Guided LLM Fine-Tuning for Enhanced RTL Synthesis","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C","json":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C.json","graph_json":"https://pith.science/api/pith-number/2IEONRGWHMPXR5DTXETJADWX3C/graph.json","events_json":"https://pith.science/api/pith-number/2IEONRGWHMPXR5DTXETJADWX3C/events.json","paper":"https://pith.science/paper/2IEONRGW"},"agent_actions":{"view_html":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C","download_json":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C.json","view_paper":"https://pith.science/paper/2IEONRGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.04379&json=true","fetch_graph":"https://pith.science/api/pith-number/2IEONRGWHMPXR5DTXETJADWX3C/graph.json","fetch_events":"https://pith.science/api/pith-number/2IEONRGWHMPXR5DTXETJADWX3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C/action/storage_attestation","attest_author":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C/action/author_attestation","sign_citation":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C/action/citation_signature","submit_replication":"https://pith.science/pith/2IEONRGWHMPXR5DTXETJADWX3C/action/replication_record"}},"created_at":"2026-07-05T08:28:43.248931+00:00","updated_at":"2026-07-05T08:28:43.248931+00:00"}