{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5VVDCDJVLWWYG3YJSOC2VSSN3N","short_pith_number":"pith:5VVDCDJV","canonical_record":{"source":{"id":"1904.06198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T00:56:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d89534c379cac05b65070e3af5b9ae2583325fca5f7962e4f3faaa599314a90f","abstract_canon_sha256":"6396563b28db1b5eac7e0c497587359943db90ea2f0d20f0c5883bd898730756"},"schema_version":"1.0"},"canonical_sha256":"ed6a310d355dad836f099385aaca4ddb4f5fcae7c3c4e8d0545ec4b1bf09c705","source":{"kind":"arxiv","id":"1904.06198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06198","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06198v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06198","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"5VVDCDJVLWWY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5VVDCDJVLWWYG3YJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5VVDCDJV","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5VVDCDJVLWWYG3YJSOC2VSSN3N","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T00:56:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d89534c379cac05b65070e3af5b9ae2583325fca5f7962e4f3faaa599314a90f","abstract_canon_sha256":"6396563b28db1b5eac7e0c497587359943db90ea2f0d20f0c5883bd898730756"},"schema_version":"1.0"},"canonical_sha256":"ed6a310d355dad836f099385aaca4ddb4f5fcae7c3c4e8d0545ec4b1bf09c705","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:43.854703Z","signature_b64":"rHbWa7eW4Z8NzqdZGqiKmn4RSqVxtFuwxbV0h+y41mt1Bi0kuMENsrDHjJ5kAjtd5lnnfJKe+aY0aBG8S1XNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed6a310d355dad836f099385aaca4ddb4f5fcae7c3c4e8d0545ec4b1bf09c705","last_reissued_at":"2026-05-17T23:48:43.854219Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:43.854219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06198","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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRuG2u/Hl/qK2Ez3I4F7OZo1l7NxPvmcQMkxXt/w8LlD17c3nyqFkGHwdL9wn9O4/PHsvhuxSzKKzgmyX7exCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:09:37.819583Z"},"content_sha256":"6af81a3ca20b5f968fa8765d447752ebe21f3beada7a917a8c7c65219dd1d530","schema_version":"1.0","event_id":"sha256:6af81a3ca20b5f968fa8765d447752ebe21f3beada7a917a8c7c65219dd1d530"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5VVDCDJVLWWYG3YJSOC2VSSN3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cyclic Coding Algorithms under MorphoSys Reconfigurable Computing System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"(2) London South Bank University), Hassan Diab (1), Issam Damaj (2) ((1) American University of Beirut","submitted_at":"2019-04-10T00:56:12Z","abstract_excerpt":"This paper introduces reconfigurable computing (RC) and specifically chooses one of the prototypes in this field, MorphoSys (M1) [1 - 5]. The paper addresses the results obtained when using RC in mapping algorithms pertaining to digital coding in relation to previous research [6 - 10]. The chosen algorithms relate to cyclic coding techniques, namely the CCITT CRC-16 and the CRC-16. A performance analysis study of the M1 RC system is also presented to evaluate the efficiency of the algorithm execution on the M1 system. For comparison purposes, three other systems where used to map the same algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06198","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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzJuhYUwP49XTbukDbY2b79VSzWc+NlBp5kK2Sy7birUS5jdRQG2ZRp09NLFK1+fuOPv/xlmegUgStVVoG9RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:09:37.820295Z"},"content_sha256":"6c955bfea72d7077767627582b590e96bb567a955e12ccadc9e7e3b7fe337bbc","schema_version":"1.0","event_id":"sha256:6c955bfea72d7077767627582b590e96bb567a955e12ccadc9e7e3b7fe337bbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N/bundle.json","state_url":"https://pith.science/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N/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-09T06:09:37Z","links":{"resolver":"https://pith.science/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N","bundle":"https://pith.science/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N/bundle.json","state":"https://pith.science/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VVDCDJVLWWYG3YJSOC2VSSN3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5VVDCDJVLWWYG3YJSOC2VSSN3N","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":"6396563b28db1b5eac7e0c497587359943db90ea2f0d20f0c5883bd898730756","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T00:56:12Z","title_canon_sha256":"d89534c379cac05b65070e3af5b9ae2583325fca5f7962e4f3faaa599314a90f"},"schema_version":"1.0","source":{"id":"1904.06198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06198","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06198v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06198","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"5VVDCDJVLWWY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5VVDCDJVLWWYG3YJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5VVDCDJV","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6c955bfea72d7077767627582b590e96bb567a955e12ccadc9e7e3b7fe337bbc","target":"graph","created_at":"2026-05-17T23:48:43Z","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":"This paper introduces reconfigurable computing (RC) and specifically chooses one of the prototypes in this field, MorphoSys (M1) [1 - 5]. The paper addresses the results obtained when using RC in mapping algorithms pertaining to digital coding in relation to previous research [6 - 10]. The chosen algorithms relate to cyclic coding techniques, namely the CCITT CRC-16 and the CRC-16. A performance analysis study of the M1 RC system is also presented to evaluate the efficiency of the algorithm execution on the M1 system. For comparison purposes, three other systems where used to map the same algo","authors_text":"(2) London South Bank University), Hassan Diab (1), Issam Damaj (2) ((1) American University of Beirut","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T00:56:12Z","title":"Cyclic Coding Algorithms under MorphoSys Reconfigurable Computing System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06198","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:6af81a3ca20b5f968fa8765d447752ebe21f3beada7a917a8c7c65219dd1d530","target":"record","created_at":"2026-05-17T23:48:43Z","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":"6396563b28db1b5eac7e0c497587359943db90ea2f0d20f0c5883bd898730756","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T00:56:12Z","title_canon_sha256":"d89534c379cac05b65070e3af5b9ae2583325fca5f7962e4f3faaa599314a90f"},"schema_version":"1.0","source":{"id":"1904.06198","kind":"arxiv","version":1}},"canonical_sha256":"ed6a310d355dad836f099385aaca4ddb4f5fcae7c3c4e8d0545ec4b1bf09c705","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed6a310d355dad836f099385aaca4ddb4f5fcae7c3c4e8d0545ec4b1bf09c705","first_computed_at":"2026-05-17T23:48:43.854219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:43.854219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rHbWa7eW4Z8NzqdZGqiKmn4RSqVxtFuwxbV0h+y41mt1Bi0kuMENsrDHjJ5kAjtd5lnnfJKe+aY0aBG8S1XNDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:43.854703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6af81a3ca20b5f968fa8765d447752ebe21f3beada7a917a8c7c65219dd1d530","sha256:6c955bfea72d7077767627582b590e96bb567a955e12ccadc9e7e3b7fe337bbc"],"state_sha256":"6ee290641e20d23ba7964157a04b51a490b0558e8eec0e321fc3ca260de3f0ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UxD0xxAAZiNjJoDflWTvoPaR0xjqAU6Oqe3n5rrQR4kRmh8vWoujJQu+cpb8mZDyYeC7XebmQqWXZOQp7J8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:09:37.824350Z","bundle_sha256":"b271b61be891fb2c0d3b52535b985e3806aa276e0e1352ba9efc8886c12e2ae4"}}