{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IX6GIA3CV2MKEJ7GCS6WCOVHMA","short_pith_number":"pith:IX6GIA3C","schema_version":"1.0","canonical_sha256":"45fc640362ae98a227e614bd613aa7600f3f1eed98920f8dd80c0b0922640cfb","source":{"kind":"arxiv","id":"2407.18271","version":4},"attestation_state":"computed","paper":{"title":"Large Language Model for Verilog Generation with Code-Structure-Guided Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Bingkun Yao, Jie Zhou, Nan Guan, Ning Wang, Xi Wang, Zhe Jiang","submitted_at":"2024-07-21T11:25:21Z","abstract_excerpt":"Recent advancements in large language models (LLMs) have sparked significant interest in the automatic generation of Register Transfer Level (RTL) designs, particularly using Verilog. Current research on this topic primarily focuses on pre-training and instruction tuning, but the effectiveness of these methods is constrained by the limited availability of training data, as public Verilog code is far less abundant than software code. In particular, these methods struggle to effectively capture Verilog parallel code structures, which fundamentally differ from the imperative, sequential control f"},"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":"2407.18271","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-07-21T11:25:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ec57dd4e36a135c7b7a1906dd28a240c7d17a543b555e4d8e8318c1eba475f90","abstract_canon_sha256":"e556de4f3ba2b78d671b53ccf243dd61bb4a7f62a73cfdc549183ef1c06d47f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:24.223913Z","signature_b64":"Crv4zlHmvym83WD4Svb5k/EeJI0JeVjFMzZ6/uLV3xEJr+Ogrw/fIfaoNhQdOknFlButtesNcTV7kqFD9eBrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45fc640362ae98a227e614bd613aa7600f3f1eed98920f8dd80c0b0922640cfb","last_reissued_at":"2026-07-05T10:51:24.223435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:24.223435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Language Model for Verilog Generation with Code-Structure-Guided Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Bingkun Yao, Jie Zhou, Nan Guan, Ning Wang, Xi Wang, Zhe Jiang","submitted_at":"2024-07-21T11:25:21Z","abstract_excerpt":"Recent advancements in large language models (LLMs) have sparked significant interest in the automatic generation of Register Transfer Level (RTL) designs, particularly using Verilog. Current research on this topic primarily focuses on pre-training and instruction tuning, but the effectiveness of these methods is constrained by the limited availability of training data, as public Verilog code is far less abundant than software code. In particular, these methods struggle to effectively capture Verilog parallel code structures, which fundamentally differ from the imperative, sequential control f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18271","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/2407.18271/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":"2407.18271","created_at":"2026-07-05T10:51:24.223491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.18271v4","created_at":"2026-07-05T10:51:24.223491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18271","created_at":"2026-07-05T10:51:24.223491+00:00"},{"alias_kind":"pith_short_12","alias_value":"IX6GIA3CV2MK","created_at":"2026-07-05T10:51:24.223491+00:00"},{"alias_kind":"pith_short_16","alias_value":"IX6GIA3CV2MKEJ7G","created_at":"2026-07-05T10:51:24.223491+00:00"},{"alias_kind":"pith_short_8","alias_value":"IX6GIA3C","created_at":"2026-07-05T10:51:24.223491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.08332","citing_title":"ORFS-agent: Tool-Using Agents for Chip Design Optimization","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2507.00642","citing_title":"ChatHLS: Towards Systematic Design Automation and Optimization for High-Level Synthesis","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA","json":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA.json","graph_json":"https://pith.science/api/pith-number/IX6GIA3CV2MKEJ7GCS6WCOVHMA/graph.json","events_json":"https://pith.science/api/pith-number/IX6GIA3CV2MKEJ7GCS6WCOVHMA/events.json","paper":"https://pith.science/paper/IX6GIA3C"},"agent_actions":{"view_html":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA","download_json":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA.json","view_paper":"https://pith.science/paper/IX6GIA3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.18271&json=true","fetch_graph":"https://pith.science/api/pith-number/IX6GIA3CV2MKEJ7GCS6WCOVHMA/graph.json","fetch_events":"https://pith.science/api/pith-number/IX6GIA3CV2MKEJ7GCS6WCOVHMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA/action/storage_attestation","attest_author":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA/action/author_attestation","sign_citation":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA/action/citation_signature","submit_replication":"https://pith.science/pith/IX6GIA3CV2MKEJ7GCS6WCOVHMA/action/replication_record"}},"created_at":"2026-07-05T10:51:24.223491+00:00","updated_at":"2026-07-05T10:51:24.223491+00:00"}