{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OFTDDJVRXJ5LU2DZNFOCNUUH7V","short_pith_number":"pith:OFTDDJVR","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"},"canonical_sha256":"716631a6b1ba7aba6879695c26d287fd5d7b02160278fc6c0aaf3e7ccbf9885a","source":{"kind":"arxiv","id":"1807.03611","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03611","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03611v2","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03611","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"OFTDDJVRXJ5L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFTDDJVRXJ5LU2DZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFTDDJVR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OFTDDJVRXJ5LU2DZNFOCNUUH7V","target":"record","payload":{"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"},"canonical_sha256":"716631a6b1ba7aba6879695c26d287fd5d7b02160278fc6c0aaf3e7ccbf9885a","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"},"source_kind":"arxiv","source_id":"1807.03611","source_version":2,"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:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UM139uynjYjA8ZpQFcdtCHyl247O04Hnf3MzOh5rUl8bReROhPeZv+Spv0o2cs9ZUpq6om0tvY6hqaRWUHL1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:18:56.664187Z"},"content_sha256":"868da0c6974465bfa0369ac4ca26cbb25b48fb014d7b5f61307ddecedab531d0","schema_version":"1.0","event_id":"sha256:868da0c6974465bfa0369ac4ca26cbb25b48fb014d7b5f61307ddecedab531d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OFTDDJVRXJ5LU2DZNFOCNUUH7V","target":"graph","payload":{"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"},"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:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X21j8huFiv7r62tsaFNkAK8C+p1aeATJzIi2kHx5pw0TN0lo/D91eIYF4oO2r5GegrjRCXTOxkiP0YL/JRfvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:18:56.664801Z"},"content_sha256":"9224e2e3d01171846373b6a02f2b8c7fd774de742348336b5ab6ad6bd4742ac6","schema_version":"1.0","event_id":"sha256:9224e2e3d01171846373b6a02f2b8c7fd774de742348336b5ab6ad6bd4742ac6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/bundle.json","state_url":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/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-06-05T10:18:56Z","links":{"resolver":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V","bundle":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/bundle.json","state":"https://pith.science/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFTDDJVRXJ5LU2DZNFOCNUUH7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OFTDDJVRXJ5LU2DZNFOCNUUH7V","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":"be12bc50dc7c7611e3c35237981e211a6884bc381fa67d8e1bceb70f61b21c6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T13:17:37Z","title_canon_sha256":"495b3169b7fb699ebeb74cd3193d4625ca4d495fa4cfcfce10b1e9625c88529a"},"schema_version":"1.0","source":{"id":"1807.03611","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03611","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03611v2","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03611","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"OFTDDJVRXJ5L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFTDDJVRXJ5LU2DZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFTDDJVR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:9224e2e3d01171846373b6a02f2b8c7fd774de742348336b5ab6ad6bd4742ac6","target":"graph","created_at":"2026-05-18T00:00:35Z","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":"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","authors_text":"Jakub T\\v{e}tek, Martin Hora, V\\'aclav Kon\\v{c}ick\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T13:17:37Z","title":"Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03611","kind":"arxiv","version":2},"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:868da0c6974465bfa0369ac4ca26cbb25b48fb014d7b5f61307ddecedab531d0","target":"record","created_at":"2026-05-18T00:00:35Z","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":"be12bc50dc7c7611e3c35237981e211a6884bc381fa67d8e1bceb70f61b21c6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T13:17:37Z","title_canon_sha256":"495b3169b7fb699ebeb74cd3193d4625ca4d495fa4cfcfce10b1e9625c88529a"},"schema_version":"1.0","source":{"id":"1807.03611","kind":"arxiv","version":2}},"canonical_sha256":"716631a6b1ba7aba6879695c26d287fd5d7b02160278fc6c0aaf3e7ccbf9885a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"716631a6b1ba7aba6879695c26d287fd5d7b02160278fc6c0aaf3e7ccbf9885a","first_computed_at":"2026-05-18T00:00:35.027268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:35.027268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"faebdIAqG9moz+sKTmN+4tLQGihydXZInGuIk1GhrcjmyzrtNH4yWG2V3258bdTOY+b4XIlHJ1CkekSzIn6oAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:35.027742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03611","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:868da0c6974465bfa0369ac4ca26cbb25b48fb014d7b5f61307ddecedab531d0","sha256:9224e2e3d01171846373b6a02f2b8c7fd774de742348336b5ab6ad6bd4742ac6"],"state_sha256":"5186e16709ecd0b3be5e0d97075974e634cdca4de77fa4e6ef300a222088ab99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWfLUAHEEvgpVkvV3OzXxpg9OQXLx68Uv1KrJLo1ZAJzyjiYORFL0HC3jLaE816fQlOtj3dbxb26Pzj43XrsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:18:56.667543Z","bundle_sha256":"b9b7e5498a4a2f3d42395decc186d62a0fb817b17adbecca38196ac88751c98a"}}