{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:47ILDQRQJ2UDWEXXGWE26W44EX","short_pith_number":"pith:47ILDQRQ","canonical_record":{"source":{"id":"1010.1044","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T00:54:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8d7575038a4fe2a9ec0f09b8fd5c3720e0a1311623e8f8e8edab993c1174e2a0","abstract_canon_sha256":"0e8f8287e9c1f0e7d2ac86bdc8aab7bc1704adbd39b9d4586f195e08cf0a8988"},"schema_version":"1.0"},"canonical_sha256":"e7d0b1c2304ea83b12f73589af5b9c25fb15ef66a1985dc0f719f1c6615f8a35","source":{"kind":"arxiv","id":"1010.1044","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1044","created_at":"2026-05-18T03:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1044v4","created_at":"2026-05-18T03:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1044","created_at":"2026-05-18T03:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"47ILDQRQJ2UD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"47ILDQRQJ2UDWEXX","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"47ILDQRQ","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:47ILDQRQJ2UDWEXXGWE26W44EX","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1044","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T00:54:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8d7575038a4fe2a9ec0f09b8fd5c3720e0a1311623e8f8e8edab993c1174e2a0","abstract_canon_sha256":"0e8f8287e9c1f0e7d2ac86bdc8aab7bc1704adbd39b9d4586f195e08cf0a8988"},"schema_version":"1.0"},"canonical_sha256":"e7d0b1c2304ea83b12f73589af5b9c25fb15ef66a1985dc0f719f1c6615f8a35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:45.720228Z","signature_b64":"k3Ug6V3BSidLEDHT1d1HGbyLOmyq2fJCTbSwype+F0hXdTd8etNRq4IvCWmO4Ow8PoWySash1TeTULQ8iVRwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7d0b1c2304ea83b12f73589af5b9c25fb15ef66a1985dc0f719f1c6615f8a35","last_reissued_at":"2026-05-18T03:46:45.719673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:45.719673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1044","source_version":4,"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-18T03:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAt6JtkpON7MDc0zE0V+RbIYpVuKdcXk0Zi6VzejvrBauGAh5qNExfWno3Bwk/u6InUwq5c49MKb7RbeKF4wCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:14:08.224792Z"},"content_sha256":"be4ea00e08029fbda17687b9f58ec4812a8fc6344429a822e33502634dada5df","schema_version":"1.0","event_id":"sha256:be4ea00e08029fbda17687b9f58ec4812a8fc6344429a822e33502634dada5df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:47ILDQRQJ2UDWEXXGWE26W44EX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of the $K$-User Cyclic Gaussian Interference Channel","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lei Zhou, Wei Yu","submitted_at":"2010-10-06T00:54:02Z","abstract_excerpt":"This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a capacity region outer bound for the two-user Gaussian interference channel and proved that a simple Han-Kobayashi power splitting scheme can achieve to within one bit of the capacity region for all values of channel parameters, this paper shows that a similar strategy also achieves the capacity region of the $K$-user cyclic interference channel to within a cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1044","kind":"arxiv","version":4},"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-18T03:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnL8E+Un6OVvhzMtOjNnVi/FJec5h7qUg5wN1KTmVhzI7vQPUnUvNCPmM8TeAFdIsleFI4+WtyXY1lNEvDt5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:14:08.225148Z"},"content_sha256":"3c72ddcdedc9819be093eb02b517c2db48711da67714f7dbe0c94a359065a93f","schema_version":"1.0","event_id":"sha256:3c72ddcdedc9819be093eb02b517c2db48711da67714f7dbe0c94a359065a93f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47ILDQRQJ2UDWEXXGWE26W44EX/bundle.json","state_url":"https://pith.science/pith/47ILDQRQJ2UDWEXXGWE26W44EX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47ILDQRQJ2UDWEXXGWE26W44EX/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-30T01:14:08Z","links":{"resolver":"https://pith.science/pith/47ILDQRQJ2UDWEXXGWE26W44EX","bundle":"https://pith.science/pith/47ILDQRQJ2UDWEXXGWE26W44EX/bundle.json","state":"https://pith.science/pith/47ILDQRQJ2UDWEXXGWE26W44EX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47ILDQRQJ2UDWEXXGWE26W44EX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:47ILDQRQJ2UDWEXXGWE26W44EX","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":"0e8f8287e9c1f0e7d2ac86bdc8aab7bc1704adbd39b9d4586f195e08cf0a8988","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T00:54:02Z","title_canon_sha256":"8d7575038a4fe2a9ec0f09b8fd5c3720e0a1311623e8f8e8edab993c1174e2a0"},"schema_version":"1.0","source":{"id":"1010.1044","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1044","created_at":"2026-05-18T03:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1044v4","created_at":"2026-05-18T03:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1044","created_at":"2026-05-18T03:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"47ILDQRQJ2UD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"47ILDQRQJ2UDWEXX","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"47ILDQRQ","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:3c72ddcdedc9819be093eb02b517c2db48711da67714f7dbe0c94a359065a93f","target":"graph","created_at":"2026-05-18T03:46:45Z","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":"This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a capacity region outer bound for the two-user Gaussian interference channel and proved that a simple Han-Kobayashi power splitting scheme can achieve to within one bit of the capacity region for all values of channel parameters, this paper shows that a similar strategy also achieves the capacity region of the $K$-user cyclic interference channel to within a cons","authors_text":"Lei Zhou, Wei Yu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T00:54:02Z","title":"On the Capacity of the $K$-User Cyclic Gaussian Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1044","kind":"arxiv","version":4},"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:be4ea00e08029fbda17687b9f58ec4812a8fc6344429a822e33502634dada5df","target":"record","created_at":"2026-05-18T03:46:45Z","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":"0e8f8287e9c1f0e7d2ac86bdc8aab7bc1704adbd39b9d4586f195e08cf0a8988","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T00:54:02Z","title_canon_sha256":"8d7575038a4fe2a9ec0f09b8fd5c3720e0a1311623e8f8e8edab993c1174e2a0"},"schema_version":"1.0","source":{"id":"1010.1044","kind":"arxiv","version":4}},"canonical_sha256":"e7d0b1c2304ea83b12f73589af5b9c25fb15ef66a1985dc0f719f1c6615f8a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7d0b1c2304ea83b12f73589af5b9c25fb15ef66a1985dc0f719f1c6615f8a35","first_computed_at":"2026-05-18T03:46:45.719673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:45.719673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k3Ug6V3BSidLEDHT1d1HGbyLOmyq2fJCTbSwype+F0hXdTd8etNRq4IvCWmO4Ow8PoWySash1TeTULQ8iVRwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:45.720228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1044","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4ea00e08029fbda17687b9f58ec4812a8fc6344429a822e33502634dada5df","sha256:3c72ddcdedc9819be093eb02b517c2db48711da67714f7dbe0c94a359065a93f"],"state_sha256":"93724ac2fa18a9b45725648a7d682ffa8a7cc1d562fa4fb1e1382f1787836fa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roL8lFhpJG6+LABadbQW6ljz9AvHFh3wX+MLhUu9v4KCscKSEsUpXezSRD0w11mwU0Y9SF6i0qCqpgyJV/SvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:14:08.227489Z","bundle_sha256":"ebd00c980b20cda904ef68c5e5833b30093c6bdd77c6435dc9b7b87ed4f1035f"}}