{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KFGVWSZV7BCXXNBTYMLTABTQ2I","short_pith_number":"pith:KFGVWSZV","schema_version":"1.0","canonical_sha256":"514d5b4b35f8457bb433c317300670d231238ecabb0600bfb9cf9586ffcf4a3a","source":{"kind":"arxiv","id":"2602.16953","version":3},"attestation_state":"computed","paper":{"title":"LLM4Cov: Execution-Aware Agentic Learning for High-coverage Testbench Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Brucek Khailany, Chia-Tung Ho, Haoxing Ren, Hejia Zhang, Jishen Zhao, Zhongming Yu","submitted_at":"2026-02-18T23:36:46Z","abstract_excerpt":"Execution-aware LLM agents offer a promising paradigm for learning from tool feedback, but such feedback can be expensive and slow to obtain, making online reinforcement learning (RL) less practical in certain scenarios. High-coverage hardware verification exemplifies this challenge due to its reliance on industrial simulators and non-differentiable execution signals. We propose LLM4Cov, an offline agent-learning framework that models verification as single-step state transitions guided by deterministic evaluators. Building on this formulation, we introduce execution-validated data curation, p"},"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":"2602.16953","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-02-18T23:36:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a5ec8c1b4c5479d5d053b068e671498ac91d3a8beea53116bce6aaa87197b68","abstract_canon_sha256":"efcc5ee32943b792e75a52ad02bb516b5d61e762870b3aaed3c4de7fa572f49d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:43.843014Z","signature_b64":"oi8Scnw6Fsc2ay9V4cb+24r7sqZSmxgO9gTJjYZqlG3U9hiw9yhVXo9rSajnruDR8FCN7XkTG8bnGwNeq7/FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"514d5b4b35f8457bb433c317300670d231238ecabb0600bfb9cf9586ffcf4a3a","last_reissued_at":"2026-06-02T01:03:43.842430Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:43.842430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM4Cov: Execution-Aware Agentic Learning for High-coverage Testbench Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Brucek Khailany, Chia-Tung Ho, Haoxing Ren, Hejia Zhang, Jishen Zhao, Zhongming Yu","submitted_at":"2026-02-18T23:36:46Z","abstract_excerpt":"Execution-aware LLM agents offer a promising paradigm for learning from tool feedback, but such feedback can be expensive and slow to obtain, making online reinforcement learning (RL) less practical in certain scenarios. High-coverage hardware verification exemplifies this challenge due to its reliance on industrial simulators and non-differentiable execution signals. We propose LLM4Cov, an offline agent-learning framework that models verification as single-step state transitions guided by deterministic evaluators. Building on this formulation, we introduce execution-validated data curation, p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16953","kind":"arxiv","version":3},"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/2602.16953/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":"2602.16953","created_at":"2026-06-02T01:03:43.842497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.16953v3","created_at":"2026-06-02T01:03:43.842497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16953","created_at":"2026-06-02T01:03:43.842497+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFGVWSZV7BCX","created_at":"2026-06-02T01:03:43.842497+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFGVWSZV7BCXXNBT","created_at":"2026-06-02T01:03:43.842497+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFGVWSZV","created_at":"2026-06-02T01:03:43.842497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27643","citing_title":"HAVEN: Hybrid Automated Verification ENgine for UVM Testbench Synthesis with LLMs","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I","json":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I.json","graph_json":"https://pith.science/api/pith-number/KFGVWSZV7BCXXNBTYMLTABTQ2I/graph.json","events_json":"https://pith.science/api/pith-number/KFGVWSZV7BCXXNBTYMLTABTQ2I/events.json","paper":"https://pith.science/paper/KFGVWSZV"},"agent_actions":{"view_html":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I","download_json":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I.json","view_paper":"https://pith.science/paper/KFGVWSZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.16953&json=true","fetch_graph":"https://pith.science/api/pith-number/KFGVWSZV7BCXXNBTYMLTABTQ2I/graph.json","fetch_events":"https://pith.science/api/pith-number/KFGVWSZV7BCXXNBTYMLTABTQ2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I/action/storage_attestation","attest_author":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I/action/author_attestation","sign_citation":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I/action/citation_signature","submit_replication":"https://pith.science/pith/KFGVWSZV7BCXXNBTYMLTABTQ2I/action/replication_record"}},"created_at":"2026-06-02T01:03:43.842497+00:00","updated_at":"2026-06-02T01:03:43.842497+00:00"}