{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FGMN45BB6XYFVJU5FDOQV5ZBQH","short_pith_number":"pith:FGMN45BB","schema_version":"1.0","canonical_sha256":"2998de7421f5f05aa69d28dd0af72181d3c4b93fe767c020799987c5489ec2c0","source":{"kind":"arxiv","id":"2507.21485","version":1},"attestation_state":"computed","paper":{"title":"HLSDebugger: Identification and Correction of Logic Bugs in HLS Code with LLM Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Jing Wang, Shang Liu, Yao Lu, Zhiyao Xie","submitted_at":"2025-07-29T03:59:19Z","abstract_excerpt":"High-level synthesis (HLS) accelerates hardware design by enabling the automatic translation of high-level descriptions into efficient hardware implementations. However, debugging HLS code is a challenging and labor-intensive task, especially for novice circuit designers or software engineers without sufficient hardware domain knowledge. The recent emergence of Large Language Models (LLMs) is promising in automating the HLS debugging process. Despite the great potential, three key challenges persist when applying LLMs to HLS logic debugging: 1) High-quality circuit data for training LLMs is sc"},"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":"2507.21485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2025-07-29T03:59:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f157e50a853d9c2a80922dd9fbf12a31808aed37b1129b8a8c136e3af007429b","abstract_canon_sha256":"e1e6f00581e99d539a29b909ccad584d52e5eb5dffae9bd395bf8acb145316fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:00.886997Z","signature_b64":"YBl1VP+QgmqtSFoSV7Hr3pUbRSpsRCF8TojoyOWB94OObRfNgcixLtiy38eYcPbmTm8KXzJUru2flynbd4V0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2998de7421f5f05aa69d28dd0af72181d3c4b93fe767c020799987c5489ec2c0","last_reissued_at":"2026-07-05T11:45:00.886549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:00.886549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HLSDebugger: Identification and Correction of Logic Bugs in HLS Code with LLM Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Jing Wang, Shang Liu, Yao Lu, Zhiyao Xie","submitted_at":"2025-07-29T03:59:19Z","abstract_excerpt":"High-level synthesis (HLS) accelerates hardware design by enabling the automatic translation of high-level descriptions into efficient hardware implementations. However, debugging HLS code is a challenging and labor-intensive task, especially for novice circuit designers or software engineers without sufficient hardware domain knowledge. The recent emergence of Large Language Models (LLMs) is promising in automating the HLS debugging process. Despite the great potential, three key challenges persist when applying LLMs to HLS logic debugging: 1) High-quality circuit data for training LLMs is sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21485","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/2507.21485/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":"2507.21485","created_at":"2026-07-05T11:45:00.886606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.21485v1","created_at":"2026-07-05T11:45:00.886606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21485","created_at":"2026-07-05T11:45:00.886606+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGMN45BB6XYF","created_at":"2026-07-05T11:45:00.886606+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGMN45BB6XYFVJU5","created_at":"2026-07-05T11:45:00.886606+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGMN45BB","created_at":"2026-07-05T11:45:00.886606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18162","citing_title":"VerilogCL: A Contrastive Learning Framework for Robust LLM-Based Verilog Generation","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH","json":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH.json","graph_json":"https://pith.science/api/pith-number/FGMN45BB6XYFVJU5FDOQV5ZBQH/graph.json","events_json":"https://pith.science/api/pith-number/FGMN45BB6XYFVJU5FDOQV5ZBQH/events.json","paper":"https://pith.science/paper/FGMN45BB"},"agent_actions":{"view_html":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH","download_json":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH.json","view_paper":"https://pith.science/paper/FGMN45BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.21485&json=true","fetch_graph":"https://pith.science/api/pith-number/FGMN45BB6XYFVJU5FDOQV5ZBQH/graph.json","fetch_events":"https://pith.science/api/pith-number/FGMN45BB6XYFVJU5FDOQV5ZBQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH/action/storage_attestation","attest_author":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH/action/author_attestation","sign_citation":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH/action/citation_signature","submit_replication":"https://pith.science/pith/FGMN45BB6XYFVJU5FDOQV5ZBQH/action/replication_record"}},"created_at":"2026-07-05T11:45:00.886606+00:00","updated_at":"2026-07-05T11:45:00.886606+00:00"}