{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:U5S4MQZVD72JMZOBLSNDPAKFKO","short_pith_number":"pith:U5S4MQZV","schema_version":"1.0","canonical_sha256":"a765c643351ff49665c15c9a3781455386255835f47c6ad4af0664b43c995350","source":{"kind":"arxiv","id":"2107.11673","version":4},"attestation_state":"computed","paper":{"title":"ScaleHLS: A New Scalable High-Level Synthesis Framework on Multi-Level Intermediate Representation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.PL","authors_text":"Cong Hao, Deming Chen, Hanchen Ye, Hyunmin Jeong, Jack Huang, Jianyi Cheng, Stephen Neuendorffer","submitted_at":"2021-07-24T19:20:23Z","abstract_excerpt":"High-level synthesis (HLS) has been widely adopted as it significantly improves the hardware design productivity and enables efficient design space exploration (DSE). Existing HLS tools are built using compiler infrastructures largely based on a single-level abstraction, such as LLVM. However, as HLS designs typically come with intrinsic structural or functional hierarchies, different HLS optimization problems are often better solved with different levels of abstractions. This paper proposes ScaleHLS, a new scalable and customizable HLS framework, on top of a multi-level compiler infrastructur"},"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":"2107.11673","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-07-24T19:20:23Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"513f6a41127ca2b980be01ec4c5e4a0926b5f430499340f70db6b469ee223276","abstract_canon_sha256":"0af6b118af6943d14916fdb0c1b93657849b642c1a101d55a317efb5ed9af67b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:03.342262Z","signature_b64":"OIxKNAqfrO7nxOsM7mphoQYLB3DiLtQpMiuZNLXpnk3VVATfIkn7k5mxK1/Jk2fBhuoBz/SeTdt/2JkMRRXIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a765c643351ff49665c15c9a3781455386255835f47c6ad4af0664b43c995350","last_reissued_at":"2026-07-05T03:43:03.341865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:03.341865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ScaleHLS: A New Scalable High-Level Synthesis Framework on Multi-Level Intermediate Representation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.PL","authors_text":"Cong Hao, Deming Chen, Hanchen Ye, Hyunmin Jeong, Jack Huang, Jianyi Cheng, Stephen Neuendorffer","submitted_at":"2021-07-24T19:20:23Z","abstract_excerpt":"High-level synthesis (HLS) has been widely adopted as it significantly improves the hardware design productivity and enables efficient design space exploration (DSE). Existing HLS tools are built using compiler infrastructures largely based on a single-level abstraction, such as LLVM. However, as HLS designs typically come with intrinsic structural or functional hierarchies, different HLS optimization problems are often better solved with different levels of abstractions. This paper proposes ScaleHLS, a new scalable and customizable HLS framework, on top of a multi-level compiler infrastructur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11673","kind":"arxiv","version":4},"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/2107.11673/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":"2107.11673","created_at":"2026-07-05T03:43:03.341922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.11673v4","created_at":"2026-07-05T03:43:03.341922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11673","created_at":"2026-07-05T03:43:03.341922+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5S4MQZVD72J","created_at":"2026-07-05T03:43:03.341922+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5S4MQZVD72JMZOB","created_at":"2026-07-05T03:43:03.341922+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5S4MQZV","created_at":"2026-07-05T03:43:03.341922+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06791","citing_title":"HLSmith: An Expert-Guided Agentic Framework for C/C++-to-HLS Translation","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO","json":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO.json","graph_json":"https://pith.science/api/pith-number/U5S4MQZVD72JMZOBLSNDPAKFKO/graph.json","events_json":"https://pith.science/api/pith-number/U5S4MQZVD72JMZOBLSNDPAKFKO/events.json","paper":"https://pith.science/paper/U5S4MQZV"},"agent_actions":{"view_html":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO","download_json":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO.json","view_paper":"https://pith.science/paper/U5S4MQZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.11673&json=true","fetch_graph":"https://pith.science/api/pith-number/U5S4MQZVD72JMZOBLSNDPAKFKO/graph.json","fetch_events":"https://pith.science/api/pith-number/U5S4MQZVD72JMZOBLSNDPAKFKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO/action/storage_attestation","attest_author":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO/action/author_attestation","sign_citation":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO/action/citation_signature","submit_replication":"https://pith.science/pith/U5S4MQZVD72JMZOBLSNDPAKFKO/action/replication_record"}},"created_at":"2026-07-05T03:43:03.341922+00:00","updated_at":"2026-07-05T03:43:03.341922+00:00"}