{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X2G7JQPPUWEI36TZIDS5BM5ATD","short_pith_number":"pith:X2G7JQPP","schema_version":"1.0","canonical_sha256":"be8df4c1efa5888dfa7940e5d0b3a098d764caf3db261455e05ed8e3290f5619","source":{"kind":"arxiv","id":"1807.06434","version":1},"attestation_state":"computed","paper":{"title":"DLA: Compiler and FPGA Overlay for Neural Network Inference Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","eess.SP"],"primary_cat":"cs.DC","authors_text":"Andrew Bitar, Andrew C. Ling, David Han, Gordon R. Chiu, Ian Prins, Joseph Chu, Joshua Fender, Mohamed S. Abdelfattah, Nitika Shanker, Roberto DiCecco, Shane OConnell","submitted_at":"2018-07-13T15:25:56Z","abstract_excerpt":"Overlays have shown significant promise for field-programmable gate-arrays (FPGAs) as they allow for fast development cycles and remove many of the challenges of the traditional FPGA hardware design flow. However, this often comes with a significant performance burden resulting in very little adoption of overlays for practical applications. In this paper, we tailor an overlay to a specific application domain, and we show how we maintain its full programmability without paying for the performance overhead traditionally associated with overlays. Specifically, we introduce an overlay targeted for"},"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":"1807.06434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T15:25:56Z","cross_cats_sorted":["cs.AR","eess.SP"],"title_canon_sha256":"52f42790b905313a6cd34ceba0e1cab97a34670cd6c41d4da13e736663e84195","abstract_canon_sha256":"1ab30a84cce124a3cee43d751df9085e8fcad7536ff3dca32de3f6beb0b80244"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:33.048783Z","signature_b64":"2vMzn0ZS0oNPJ1RiZ6PT4prfvR0qNudr5cCBmDC/hE5jybo9PbdcDF5niHvgJWBIFI198xT1PTykDE5vGMM5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be8df4c1efa5888dfa7940e5d0b3a098d764caf3db261455e05ed8e3290f5619","last_reissued_at":"2026-05-18T00:10:33.047589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:33.047589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DLA: Compiler and FPGA Overlay for Neural Network Inference Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","eess.SP"],"primary_cat":"cs.DC","authors_text":"Andrew Bitar, Andrew C. Ling, David Han, Gordon R. Chiu, Ian Prins, Joseph Chu, Joshua Fender, Mohamed S. Abdelfattah, Nitika Shanker, Roberto DiCecco, Shane OConnell","submitted_at":"2018-07-13T15:25:56Z","abstract_excerpt":"Overlays have shown significant promise for field-programmable gate-arrays (FPGAs) as they allow for fast development cycles and remove many of the challenges of the traditional FPGA hardware design flow. However, this often comes with a significant performance burden resulting in very little adoption of overlays for practical applications. In this paper, we tailor an overlay to a specific application domain, and we show how we maintain its full programmability without paying for the performance overhead traditionally associated with overlays. Specifically, we introduce an overlay targeted for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06434","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":""},"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":"1807.06434","created_at":"2026-05-18T00:10:33.047682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06434v1","created_at":"2026-05-18T00:10:33.047682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06434","created_at":"2026-05-18T00:10:33.047682+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2G7JQPPUWEI","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2G7JQPPUWEI36TZ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2G7JQPP","created_at":"2026-05-18T12:33:01.666342+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/X2G7JQPPUWEI36TZIDS5BM5ATD","json":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD.json","graph_json":"https://pith.science/api/pith-number/X2G7JQPPUWEI36TZIDS5BM5ATD/graph.json","events_json":"https://pith.science/api/pith-number/X2G7JQPPUWEI36TZIDS5BM5ATD/events.json","paper":"https://pith.science/paper/X2G7JQPP"},"agent_actions":{"view_html":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD","download_json":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD.json","view_paper":"https://pith.science/paper/X2G7JQPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06434&json=true","fetch_graph":"https://pith.science/api/pith-number/X2G7JQPPUWEI36TZIDS5BM5ATD/graph.json","fetch_events":"https://pith.science/api/pith-number/X2G7JQPPUWEI36TZIDS5BM5ATD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD/action/storage_attestation","attest_author":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD/action/author_attestation","sign_citation":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD/action/citation_signature","submit_replication":"https://pith.science/pith/X2G7JQPPUWEI36TZIDS5BM5ATD/action/replication_record"}},"created_at":"2026-05-18T00:10:33.047682+00:00","updated_at":"2026-05-18T00:10:33.047682+00:00"}