{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PBEP3QOFIVC3MH6KV5CB2ZOLWK","short_pith_number":"pith:PBEP3QOF","canonical_record":{"source":{"id":"1904.02802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-04T21:59:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c07518ad144d5e11f4b24a69ffe7790d7952b02d4f0fbc999203dcb34099713","abstract_canon_sha256":"5bddeaeae188d50773db4a22eacf460fd12429143eee94193e6e0fb98952ced8"},"schema_version":"1.0"},"canonical_sha256":"7848fdc1c54545b61fcaaf441d65cbb2af9222b736eac4141c0c4f7c88f649b3","source":{"kind":"arxiv","id":"1904.02802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02802","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02802v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02802","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"PBEP3QOFIVC3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PBEP3QOFIVC3MH6K","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PBEP3QOF","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PBEP3QOFIVC3MH6KV5CB2ZOLWK","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-04T21:59:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c07518ad144d5e11f4b24a69ffe7790d7952b02d4f0fbc999203dcb34099713","abstract_canon_sha256":"5bddeaeae188d50773db4a22eacf460fd12429143eee94193e6e0fb98952ced8"},"schema_version":"1.0"},"canonical_sha256":"7848fdc1c54545b61fcaaf441d65cbb2af9222b736eac4141c0c4f7c88f649b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.602723Z","signature_b64":"L45QiXtUpBfMSI5WdVhlERZS1nf3o5706qX3J68aJclNx2RA6h+798A/8/Xc6PkUr3ylNppoIbZ41djPB4hsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7848fdc1c54545b61fcaaf441d65cbb2af9222b736eac4141c0c4f7c88f649b3","last_reissued_at":"2026-05-17T23:49:19.602125Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.602125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02802","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:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PSHDqfrq7M1Z0oK1ZVvVefcdtHD+hKk0zuOD1p8YYgDeB/czge+8ybBJBUccQdZhBfLWnsRC4eniBuaUaU0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:05:40.482459Z"},"content_sha256":"835852b3f42d6a4030d73e4745f74443137f76f20dba03498845bb620a75324b","schema_version":"1.0","event_id":"sha256:835852b3f42d6a4030d73e4745f74443137f76f20dba03498845bb620a75324b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PBEP3QOFIVC3MH6KV5CB2ZOLWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Error Rate Analysis for URLLC over Multiple Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinho Choi","submitted_at":"2019-04-04T21:59:38Z","abstract_excerpt":"In this paper, we study ultra-reliable and low-latency communication (URLLC) under fading using multiple frequency or time bins. We investigate an approach to find an upper-bound on the packet error rate when a finite-length code is used. From simulation results, we find that the bound is reasonably tight for wide ranges of signal-to-noise ratio (SNR) and the number of multiple bins. Thus, the derived bound can be used to determine key parameters to guarantee the performance of URLLC in terms of the packet error rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02802","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:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjsVQY3fBPrBwM1rJ03ZxfW8KSVAQT6LbmAsohxIVFNSytghtUB/em4kMnC/0DDcLKz5trxu4z0nAPEFvT4GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:05:40.483081Z"},"content_sha256":"5a2eaf849259965d9afbc554809949c920fda38cbefd0b6c503c8e791212292b","schema_version":"1.0","event_id":"sha256:5a2eaf849259965d9afbc554809949c920fda38cbefd0b6c503c8e791212292b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK/bundle.json","state_url":"https://pith.science/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK/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-05-28T20:05:40Z","links":{"resolver":"https://pith.science/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK","bundle":"https://pith.science/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK/bundle.json","state":"https://pith.science/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBEP3QOFIVC3MH6KV5CB2ZOLWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PBEP3QOFIVC3MH6KV5CB2ZOLWK","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":"5bddeaeae188d50773db4a22eacf460fd12429143eee94193e6e0fb98952ced8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-04T21:59:38Z","title_canon_sha256":"9c07518ad144d5e11f4b24a69ffe7790d7952b02d4f0fbc999203dcb34099713"},"schema_version":"1.0","source":{"id":"1904.02802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02802","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02802v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02802","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"PBEP3QOFIVC3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PBEP3QOFIVC3MH6K","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PBEP3QOF","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:5a2eaf849259965d9afbc554809949c920fda38cbefd0b6c503c8e791212292b","target":"graph","created_at":"2026-05-17T23:49:19Z","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 this paper, we study ultra-reliable and low-latency communication (URLLC) under fading using multiple frequency or time bins. We investigate an approach to find an upper-bound on the packet error rate when a finite-length code is used. From simulation results, we find that the bound is reasonably tight for wide ranges of signal-to-noise ratio (SNR) and the number of multiple bins. Thus, the derived bound can be used to determine key parameters to guarantee the performance of URLLC in terms of the packet error rate.","authors_text":"Jinho Choi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-04T21:59:38Z","title":"On Error Rate Analysis for URLLC over Multiple Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02802","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:835852b3f42d6a4030d73e4745f74443137f76f20dba03498845bb620a75324b","target":"record","created_at":"2026-05-17T23:49:19Z","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":"5bddeaeae188d50773db4a22eacf460fd12429143eee94193e6e0fb98952ced8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-04T21:59:38Z","title_canon_sha256":"9c07518ad144d5e11f4b24a69ffe7790d7952b02d4f0fbc999203dcb34099713"},"schema_version":"1.0","source":{"id":"1904.02802","kind":"arxiv","version":1}},"canonical_sha256":"7848fdc1c54545b61fcaaf441d65cbb2af9222b736eac4141c0c4f7c88f649b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7848fdc1c54545b61fcaaf441d65cbb2af9222b736eac4141c0c4f7c88f649b3","first_computed_at":"2026-05-17T23:49:19.602125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:19.602125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L45QiXtUpBfMSI5WdVhlERZS1nf3o5706qX3J68aJclNx2RA6h+798A/8/Xc6PkUr3ylNppoIbZ41djPB4hsDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:19.602723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:835852b3f42d6a4030d73e4745f74443137f76f20dba03498845bb620a75324b","sha256:5a2eaf849259965d9afbc554809949c920fda38cbefd0b6c503c8e791212292b"],"state_sha256":"d003a845e74722b29475eb9e2a2caf67f798c4911e3a8a7c07a89e78c81378d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzPFd21NDrKN2/O2/OW4l+95CzJuR9BpB1FbasaLFgZKwf+Y433VH2jVkdRpFahUEnKP7WXw3/Y3rGZ55ipNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:05:40.486449Z","bundle_sha256":"3b7251f70f78f16e87470e4571523a90f5219455e87b544e37469fddf0f31791"}}