{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TGCUD4L4ZGQQ5TMP4BIQSYIEH6","short_pith_number":"pith:TGCUD4L4","schema_version":"1.0","canonical_sha256":"998541f17cc9a10ecd8fe0510961043f9f6383213d8738195374ec41871fdde2","source":{"kind":"arxiv","id":"2409.15281","version":1},"attestation_state":"computed","paper":{"title":"LAAG-RV: LLM Assisted Assertion Generation for RTL Design Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.AR","authors_text":"Bhabesh Mali, Chandan Karfa, Karthik Maddala","submitted_at":"2024-08-13T06:03:41Z","abstract_excerpt":"Writing SystemVerilog Assertions (SVA) is an important but complex step in verifying Register Transfer Level (RTL) designs. Conventionally, experts need to understand the design specifications and write the SVA assertions, which is time-consuming and error-prone. However, with the recent advancement of transformer models, the Large Language Models (LLMs) assisted assertion generation for design verification is gaining interest in recent times. Motivated by this, we proposed a novel LLM-based framework, LAAG-RV, to generate SVA from the natural language specifications of the design. Our framewo"},"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.15281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2024-08-13T06:03:41Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"2717d91b58927b478005376e632901b6de077c22612c0be01cbc039fa597c6f2","abstract_canon_sha256":"a1079305d36d9c9651178779d2736cac5f8ac6b092527164d8aa135a9b3b7f27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:52.292137Z","signature_b64":"YbecmJzV9OLmRSfywpYRbkdDdFQ7bb6WUlC+f/Y8LSzzm64zI8ijEVZ7IC+l7IlhU+uMYg7zRT42ZHYlBgOLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"998541f17cc9a10ecd8fe0510961043f9f6383213d8738195374ec41871fdde2","last_reissued_at":"2026-07-05T09:10:52.291628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:52.291628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LAAG-RV: LLM Assisted Assertion Generation for RTL Design Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.AR","authors_text":"Bhabesh Mali, Chandan Karfa, Karthik Maddala","submitted_at":"2024-08-13T06:03:41Z","abstract_excerpt":"Writing SystemVerilog Assertions (SVA) is an important but complex step in verifying Register Transfer Level (RTL) designs. Conventionally, experts need to understand the design specifications and write the SVA assertions, which is time-consuming and error-prone. However, with the recent advancement of transformer models, the Large Language Models (LLMs) assisted assertion generation for design verification is gaining interest in recent times. Motivated by this, we proposed a novel LLM-based framework, LAAG-RV, to generate SVA from the natural language specifications of the design. Our framewo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15281","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/2409.15281/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.15281","created_at":"2026-07-05T09:10:52.291701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15281v1","created_at":"2026-07-05T09:10:52.291701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15281","created_at":"2026-07-05T09:10:52.291701+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGCUD4L4ZGQQ","created_at":"2026-07-05T09:10:52.291701+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGCUD4L4ZGQQ5TMP","created_at":"2026-07-05T09:10:52.291701+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGCUD4L4","created_at":"2026-07-05T09:10:52.291701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.17865","citing_title":"LASA: Enhancing SoC Security Verification with LLM-Aided Property Generation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6","json":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6.json","graph_json":"https://pith.science/api/pith-number/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/graph.json","events_json":"https://pith.science/api/pith-number/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/events.json","paper":"https://pith.science/paper/TGCUD4L4"},"agent_actions":{"view_html":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6","download_json":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6.json","view_paper":"https://pith.science/paper/TGCUD4L4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15281&json=true","fetch_graph":"https://pith.science/api/pith-number/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/graph.json","fetch_events":"https://pith.science/api/pith-number/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/action/storage_attestation","attest_author":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/action/author_attestation","sign_citation":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/action/citation_signature","submit_replication":"https://pith.science/pith/TGCUD4L4ZGQQ5TMP4BIQSYIEH6/action/replication_record"}},"created_at":"2026-07-05T09:10:52.291701+00:00","updated_at":"2026-07-05T09:10:52.291701+00:00"}