{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FLMV2VPRYLQIYZGNZKRKZ5FX3Y","short_pith_number":"pith:FLMV2VPR","canonical_record":{"source":{"id":"2206.09572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T05:10:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbe09ae841dce3929fd0dea428259563986722687ede7605deeffd4c4362eb7f","abstract_canon_sha256":"0dfeba461fa2243b79c00e368ca89fdcc8f159d8bf62e6f708240628e6f378c1"},"schema_version":"1.0"},"canonical_sha256":"2ad95d55f1c2e08c64cdcaa2acf4b7de359d3633f0d05012019060b1602ffd4f","source":{"kind":"arxiv","id":"2206.09572","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.09572","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"arxiv_version","alias_value":"2206.09572v2","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09572","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"pith_short_12","alias_value":"FLMV2VPRYLQI","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"pith_short_16","alias_value":"FLMV2VPRYLQIYZGN","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"pith_short_8","alias_value":"FLMV2VPR","created_at":"2026-07-05T05:27:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FLMV2VPRYLQIYZGNZKRKZ5FX3Y","target":"record","payload":{"canonical_record":{"source":{"id":"2206.09572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T05:10:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbe09ae841dce3929fd0dea428259563986722687ede7605deeffd4c4362eb7f","abstract_canon_sha256":"0dfeba461fa2243b79c00e368ca89fdcc8f159d8bf62e6f708240628e6f378c1"},"schema_version":"1.0"},"canonical_sha256":"2ad95d55f1c2e08c64cdcaa2acf4b7de359d3633f0d05012019060b1602ffd4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:48.428115Z","signature_b64":"P6VwtKivXrx8kzfEctpNMOx95yFnZ01XlL1mbQnJ8DiYr+2Wj5limxS4zuRWmhB1uuab2OwNZmPowUdfT75PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ad95d55f1c2e08c64cdcaa2acf4b7de359d3633f0d05012019060b1602ffd4f","last_reissued_at":"2026-07-05T05:27:48.427580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:48.427580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.09572","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-07-05T05:27:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mwh28iV433xPZxbAiiR0xJeax6iooxSlOSNForE2chzidP2xzNUOw51MYp3JP1mt7adEY+SgH6eSDog4i6ziBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:49:45.989114Z"},"content_sha256":"f8780fd9da114559af498ce0401c72daaa070f2c13bb59d23ca6466c7aacc518","schema_version":"1.0","event_id":"sha256:f8780fd9da114559af498ce0401c72daaa070f2c13bb59d23ca6466c7aacc518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FLMV2VPRYLQIYZGNZKRKZ5FX3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Decoders for Short Block Length Codes in 6G URLLC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Chentao Yue, Mahyar Shirvanimoghaddam, Vera Miloslavskaya, Yonghui Li","submitted_at":"2022-06-20T05:10:00Z","abstract_excerpt":"This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and packet-size flexibility. These requirements exacerbate the difficulty of the physical-layer design, particularly for the channel coding and decoding schemes. To satisfy the requirements of URLLC, decoders must exhibit superior error-rate performance \\black{and} low decoding complexity. \\black{Also, it is desired that decoders be universal} to accommodate various "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09572","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.09572/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:27:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdrfgnzxUNI+d+KbBf3AI9JyzwCSjtfmHa/U4BmbxzIxiIUnyUNsJrGfysuhcKn3aS5M2x6Sa+boUb6itzaiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:49:45.989780Z"},"content_sha256":"b3402400eab1f79af4704907a91d86424191a8aac94966482b7fa08dd94730f7","schema_version":"1.0","event_id":"sha256:b3402400eab1f79af4704907a91d86424191a8aac94966482b7fa08dd94730f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y/bundle.json","state_url":"https://pith.science/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y/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-08-18T14:49:45Z","links":{"resolver":"https://pith.science/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y","bundle":"https://pith.science/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y/bundle.json","state":"https://pith.science/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLMV2VPRYLQIYZGNZKRKZ5FX3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FLMV2VPRYLQIYZGNZKRKZ5FX3Y","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":"0dfeba461fa2243b79c00e368ca89fdcc8f159d8bf62e6f708240628e6f378c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T05:10:00Z","title_canon_sha256":"cbe09ae841dce3929fd0dea428259563986722687ede7605deeffd4c4362eb7f"},"schema_version":"1.0","source":{"id":"2206.09572","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.09572","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"arxiv_version","alias_value":"2206.09572v2","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09572","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"pith_short_12","alias_value":"FLMV2VPRYLQI","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"pith_short_16","alias_value":"FLMV2VPRYLQIYZGN","created_at":"2026-07-05T05:27:48Z"},{"alias_kind":"pith_short_8","alias_value":"FLMV2VPR","created_at":"2026-07-05T05:27:48Z"}],"graph_snapshots":[{"event_id":"sha256:b3402400eab1f79af4704907a91d86424191a8aac94966482b7fa08dd94730f7","target":"graph","created_at":"2026-07-05T05:27:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.09572/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and packet-size flexibility. These requirements exacerbate the difficulty of the physical-layer design, particularly for the channel coding and decoding schemes. To satisfy the requirements of URLLC, decoders must exhibit superior error-rate performance \\black{and} low decoding complexity. \\black{Also, it is desired that decoders be universal} to accommodate various ","authors_text":"Branka Vucetic, Chentao Yue, Mahyar Shirvanimoghaddam, Vera Miloslavskaya, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T05:10:00Z","title":"Efficient Decoders for Short Block Length Codes in 6G URLLC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09572","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:f8780fd9da114559af498ce0401c72daaa070f2c13bb59d23ca6466c7aacc518","target":"record","created_at":"2026-07-05T05:27:48Z","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":"0dfeba461fa2243b79c00e368ca89fdcc8f159d8bf62e6f708240628e6f378c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T05:10:00Z","title_canon_sha256":"cbe09ae841dce3929fd0dea428259563986722687ede7605deeffd4c4362eb7f"},"schema_version":"1.0","source":{"id":"2206.09572","kind":"arxiv","version":2}},"canonical_sha256":"2ad95d55f1c2e08c64cdcaa2acf4b7de359d3633f0d05012019060b1602ffd4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ad95d55f1c2e08c64cdcaa2acf4b7de359d3633f0d05012019060b1602ffd4f","first_computed_at":"2026-07-05T05:27:48.427580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:27:48.427580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6VwtKivXrx8kzfEctpNMOx95yFnZ01XlL1mbQnJ8DiYr+2Wj5limxS4zuRWmhB1uuab2OwNZmPowUdfT75PAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:27:48.428115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.09572","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8780fd9da114559af498ce0401c72daaa070f2c13bb59d23ca6466c7aacc518","sha256:b3402400eab1f79af4704907a91d86424191a8aac94966482b7fa08dd94730f7"],"state_sha256":"76440f80007a36a3bf2e6270cc2424f92949cbc309c56d5b2d2be7e2da9058f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCDwqZoU04UjNvcN1KGPeP5O6eVnbq3UeD8tZR5xDt7tWSKZT3X0HjHDPPvmgONimv/4LUhX3vfzUo+Lz+amBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:49:45.997411Z","bundle_sha256":"09c04cf928e5b28dd26c4f407bb45567c138538b041237402450d68d0fe82f5f"}}