{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:E733WAV5GQOJZFFQ7YZAQOASND","short_pith_number":"pith:E733WAV5","schema_version":"1.0","canonical_sha256":"27f7bb02bd341c9c94b0fe3208381268e94318f8bc3da4d27339222300713d99","source":{"kind":"arxiv","id":"2306.14027","version":2},"attestation_state":"computed","paper":{"title":"(Security) Assertions by Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"(2) University of New South Wales, (3) University of Calgary, (4) New York University), Benjamin Tan (3), Brendan Dolan-Gavitt (4), Hammond Pearce (2), Jeyavijayan Rajendran (1) ((1) Texas A&M University, Rahul Kande (1), Ramesh Karri (4), Shailja Thakur (4)","submitted_at":"2023-06-24T17:44:36Z","abstract_excerpt":"The security of computer systems typically relies on a hardware root of trust. As vulnerabilities in hardware can have severe implications on a system, there is a need for techniques to support security verification activities. Assertion-based verification is a popular verification technique that involves capturing design intent in a set of assertions that can be used in formal verification or testing-based checking. However, writing security-centric assertions is a challenging task. In this work, we investigate the use of emerging large language models (LLMs) for code generation in hardware a"},"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":"2306.14027","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-24T17:44:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"647dacdc6477bf01f792341ada0c8755eba88961ae3b09c9e5504c302c07598f","abstract_canon_sha256":"e1623eff72fd0a51db63346aa35ac700a13e4b25dd36bb60ab62a81a94d3a88f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:59.225451Z","signature_b64":"lMpB2RvIXUmIib1TqUusJbzeoWLlo57zoeJeBLvmZFnQKTJVbc7BKO7Kzs5VZdyl6p1fY/l91S/xMwYD/fd8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27f7bb02bd341c9c94b0fe3208381268e94318f8bc3da4d27339222300713d99","last_reissued_at":"2026-07-05T08:41:59.225028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:59.225028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Security) Assertions by Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"(2) University of New South Wales, (3) University of Calgary, (4) New York University), Benjamin Tan (3), Brendan Dolan-Gavitt (4), Hammond Pearce (2), Jeyavijayan Rajendran (1) ((1) Texas A&M University, Rahul Kande (1), Ramesh Karri (4), Shailja Thakur (4)","submitted_at":"2023-06-24T17:44:36Z","abstract_excerpt":"The security of computer systems typically relies on a hardware root of trust. As vulnerabilities in hardware can have severe implications on a system, there is a need for techniques to support security verification activities. Assertion-based verification is a popular verification technique that involves capturing design intent in a set of assertions that can be used in formal verification or testing-based checking. However, writing security-centric assertions is a challenging task. In this work, we investigate the use of emerging large language models (LLMs) for code generation in hardware a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14027","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/2306.14027/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":"2306.14027","created_at":"2026-07-05T08:41:59.225083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.14027v2","created_at":"2026-07-05T08:41:59.225083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14027","created_at":"2026-07-05T08:41:59.225083+00:00"},{"alias_kind":"pith_short_12","alias_value":"E733WAV5GQOJ","created_at":"2026-07-05T08:41:59.225083+00:00"},{"alias_kind":"pith_short_16","alias_value":"E733WAV5GQOJZFFQ","created_at":"2026-07-05T08:41:59.225083+00:00"},{"alias_kind":"pith_short_8","alias_value":"E733WAV5","created_at":"2026-07-05T08:41:59.225083+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":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND","json":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND.json","graph_json":"https://pith.science/api/pith-number/E733WAV5GQOJZFFQ7YZAQOASND/graph.json","events_json":"https://pith.science/api/pith-number/E733WAV5GQOJZFFQ7YZAQOASND/events.json","paper":"https://pith.science/paper/E733WAV5"},"agent_actions":{"view_html":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND","download_json":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND.json","view_paper":"https://pith.science/paper/E733WAV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.14027&json=true","fetch_graph":"https://pith.science/api/pith-number/E733WAV5GQOJZFFQ7YZAQOASND/graph.json","fetch_events":"https://pith.science/api/pith-number/E733WAV5GQOJZFFQ7YZAQOASND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND/action/storage_attestation","attest_author":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND/action/author_attestation","sign_citation":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND/action/citation_signature","submit_replication":"https://pith.science/pith/E733WAV5GQOJZFFQ7YZAQOASND/action/replication_record"}},"created_at":"2026-07-05T08:41:59.225083+00:00","updated_at":"2026-07-05T08:41:59.225083+00:00"}