{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YG6AXMG42QEBFARWUVOZLRZAH7","short_pith_number":"pith:YG6AXMG4","canonical_record":{"source":{"id":"1110.1891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-09T22:22:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"791f786de7121f50aba81decf5d3657f1a496345b2689af8b6d435a988202b26","abstract_canon_sha256":"aa6cff2d63462253713935040b7063f4aba391d2a6fe3b1db5edb0a36ccb9e7f"},"schema_version":"1.0"},"canonical_sha256":"c1bc0bb0dcd408128236a55d95c7203ff40530d3aea6439f70b8fdf7831b4f75","source":{"kind":"arxiv","id":"1110.1891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1891","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1891v1","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1891","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"YG6AXMG42QEB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YG6AXMG42QEBFARW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YG6AXMG4","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YG6AXMG42QEBFARWUVOZLRZAH7","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-09T22:22:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"791f786de7121f50aba81decf5d3657f1a496345b2689af8b6d435a988202b26","abstract_canon_sha256":"aa6cff2d63462253713935040b7063f4aba391d2a6fe3b1db5edb0a36ccb9e7f"},"schema_version":"1.0"},"canonical_sha256":"c1bc0bb0dcd408128236a55d95c7203ff40530d3aea6439f70b8fdf7831b4f75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.407271Z","signature_b64":"yRGsZJCSjqa99i1SC9l6CglpyJwTY7QdTTASE7XTUt+HDSmCrjSMGYIHZw/jzYoZAW2lzc/cw7FoLd1EbGOiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1bc0bb0dcd408128236a55d95c7203ff40530d3aea6439f70b8fdf7831b4f75","last_reissued_at":"2026-05-18T04:11:19.406820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.406820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1891","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:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUr4M1vOFAt2a3kTTIMWw6hIjAV8lcqXLiUYDnhuVHgE9Ae5cynycrRlRxeupf0xyS1NhTEq/5TAZ6ecB+Y1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:31:51.128477Z"},"content_sha256":"7cdeae94ea064d4f0403b320a8411a83b77eba71d8bcad0b54a1ee96e61c5c77","schema_version":"1.0","event_id":"sha256:7cdeae94ea064d4f0403b320a8411a83b77eba71d8bcad0b54a1ee96e61c5c77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YG6AXMG42QEBFARWUVOZLRZAH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Channel Coding in Random Access Communication over Compound Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2011-10-09T22:22:41Z","abstract_excerpt":"Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the time varying channel states with high precision. This paper investigates random multiple access communication over a compound wireless channel where channel realization is known neither at the transmitters nor at the receiver. An achievable rate and error probability tradeoff bound is derived under the non-asymptotic assumption of a finite codeword length. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1891","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:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCxOiCRy1NvSlSnUfX2YNPMqL07te1vMmAsCrfrmaor+eGOoVZ42z+BEcwzNvZWtYD7MpO8/MsGkhvV5uNVSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:31:51.128832Z"},"content_sha256":"c75ea274050dbcdce01bbf7164242ca333f187fc39716c9f2ab464a4ca30fac4","schema_version":"1.0","event_id":"sha256:c75ea274050dbcdce01bbf7164242ca333f187fc39716c9f2ab464a4ca30fac4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YG6AXMG42QEBFARWUVOZLRZAH7/bundle.json","state_url":"https://pith.science/pith/YG6AXMG42QEBFARWUVOZLRZAH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YG6AXMG42QEBFARWUVOZLRZAH7/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-04T19:31:51Z","links":{"resolver":"https://pith.science/pith/YG6AXMG42QEBFARWUVOZLRZAH7","bundle":"https://pith.science/pith/YG6AXMG42QEBFARWUVOZLRZAH7/bundle.json","state":"https://pith.science/pith/YG6AXMG42QEBFARWUVOZLRZAH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YG6AXMG42QEBFARWUVOZLRZAH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YG6AXMG42QEBFARWUVOZLRZAH7","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":"aa6cff2d63462253713935040b7063f4aba391d2a6fe3b1db5edb0a36ccb9e7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-09T22:22:41Z","title_canon_sha256":"791f786de7121f50aba81decf5d3657f1a496345b2689af8b6d435a988202b26"},"schema_version":"1.0","source":{"id":"1110.1891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1891","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1891v1","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1891","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"YG6AXMG42QEB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YG6AXMG42QEBFARW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YG6AXMG4","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:c75ea274050dbcdce01bbf7164242ca333f187fc39716c9f2ab464a4ca30fac4","target":"graph","created_at":"2026-05-18T04:11: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":"Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the time varying channel states with high precision. This paper investigates random multiple access communication over a compound wireless channel where channel realization is known neither at the transmitters nor at the receiver. An achievable rate and error probability tradeoff bound is derived under the non-asymptotic assumption of a finite codeword length. Th","authors_text":"Jie Luo, Zheng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-09T22:22:41Z","title":"Channel Coding in Random Access Communication over Compound Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1891","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:7cdeae94ea064d4f0403b320a8411a83b77eba71d8bcad0b54a1ee96e61c5c77","target":"record","created_at":"2026-05-18T04:11: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":"aa6cff2d63462253713935040b7063f4aba391d2a6fe3b1db5edb0a36ccb9e7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-09T22:22:41Z","title_canon_sha256":"791f786de7121f50aba81decf5d3657f1a496345b2689af8b6d435a988202b26"},"schema_version":"1.0","source":{"id":"1110.1891","kind":"arxiv","version":1}},"canonical_sha256":"c1bc0bb0dcd408128236a55d95c7203ff40530d3aea6439f70b8fdf7831b4f75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1bc0bb0dcd408128236a55d95c7203ff40530d3aea6439f70b8fdf7831b4f75","first_computed_at":"2026-05-18T04:11:19.406820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:19.406820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yRGsZJCSjqa99i1SC9l6CglpyJwTY7QdTTASE7XTUt+HDSmCrjSMGYIHZw/jzYoZAW2lzc/cw7FoLd1EbGOiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:19.407271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cdeae94ea064d4f0403b320a8411a83b77eba71d8bcad0b54a1ee96e61c5c77","sha256:c75ea274050dbcdce01bbf7164242ca333f187fc39716c9f2ab464a4ca30fac4"],"state_sha256":"3d20f79b5ce8615f2f1df168460912eaf8db467e7661aeef8ba508651b144dd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gGVOOKleSz8zQBO2HdvVf3FnNckeaPn/WIvUOQ5m62KR0wAJtpZbsJrQlNya+/QmHV8F/UKRoHV9Dphiun3dAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:31:51.130818Z","bundle_sha256":"716997225699e7aee0ee235fa186c30652739dd8f3c4fe555a41347ec9bd5ef7"}}