{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ORDKPEDX22RAZSUCZFHGF2IZWE","short_pith_number":"pith:ORDKPEDX","canonical_record":{"source":{"id":"1207.3040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:05:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80ff4e8c5f66552c52e0d11419b29b30707d2607b696d46ff2dfa238a0633276","abstract_canon_sha256":"26262a0ffd6f3dac4f444b6f671f8652572eb4992e8d6818898434d5b77e60ee"},"schema_version":"1.0"},"canonical_sha256":"7446a79077d6a20cca82c94e62e919b13c4516c2c20f4f64d2a4752eb1a6288f","source":{"kind":"arxiv","id":"1207.3040","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ORDKPEDX22RAZSUCZFHGF2IZWE","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:05:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80ff4e8c5f66552c52e0d11419b29b30707d2607b696d46ff2dfa238a0633276","abstract_canon_sha256":"26262a0ffd6f3dac4f444b6f671f8652572eb4992e8d6818898434d5b77e60ee"},"schema_version":"1.0"},"canonical_sha256":"7446a79077d6a20cca82c94e62e919b13c4516c2c20f4f64d2a4752eb1a6288f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:37.671714Z","signature_b64":"3osoF3dAD2dFtOz7P2ywl94mRr1Mkpz1YxULnXbAIuc3eXPZ6saziGvJeKcKH+FUON+jzBrOsUTJA9WUwB+xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7446a79077d6a20cca82c94e62e919b13c4516c2c20f4f64d2a4752eb1a6288f","last_reissued_at":"2026-05-18T03:33:37.671111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:37.671111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3040","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-18T03:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrFjVBCPSf2sTq04B/zjZ0RrgQ1CHivQxvLnJ9qnjC0t0wVdDdrdaL5hfHNoeREp4lDCfZ71bMF2pd7ltsm2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:15:11.350884Z"},"content_sha256":"8ba34fb1a16e8bbec655ea6341aec2c4fb2555956fc201706fef2590a828b71f","schema_version":"1.0","event_id":"sha256:8ba34fb1a16e8bbec655ea6341aec2c4fb2555956fc201706fef2590a828b71f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ORDKPEDX22RAZSUCZFHGF2IZWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of Communications in Interference Networks-Part IV: Networks with a Sequence of Less-Noisy Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Reza K. Farsani","submitted_at":"2012-07-12T18:05:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3040","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-18T03:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pBvWboipz671XjwVXbFQ0Ly7aPqzF3q4Tm35akNvQ+U7ZTS18Oo0rJ84ISSLpR0/4SoO44HCM8VF8dV67q8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:15:11.351232Z"},"content_sha256":"ed9ecd4852f3b2713a3224c5cb4d88b4d642c95ebcc8631ef29c9f85386a6b86","schema_version":"1.0","event_id":"sha256:ed9ecd4852f3b2713a3224c5cb4d88b4d642c95ebcc8631ef29c9f85386a6b86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/bundle.json","state_url":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/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-25T07:15:11Z","links":{"resolver":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE","bundle":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/bundle.json","state":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3FlkanQQWtjQn4v9PaEVxURkhHUse0FgyUe6I4NUxR/0GizZFCNluz/Mb/Hg/Tceb0ScOZ9A5+40raSwnOqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:15:11.353270Z","bundle_sha256":"dc01c798e39724a452f9ee6ff23d6d11c5a4dad9fdcf7873ef11a78e2f347688"}}