{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B6KDHVXE6ZVBPD4PYWJDLDMIYW","short_pith_number":"pith:B6KDHVXE","canonical_record":{"source":{"id":"1405.0963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T16:56:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5808de193c12ad86bcaad39489cd5b92464747e21d56ed39455acd202997c942","abstract_canon_sha256":"395e3e4979ca1465bdba1a2e3552e34b234cd9a97adb4ec9d0adae66cc1e3d7c"},"schema_version":"1.0"},"canonical_sha256":"0f9433d6e4f66a178f8fc592358d88c5af955d1c241c36f98b5290824d051dfd","source":{"kind":"arxiv","id":"1405.0963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0963","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0963v1","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0963","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"B6KDHVXE6ZVB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B6KDHVXE6ZVBPD4P","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B6KDHVXE","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B6KDHVXE6ZVBPD4PYWJDLDMIYW","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T16:56:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5808de193c12ad86bcaad39489cd5b92464747e21d56ed39455acd202997c942","abstract_canon_sha256":"395e3e4979ca1465bdba1a2e3552e34b234cd9a97adb4ec9d0adae66cc1e3d7c"},"schema_version":"1.0"},"canonical_sha256":"0f9433d6e4f66a178f8fc592358d88c5af955d1c241c36f98b5290824d051dfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:40.346979Z","signature_b64":"P+2OwHQjyRckUyCAmZjkD+BH6563KN8kydQmL3cCaIKOU+12dKsqUZD59+KO1wcEyxjEpROgC4mjXzQ8razXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f9433d6e4f66a178f8fc592358d88c5af955d1c241c36f98b5290824d051dfd","last_reissued_at":"2026-05-18T02:52:40.346560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:40.346560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0963","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-18T02:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aF7Y16Pdxlha+GwLHz8vybFzbRMS0Z26AR4Q+5ssoU+yark88eunoluLV276+Q0swwT+2u7YGsEoVyu17396BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:15:07.195710Z"},"content_sha256":"09c47ddfd9c0e4dd88e66401338a30bc495eccc9e4ed47405bce7cdee9bed421","schema_version":"1.0","event_id":"sha256:09c47ddfd9c0e4dd88e66401338a30bc495eccc9e4ed47405bce7cdee9bed421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B6KDHVXE6ZVBPD4PYWJDLDMIYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many-Broadcast Channels: Definition and Capacity in the Degraded Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongning Guo, Tsung-Yi Chen, Xu Chen","submitted_at":"2014-05-05T16:56:16Z","abstract_excerpt":"Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. Motivated by emerging systems with a massive number of users, this paper studies the new {\\em many-user paradigm}, where the number of users is allowed to grow with the blocklength. The focus of this paper is the degraded many-broadcast channel model, whose number of users may grow as fast as linearly with the blocklength. A notion of capacity in terms of message length is defined and an example of Gaussian degraded many-broadcas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0963","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-18T02:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNqi2LOLej5cXQl05/w91OUSOPhScAMlQ6pPH07CWTVyA7SRAj+v6ARPRUIJJ2G0GYurA4y56keLiOWYzR5aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:15:07.196448Z"},"content_sha256":"c2a04d3ba5f55e158ba41bfe26876df28e094b138bcf75c0f4b49fafd51517d6","schema_version":"1.0","event_id":"sha256:c2a04d3ba5f55e158ba41bfe26876df28e094b138bcf75c0f4b49fafd51517d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW/bundle.json","state_url":"https://pith.science/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW/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-26T23:15:07Z","links":{"resolver":"https://pith.science/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW","bundle":"https://pith.science/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW/bundle.json","state":"https://pith.science/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6KDHVXE6ZVBPD4PYWJDLDMIYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B6KDHVXE6ZVBPD4PYWJDLDMIYW","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":"395e3e4979ca1465bdba1a2e3552e34b234cd9a97adb4ec9d0adae66cc1e3d7c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T16:56:16Z","title_canon_sha256":"5808de193c12ad86bcaad39489cd5b92464747e21d56ed39455acd202997c942"},"schema_version":"1.0","source":{"id":"1405.0963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0963","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0963v1","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0963","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"B6KDHVXE6ZVB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B6KDHVXE6ZVBPD4P","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B6KDHVXE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:c2a04d3ba5f55e158ba41bfe26876df28e094b138bcf75c0f4b49fafd51517d6","target":"graph","created_at":"2026-05-18T02:52:40Z","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":"Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. Motivated by emerging systems with a massive number of users, this paper studies the new {\\em many-user paradigm}, where the number of users is allowed to grow with the blocklength. The focus of this paper is the degraded many-broadcast channel model, whose number of users may grow as fast as linearly with the blocklength. A notion of capacity in terms of message length is defined and an example of Gaussian degraded many-broadcas","authors_text":"Dongning Guo, Tsung-Yi Chen, Xu Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T16:56:16Z","title":"Many-Broadcast Channels: Definition and Capacity in the Degraded Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0963","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:09c47ddfd9c0e4dd88e66401338a30bc495eccc9e4ed47405bce7cdee9bed421","target":"record","created_at":"2026-05-18T02:52:40Z","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":"395e3e4979ca1465bdba1a2e3552e34b234cd9a97adb4ec9d0adae66cc1e3d7c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T16:56:16Z","title_canon_sha256":"5808de193c12ad86bcaad39489cd5b92464747e21d56ed39455acd202997c942"},"schema_version":"1.0","source":{"id":"1405.0963","kind":"arxiv","version":1}},"canonical_sha256":"0f9433d6e4f66a178f8fc592358d88c5af955d1c241c36f98b5290824d051dfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f9433d6e4f66a178f8fc592358d88c5af955d1c241c36f98b5290824d051dfd","first_computed_at":"2026-05-18T02:52:40.346560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:40.346560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P+2OwHQjyRckUyCAmZjkD+BH6563KN8kydQmL3cCaIKOU+12dKsqUZD59+KO1wcEyxjEpROgC4mjXzQ8razXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:40.346979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09c47ddfd9c0e4dd88e66401338a30bc495eccc9e4ed47405bce7cdee9bed421","sha256:c2a04d3ba5f55e158ba41bfe26876df28e094b138bcf75c0f4b49fafd51517d6"],"state_sha256":"92249b852aa0ddd5206aa18e10a80fb2060df99efe2db121c386b2724e4abbbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8Ti/KY1r6iLueTTbcQDZykKuTAlxAAoNqYJc06OrlTGGoH0ES6QtNByp1Rh91fG1dyjzNk06EH0W3OD7GpRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:15:07.199804Z","bundle_sha256":"15e5dd4eee59ad8e39ad5c00bab32eb5070e0d4a1942e3b9e7923ac8cea0d9c4"}}