{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y7PXCDDVZ2B4EDU5ETNZ43TPA7","short_pith_number":"pith:Y7PXCDDV","schema_version":"1.0","canonical_sha256":"c7df710c75ce83c20e9d24db9e6e6f07dd6f119ff00115c15faff2bc21b324b6","source":{"kind":"arxiv","id":"2504.21187","version":1},"attestation_state":"computed","paper":{"title":"LIFT: LLM-Based Pragma Insertion for HLS via GNN Supervised Fine-Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jason Cong, Neha Prakriya, Yizhou Sun, Zijian Ding","submitted_at":"2025-04-29T21:42:59Z","abstract_excerpt":"FPGAs are increasingly adopted in datacenter environments for their reconfigurability and energy efficiency. High-Level Synthesis (HLS) tools have eased FPGA programming by raising the abstraction level from RTL to untimed C/C++, yet attaining high performance still demands expert knowledge and iterative manual insertion of optimization pragmas to modify the microarchitecture. To address this challenge, we propose LIFT, a large language model (LLM)-based coding assistant for HLS that automatically generates performance-critical pragmas given a C/C++ design. We fine-tune the LLM by tightly inte"},"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":"2504.21187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-29T21:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"7d4300d041850b4e52f6d4547e06b43e3b6ae8ed04c0d177e3c4d6fbc5b55f99","abstract_canon_sha256":"0d2b4219ba7a03c4e830a700dfec4b961234a688c2a2a9e7f9954e19573d22ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:58.609095Z","signature_b64":"baqhCTmmldMEleYjl8kyGIVeBr+ULskFQ/7+pcFrJwqeShuZMnCrUe9jM1L0mDShxY2EtOsW4CFZyJc3y9V8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7df710c75ce83c20e9d24db9e6e6f07dd6f119ff00115c15faff2bc21b324b6","last_reissued_at":"2026-07-05T10:55:58.608611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:58.608611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LIFT: LLM-Based Pragma Insertion for HLS via GNN Supervised Fine-Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jason Cong, Neha Prakriya, Yizhou Sun, Zijian Ding","submitted_at":"2025-04-29T21:42:59Z","abstract_excerpt":"FPGAs are increasingly adopted in datacenter environments for their reconfigurability and energy efficiency. High-Level Synthesis (HLS) tools have eased FPGA programming by raising the abstraction level from RTL to untimed C/C++, yet attaining high performance still demands expert knowledge and iterative manual insertion of optimization pragmas to modify the microarchitecture. To address this challenge, we propose LIFT, a large language model (LLM)-based coding assistant for HLS that automatically generates performance-critical pragmas given a C/C++ design. We fine-tune the LLM by tightly inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21187","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/2504.21187/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":"2504.21187","created_at":"2026-07-05T10:55:58.608670+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21187v1","created_at":"2026-07-05T10:55:58.608670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21187","created_at":"2026-07-05T10:55:58.608670+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7PXCDDVZ2B4","created_at":"2026-07-05T10:55:58.608670+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7PXCDDVZ2B4EDU5","created_at":"2026-07-05T10:55:58.608670+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7PXCDDV","created_at":"2026-07-05T10:55:58.608670+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28409","citing_title":"Evidence-Driven LLM Agent for C-to-Synthesizable-C Conversion and Verification","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07246","citing_title":"MailoHLS: Multi-Adapter Structure-Aware Learning for Pareto-Driven HLS Pragma Optimization","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15237","citing_title":"A3D: Agentic AI flow for autonomous Accelerator Design","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2603.25719","citing_title":"Agent Factories for High Level Synthesis: How Far Can General-Purpose Coding Agents Go in Hardware Optimization?","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7","json":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7.json","graph_json":"https://pith.science/api/pith-number/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/graph.json","events_json":"https://pith.science/api/pith-number/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/events.json","paper":"https://pith.science/paper/Y7PXCDDV"},"agent_actions":{"view_html":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7","download_json":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7.json","view_paper":"https://pith.science/paper/Y7PXCDDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21187&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/action/storage_attestation","attest_author":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/action/author_attestation","sign_citation":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/action/citation_signature","submit_replication":"https://pith.science/pith/Y7PXCDDVZ2B4EDU5ETNZ43TPA7/action/replication_record"}},"created_at":"2026-07-05T10:55:58.608670+00:00","updated_at":"2026-07-05T10:55:58.608670+00:00"}