{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4ROXCK7ULNP7EXRXZ64DOXYHWN","short_pith_number":"pith:4ROXCK7U","schema_version":"1.0","canonical_sha256":"e45d712bf45b5ff25e37cfb8375f07b357b4f36abb7a7cfa4f0d822cb04534b6","source":{"kind":"arxiv","id":"2411.16238","version":1},"attestation_state":"computed","paper":{"title":"UVLLM: An Automated Universal RTL Verification Framework using LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Dingrong Pan, Jialin Sun, Jie Zhou, Junhao Ye, Ke Xu, Nan Guan, Ning Wang, Shiyue Zhang, Weiwei Shan, Xinwei Fang, Xinyao Jiao, Xi Wang, Yuchen Hu, Zhe Jiang","submitted_at":"2024-11-25T09:53:35Z","abstract_excerpt":"Verifying hardware designs in embedded systems is crucial but often labor-intensive and time-consuming. While existing solutions have improved automation, they frequently rely on unrealistic assumptions. To address these challenges, we introduce a novel framework, UVLLM, which combines Large Language Models (LLMs) with the Universal Verification Methodology (UVM) to relax these assumptions. UVLLM significantly enhances the automation of testing and repairing error-prone Register Transfer Level (RTL) codes, a critical aspect of verification development. Unlike existing methods, UVLLM ensures th"},"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":"2411.16238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-11-25T09:53:35Z","cross_cats_sorted":[],"title_canon_sha256":"01dae54b6e0bd6d5718cd66e5c221b20b833568a0de85a4254c74c0ea1228c2f","abstract_canon_sha256":"d2cadb2e09e216598641cfc8592bc6746609373ba2b7cb35044b3f2844fca110"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:06.469510Z","signature_b64":"q7Hml6DnN4mWIqFjx1BNBuQjwUaD0WKgqgd/YjnmBalfVZis/BiAaMztFBI29ZkXtRxKXSRXhGEeLzmMClMhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e45d712bf45b5ff25e37cfb8375f07b357b4f36abb7a7cfa4f0d822cb04534b6","last_reissued_at":"2026-07-05T09:40:06.469036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:06.469036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UVLLM: An Automated Universal RTL Verification Framework using LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Dingrong Pan, Jialin Sun, Jie Zhou, Junhao Ye, Ke Xu, Nan Guan, Ning Wang, Shiyue Zhang, Weiwei Shan, Xinwei Fang, Xinyao Jiao, Xi Wang, Yuchen Hu, Zhe Jiang","submitted_at":"2024-11-25T09:53:35Z","abstract_excerpt":"Verifying hardware designs in embedded systems is crucial but often labor-intensive and time-consuming. While existing solutions have improved automation, they frequently rely on unrealistic assumptions. To address these challenges, we introduce a novel framework, UVLLM, which combines Large Language Models (LLMs) with the Universal Verification Methodology (UVM) to relax these assumptions. UVLLM significantly enhances the automation of testing and repairing error-prone Register Transfer Level (RTL) codes, a critical aspect of verification development. Unlike existing methods, UVLLM ensures th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16238","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/2411.16238/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":"2411.16238","created_at":"2026-07-05T09:40:06.469092+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16238v1","created_at":"2026-07-05T09:40:06.469092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16238","created_at":"2026-07-05T09:40:06.469092+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ROXCK7ULNP7","created_at":"2026-07-05T09:40:06.469092+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ROXCK7ULNP7EXRX","created_at":"2026-07-05T09:40:06.469092+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ROXCK7U","created_at":"2026-07-05T09:40:06.469092+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08944","citing_title":"LongRTL: Graph-Similarity-Guided LLM-driven Long Context RTL Optimization","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2504.19959","citing_title":"From Concept to Practice: an Automated LLM-aided UVM Machine for RTL Verification","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15606","citing_title":"Spec2Cov: An Agentic Framework for Code Coverage Closure of Digital Hardware Designs","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02811","citing_title":"ChatSVA: Bridging SVA Generation for Hardware Verification via Task-Specific LLMs","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04704","citing_title":"UVMarvel: an Automated LLM-aided UVM Machine for Subsystem-level RTL Verification","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11044","citing_title":"Automated SVA Generation with LLMs","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15606","citing_title":"Spec2Cov: An Agentic Framework for Code Coverage Closure of Digital Hardware Designs","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15657","citing_title":"Understanding Inference-Time Token Allocation and Coverage Limits in Agentic Hardware Verification","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17288","citing_title":"Clover: A Neural-Symbolic Agentic Harness with Stochastic Tree-of-Thoughts for Verified RTL Repair","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN","json":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN.json","graph_json":"https://pith.science/api/pith-number/4ROXCK7ULNP7EXRXZ64DOXYHWN/graph.json","events_json":"https://pith.science/api/pith-number/4ROXCK7ULNP7EXRXZ64DOXYHWN/events.json","paper":"https://pith.science/paper/4ROXCK7U"},"agent_actions":{"view_html":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN","download_json":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN.json","view_paper":"https://pith.science/paper/4ROXCK7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16238&json=true","fetch_graph":"https://pith.science/api/pith-number/4ROXCK7ULNP7EXRXZ64DOXYHWN/graph.json","fetch_events":"https://pith.science/api/pith-number/4ROXCK7ULNP7EXRXZ64DOXYHWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN/action/storage_attestation","attest_author":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN/action/author_attestation","sign_citation":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN/action/citation_signature","submit_replication":"https://pith.science/pith/4ROXCK7ULNP7EXRXZ64DOXYHWN/action/replication_record"}},"created_at":"2026-07-05T09:40:06.469092+00:00","updated_at":"2026-07-05T09:40:06.469092+00:00"}