{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LBXVC5IU3M2QENRO5DOT3FDLZL","short_pith_number":"pith:LBXVC5IU","schema_version":"1.0","canonical_sha256":"586f517514db3502362ee8dd3d946bcaef3b721b8e6f4248441b86ec7c9391ee","source":{"kind":"arxiv","id":"2503.08823","version":2},"attestation_state":"computed","paper":{"title":"ResBench: Benchmarking LLM-Generated FPGA Designs with Resource Awareness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.ET","cs.LG"],"primary_cat":"cs.AR","authors_text":"Ce Guo, Tong Zhao","submitted_at":"2025-03-11T18:54:17Z","abstract_excerpt":"Field-Programmable Gate Arrays (FPGAs) are widely used in modern hardware design, yet writing Hardware Description Language (HDL) code for FPGA implementation remains a complex and time-consuming task. Large Language Models (LLMs) have emerged as a promising tool for HDL generation, but existing benchmarks for LLM-based code generation primarily focus on functional correctness while overlooking hardware resource usage. Furthermore, current benchmarks offer limited diversity and do not fully represent the wide range of real-world FPGA applications. To address these shortcomings, we introduce Re"},"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":"2503.08823","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-03-11T18:54:17Z","cross_cats_sorted":["cs.AI","cs.CL","cs.ET","cs.LG"],"title_canon_sha256":"5e6e26c916a82ae198ec6c026dbfd299058b6dd8d8d4c6b2733fa736d88e5be4","abstract_canon_sha256":"9dbb627121c712513dee287f945eaec0ee8a142b7483c8dc53e5dd126061720a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:46.867010Z","signature_b64":"3s1DiAbeHdNxNuOlhANl90EC22oJqkhLIJh9aidJr3d004sMZHQTttWESibiJvjthG3HmEFotHvSmnc0H2rNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"586f517514db3502362ee8dd3d946bcaef3b721b8e6f4248441b86ec7c9391ee","last_reissued_at":"2026-07-05T10:37:46.866331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:46.866331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ResBench: Benchmarking LLM-Generated FPGA Designs with Resource Awareness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.ET","cs.LG"],"primary_cat":"cs.AR","authors_text":"Ce Guo, Tong Zhao","submitted_at":"2025-03-11T18:54:17Z","abstract_excerpt":"Field-Programmable Gate Arrays (FPGAs) are widely used in modern hardware design, yet writing Hardware Description Language (HDL) code for FPGA implementation remains a complex and time-consuming task. Large Language Models (LLMs) have emerged as a promising tool for HDL generation, but existing benchmarks for LLM-based code generation primarily focus on functional correctness while overlooking hardware resource usage. Furthermore, current benchmarks offer limited diversity and do not fully represent the wide range of real-world FPGA applications. To address these shortcomings, we introduce Re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08823","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/2503.08823/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":"2503.08823","created_at":"2026-07-05T10:37:46.866414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.08823v2","created_at":"2026-07-05T10:37:46.866414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08823","created_at":"2026-07-05T10:37:46.866414+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBXVC5IU3M2Q","created_at":"2026-07-05T10:37:46.866414+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBXVC5IU3M2QENRO","created_at":"2026-07-05T10:37:46.866414+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBXVC5IU","created_at":"2026-07-05T10:37:46.866414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14625","citing_title":"Towards Optimal Circuit Generation: Multi-Agent Collaboration Meets Collective Intelligence","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL","json":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL.json","graph_json":"https://pith.science/api/pith-number/LBXVC5IU3M2QENRO5DOT3FDLZL/graph.json","events_json":"https://pith.science/api/pith-number/LBXVC5IU3M2QENRO5DOT3FDLZL/events.json","paper":"https://pith.science/paper/LBXVC5IU"},"agent_actions":{"view_html":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL","download_json":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL.json","view_paper":"https://pith.science/paper/LBXVC5IU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.08823&json=true","fetch_graph":"https://pith.science/api/pith-number/LBXVC5IU3M2QENRO5DOT3FDLZL/graph.json","fetch_events":"https://pith.science/api/pith-number/LBXVC5IU3M2QENRO5DOT3FDLZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL/action/storage_attestation","attest_author":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL/action/author_attestation","sign_citation":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL/action/citation_signature","submit_replication":"https://pith.science/pith/LBXVC5IU3M2QENRO5DOT3FDLZL/action/replication_record"}},"created_at":"2026-07-05T10:37:46.866414+00:00","updated_at":"2026-07-05T10:37:46.866414+00:00"}