{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JIS64XXC5NUNOCLALPJGH56IEM","short_pith_number":"pith:JIS64XXC","schema_version":"1.0","canonical_sha256":"4a25ee5ee2eb68d709605bd263f7c8230ee87a299f619d66e67199ece5659f76","source":{"kind":"arxiv","id":"2104.05421","version":1},"attestation_state":"computed","paper":{"title":"NullaNet Tiny: Ultra-low-latency DNN Inference Through Fixed-function Combinational Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amirhossein Esmaili, Arash Fayyazi, Atharva Khare, Mahdi Nazemi, Massoud Pedram, Soheil Nazar Shahsavani","submitted_at":"2021-04-07T00:16:39Z","abstract_excerpt":"While there is a large body of research on efficient processing of deep neural networks (DNNs), ultra-low-latency realization of these models for applications with stringent, sub-microsecond latency requirements continues to be an unresolved, challenging problem. Field-programmable gate array (FPGA)-based DNN accelerators are gaining traction as a serious contender to replace graphics processing unit/central processing unit-based platforms considering their performance, flexibility, and energy efficiency. This paper presents NullaNet Tiny, an across-the-stack design and optimization framework "},"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":"2104.05421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-07T00:16:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a45399c92ae2681dee3ee23696c960da0d2b080484dc4f4c1c847cc536ad235b","abstract_canon_sha256":"e45029f13f99fa453bccd95f52a167b82fa2c9be486cc4369b3972b6d5209710"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:12.302671Z","signature_b64":"QXbHODw5X01ed5AKs9hCaV+E/a1DEBYXfiRqy7ZEzMFmH86t+YCdp2s4IEZyeZMTNi+bTX9AZ8ZQnYG1xm7TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a25ee5ee2eb68d709605bd263f7c8230ee87a299f619d66e67199ece5659f76","last_reissued_at":"2026-07-05T02:31:12.302175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:12.302175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NullaNet Tiny: Ultra-low-latency DNN Inference Through Fixed-function Combinational Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amirhossein Esmaili, Arash Fayyazi, Atharva Khare, Mahdi Nazemi, Massoud Pedram, Soheil Nazar Shahsavani","submitted_at":"2021-04-07T00:16:39Z","abstract_excerpt":"While there is a large body of research on efficient processing of deep neural networks (DNNs), ultra-low-latency realization of these models for applications with stringent, sub-microsecond latency requirements continues to be an unresolved, challenging problem. Field-programmable gate array (FPGA)-based DNN accelerators are gaining traction as a serious contender to replace graphics processing unit/central processing unit-based platforms considering their performance, flexibility, and energy efficiency. This paper presents NullaNet Tiny, an across-the-stack design and optimization framework "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05421","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/2104.05421/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":"2104.05421","created_at":"2026-07-05T02:31:12.302233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.05421v1","created_at":"2026-07-05T02:31:12.302233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05421","created_at":"2026-07-05T02:31:12.302233+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIS64XXC5NUN","created_at":"2026-07-05T02:31:12.302233+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIS64XXC5NUNOCLA","created_at":"2026-07-05T02:31:12.302233+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIS64XXC","created_at":"2026-07-05T02:31:12.302233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29994","citing_title":"Precomputed 1D-CNNs for Atrial Fibrillation Detection on Tiny Smart Sensor Systems","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM","json":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM.json","graph_json":"https://pith.science/api/pith-number/JIS64XXC5NUNOCLALPJGH56IEM/graph.json","events_json":"https://pith.science/api/pith-number/JIS64XXC5NUNOCLALPJGH56IEM/events.json","paper":"https://pith.science/paper/JIS64XXC"},"agent_actions":{"view_html":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM","download_json":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM.json","view_paper":"https://pith.science/paper/JIS64XXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.05421&json=true","fetch_graph":"https://pith.science/api/pith-number/JIS64XXC5NUNOCLALPJGH56IEM/graph.json","fetch_events":"https://pith.science/api/pith-number/JIS64XXC5NUNOCLALPJGH56IEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM/action/storage_attestation","attest_author":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM/action/author_attestation","sign_citation":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM/action/citation_signature","submit_replication":"https://pith.science/pith/JIS64XXC5NUNOCLALPJGH56IEM/action/replication_record"}},"created_at":"2026-07-05T02:31:12.302233+00:00","updated_at":"2026-07-05T02:31:12.302233+00:00"}