{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NI6G6YO3PYMMMMZQD2QF6TVKBI","short_pith_number":"pith:NI6G6YO3","canonical_record":{"source":{"id":"1705.02816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T10:40:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9aec6cc3a834689f52fc719ffc9701762f4d63f823b94bc011926c7ce8ee497","abstract_canon_sha256":"1ca8a2fbfcf480dfcd257f46fea19d51ce1d90052631e4b4fe504b89e81508b8"},"schema_version":"1.0"},"canonical_sha256":"6a3c6f61db7e18c633301ea05f4eaa0a0f5580d856815dd9de74a498d865a4c3","source":{"kind":"arxiv","id":"1705.02816","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02816","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02816v3","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02816","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"NI6G6YO3PYMM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NI6G6YO3PYMMMMZQ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NI6G6YO3","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NI6G6YO3PYMMMMZQD2QF6TVKBI","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T10:40:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9aec6cc3a834689f52fc719ffc9701762f4d63f823b94bc011926c7ce8ee497","abstract_canon_sha256":"1ca8a2fbfcf480dfcd257f46fea19d51ce1d90052631e4b4fe504b89e81508b8"},"schema_version":"1.0"},"canonical_sha256":"6a3c6f61db7e18c633301ea05f4eaa0a0f5580d856815dd9de74a498d865a4c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:49.961630Z","signature_b64":"XKSQgbakQ6zs9ty9YOesAimGqbW8MgFCYO5FgAGH/Aj1UWoVW4pMuqwLAr2rwFRcazM+wW81yn7TWMZITu8QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3c6f61db7e18c633301ea05f4eaa0a0f5580d856815dd9de74a498d865a4c3","last_reissued_at":"2026-05-18T00:43:49.961082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:49.961082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02816","source_version":3,"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:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPiZ4HBA7U90emE6oNgkbwMPk8vnJ7nJdRdnKDRte4NqQtJS/1aGZ+YmuH7IxJJKUP+fF7j0T6EhHujdaZWhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:34:04.495828Z"},"content_sha256":"c886b956f9a674e693a684f8ad415c6cc6c02404292ffc4e65e49671a1e4730c","schema_version":"1.0","event_id":"sha256:c886b956f9a674e693a684f8ad415c6cc6c02404292ffc4e65e49671a1e4730c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NI6G6YO3PYMMMMZQD2QF6TVKBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-Blocklength Bounds on the Maximum Coding Rate of Rician Fading Channels with Applications to Pilot-Assisted Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik G. Str\\\"om, Giuseppe Durisi, Johan \\\"Ostman","submitted_at":"2017-05-08T10:40:42Z","abstract_excerpt":"We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state information is available at the receiver, allow one to quantify the tradeoff between the rate gains resulting from the exploitation of time-frequency diversity and the rate loss resulting from fast channel variations and pilot-symbol overhead."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02816","kind":"arxiv","version":3},"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:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bOmEtnnq5npzjp4YvJfNAkfik9ttVAxuvbAdnWhQTXI6kjtFu+NRcbh29cJ0s5vXKcKFcPwUjjZZ94TlReJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:34:04.496173Z"},"content_sha256":"241cc7bb1e2b779cf3e8ad880513e43bba8d697867d8790fc9c4ad8750397a60","schema_version":"1.0","event_id":"sha256:241cc7bb1e2b779cf3e8ad880513e43bba8d697867d8790fc9c4ad8750397a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI/bundle.json","state_url":"https://pith.science/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI/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-05T12:34:04Z","links":{"resolver":"https://pith.science/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI","bundle":"https://pith.science/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI/bundle.json","state":"https://pith.science/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NI6G6YO3PYMMMMZQD2QF6TVKBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NI6G6YO3PYMMMMZQD2QF6TVKBI","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":"1ca8a2fbfcf480dfcd257f46fea19d51ce1d90052631e4b4fe504b89e81508b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T10:40:42Z","title_canon_sha256":"f9aec6cc3a834689f52fc719ffc9701762f4d63f823b94bc011926c7ce8ee497"},"schema_version":"1.0","source":{"id":"1705.02816","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02816","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02816v3","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02816","created_at":"2026-05-18T00:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"NI6G6YO3PYMM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NI6G6YO3PYMMMMZQ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NI6G6YO3","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:241cc7bb1e2b779cf3e8ad880513e43bba8d697867d8790fc9c4ad8750397a60","target":"graph","created_at":"2026-05-18T00:43:49Z","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":"We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state information is available at the receiver, allow one to quantify the tradeoff between the rate gains resulting from the exploitation of time-frequency diversity and the rate loss resulting from fast channel variations and pilot-symbol overhead.","authors_text":"Erik G. Str\\\"om, Giuseppe Durisi, Johan \\\"Ostman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T10:40:42Z","title":"Finite-Blocklength Bounds on the Maximum Coding Rate of Rician Fading Channels with Applications to Pilot-Assisted Transmission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02816","kind":"arxiv","version":3},"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:c886b956f9a674e693a684f8ad415c6cc6c02404292ffc4e65e49671a1e4730c","target":"record","created_at":"2026-05-18T00:43:49Z","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":"1ca8a2fbfcf480dfcd257f46fea19d51ce1d90052631e4b4fe504b89e81508b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T10:40:42Z","title_canon_sha256":"f9aec6cc3a834689f52fc719ffc9701762f4d63f823b94bc011926c7ce8ee497"},"schema_version":"1.0","source":{"id":"1705.02816","kind":"arxiv","version":3}},"canonical_sha256":"6a3c6f61db7e18c633301ea05f4eaa0a0f5580d856815dd9de74a498d865a4c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a3c6f61db7e18c633301ea05f4eaa0a0f5580d856815dd9de74a498d865a4c3","first_computed_at":"2026-05-18T00:43:49.961082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:49.961082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XKSQgbakQ6zs9ty9YOesAimGqbW8MgFCYO5FgAGH/Aj1UWoVW4pMuqwLAr2rwFRcazM+wW81yn7TWMZITu8QBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:49.961630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02816","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c886b956f9a674e693a684f8ad415c6cc6c02404292ffc4e65e49671a1e4730c","sha256:241cc7bb1e2b779cf3e8ad880513e43bba8d697867d8790fc9c4ad8750397a60"],"state_sha256":"828b4e7546430e0bbcea25859308b0e16513704859db3d3eef388e08f7fcfed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8hITHjqKlyQyhOOzOEevBM/Mz4dKV0Q0Q+8dAt553TdYQ1GNH26dTnpT3hrHiCNE0fN1P9jtnd62vsIoSGKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:34:04.498376Z","bundle_sha256":"c66f5c79120dbdb794cf6b2153f19d39c472d512c85bced5054a54509755833a"}}