{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4BPRN6BC6ZAUPDMJYRA7AAL2BY","short_pith_number":"pith:4BPRN6BC","schema_version":"1.0","canonical_sha256":"e05f16f822f641478d89c441f0017a0e203c9a9cb10cb32d68042c3680373715","source":{"kind":"arxiv","id":"2506.21569","version":1},"attestation_state":"computed","paper":{"title":"Hybrid-NL2SVA: Integrating RAG and Finetuning for LLM-based NL2SVA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Derek Ekberg, Ramesh Karri, Siddharth Garg, Weihua Xiao","submitted_at":"2025-06-12T17:52:06Z","abstract_excerpt":"SystemVerilog Assertions (SVAs) are critical for verifying the correctness of hardware designs, but manually writing them from natural language property descriptions, i.e., NL2SVA, remains a labor-intensive and error-prone task. Recent advances in large language models (LLMs) offer opportunities to automate this translation. However, existing models still struggle with understanding domain-specific syntax and semantics. To enhance LLM performance in NL2SVA, we propose a customized retrieval-augmented generation (RAG) framework and a synthetic fine-tuning dataset that together improve LLM's per"},"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":"2506.21569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-12T17:52:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c0f357aff00b85a743043c6ddd86dd3999fea6d5e4eba005b6f5a586cf45e709","abstract_canon_sha256":"c263e6c1866bc8c04f917cfeb5eed92392fd20d1cdeccbc48bc9ada1e5b7eb74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:56.525578Z","signature_b64":"t5J5hJNqnWtVp95trwvlJtbb0Jw+0hY19y1511ak6kM1pKwf6q7feEpOph1jGHsXrtSiIc9f+Pjv7FAjoREiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e05f16f822f641478d89c441f0017a0e203c9a9cb10cb32d68042c3680373715","last_reissued_at":"2026-07-05T11:27:56.525095Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:56.525095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid-NL2SVA: Integrating RAG and Finetuning for LLM-based NL2SVA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Derek Ekberg, Ramesh Karri, Siddharth Garg, Weihua Xiao","submitted_at":"2025-06-12T17:52:06Z","abstract_excerpt":"SystemVerilog Assertions (SVAs) are critical for verifying the correctness of hardware designs, but manually writing them from natural language property descriptions, i.e., NL2SVA, remains a labor-intensive and error-prone task. Recent advances in large language models (LLMs) offer opportunities to automate this translation. However, existing models still struggle with understanding domain-specific syntax and semantics. To enhance LLM performance in NL2SVA, we propose a customized retrieval-augmented generation (RAG) framework and a synthetic fine-tuning dataset that together improve LLM's per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21569","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/2506.21569/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":"2506.21569","created_at":"2026-07-05T11:27:56.525151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21569v1","created_at":"2026-07-05T11:27:56.525151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21569","created_at":"2026-07-05T11:27:56.525151+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BPRN6BC6ZAU","created_at":"2026-07-05T11:27:56.525151+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BPRN6BC6ZAUPDMJ","created_at":"2026-07-05T11:27:56.525151+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BPRN6BC","created_at":"2026-07-05T11:27:56.525151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03245","citing_title":"FVRuleLearner: Operator-Level Reasoning Tree (Op-Tree)-Based Rules Learning for Formal Verification","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY","json":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY.json","graph_json":"https://pith.science/api/pith-number/4BPRN6BC6ZAUPDMJYRA7AAL2BY/graph.json","events_json":"https://pith.science/api/pith-number/4BPRN6BC6ZAUPDMJYRA7AAL2BY/events.json","paper":"https://pith.science/paper/4BPRN6BC"},"agent_actions":{"view_html":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY","download_json":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY.json","view_paper":"https://pith.science/paper/4BPRN6BC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21569&json=true","fetch_graph":"https://pith.science/api/pith-number/4BPRN6BC6ZAUPDMJYRA7AAL2BY/graph.json","fetch_events":"https://pith.science/api/pith-number/4BPRN6BC6ZAUPDMJYRA7AAL2BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY/action/storage_attestation","attest_author":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY/action/author_attestation","sign_citation":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY/action/citation_signature","submit_replication":"https://pith.science/pith/4BPRN6BC6ZAUPDMJYRA7AAL2BY/action/replication_record"}},"created_at":"2026-07-05T11:27:56.525151+00:00","updated_at":"2026-07-05T11:27:56.525151+00:00"}