{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OPNVD2YKAVHCAYTHITG7JNLCVE","short_pith_number":"pith:OPNVD2YK","schema_version":"1.0","canonical_sha256":"73db51eb0a054e20626744cdf4b562a93f520e39f3ae1dc4eb4f4488abe47bf3","source":{"kind":"arxiv","id":"2409.15186","version":2},"attestation_state":"computed","paper":{"title":"Location is Key: Leveraging Large Language Model for Functional Bug Localization in Verilog","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Bingkun Yao, Hong Gao, Jie Zhou, Nan Guan, Ning Wang, Xi Wang, Zhe Jiang","submitted_at":"2024-09-23T16:38:53Z","abstract_excerpt":"Bug localization in Verilog code is a crucial and time-consuming task during the verification of hardware design. Since introduction, Large Language Models (LLMs) have showed their strong programming capabilities. However, no work has yet considered using LLMs for bug localization in Verilog code. This paper presents Location-is-Key, an opensource LLM solution to locate functional errors in Verilog snippets. LiK achieves high localization accuracy, with a pass@1 localization accuracy of 93.3% on our test dataset based on RTLLM, surpassing GPT-4's 77.9% and comparable to Claude-3.5's 90.8%. Add"},"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":"2409.15186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-09-23T16:38:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"70f349886a3b579a4eb2d142deaf50106e95f3260b0861890a89bd507095abda","abstract_canon_sha256":"ec1b866ce44cb743202d18a0e7571162dfc62d6be3fb32568ddf97ee8b65d7c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:13:07.958763Z","signature_b64":"nit6JSJlQJ27FVwZKpU47DjEAFnenU/nhf/WxyHazOAGGbNklT3ooZJmBP3plJ7SEr2W+xkAfxZTKpRFb34kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73db51eb0a054e20626744cdf4b562a93f520e39f3ae1dc4eb4f4488abe47bf3","last_reissued_at":"2026-07-05T09:13:07.958245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:13:07.958245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Location is Key: Leveraging Large Language Model for Functional Bug Localization in Verilog","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Bingkun Yao, Hong Gao, Jie Zhou, Nan Guan, Ning Wang, Xi Wang, Zhe Jiang","submitted_at":"2024-09-23T16:38:53Z","abstract_excerpt":"Bug localization in Verilog code is a crucial and time-consuming task during the verification of hardware design. Since introduction, Large Language Models (LLMs) have showed their strong programming capabilities. However, no work has yet considered using LLMs for bug localization in Verilog code. This paper presents Location-is-Key, an opensource LLM solution to locate functional errors in Verilog snippets. LiK achieves high localization accuracy, with a pass@1 localization accuracy of 93.3% on our test dataset based on RTLLM, surpassing GPT-4's 77.9% and comparable to Claude-3.5's 90.8%. Add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15186","kind":"arxiv","version":2},"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/2409.15186/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":"2409.15186","created_at":"2026-07-05T09:13:07.958306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15186v2","created_at":"2026-07-05T09:13:07.958306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15186","created_at":"2026-07-05T09:13:07.958306+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPNVD2YKAVHC","created_at":"2026-07-05T09:13:07.958306+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPNVD2YKAVHCAYTH","created_at":"2026-07-05T09:13:07.958306+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPNVD2YK","created_at":"2026-07-05T09:13:07.958306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.19959","citing_title":"From Concept to Practice: an Automated LLM-aided UVM Machine for RTL Verification","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14237","citing_title":"TOPCELL: Topology Optimization of Standard Cell via LLMs","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE","json":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE.json","graph_json":"https://pith.science/api/pith-number/OPNVD2YKAVHCAYTHITG7JNLCVE/graph.json","events_json":"https://pith.science/api/pith-number/OPNVD2YKAVHCAYTHITG7JNLCVE/events.json","paper":"https://pith.science/paper/OPNVD2YK"},"agent_actions":{"view_html":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE","download_json":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE.json","view_paper":"https://pith.science/paper/OPNVD2YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15186&json=true","fetch_graph":"https://pith.science/api/pith-number/OPNVD2YKAVHCAYTHITG7JNLCVE/graph.json","fetch_events":"https://pith.science/api/pith-number/OPNVD2YKAVHCAYTHITG7JNLCVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE/action/storage_attestation","attest_author":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE/action/author_attestation","sign_citation":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE/action/citation_signature","submit_replication":"https://pith.science/pith/OPNVD2YKAVHCAYTHITG7JNLCVE/action/replication_record"}},"created_at":"2026-07-05T09:13:07.958306+00:00","updated_at":"2026-07-05T09:13:07.958306+00:00"}