{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BCVJ2NDBQE2EZKM6ULDCFMX5K5","short_pith_number":"pith:BCVJ2NDB","canonical_record":{"source":{"id":"1809.02887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-09-08T22:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"79c32cf180d8ad32d42395ba87a5e8dc86a45a56154a6363f47bef70f1189a6b","abstract_canon_sha256":"7ed44b32f7bf389596d98b017030a195320e7d8259ad7b080ea41689fd1aace8"},"schema_version":"1.0"},"canonical_sha256":"08aa9d346181344ca99ea2c622b2fd577445e64809bdad889d8b25e13e282ac9","source":{"kind":"arxiv","id":"1809.02887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02887","created_at":"2026-05-18T00:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02887v1","created_at":"2026-05-18T00:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02887","created_at":"2026-05-18T00:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"BCVJ2NDBQE2E","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BCVJ2NDBQE2EZKM6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BCVJ2NDB","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BCVJ2NDBQE2EZKM6ULDCFMX5K5","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-09-08T22:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"79c32cf180d8ad32d42395ba87a5e8dc86a45a56154a6363f47bef70f1189a6b","abstract_canon_sha256":"7ed44b32f7bf389596d98b017030a195320e7d8259ad7b080ea41689fd1aace8"},"schema_version":"1.0"},"canonical_sha256":"08aa9d346181344ca99ea2c622b2fd577445e64809bdad889d8b25e13e282ac9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:14.999116Z","signature_b64":"gJWQUhhBgZDbjHqJwhrNAS6x7DOM59h5KPgb463hgy9NBKVVdnuKL2ABlyNLNwRTrpb5Z2e/kJ0K7lbRA+awBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08aa9d346181344ca99ea2c622b2fd577445e64809bdad889d8b25e13e282ac9","last_reissued_at":"2026-05-18T00:06:14.998542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:14.998542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02887","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:06:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFd3JWgPobFMRzv9X2IUNrEemTQ0bHcpNe14yWkqSH3XvAjryKNoAMjPky55PO7thji4dV1XbUNPdduI40mtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:00:39.132763Z"},"content_sha256":"2ff9f8d7e76d8395bffbcb1d9da46130d051eeeb681093277395d2081bf5ac86","schema_version":"1.0","event_id":"sha256:2ff9f8d7e76d8395bffbcb1d9da46130d051eeeb681093277395d2081bf5ac86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BCVJ2NDBQE2EZKM6ULDCFMX5K5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Viterbi Algorithm using Custom Instruction Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hasan Mahmood, Imran Hafeez Abbassi, Usman Sanwal, Waqar Ahmad","submitted_at":"2018-09-08T22:21:14Z","abstract_excerpt":"In recent years, the decoding algorithms in communication networks are becoming increasingly complex aiming to achieve high reliability in correctly decoding received messages. These decoding algorithms involve computationally complex operations requiring high performance computing hardware, which are generally expensive. A cost-effective solution is to enhance the Instruction Set Architecture (ISA) of the processors by creating new custom instructions for the computational parts of the decoding algorithms. In this paper, we propose to utilize the custom instruction approach to efficiently imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02887","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:06:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWwT4yC/iCLsMDvT/B8OxVJGqhIaIKAE27N6E1GrGPjq1jbpeFi7Lv4vFVwCFlrDZ7SuLWf/B3PtywphcrzqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:00:39.133109Z"},"content_sha256":"1b7e0535ea7770b79eb2e5fa57a158d09c8b31d3b85202981d14451635592d05","schema_version":"1.0","event_id":"sha256:1b7e0535ea7770b79eb2e5fa57a158d09c8b31d3b85202981d14451635592d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5/bundle.json","state_url":"https://pith.science/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5/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-03T01:00:39Z","links":{"resolver":"https://pith.science/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5","bundle":"https://pith.science/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5/bundle.json","state":"https://pith.science/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCVJ2NDBQE2EZKM6ULDCFMX5K5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BCVJ2NDBQE2EZKM6ULDCFMX5K5","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":"7ed44b32f7bf389596d98b017030a195320e7d8259ad7b080ea41689fd1aace8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-09-08T22:21:14Z","title_canon_sha256":"79c32cf180d8ad32d42395ba87a5e8dc86a45a56154a6363f47bef70f1189a6b"},"schema_version":"1.0","source":{"id":"1809.02887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02887","created_at":"2026-05-18T00:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02887v1","created_at":"2026-05-18T00:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02887","created_at":"2026-05-18T00:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"BCVJ2NDBQE2E","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BCVJ2NDBQE2EZKM6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BCVJ2NDB","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:1b7e0535ea7770b79eb2e5fa57a158d09c8b31d3b85202981d14451635592d05","target":"graph","created_at":"2026-05-18T00:06:14Z","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":"In recent years, the decoding algorithms in communication networks are becoming increasingly complex aiming to achieve high reliability in correctly decoding received messages. These decoding algorithms involve computationally complex operations requiring high performance computing hardware, which are generally expensive. A cost-effective solution is to enhance the Instruction Set Architecture (ISA) of the processors by creating new custom instructions for the computational parts of the decoding algorithms. In this paper, we propose to utilize the custom instruction approach to efficiently imp","authors_text":"Hasan Mahmood, Imran Hafeez Abbassi, Usman Sanwal, Waqar Ahmad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-09-08T22:21:14Z","title":"Accelerating Viterbi Algorithm using Custom Instruction Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02887","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:2ff9f8d7e76d8395bffbcb1d9da46130d051eeeb681093277395d2081bf5ac86","target":"record","created_at":"2026-05-18T00:06:14Z","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":"7ed44b32f7bf389596d98b017030a195320e7d8259ad7b080ea41689fd1aace8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-09-08T22:21:14Z","title_canon_sha256":"79c32cf180d8ad32d42395ba87a5e8dc86a45a56154a6363f47bef70f1189a6b"},"schema_version":"1.0","source":{"id":"1809.02887","kind":"arxiv","version":1}},"canonical_sha256":"08aa9d346181344ca99ea2c622b2fd577445e64809bdad889d8b25e13e282ac9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08aa9d346181344ca99ea2c622b2fd577445e64809bdad889d8b25e13e282ac9","first_computed_at":"2026-05-18T00:06:14.998542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:14.998542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gJWQUhhBgZDbjHqJwhrNAS6x7DOM59h5KPgb463hgy9NBKVVdnuKL2ABlyNLNwRTrpb5Z2e/kJ0K7lbRA+awBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:14.999116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ff9f8d7e76d8395bffbcb1d9da46130d051eeeb681093277395d2081bf5ac86","sha256:1b7e0535ea7770b79eb2e5fa57a158d09c8b31d3b85202981d14451635592d05"],"state_sha256":"adf59f283e7dfe5e99c970a5aef1be3589147702ffddcafb9660f44c85be81be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3onE/k61VNKLq6yik65xRqKWNK7Y8uhJcYyVpZgITpbY7qws51936HSwwiGQFWWfe4vRBvMitazLxmDTJ+uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:00:39.135081Z","bundle_sha256":"ff6bca14a87cd636adb79ee4505dbda25fa2d8e36dd0f3fcfe42266021d0b6ea"}}