{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3FYHVG5ZGCCNGFAR2VGSXJBCFI","short_pith_number":"pith:3FYHVG5Z","schema_version":"1.0","canonical_sha256":"d9707a9bb93084d31411d54d2ba4222a038e5e156fb7f5ecaef35515b0f73884","source":{"kind":"arxiv","id":"2503.14153","version":1},"attestation_state":"computed","paper":{"title":"Speculative Decoding for Verilog: Speed and Quality, All in One","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.CL"],"primary_cat":"cs.LG","authors_text":"Changran Xu, Ningyi Xu, Qiang Xu, Shan Huang, Yi Liu, Yunhao Zhou","submitted_at":"2025-03-18T11:21:53Z","abstract_excerpt":"The rapid advancement of large language models (LLMs) has revolutionized code generation tasks across various programming languages. However, the unique characteristics of programming languages, particularly those like Verilog with specific syntax and lower representation in training datasets, pose significant challenges for conventional tokenization and decoding approaches. In this paper, we introduce a novel application of speculative decoding for Verilog code generation, showing that it can improve both inference speed and output quality, effectively achieving speed and quality all in one. "},"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":"2503.14153","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-18T11:21:53Z","cross_cats_sorted":["cs.AR","cs.CL"],"title_canon_sha256":"750154dcec958f07b4b6f8f2d5b7085fb73e8db9718318f61a14de8c9778ce1d","abstract_canon_sha256":"9695591dae47569911b80cfa0e1b8646de5beee5681a18ad5119aebb146ca38e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:56.350644Z","signature_b64":"fi03WEEBXSgiN/f0kuTPgSAb/ETPuBtcetpmF8toee3bGP7hW8GnXGfZtNt73THh1+U4SBQ57N8FZhErf701CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9707a9bb93084d31411d54d2ba4222a038e5e156fb7f5ecaef35515b0f73884","last_reissued_at":"2026-07-05T10:33:56.350012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:56.350012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speculative Decoding for Verilog: Speed and Quality, All in One","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.CL"],"primary_cat":"cs.LG","authors_text":"Changran Xu, Ningyi Xu, Qiang Xu, Shan Huang, Yi Liu, Yunhao Zhou","submitted_at":"2025-03-18T11:21:53Z","abstract_excerpt":"The rapid advancement of large language models (LLMs) has revolutionized code generation tasks across various programming languages. However, the unique characteristics of programming languages, particularly those like Verilog with specific syntax and lower representation in training datasets, pose significant challenges for conventional tokenization and decoding approaches. In this paper, we introduce a novel application of speculative decoding for Verilog code generation, showing that it can improve both inference speed and output quality, effectively achieving speed and quality all in one. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14153","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/2503.14153/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":"2503.14153","created_at":"2026-07-05T10:33:56.350091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14153v1","created_at":"2026-07-05T10:33:56.350091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14153","created_at":"2026-07-05T10:33:56.350091+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FYHVG5ZGCCN","created_at":"2026-07-05T10:33:56.350091+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FYHVG5ZGCCNGFAR","created_at":"2026-07-05T10:33:56.350091+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FYHVG5Z","created_at":"2026-07-05T10:33:56.350091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00531","citing_title":"CURE: Local Uncertainty Repair for Block-Parallel Speculative Decoding","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI","json":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI.json","graph_json":"https://pith.science/api/pith-number/3FYHVG5ZGCCNGFAR2VGSXJBCFI/graph.json","events_json":"https://pith.science/api/pith-number/3FYHVG5ZGCCNGFAR2VGSXJBCFI/events.json","paper":"https://pith.science/paper/3FYHVG5Z"},"agent_actions":{"view_html":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI","download_json":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI.json","view_paper":"https://pith.science/paper/3FYHVG5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14153&json=true","fetch_graph":"https://pith.science/api/pith-number/3FYHVG5ZGCCNGFAR2VGSXJBCFI/graph.json","fetch_events":"https://pith.science/api/pith-number/3FYHVG5ZGCCNGFAR2VGSXJBCFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI/action/storage_attestation","attest_author":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI/action/author_attestation","sign_citation":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI/action/citation_signature","submit_replication":"https://pith.science/pith/3FYHVG5ZGCCNGFAR2VGSXJBCFI/action/replication_record"}},"created_at":"2026-07-05T10:33:56.350091+00:00","updated_at":"2026-07-05T10:33:56.350091+00:00"}