{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GEMED6VIOVNZXVIX6SWZBH5D2J","short_pith_number":"pith:GEMED6VI","schema_version":"1.0","canonical_sha256":"311841faa8755b9bd517f4ad909fa3d24a707bd0b3ded71be7cc1c912a4f6f45","source":{"kind":"arxiv","id":"2508.18462","version":1},"attestation_state":"computed","paper":{"title":"VERIRL: Boosting the LLM-based Verilog Code Generation via Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fu Teng, Jianwei Yin, Liqiang Lu, Mengnan Qi, Miao Pan, Xinyi Chai, Xuhong Zhang, Yiyao Yang, Zhezhi He","submitted_at":"2025-08-25T20:20:44Z","abstract_excerpt":"Recent advancements in code generation have shown remarkable success across software domains, yet hardware description languages (HDLs) such as Verilog remain underexplored due to their concurrency semantics, syntactic rigidity, and simulation complexity. In this work, we address these challenges by introducing a reinforcement learning (RL) framework tailored for Verilog code generation. We first construct Veribench-53K, a high-quality dataset curated from over 700K Verilog problems, enriched with structured prompts, complexity labels, and diverse testbenches. To tackle the problem of sparse a"},"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":"2508.18462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-25T20:20:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"405145d7277d5cd9aa691a56ec648a92af72a6e7e3bfbcbc10b527e41e9e52c9","abstract_canon_sha256":"c9dd366580aaddb6e053f0604e3bb77fce5f5cb76fda1b8f3a699017177e2826"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:24.943416Z","signature_b64":"9nN2mLL9ytclrdA34obPb3OKwEAzMd+ub1g1omaVwcaOuXT0yLtzUfZ26olE7/lszbQZ89MJlnL4Q7ZVApBXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311841faa8755b9bd517f4ad909fa3d24a707bd0b3ded71be7cc1c912a4f6f45","last_reissued_at":"2026-07-05T11:59:24.942951Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:24.942951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VERIRL: Boosting the LLM-based Verilog Code Generation via Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fu Teng, Jianwei Yin, Liqiang Lu, Mengnan Qi, Miao Pan, Xinyi Chai, Xuhong Zhang, Yiyao Yang, Zhezhi He","submitted_at":"2025-08-25T20:20:44Z","abstract_excerpt":"Recent advancements in code generation have shown remarkable success across software domains, yet hardware description languages (HDLs) such as Verilog remain underexplored due to their concurrency semantics, syntactic rigidity, and simulation complexity. In this work, we address these challenges by introducing a reinforcement learning (RL) framework tailored for Verilog code generation. We first construct Veribench-53K, a high-quality dataset curated from over 700K Verilog problems, enriched with structured prompts, complexity labels, and diverse testbenches. To tackle the problem of sparse a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18462","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/2508.18462/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":"2508.18462","created_at":"2026-07-05T11:59:24.943010+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.18462v1","created_at":"2026-07-05T11:59:24.943010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18462","created_at":"2026-07-05T11:59:24.943010+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEMED6VIOVNZ","created_at":"2026-07-05T11:59:24.943010+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEMED6VIOVNZXVIX","created_at":"2026-07-05T11:59:24.943010+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEMED6VI","created_at":"2026-07-05T11:59:24.943010+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.01799","citing_title":"TestDecision: Sequential Test Suite Generation via Greedy Optimization and Reinforcement Learning","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J","json":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J.json","graph_json":"https://pith.science/api/pith-number/GEMED6VIOVNZXVIX6SWZBH5D2J/graph.json","events_json":"https://pith.science/api/pith-number/GEMED6VIOVNZXVIX6SWZBH5D2J/events.json","paper":"https://pith.science/paper/GEMED6VI"},"agent_actions":{"view_html":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J","download_json":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J.json","view_paper":"https://pith.science/paper/GEMED6VI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.18462&json=true","fetch_graph":"https://pith.science/api/pith-number/GEMED6VIOVNZXVIX6SWZBH5D2J/graph.json","fetch_events":"https://pith.science/api/pith-number/GEMED6VIOVNZXVIX6SWZBH5D2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J/action/storage_attestation","attest_author":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J/action/author_attestation","sign_citation":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J/action/citation_signature","submit_replication":"https://pith.science/pith/GEMED6VIOVNZXVIX6SWZBH5D2J/action/replication_record"}},"created_at":"2026-07-05T11:59:24.943010+00:00","updated_at":"2026-07-05T11:59:24.943010+00:00"}