{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JOCNHWW7WUWAZK6UERE2JOKTUV","short_pith_number":"pith:JOCNHWW7","schema_version":"1.0","canonical_sha256":"4b84d3dadfb52c0cabd42449a4b953a5798564e5fa523311b5a51b5224ce0d5f","source":{"kind":"arxiv","id":"2606.04246","version":1},"attestation_state":"computed","paper":{"title":"StepPRM-RTL: Stepwise Process-Reward Guided LLM Fine-Tuning for Enhanced RTL Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.CL"],"primary_cat":"cs.AI","authors_text":"Apoorva Nitsure, Ehsan Degan, Luyao Shi, Prashanth Vijayaraghavan, Vandana Mukherjee","submitted_at":"2026-06-02T21:52:48Z","abstract_excerpt":"Automatic generation of RTL code for digital hardware designs remains challenging due to long-horizon reasoning, multi-step dependencies, and strict correctness constraints in Verilog and VHDL. We present StepPRM-RTL, a novel framework that combines stepwise trajectory modeling, process-reward modeling (PRM), and retrieval-augmented fine-tuning (RAFT) to enhance both the functional correctness and reasoning fidelity of LLM-based RTL code generation. StepPRM-RTL constructs stepwise reasoning trajectories from canonical solutions, where each step contains a rationale and incremental code modific"},"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":"2606.04246","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-02T21:52:48Z","cross_cats_sorted":["cs.AR","cs.CL"],"title_canon_sha256":"48218860d80a9f6b88a797cc8930cf6d47fd8a7e813b6279f5745772830b3f27","abstract_canon_sha256":"8993371332ca9a2de92df294b1008b6f92c98686cf229ce7096e349bc9423d8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:00.284539Z","signature_b64":"iRC8RSLfhqC8vbfXnpqfutfw7W1Xjiy0I+wZSL6Cx0Mpwrn0dHVTyuV4ozDLQWfEd3NmMLgOoFDveedBfAZ0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b84d3dadfb52c0cabd42449a4b953a5798564e5fa523311b5a51b5224ce0d5f","last_reissued_at":"2026-06-04T01:09:00.284073Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:00.284073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StepPRM-RTL: Stepwise Process-Reward Guided LLM Fine-Tuning for Enhanced RTL Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.CL"],"primary_cat":"cs.AI","authors_text":"Apoorva Nitsure, Ehsan Degan, Luyao Shi, Prashanth Vijayaraghavan, Vandana Mukherjee","submitted_at":"2026-06-02T21:52:48Z","abstract_excerpt":"Automatic generation of RTL code for digital hardware designs remains challenging due to long-horizon reasoning, multi-step dependencies, and strict correctness constraints in Verilog and VHDL. We present StepPRM-RTL, a novel framework that combines stepwise trajectory modeling, process-reward modeling (PRM), and retrieval-augmented fine-tuning (RAFT) to enhance both the functional correctness and reasoning fidelity of LLM-based RTL code generation. StepPRM-RTL constructs stepwise reasoning trajectories from canonical solutions, where each step contains a rationale and incremental code modific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04246","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/2606.04246/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":"2606.04246","created_at":"2026-06-04T01:09:00.284151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04246v1","created_at":"2026-06-04T01:09:00.284151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04246","created_at":"2026-06-04T01:09:00.284151+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOCNHWW7WUWA","created_at":"2026-06-04T01:09:00.284151+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOCNHWW7WUWAZK6U","created_at":"2026-06-04T01:09:00.284151+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOCNHWW7","created_at":"2026-06-04T01:09:00.284151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV","json":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV.json","graph_json":"https://pith.science/api/pith-number/JOCNHWW7WUWAZK6UERE2JOKTUV/graph.json","events_json":"https://pith.science/api/pith-number/JOCNHWW7WUWAZK6UERE2JOKTUV/events.json","paper":"https://pith.science/paper/JOCNHWW7"},"agent_actions":{"view_html":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV","download_json":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV.json","view_paper":"https://pith.science/paper/JOCNHWW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04246&json=true","fetch_graph":"https://pith.science/api/pith-number/JOCNHWW7WUWAZK6UERE2JOKTUV/graph.json","fetch_events":"https://pith.science/api/pith-number/JOCNHWW7WUWAZK6UERE2JOKTUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV/action/storage_attestation","attest_author":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV/action/author_attestation","sign_citation":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV/action/citation_signature","submit_replication":"https://pith.science/pith/JOCNHWW7WUWAZK6UERE2JOKTUV/action/replication_record"}},"created_at":"2026-06-04T01:09:00.284151+00:00","updated_at":"2026-06-04T01:09:00.284151+00:00"}