{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JFN3DZMVYR6S3WHAZRM6VQIFRM","short_pith_number":"pith:JFN3DZMV","schema_version":"1.0","canonical_sha256":"495bb1e595c47d2dd8e0cc59eac1058b32adcfcfc3c7c86986dcd8f3e631f5cd","source":{"kind":"arxiv","id":"2310.00330","version":1},"attestation_state":"computed","paper":{"title":"A DSP shared is a DSP earned: HLS Task-Level Multi-Pumping for High-Performance Low-Resource Designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Giovanni Brignone, Luciano Lavagno, Mihai T. Lazarescu","submitted_at":"2023-09-30T10:28:47Z","abstract_excerpt":"High-level synthesis (HLS) enhances digital hardware design productivity through a high abstraction level. Even if the HLS abstraction prevents fine-grained manual register-transfer level (RTL) optimizations, it also enables automatable optimizations that would be unfeasible or hard to automate at RTL. Specifically, we propose a task-level multi-pumping methodology to reduce resource utilization, particularly digital signal processors (DSPs), while preserving the throughput of HLS kernels modeled as dataflow graphs (DFGs) targeting field-programmable gate arrays. The methodology exploits the H"},"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":"2310.00330","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2023-09-30T10:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"bb1ebeb836fdbdb327b2e5e00cc3e243775d43a86e935fa95a6a3db039ef50a2","abstract_canon_sha256":"04f48e6f9ae045e57c99abd0d66b66a74bc4be6852b8b4862020122e514c7083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:46.022176Z","signature_b64":"xURidv4GyJ2mLpTyJiP11GfuV/woDzEPGO0YLXrH3Xw8paUm6oxWu6Y9oKao1SG7B+BMdS4/YT+D1mRWHOmSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"495bb1e595c47d2dd8e0cc59eac1058b32adcfcfc3c7c86986dcd8f3e631f5cd","last_reissued_at":"2026-07-05T07:28:46.021718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:46.021718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A DSP shared is a DSP earned: HLS Task-Level Multi-Pumping for High-Performance Low-Resource Designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Giovanni Brignone, Luciano Lavagno, Mihai T. Lazarescu","submitted_at":"2023-09-30T10:28:47Z","abstract_excerpt":"High-level synthesis (HLS) enhances digital hardware design productivity through a high abstraction level. Even if the HLS abstraction prevents fine-grained manual register-transfer level (RTL) optimizations, it also enables automatable optimizations that would be unfeasible or hard to automate at RTL. Specifically, we propose a task-level multi-pumping methodology to reduce resource utilization, particularly digital signal processors (DSPs), while preserving the throughput of HLS kernels modeled as dataflow graphs (DFGs) targeting field-programmable gate arrays. The methodology exploits the H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00330","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/2310.00330/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":"2310.00330","created_at":"2026-07-05T07:28:46.021771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.00330v1","created_at":"2026-07-05T07:28:46.021771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00330","created_at":"2026-07-05T07:28:46.021771+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFN3DZMVYR6S","created_at":"2026-07-05T07:28:46.021771+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFN3DZMVYR6S3WHA","created_at":"2026-07-05T07:28:46.021771+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFN3DZMV","created_at":"2026-07-05T07:28:46.021771+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM","json":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM.json","graph_json":"https://pith.science/api/pith-number/JFN3DZMVYR6S3WHAZRM6VQIFRM/graph.json","events_json":"https://pith.science/api/pith-number/JFN3DZMVYR6S3WHAZRM6VQIFRM/events.json","paper":"https://pith.science/paper/JFN3DZMV"},"agent_actions":{"view_html":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM","download_json":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM.json","view_paper":"https://pith.science/paper/JFN3DZMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.00330&json=true","fetch_graph":"https://pith.science/api/pith-number/JFN3DZMVYR6S3WHAZRM6VQIFRM/graph.json","fetch_events":"https://pith.science/api/pith-number/JFN3DZMVYR6S3WHAZRM6VQIFRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM/action/storage_attestation","attest_author":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM/action/author_attestation","sign_citation":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM/action/citation_signature","submit_replication":"https://pith.science/pith/JFN3DZMVYR6S3WHAZRM6VQIFRM/action/replication_record"}},"created_at":"2026-07-05T07:28:46.021771+00:00","updated_at":"2026-07-05T07:28:46.021771+00:00"}