{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:P2NGNXRCIKQYQDYJFTPAJ76TWJ","short_pith_number":"pith:P2NGNXRC","canonical_record":{"source":{"id":"2211.02385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-04T11:32:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c8e7b524702629231e448c1a75961fe0130a8abd9e8f340ddf4b5e2d8243e5f","abstract_canon_sha256":"cd5943aec59aa143bcc856161a0e03c6755260eaf91823c3eec758012e3879a5"},"schema_version":"1.0"},"canonical_sha256":"7e9a66de2242a1880f092cde04ffd3b243966b6d44c017315bb07d10648a43bb","source":{"kind":"arxiv","id":"2211.02385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02385","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02385v2","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02385","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"P2NGNXRCIKQY","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"pith_short_16","alias_value":"P2NGNXRCIKQYQDYJ","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"pith_short_8","alias_value":"P2NGNXRC","created_at":"2026-07-05T06:42:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:P2NGNXRCIKQYQDYJFTPAJ76TWJ","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-04T11:32:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c8e7b524702629231e448c1a75961fe0130a8abd9e8f340ddf4b5e2d8243e5f","abstract_canon_sha256":"cd5943aec59aa143bcc856161a0e03c6755260eaf91823c3eec758012e3879a5"},"schema_version":"1.0"},"canonical_sha256":"7e9a66de2242a1880f092cde04ffd3b243966b6d44c017315bb07d10648a43bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:18.012517Z","signature_b64":"Gd/kVOuOXbVnlHjZTypP5N1xa0w6Dkq/8x9d/9Y7b74/jDeDkWc6Fifdmq7uM1xDYHnXl23Hh51VlUP9OPlMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e9a66de2242a1880f092cde04ffd3b243966b6d44c017315bb07d10648a43bb","last_reissued_at":"2026-07-05T06:42:18.012070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:18.012070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02385","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-05T06:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpD+nq+a1fVjd0d1DJwvR6biKV/7Z91lDCcObKARSKrEKmoUeMWNwL4Ok0UYiWXeuhPOs3JatGiDgBG/P1lGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:25:02.500507Z"},"content_sha256":"80f2c64ce7fd6a2ea48297200da0ee21997e6fe05abe6cc75524f883cb0f95fb","schema_version":"1.0","event_id":"sha256:80f2c64ce7fd6a2ea48297200da0ee21997e6fe05abe6cc75524f883cb0f95fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:P2NGNXRCIKQYQDYJFTPAJ76TWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient evaluation of the error probability for pilot-assisted URLLC with Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alejandro Lancho, A. Oguz Kislal, Erik Str\\\"om, Giuseppe Durisi","submitted_at":"2022-11-04T11:32:50Z","abstract_excerpt":"We propose a numerically efficient method for evaluating the random-coding union bound with parameter $s$ on the error probability achievable in the finite-blocklength regime by a pilot-assisted transmission scheme employing Gaussian codebooks and operating over a memoryless block-fading channel. Our method relies on the saddlepoint approximation, which, differently from previous results reported for similar scenarios, is performed with respect to the number of fading blocks (a.k.a. diversity branches) spanned by each codeword, instead of the number of channel uses per block. This different ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02385","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/2211.02385/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-05T06:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0N8xmjg3b0VVIF8qE/vv11qThbDxOfQ4mycLUR0D8REFSFZ1gcSVHUO50n1DwBk4/IvBQVhlBl6/wUuQuTlCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:25:02.501246Z"},"content_sha256":"d309c3f52b53dec56b31f7ed63a190aeb8e80d178196012f9614c15deed3ca20","schema_version":"1.0","event_id":"sha256:d309c3f52b53dec56b31f7ed63a190aeb8e80d178196012f9614c15deed3ca20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ/bundle.json","state_url":"https://pith.science/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ/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-23T15:25:02Z","links":{"resolver":"https://pith.science/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ","bundle":"https://pith.science/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ/bundle.json","state":"https://pith.science/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2NGNXRCIKQYQDYJFTPAJ76TWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:P2NGNXRCIKQYQDYJFTPAJ76TWJ","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":"cd5943aec59aa143bcc856161a0e03c6755260eaf91823c3eec758012e3879a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-04T11:32:50Z","title_canon_sha256":"4c8e7b524702629231e448c1a75961fe0130a8abd9e8f340ddf4b5e2d8243e5f"},"schema_version":"1.0","source":{"id":"2211.02385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02385","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02385v2","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02385","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"P2NGNXRCIKQY","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"pith_short_16","alias_value":"P2NGNXRCIKQYQDYJ","created_at":"2026-07-05T06:42:18Z"},{"alias_kind":"pith_short_8","alias_value":"P2NGNXRC","created_at":"2026-07-05T06:42:18Z"}],"graph_snapshots":[{"event_id":"sha256:d309c3f52b53dec56b31f7ed63a190aeb8e80d178196012f9614c15deed3ca20","target":"graph","created_at":"2026-07-05T06:42:18Z","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/2211.02385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a numerically efficient method for evaluating the random-coding union bound with parameter $s$ on the error probability achievable in the finite-blocklength regime by a pilot-assisted transmission scheme employing Gaussian codebooks and operating over a memoryless block-fading channel. Our method relies on the saddlepoint approximation, which, differently from previous results reported for similar scenarios, is performed with respect to the number of fading blocks (a.k.a. diversity branches) spanned by each codeword, instead of the number of channel uses per block. This different ap","authors_text":"Alejandro Lancho, A. Oguz Kislal, Erik Str\\\"om, Giuseppe Durisi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-04T11:32:50Z","title":"Efficient evaluation of the error probability for pilot-assisted URLLC with Massive MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02385","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:80f2c64ce7fd6a2ea48297200da0ee21997e6fe05abe6cc75524f883cb0f95fb","target":"record","created_at":"2026-07-05T06:42:18Z","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":"cd5943aec59aa143bcc856161a0e03c6755260eaf91823c3eec758012e3879a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-04T11:32:50Z","title_canon_sha256":"4c8e7b524702629231e448c1a75961fe0130a8abd9e8f340ddf4b5e2d8243e5f"},"schema_version":"1.0","source":{"id":"2211.02385","kind":"arxiv","version":2}},"canonical_sha256":"7e9a66de2242a1880f092cde04ffd3b243966b6d44c017315bb07d10648a43bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e9a66de2242a1880f092cde04ffd3b243966b6d44c017315bb07d10648a43bb","first_computed_at":"2026-07-05T06:42:18.012070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:42:18.012070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gd/kVOuOXbVnlHjZTypP5N1xa0w6Dkq/8x9d/9Y7b74/jDeDkWc6Fifdmq7uM1xDYHnXl23Hh51VlUP9OPlMBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:42:18.012517Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80f2c64ce7fd6a2ea48297200da0ee21997e6fe05abe6cc75524f883cb0f95fb","sha256:d309c3f52b53dec56b31f7ed63a190aeb8e80d178196012f9614c15deed3ca20"],"state_sha256":"ccaaa6f645d58b5b1598f745e4b5a0a83a8c2cfa35cc35cc9cf452d18674ffd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsmt2E+VH+kUT1GXRKlaBmL/k6zypgKr20PV2Qjlrm8S2ZCqma2U9WfBVrBhW9ZioRd7s3q4qefpQgVK5GopBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T15:25:02.506763Z","bundle_sha256":"c5407b4f844eafcafeeb37942af48e41ce97949cdf67dc2866131452d34b8d57"}}