{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VTEJZYR47IRWTR4SJ7KKNQXD5K","short_pith_number":"pith:VTEJZYR4","canonical_record":{"source":{"id":"1011.2686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T15:31:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cac05888b2db2be55003004285dd52d533031d3c93af88a80500d5781c37a13f","abstract_canon_sha256":"4ceaaec42e9e3e89f7bf73f6a72da0aee907df095693a07bb2579199febfac5c"},"schema_version":"1.0"},"canonical_sha256":"acc89ce23cfa2369c7924fd4a6c2e3eabb31025edd8a4705bffa7572a648d4ba","source":{"kind":"arxiv","id":"1011.2686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2686","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2686v1","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2686","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"VTEJZYR47IRW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VTEJZYR47IRWTR4S","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VTEJZYR4","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VTEJZYR47IRWTR4SJ7KKNQXD5K","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T15:31:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cac05888b2db2be55003004285dd52d533031d3c93af88a80500d5781c37a13f","abstract_canon_sha256":"4ceaaec42e9e3e89f7bf73f6a72da0aee907df095693a07bb2579199febfac5c"},"schema_version":"1.0"},"canonical_sha256":"acc89ce23cfa2369c7924fd4a6c2e3eabb31025edd8a4705bffa7572a648d4ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:09.718851Z","signature_b64":"84OLeh7azYZ30++iNfk2OHt6b9w9nQ9iW5hnkDpcgu4LfZD/WZZa/wEy1MO2GGFS1EYpk8hkZ+XwD27RMnjZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acc89ce23cfa2369c7924fd4a6c2e3eabb31025edd8a4705bffa7572a648d4ba","last_reissued_at":"2026-05-18T04:36:09.718236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:09.718236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2686","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-18T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFhoD9G3cc8U4Vd9rgVUOtp4BbT8rZ6JnLnw1H9wLhhrv0ygHP5CDIEbGFsY2Yk70YaODIwH4SsNe3lb7USRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:03:16.340227Z"},"content_sha256":"5db0b202836955bd3bf31b15edfefcda8a1ad14bc986e353702d51f0111a69bc","schema_version":"1.0","event_id":"sha256:5db0b202836955bd3bf31b15edfefcda8a1ad14bc986e353702d51f0111a69bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VTEJZYR47IRWTR4SJ7KKNQXD5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Graeme Woodward, Kevin Morris, Ran Xu, Taskin Kocak","submitted_at":"2010-11-11T15:31:05Z","abstract_excerpt":"The bidirectional Fano algorithm (BFA) can achieve at least two times decoding throughput compared to the conventional unidirectional Fano algorithm (UFA). In this paper, bidirectional Fano decoding is examined from the queuing theory perspective. A Discrete Time Markov Chain (DTMC) is employed to model the BFA decoder with a finite input buffer. The relationship between the input data rate, the input buffer size and the clock speed of the BFA decoder is established. The DTMC based modelling can be used in designing a high throughput parallel BFA decoding system. It is shown that there is a tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2686","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-18T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX8QiNtiksc/xG5n0/F1MmKRnwfb6752DrBVU91Hs8cStuuzMzFnCvaCeI22/G4TUZUzW+WmVnySW0s97B8TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:03:16.340973Z"},"content_sha256":"e95594fc8a34261ab3a179b08a81d17c1c2d402b0c5a65dea15670c90378b534","schema_version":"1.0","event_id":"sha256:e95594fc8a34261ab3a179b08a81d17c1c2d402b0c5a65dea15670c90378b534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K/bundle.json","state_url":"https://pith.science/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K/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-09T07:03:16Z","links":{"resolver":"https://pith.science/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K","bundle":"https://pith.science/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K/bundle.json","state":"https://pith.science/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTEJZYR47IRWTR4SJ7KKNQXD5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VTEJZYR47IRWTR4SJ7KKNQXD5K","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":"4ceaaec42e9e3e89f7bf73f6a72da0aee907df095693a07bb2579199febfac5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T15:31:05Z","title_canon_sha256":"cac05888b2db2be55003004285dd52d533031d3c93af88a80500d5781c37a13f"},"schema_version":"1.0","source":{"id":"1011.2686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2686","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2686v1","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2686","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"VTEJZYR47IRW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VTEJZYR47IRWTR4S","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VTEJZYR4","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:e95594fc8a34261ab3a179b08a81d17c1c2d402b0c5a65dea15670c90378b534","target":"graph","created_at":"2026-05-18T04:36:09Z","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":"The bidirectional Fano algorithm (BFA) can achieve at least two times decoding throughput compared to the conventional unidirectional Fano algorithm (UFA). In this paper, bidirectional Fano decoding is examined from the queuing theory perspective. A Discrete Time Markov Chain (DTMC) is employed to model the BFA decoder with a finite input buffer. The relationship between the input data rate, the input buffer size and the clock speed of the BFA decoder is established. The DTMC based modelling can be used in designing a high throughput parallel BFA decoding system. It is shown that there is a tr","authors_text":"Graeme Woodward, Kevin Morris, Ran Xu, Taskin Kocak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T15:31:05Z","title":"A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2686","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:5db0b202836955bd3bf31b15edfefcda8a1ad14bc986e353702d51f0111a69bc","target":"record","created_at":"2026-05-18T04:36:09Z","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":"4ceaaec42e9e3e89f7bf73f6a72da0aee907df095693a07bb2579199febfac5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-11T15:31:05Z","title_canon_sha256":"cac05888b2db2be55003004285dd52d533031d3c93af88a80500d5781c37a13f"},"schema_version":"1.0","source":{"id":"1011.2686","kind":"arxiv","version":1}},"canonical_sha256":"acc89ce23cfa2369c7924fd4a6c2e3eabb31025edd8a4705bffa7572a648d4ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acc89ce23cfa2369c7924fd4a6c2e3eabb31025edd8a4705bffa7572a648d4ba","first_computed_at":"2026-05-18T04:36:09.718236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:09.718236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"84OLeh7azYZ30++iNfk2OHt6b9w9nQ9iW5hnkDpcgu4LfZD/WZZa/wEy1MO2GGFS1EYpk8hkZ+XwD27RMnjZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:09.718851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5db0b202836955bd3bf31b15edfefcda8a1ad14bc986e353702d51f0111a69bc","sha256:e95594fc8a34261ab3a179b08a81d17c1c2d402b0c5a65dea15670c90378b534"],"state_sha256":"447ee639ed1905f69ee3d7106659aed2fea5ec2af9ad0b9478c42416e041c022"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obF/FLaJud4Wf1t5tZapr4w9Q14+28BPldks+xsQvBHlDCvYc/09vNuUC7Xu73b9UZemcrFImmG17mNaeyJFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:03:16.344798Z","bundle_sha256":"295e6560c160b7d3f973dae1f738077557fab3aa1785332cda3efd96efb1aec3"}}