{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OFTDDJVRXJ5LU2DZNFOCNUUH7V","short_pith_number":"pith:OFTDDJVR","schema_version":"1.0","canonical_sha256":"716631a6b1ba7aba6879695c26d287fd5d7b02160278fc6c0aaf3e7ccbf9885a","source":{"kind":"arxiv","id":"1807.03611","version":2},"attestation_state":"computed","paper":{"title":"Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub T\\v{e}tek, Martin Hora, V\\'aclav Kon\\v{c}ick\\'y","submitted_at":"2018-07-10T13:17:37Z","abstract_excerpt":"While FPGAs have been used extensively as hardware accelerators in industrial computation, no theoretical model of computation has been devised for the study of FPGA-based accelerators. In this paper, we present a theoretical model of computation on a system with conventional CPU and an FPGA, based on word-RAM. We show several algorithms in this model which are asymptotically faster than their word-RAM counterparts. Specifically, we show an algorithm for sorting, evaluation of associative operation and general techniques for speeding up some recursive algorithms and some dynamic programs. We a"},"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.03611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T13:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"495b3169b7fb699ebeb74cd3193d4625ca4d495fa4cfcfce10b1e9625c88529a","abstract_canon_sha256":"be12bc50dc7c7611e3c35237981e211a6884bc381fa67d8e1bceb70f61b21c6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:35.027742Z","signature_b64":"faebdIAqG9moz+sKTmN+4tLQGihydXZInGuIk1GhrcjmyzrtNH4yWG2V3258bdTOY+b4XIlHJ1CkekSzIn6oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716631a6b1ba7aba6879695c26d287fd5d7b02160278fc6c0aaf3e7ccbf9885a","last_reissued_at":"2026-05-18T00:00:35.027268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:35.027268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub T\\v{e}tek, Martin Hora, V\\'aclav Kon\\v{c}ick\\'y","submitted_at":"2018-07-10T13:17:37Z","abstract_excerpt":"While FPGAs have been used extensively as hardware accelerators in industrial computation, no theoretical model of computation has been devised for the study of FPGA-based accelerators. In this paper, we present a theoretical model of computation on a system with conventional CPU and an FPGA, based on word-RAM. We show several algorithms in this model which are asymptotically faster than their word-RAM counterparts. Specifically, we show an algorithm for sorting, evaluation of associative operation and general techniques for speeding up some recursive algorithms and some dynamic programs. We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03611","kind":"arxiv","version":2},"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.03611","created_at":"2026-05-18T00:00:35.027336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03611v2","created_at":"2026-05-18T00:00:35.027336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03611","created_at":"2026-05-18T00:00:35.027336+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFTDDJVRXJ5L","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFTDDJVRXJ5LU2DZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFTDDJVR","created_at":"2026-05-18T12:32:43.782077+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/OFTDDJVRXJ5LU2DZNFOCNUUH7V","json":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V.json","graph_json":"https://pith.science/api/pith-number/OFTDDJVRXJ5LU2DZNFOCNUUH7V/graph.json","events_json":"https://pith.science/api/pith-number/OFTDDJVRXJ5LU2DZNFOCNUUH7V/events.json","paper":"https://pith.science/paper/OFTDDJVR"},"agent_actions":{"view_html":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V","download_json":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V.json","view_paper":"https://pith.science/paper/OFTDDJVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03611&json=true","fetch_graph":"https://pith.science/api/pith-number/OFTDDJVRXJ5LU2DZNFOCNUUH7V/graph.json","fetch_events":"https://pith.science/api/pith-number/OFTDDJVRXJ5LU2DZNFOCNUUH7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/action/storage_attestation","attest_author":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/action/author_attestation","sign_citation":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/action/citation_signature","submit_replication":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/action/replication_record"}},"created_at":"2026-05-18T00:00:35.027336+00:00","updated_at":"2026-05-18T00:00:35.027336+00:00"}