{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SCWHSKEVXEO3OWXXXUMAXVVZA6","short_pith_number":"pith:SCWHSKEV","canonical_record":{"source":{"id":"1412.2711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T19:43:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9535ce968b0eec41fe3c580b3de29230a532b7184a4895afd87f59dbb00c64c4","abstract_canon_sha256":"84693e1c1c19453399e3222bebef12385c490fe97258e98f2d188fae3bf1baaa"},"schema_version":"1.0"},"canonical_sha256":"90ac792895b91db75af7bd180bd6b907aa9bf79fffff92d26d090c052210b18b","source":{"kind":"arxiv","id":"1412.2711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2711","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2711v1","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2711","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"pith_short_12","alias_value":"SCWHSKEVXEO3","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SCWHSKEVXEO3OWXX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SCWHSKEV","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SCWHSKEVXEO3OWXXXUMAXVVZA6","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T19:43:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9535ce968b0eec41fe3c580b3de29230a532b7184a4895afd87f59dbb00c64c4","abstract_canon_sha256":"84693e1c1c19453399e3222bebef12385c490fe97258e98f2d188fae3bf1baaa"},"schema_version":"1.0"},"canonical_sha256":"90ac792895b91db75af7bd180bd6b907aa9bf79fffff92d26d090c052210b18b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:48.905219Z","signature_b64":"LN2fkQzIO1n08A2J2Nw+Ugy1cegURAJ0F8OdBPlE5H6hXtBVuw+mO8vbBBpjLm2ez2nOoIs5lkFrgsJvUeu0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ac792895b91db75af7bd180bd6b907aa9bf79fffff92d26d090c052210b18b","last_reissued_at":"2026-05-18T02:31:48.904607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:48.904607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2711","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:31:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rekLK9jw/JeSikg6Rh77btQ7xfvuxwy6tVMdJjGOc2o3XYH+Wkwo8O/U1HqFJQBumUz/64SZ+FoyZJ1B/WhGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:42:50.654104Z"},"content_sha256":"be7cf508f0868ea46bb378450b659b8ebf0f0ad369252a9da04f06cca9235b4a","schema_version":"1.0","event_id":"sha256:be7cf508f0868ea46bb378450b659b8ebf0f0ad369252a9da04f06cca9235b4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SCWHSKEVXEO3OWXXXUMAXVVZA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Treating Interference as Noise: Compound Interference Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunhua Geng, Syed A. Jafar","submitted_at":"2014-12-08T19:43:43Z","abstract_excerpt":"In a K-user Gaussian interference channel, it has been shown by Geng et al. that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all values in dB scale), then power control and treating interference as noise (TIN) is optimal from the perspective of generalized degrees of freedom (GDoF) and achieves the entire channel capacity region to within a constant gap. In this work, we generalize the optimality of TIN to compound networks. We show that for a K-user compound Gaus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2711","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:31:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnVD6YuHOOdu1iIhMPq/4NRMv0jApL+FX8FSZoWE1CydWbC8IZUNMLq2bKoyUFxZijoInqHj6JcHEoqfC7bxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:42:50.654464Z"},"content_sha256":"a9647538c212bf1479104ae2c3103ea73cd70a7d5c66da755395e40b18b23412","schema_version":"1.0","event_id":"sha256:a9647538c212bf1479104ae2c3103ea73cd70a7d5c66da755395e40b18b23412"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6/bundle.json","state_url":"https://pith.science/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6/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-19T21:42:50Z","links":{"resolver":"https://pith.science/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6","bundle":"https://pith.science/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6/bundle.json","state":"https://pith.science/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCWHSKEVXEO3OWXXXUMAXVVZA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SCWHSKEVXEO3OWXXXUMAXVVZA6","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":"84693e1c1c19453399e3222bebef12385c490fe97258e98f2d188fae3bf1baaa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T19:43:43Z","title_canon_sha256":"9535ce968b0eec41fe3c580b3de29230a532b7184a4895afd87f59dbb00c64c4"},"schema_version":"1.0","source":{"id":"1412.2711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2711","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2711v1","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2711","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"pith_short_12","alias_value":"SCWHSKEVXEO3","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SCWHSKEVXEO3OWXX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SCWHSKEV","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:a9647538c212bf1479104ae2c3103ea73cd70a7d5c66da755395e40b18b23412","target":"graph","created_at":"2026-05-18T02:31:48Z","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":"In a K-user Gaussian interference channel, it has been shown by Geng et al. that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all values in dB scale), then power control and treating interference as noise (TIN) is optimal from the perspective of generalized degrees of freedom (GDoF) and achieves the entire channel capacity region to within a constant gap. In this work, we generalize the optimality of TIN to compound networks. We show that for a K-user compound Gaus","authors_text":"Chunhua Geng, Syed A. Jafar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T19:43:43Z","title":"On the Optimality of Treating Interference as Noise: Compound Interference Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2711","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:be7cf508f0868ea46bb378450b659b8ebf0f0ad369252a9da04f06cca9235b4a","target":"record","created_at":"2026-05-18T02:31:48Z","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":"84693e1c1c19453399e3222bebef12385c490fe97258e98f2d188fae3bf1baaa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-08T19:43:43Z","title_canon_sha256":"9535ce968b0eec41fe3c580b3de29230a532b7184a4895afd87f59dbb00c64c4"},"schema_version":"1.0","source":{"id":"1412.2711","kind":"arxiv","version":1}},"canonical_sha256":"90ac792895b91db75af7bd180bd6b907aa9bf79fffff92d26d090c052210b18b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90ac792895b91db75af7bd180bd6b907aa9bf79fffff92d26d090c052210b18b","first_computed_at":"2026-05-18T02:31:48.904607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:48.904607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LN2fkQzIO1n08A2J2Nw+Ugy1cegURAJ0F8OdBPlE5H6hXtBVuw+mO8vbBBpjLm2ez2nOoIs5lkFrgsJvUeu0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:48.905219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be7cf508f0868ea46bb378450b659b8ebf0f0ad369252a9da04f06cca9235b4a","sha256:a9647538c212bf1479104ae2c3103ea73cd70a7d5c66da755395e40b18b23412"],"state_sha256":"a2fe7a6c6e9836f61c64262cf2637f25c4bdeccf043528affbb25ffb82698da7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oM/bqXhqH/DjTh+eypG/bOzEZST6mO/c1wJo3+6+G7UqPmqU+7cqHn1pFlXqTlQmXYMprn2m+VEFQezbbMHAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T21:42:50.656434Z","bundle_sha256":"4ad29efcd8a3449855e6823e75d18bb1cf33cfba135d6a0b7bc5f3bb682c83b2"}}