{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JARKM3B7ZIYF7CU67CMEJPCGHH","short_pith_number":"pith:JARKM3B7","schema_version":"1.0","canonical_sha256":"4822a66c3fca305f8a9ef89844bc4639e358706fd10599728664eed580dd11a7","source":{"kind":"arxiv","id":"2406.09233","version":1},"attestation_state":"computed","paper":{"title":"C2HLSC: Can LLMs Bridge the Software-to-Hardware Design Gap?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Luca Collini, Ramesh Karri, Siddharth Garg","submitted_at":"2024-06-13T15:33:54Z","abstract_excerpt":"High Level Synthesis (HLS) tools offer rapid hardware design from C code, but their compatibility is limited by code constructs. This paper investigates Large Language Models (LLMs) for refactoring C code into HLS-compatible formats. We present several case studies by using an LLM to rewrite C code for NIST 800-22 randomness tests, a QuickSort algorithm and AES-128 into HLS-synthesizable c. The LLM iteratively transforms the C code guided by user prompts, implementing functions like streaming data and hardware-specific signals. This evaluation demonstrates the LLM's potential to assist hardwar"},"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":"2406.09233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-06-13T15:33:54Z","cross_cats_sorted":[],"title_canon_sha256":"6ad4cbe8073a455b973e607b1583fb77d448ad094945ff5b71c01e547c974990","abstract_canon_sha256":"b46714d88feb2e1908b3fe2f6d11a4ad471821cbe549172a9ee1581849673a22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:16.799956Z","signature_b64":"PwT6rA2D5Ksy7bkTgnwBwacVdiiDW+i4j8qw9L/X4zRUjCeqze+nN6+fPj/4/xYR40uUJkxBFFpzC0w0rjG+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4822a66c3fca305f8a9ef89844bc4639e358706fd10599728664eed580dd11a7","last_reissued_at":"2026-07-05T10:48:16.799471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:16.799471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"C2HLSC: Can LLMs Bridge the Software-to-Hardware Design Gap?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Luca Collini, Ramesh Karri, Siddharth Garg","submitted_at":"2024-06-13T15:33:54Z","abstract_excerpt":"High Level Synthesis (HLS) tools offer rapid hardware design from C code, but their compatibility is limited by code constructs. This paper investigates Large Language Models (LLMs) for refactoring C code into HLS-compatible formats. We present several case studies by using an LLM to rewrite C code for NIST 800-22 randomness tests, a QuickSort algorithm and AES-128 into HLS-synthesizable c. The LLM iteratively transforms the C code guided by user prompts, implementing functions like streaming data and hardware-specific signals. This evaluation demonstrates the LLM's potential to assist hardwar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09233","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/2406.09233/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":"2406.09233","created_at":"2026-07-05T10:48:16.799529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09233v1","created_at":"2026-07-05T10:48:16.799529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09233","created_at":"2026-07-05T10:48:16.799529+00:00"},{"alias_kind":"pith_short_12","alias_value":"JARKM3B7ZIYF","created_at":"2026-07-05T10:48:16.799529+00:00"},{"alias_kind":"pith_short_16","alias_value":"JARKM3B7ZIYF7CU6","created_at":"2026-07-05T10:48:16.799529+00:00"},{"alias_kind":"pith_short_8","alias_value":"JARKM3B7","created_at":"2026-07-05T10:48:16.799529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30949","citing_title":"AgRefactor: Self-Evolving Agentic Workflow for HLS Compatibility and Performance","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH","json":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH.json","graph_json":"https://pith.science/api/pith-number/JARKM3B7ZIYF7CU67CMEJPCGHH/graph.json","events_json":"https://pith.science/api/pith-number/JARKM3B7ZIYF7CU67CMEJPCGHH/events.json","paper":"https://pith.science/paper/JARKM3B7"},"agent_actions":{"view_html":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH","download_json":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH.json","view_paper":"https://pith.science/paper/JARKM3B7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09233&json=true","fetch_graph":"https://pith.science/api/pith-number/JARKM3B7ZIYF7CU67CMEJPCGHH/graph.json","fetch_events":"https://pith.science/api/pith-number/JARKM3B7ZIYF7CU67CMEJPCGHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH/action/storage_attestation","attest_author":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH/action/author_attestation","sign_citation":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH/action/citation_signature","submit_replication":"https://pith.science/pith/JARKM3B7ZIYF7CU67CMEJPCGHH/action/replication_record"}},"created_at":"2026-07-05T10:48:16.799529+00:00","updated_at":"2026-07-05T10:48:16.799529+00:00"}