{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F5HHAYOCJ4USXJ7QTAOCPLMWAP","short_pith_number":"pith:F5HHAYOC","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"},"canonical_sha256":"2f4e7061c24f292ba7f0981c27ad9603c9da7aa2b4977578f7e99a7db440e7aa","source":{"kind":"arxiv","id":"1801.02190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02190","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02190v1","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02190","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"F5HHAYOCJ4US","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F5HHAYOCJ4USXJ7Q","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F5HHAYOC","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F5HHAYOCJ4USXJ7QTAOCPLMWAP","target":"record","payload":{"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"},"canonical_sha256":"2f4e7061c24f292ba7f0981c27ad9603c9da7aa2b4977578f7e99a7db440e7aa","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"},"source_kind":"arxiv","source_id":"1801.02190","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbZkRjPifriK63cp0syD4wVIctJ/IwvzGzw5zbYTXFWVmTHcCg6nhmJ0g0HJ5nGTHsnx20dB6pZ1Mhzglc3mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:52:43.662717Z"},"content_sha256":"3a9c7212d3e7de8211ee0ac843bd6dbf0d80f1959f2c68ef507585bb95077625","schema_version":"1.0","event_id":"sha256:3a9c7212d3e7de8211ee0ac843bd6dbf0d80f1959f2c68ef507585bb95077625"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F5HHAYOCJ4USXJ7QTAOCPLMWAP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqjb+a8bq/OJgET9pQWKppfyFtXRgAD9kVLi2hVD/hNrRPUOJ9DFh/ek5zwYE2/lAAwvpTCjGIIM7v2OvHCCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:52:43.663057Z"},"content_sha256":"1df8ff959b3d66ae1b4558e0a95e1eb716867a96a7f6af58b4e77b2b710f93ef","schema_version":"1.0","event_id":"sha256:1df8ff959b3d66ae1b4558e0a95e1eb716867a96a7f6af58b4e77b2b710f93ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/bundle.json","state_url":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T12:52:43Z","links":{"resolver":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP","bundle":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/bundle.json","state":"https://pith.science/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5HHAYOCJ4USXJ7QTAOCPLMWAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F5HHAYOCJ4USXJ7QTAOCPLMWAP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"38d4fd7c40d0a86a7496b6d4b4d4e207bcca8ed29b2e094fc82073228cad3e53","cross_cats_sorted":["cs.AR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T13:46:03Z","title_canon_sha256":"b8109d8ae3b104f87cd43839556aa6ed22c0e5e4cb318c3d4eb04d9d3e4598bf"},"schema_version":"1.0","source":{"id":"1801.02190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02190","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02190v1","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02190","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"F5HHAYOCJ4US","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F5HHAYOCJ4USXJ7Q","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F5HHAYOC","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:1df8ff959b3d66ae1b4558e0a95e1eb716867a96a7f6af58b4e77b2b710f93ef","target":"graph","created_at":"2026-05-18T00:26:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alexandros Kouris, Christos-Savvas Bouganis, Michalis Rizakis, Stylianos I. Venieris","cross_cats":["cs.AR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T13:46:03Z","title":"Approximate FPGA-based LSTMs under Computation Time Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02190","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a9c7212d3e7de8211ee0ac843bd6dbf0d80f1959f2c68ef507585bb95077625","target":"record","created_at":"2026-05-18T00:26:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"38d4fd7c40d0a86a7496b6d4b4d4e207bcca8ed29b2e094fc82073228cad3e53","cross_cats_sorted":["cs.AR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T13:46:03Z","title_canon_sha256":"b8109d8ae3b104f87cd43839556aa6ed22c0e5e4cb318c3d4eb04d9d3e4598bf"},"schema_version":"1.0","source":{"id":"1801.02190","kind":"arxiv","version":1}},"canonical_sha256":"2f4e7061c24f292ba7f0981c27ad9603c9da7aa2b4977578f7e99a7db440e7aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f4e7061c24f292ba7f0981c27ad9603c9da7aa2b4977578f7e99a7db440e7aa","first_computed_at":"2026-05-18T00:26:22.958675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:22.958675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZw59H2UpsD66xrMvgWxePpLmWM5o2ww4zPa02YBW7NIojroFKZa285YTrwZF57pPro7jdkZYkgVOPsEQt3ADg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:22.959354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a9c7212d3e7de8211ee0ac843bd6dbf0d80f1959f2c68ef507585bb95077625","sha256:1df8ff959b3d66ae1b4558e0a95e1eb716867a96a7f6af58b4e77b2b710f93ef"],"state_sha256":"93500f203bfcaf7e2258c84ba78a0e59230727eb641a566274869852c0fb9844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftbo5STe+XbGODVnwwwmSwTFek7CNoOVi1j5XluUw7w0W0cU4wLJZTCG93mygQpCdbLOlq2az4jLJ6ZAdNbJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:52:43.664990Z","bundle_sha256":"bb1b05dd2219f603636f516abb5f3539d2071267959f8be56d25d50c1484a818"}}