{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F5HHAYOCJ4USXJ7QTAOCPLMWAP","short_pith_number":"pith:F5HHAYOC","schema_version":"1.0","canonical_sha256":"2f4e7061c24f292ba7f0981c27ad9603c9da7aa2b4977578f7e99a7db440e7aa","source":{"kind":"arxiv","id":"1801.02190","version":1},"attestation_state":"computed","paper":{"title":"Approximate FPGA-based LSTMs under Computation Time Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Alexandros Kouris, Christos-Savvas Bouganis, Michalis Rizakis, Stylianos I. Venieris","submitted_at":"2018-01-07T13:46:03Z","abstract_excerpt":"Recurrent Neural Networks and in particular Long Short-Term Memory (LSTM) networks have demonstrated state-of-the-art accuracy in several emerging Artificial Intelligence tasks. However, the models are becoming increasingly demanding in terms of computational and memory load. Emerging latency-sensitive applications including mobile robots and autonomous vehicles often operate under stringent computation time constraints. In this paper, we address the challenge of deploying computationally demanding LSTMs at a constrained time budget by introducing an approximate computing scheme that combines "},"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":"1801.02190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T13:46:03Z","cross_cats_sorted":["cs.AR","cs.LG"],"title_canon_sha256":"b8109d8ae3b104f87cd43839556aa6ed22c0e5e4cb318c3d4eb04d9d3e4598bf","abstract_canon_sha256":"38d4fd7c40d0a86a7496b6d4b4d4e207bcca8ed29b2e094fc82073228cad3e53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:22.959354Z","signature_b64":"yZw59H2UpsD66xrMvgWxePpLmWM5o2ww4zPa02YBW7NIojroFKZa285YTrwZF57pPro7jdkZYkgVOPsEQt3ADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f4e7061c24f292ba7f0981c27ad9603c9da7aa2b4977578f7e99a7db440e7aa","last_reissued_at":"2026-05-18T00:26:22.958675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:22.958675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate FPGA-based LSTMs under Computation Time Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Alexandros Kouris, Christos-Savvas Bouganis, Michalis Rizakis, Stylianos I. Venieris","submitted_at":"2018-01-07T13:46:03Z","abstract_excerpt":"Recurrent Neural Networks and in particular Long Short-Term Memory (LSTM) networks have demonstrated state-of-the-art accuracy in several emerging Artificial Intelligence tasks. However, the models are becoming increasingly demanding in terms of computational and memory load. Emerging latency-sensitive applications including mobile robots and autonomous vehicles often operate under stringent computation time constraints. In this paper, we address the challenge of deploying computationally demanding LSTMs at a constrained time budget by introducing an approximate computing scheme that combines "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02190","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":"1801.02190","created_at":"2026-05-18T00:26:22.958760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02190v1","created_at":"2026-05-18T00:26:22.958760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02190","created_at":"2026-05-18T00:26:22.958760+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5HHAYOCJ4US","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5HHAYOCJ4USXJ7Q","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5HHAYOC","created_at":"2026-05-18T12:32:22.470017+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/F5HHAYOCJ4USXJ7QTAOCPLMWAP","json":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP.json","graph_json":"https://pith.science/api/pith-number/F5HHAYOCJ4USXJ7QTAOCPLMWAP/graph.json","events_json":"https://pith.science/api/pith-number/F5HHAYOCJ4USXJ7QTAOCPLMWAP/events.json","paper":"https://pith.science/paper/F5HHAYOC"},"agent_actions":{"view_html":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP","download_json":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP.json","view_paper":"https://pith.science/paper/F5HHAYOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02190&json=true","fetch_graph":"https://pith.science/api/pith-number/F5HHAYOCJ4USXJ7QTAOCPLMWAP/graph.json","fetch_events":"https://pith.science/api/pith-number/F5HHAYOCJ4USXJ7QTAOCPLMWAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/action/storage_attestation","attest_author":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/action/author_attestation","sign_citation":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/action/citation_signature","submit_replication":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/action/replication_record"}},"created_at":"2026-05-18T00:26:22.958760+00:00","updated_at":"2026-05-18T00:26:22.958760+00:00"}