{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PPKOX2TVWGO3HP4ZJFJLK3R25W","short_pith_number":"pith:PPKOX2TV","canonical_record":{"source":{"id":"1504.00041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T21:10:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"315176df08f8c143ce1c6cea7fc72eb9aa290fa5b9222c354ae42d42b5c68933","abstract_canon_sha256":"c9ccab87dcc66580c0c1be71272f4ccb0271aff985b920d05cd4d95b8f67e105"},"schema_version":"1.0"},"canonical_sha256":"7bd4ebea75b19db3bf994952b56e3aedb3fb3c63cd82a38200a41e2160393704","source":{"kind":"arxiv","id":"1504.00041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00041","created_at":"2026-05-18T01:32:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00041v2","created_at":"2026-05-18T01:32:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00041","created_at":"2026-05-18T01:32:52Z"},{"alias_kind":"pith_short_12","alias_value":"PPKOX2TVWGO3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPKOX2TVWGO3HP4Z","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPKOX2TV","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PPKOX2TVWGO3HP4ZJFJLK3R25W","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T21:10:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"315176df08f8c143ce1c6cea7fc72eb9aa290fa5b9222c354ae42d42b5c68933","abstract_canon_sha256":"c9ccab87dcc66580c0c1be71272f4ccb0271aff985b920d05cd4d95b8f67e105"},"schema_version":"1.0"},"canonical_sha256":"7bd4ebea75b19db3bf994952b56e3aedb3fb3c63cd82a38200a41e2160393704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:52.381948Z","signature_b64":"ddxOsgkNFpLUfaZYnmuENh7Mip94XVUwzA84gXlmH2JmDNWWw6dIhjh8UJz/EJ+I5JuMsGFP+Ed+shHmxJ0lBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd4ebea75b19db3bf994952b56e3aedb3fb3c63cd82a38200a41e2160393704","last_reissued_at":"2026-05-18T01:32:52.381396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:52.381396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00041","source_version":2,"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-18T01:32:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4i2UKHcHwTVpjaSbr+pHz5sVohPIAtPh3MRoF77+eUnnO3GwC3Lbb/kMDVxsWKC8lKLzqzpQchqNwHwiWaSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:50:04.983208Z"},"content_sha256":"c5ce385109112532d49cadc315824850950bf6228645bd02e9e3613251208fbe","schema_version":"1.0","event_id":"sha256:c5ce385109112532d49cadc315824850950bf6228645bd02e9e3613251208fbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PPKOX2TVWGO3HP4ZJFJLK3R25W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality of Treating Interference as Noise: A Combinatorial Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Xinping Yi","submitted_at":"2015-03-31T21:10:15Z","abstract_excerpt":"For single-antenna Gaussian interference channels, we re-formulate the problem of determining the Generalized Degrees of Freedom (GDoF) region achievable by treating interference as Gaussian noise (TIN) derived in [3] from a combinatorial perspective. We show that the TIN power control problem can be cast into an assignment problem, such that the globally optimal power allocation variables can be obtained by well-known polynomial time algorithms. Furthermore, the expression of the TIN-Achievable GDoF region (TINA region) can be substantially simplified with the aid of maximum weighted matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00041","kind":"arxiv","version":2},"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-18T01:32:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MU/Zk/OLGUJKRyqvUtTSjRDhJi50knj4g1NghDtPbyhLVgx44E9xyuy127HBeSZGkC8A3NTt3q2CPNPZruWPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:50:04.983586Z"},"content_sha256":"c30a5cd57fe5a2b112963ccf552e6df46dbc2f1a16a74bc0a9023a0e14fcb660","schema_version":"1.0","event_id":"sha256:c30a5cd57fe5a2b112963ccf552e6df46dbc2f1a16a74bc0a9023a0e14fcb660"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W/bundle.json","state_url":"https://pith.science/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W/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-30T14:50:04Z","links":{"resolver":"https://pith.science/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W","bundle":"https://pith.science/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W/bundle.json","state":"https://pith.science/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPKOX2TVWGO3HP4ZJFJLK3R25W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PPKOX2TVWGO3HP4ZJFJLK3R25W","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":"c9ccab87dcc66580c0c1be71272f4ccb0271aff985b920d05cd4d95b8f67e105","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T21:10:15Z","title_canon_sha256":"315176df08f8c143ce1c6cea7fc72eb9aa290fa5b9222c354ae42d42b5c68933"},"schema_version":"1.0","source":{"id":"1504.00041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00041","created_at":"2026-05-18T01:32:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00041v2","created_at":"2026-05-18T01:32:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00041","created_at":"2026-05-18T01:32:52Z"},{"alias_kind":"pith_short_12","alias_value":"PPKOX2TVWGO3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPKOX2TVWGO3HP4Z","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPKOX2TV","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:c30a5cd57fe5a2b112963ccf552e6df46dbc2f1a16a74bc0a9023a0e14fcb660","target":"graph","created_at":"2026-05-18T01:32:52Z","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":"For single-antenna Gaussian interference channels, we re-formulate the problem of determining the Generalized Degrees of Freedom (GDoF) region achievable by treating interference as Gaussian noise (TIN) derived in [3] from a combinatorial perspective. We show that the TIN power control problem can be cast into an assignment problem, such that the globally optimal power allocation variables can be obtained by well-known polynomial time algorithms. Furthermore, the expression of the TIN-Achievable GDoF region (TINA region) can be substantially simplified with the aid of maximum weighted matching","authors_text":"Giuseppe Caire, Xinping Yi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T21:10:15Z","title":"Optimality of Treating Interference as Noise: A Combinatorial Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00041","kind":"arxiv","version":2},"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:c5ce385109112532d49cadc315824850950bf6228645bd02e9e3613251208fbe","target":"record","created_at":"2026-05-18T01:32:52Z","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":"c9ccab87dcc66580c0c1be71272f4ccb0271aff985b920d05cd4d95b8f67e105","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T21:10:15Z","title_canon_sha256":"315176df08f8c143ce1c6cea7fc72eb9aa290fa5b9222c354ae42d42b5c68933"},"schema_version":"1.0","source":{"id":"1504.00041","kind":"arxiv","version":2}},"canonical_sha256":"7bd4ebea75b19db3bf994952b56e3aedb3fb3c63cd82a38200a41e2160393704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bd4ebea75b19db3bf994952b56e3aedb3fb3c63cd82a38200a41e2160393704","first_computed_at":"2026-05-18T01:32:52.381396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:52.381396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddxOsgkNFpLUfaZYnmuENh7Mip94XVUwzA84gXlmH2JmDNWWw6dIhjh8UJz/EJ+I5JuMsGFP+Ed+shHmxJ0lBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:52.381948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5ce385109112532d49cadc315824850950bf6228645bd02e9e3613251208fbe","sha256:c30a5cd57fe5a2b112963ccf552e6df46dbc2f1a16a74bc0a9023a0e14fcb660"],"state_sha256":"bcb47f5becbac7c2c121046fd888a607c816ad4dde5cd523a9ae15ea57f6eedd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxo+bIP6NzGYQtxcHrSKgev6/EWEUDxU4lzMsyzHnXy2QzGDes9MuKCcSsOd4Ag/ju2EaJRgvoIN4SVuuKX1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:50:04.986241Z","bundle_sha256":"d651faad5bb0378abd81cf3eebeaf1661257af7019ac21c7a789db561b6a9df7"}}