{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EIGGQR5SL42EFJTFDGY4YWBIYP","short_pith_number":"pith:EIGGQR5S","canonical_record":{"source":{"id":"1805.04773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-12T20:07:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdf38d638695e3e3a497987f431b0826f3ce56e6f459b1d43f85cc37dabc48a5","abstract_canon_sha256":"c4289460fe6dcde58b3dc1f939e7f07e55fc2cdc91d8909d762f0e3fa450c964"},"schema_version":"1.0"},"canonical_sha256":"220c6847b25f3442a66519b1cc5828c3e7bc225d0054b6d16372eed40acefce3","source":{"kind":"arxiv","id":"1805.04773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04773","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04773v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04773","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"EIGGQR5SL42E","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EIGGQR5SL42EFJTF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EIGGQR5S","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EIGGQR5SL42EFJTFDGY4YWBIYP","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-12T20:07:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdf38d638695e3e3a497987f431b0826f3ce56e6f459b1d43f85cc37dabc48a5","abstract_canon_sha256":"c4289460fe6dcde58b3dc1f939e7f07e55fc2cdc91d8909d762f0e3fa450c964"},"schema_version":"1.0"},"canonical_sha256":"220c6847b25f3442a66519b1cc5828c3e7bc225d0054b6d16372eed40acefce3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.614192Z","signature_b64":"nQ61wTjN1+4nH/vZk5RWwtvbhWwLVEAmN0D5loZTDmZKyp4r1JSdEynbdOcsgorwBjQR5rawgRGrquyUtb9HCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"220c6847b25f3442a66519b1cc5828c3e7bc225d0054b6d16372eed40acefce3","last_reissued_at":"2026-05-18T00:16:04.613810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.613810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04773","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-18T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXZ4/JgE7DTBB5tN9BetolQqYJzJYzaZszkvM0vbOSOYRHv6bsBjpr30o+NHIbIcESdbeZQKPFRNhMcGiF+/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:35:54.888115Z"},"content_sha256":"4e5c852cf1dbf6a5b456537a3446ae9f409982ce6c94ab02219ea3a4b79c5495","schema_version":"1.0","event_id":"sha256:4e5c852cf1dbf6a5b456537a3446ae9f409982ce6c94ab02219ea3a4b79c5495"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EIGGQR5SL42EFJTFDGY4YWBIYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Treating Interference as Noise for Interfering Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bruno Clerckx, Hamdi Joudeh","submitted_at":"2018-05-12T20:07:22Z","abstract_excerpt":"In this paper, we look at the problem of treating interference as noise (TIN) in the Gaussian interfering multiple access channel (IMAC). The considered network comprises $K$ mutually interfering multiple access channels (MACs), each consisting of two transmitters communicating independent messages to one receiver. We define the TIN scheme for this channel as one in which each MAC performs a power controlled version of its capacity-achieving strategy while treating interference from all other MACs as noise. We characterize an achievable generalized degrees-of-freedom (GDoF) region under the TI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04773","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-18T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZGhqErdOdZh4ABEqg8c++XV6N3DXqx1WKNFkJCu9PvxNmCMy1/fPMShNf1bFIq5TE3cFBdmdxGsi0ikvPfyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:35:54.888495Z"},"content_sha256":"5b237eb77221d303fd9e4ec9f57b5484449869c26869ad306b55d10f65063b41","schema_version":"1.0","event_id":"sha256:5b237eb77221d303fd9e4ec9f57b5484449869c26869ad306b55d10f65063b41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIGGQR5SL42EFJTFDGY4YWBIYP/bundle.json","state_url":"https://pith.science/pith/EIGGQR5SL42EFJTFDGY4YWBIYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIGGQR5SL42EFJTFDGY4YWBIYP/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-01T16:35:54Z","links":{"resolver":"https://pith.science/pith/EIGGQR5SL42EFJTFDGY4YWBIYP","bundle":"https://pith.science/pith/EIGGQR5SL42EFJTFDGY4YWBIYP/bundle.json","state":"https://pith.science/pith/EIGGQR5SL42EFJTFDGY4YWBIYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIGGQR5SL42EFJTFDGY4YWBIYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EIGGQR5SL42EFJTFDGY4YWBIYP","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":"c4289460fe6dcde58b3dc1f939e7f07e55fc2cdc91d8909d762f0e3fa450c964","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-12T20:07:22Z","title_canon_sha256":"bdf38d638695e3e3a497987f431b0826f3ce56e6f459b1d43f85cc37dabc48a5"},"schema_version":"1.0","source":{"id":"1805.04773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04773","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04773v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04773","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"EIGGQR5SL42E","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EIGGQR5SL42EFJTF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EIGGQR5S","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:5b237eb77221d303fd9e4ec9f57b5484449869c26869ad306b55d10f65063b41","target":"graph","created_at":"2026-05-18T00:16:04Z","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 this paper, we look at the problem of treating interference as noise (TIN) in the Gaussian interfering multiple access channel (IMAC). The considered network comprises $K$ mutually interfering multiple access channels (MACs), each consisting of two transmitters communicating independent messages to one receiver. We define the TIN scheme for this channel as one in which each MAC performs a power controlled version of its capacity-achieving strategy while treating interference from all other MACs as noise. We characterize an achievable generalized degrees-of-freedom (GDoF) region under the TI","authors_text":"Bruno Clerckx, Hamdi Joudeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-12T20:07:22Z","title":"On the Optimality of Treating Interference as Noise for Interfering Multiple Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04773","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:4e5c852cf1dbf6a5b456537a3446ae9f409982ce6c94ab02219ea3a4b79c5495","target":"record","created_at":"2026-05-18T00:16:04Z","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":"c4289460fe6dcde58b3dc1f939e7f07e55fc2cdc91d8909d762f0e3fa450c964","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-12T20:07:22Z","title_canon_sha256":"bdf38d638695e3e3a497987f431b0826f3ce56e6f459b1d43f85cc37dabc48a5"},"schema_version":"1.0","source":{"id":"1805.04773","kind":"arxiv","version":1}},"canonical_sha256":"220c6847b25f3442a66519b1cc5828c3e7bc225d0054b6d16372eed40acefce3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"220c6847b25f3442a66519b1cc5828c3e7bc225d0054b6d16372eed40acefce3","first_computed_at":"2026-05-18T00:16:04.613810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:04.613810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nQ61wTjN1+4nH/vZk5RWwtvbhWwLVEAmN0D5loZTDmZKyp4r1JSdEynbdOcsgorwBjQR5rawgRGrquyUtb9HCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:04.614192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e5c852cf1dbf6a5b456537a3446ae9f409982ce6c94ab02219ea3a4b79c5495","sha256:5b237eb77221d303fd9e4ec9f57b5484449869c26869ad306b55d10f65063b41"],"state_sha256":"1cb81d3c9cd57e7322685d535d92aef67afa7951518f5c0d3403a7f34ba3fb16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/iO4FFfWBWupQwhcdVsj2T53qjX07sd56DwwwQeATZagqqAPguaPJjUM6f+rg5EWnA30GXrK9LOXSlr8AM3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:35:54.890565Z","bundle_sha256":"c6e2bf30394e7b83a8f018f7eb6471a2da06ac324a577e6728bd212e5e4ededb"}}