{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ORDKPEDX22RAZSUCZFHGF2IZWE","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":"26262a0ffd6f3dac4f444b6f671f8652572eb4992e8d6818898434d5b77e60ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:05:31Z","title_canon_sha256":"80ff4e8c5f66552c52e0d11419b29b30707d2607b696d46ff2dfa238a0633276"},"schema_version":"1.0","source":{"id":"1207.3040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3040","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3040v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3040","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"ORDKPEDX22RA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ORDKPEDX22RAZSUC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ORDKPEDX","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ed9ecd4852f3b2713a3224c5cb4d88b4d642c95ebcc8631ef29c9f85386a6b86","target":"graph","created_at":"2026-05-18T03:33:37Z","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 fourth part of our multi-part papers, classes of interference networks with a sequence of less-noisy receivers are identified for which a successive decoding scheme achieve the sum-rate capacity. First, the two-receiver networks are analyzed: it is demonstrated that the unified outer bounds derived in Part III of our multi-part papers are sum-rate optimal for network scenarios which satisfy certain less-noisy conditions. Then, the multi-receiver networks are considered. These networks are far less understood. One of the main difficulties in the analysis of such scenarios is how to esta","authors_text":"Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:05:31Z","title":"Fundamental Limits of Communications in Interference Networks-Part IV: Networks with a Sequence of Less-Noisy Receivers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3040","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:8ba34fb1a16e8bbec655ea6341aec2c4fb2555956fc201706fef2590a828b71f","target":"record","created_at":"2026-05-18T03:33:37Z","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":"26262a0ffd6f3dac4f444b6f671f8652572eb4992e8d6818898434d5b77e60ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:05:31Z","title_canon_sha256":"80ff4e8c5f66552c52e0d11419b29b30707d2607b696d46ff2dfa238a0633276"},"schema_version":"1.0","source":{"id":"1207.3040","kind":"arxiv","version":2}},"canonical_sha256":"7446a79077d6a20cca82c94e62e919b13c4516c2c20f4f64d2a4752eb1a6288f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7446a79077d6a20cca82c94e62e919b13c4516c2c20f4f64d2a4752eb1a6288f","first_computed_at":"2026-05-18T03:33:37.671111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:37.671111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3osoF3dAD2dFtOz7P2ywl94mRr1Mkpz1YxULnXbAIuc3eXPZ6saziGvJeKcKH+FUON+jzBrOsUTJA9WUwB+xCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:37.671714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ba34fb1a16e8bbec655ea6341aec2c4fb2555956fc201706fef2590a828b71f","sha256:ed9ecd4852f3b2713a3224c5cb4d88b4d642c95ebcc8631ef29c9f85386a6b86"],"state_sha256":"4318272074a6a902580f5c49b0991fd3b99daf33029cec5f31f837d4540d4fa2"}