{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ORDKPEDX22RAZSUCZFHGF2IZWE","short_pith_number":"pith:ORDKPEDX","schema_version":"1.0","canonical_sha256":"7446a79077d6a20cca82c94e62e919b13c4516c2c20f4f64d2a4752eb1a6288f","source":{"kind":"arxiv","id":"1207.3040","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.3040","created_at":"2026-05-18T03:33:37.671186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3040v2","created_at":"2026-05-18T03:33:37.671186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3040","created_at":"2026-05-18T03:33:37.671186+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORDKPEDX22RA","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORDKPEDX22RAZSUC","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORDKPEDX","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE","json":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE.json","graph_json":"https://pith.science/api/pith-number/ORDKPEDX22RAZSUCZFHGF2IZWE/graph.json","events_json":"https://pith.science/api/pith-number/ORDKPEDX22RAZSUCZFHGF2IZWE/events.json","paper":"https://pith.science/paper/ORDKPEDX"},"agent_actions":{"view_html":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE","download_json":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE.json","view_paper":"https://pith.science/paper/ORDKPEDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3040&json=true","fetch_graph":"https://pith.science/api/pith-number/ORDKPEDX22RAZSUCZFHGF2IZWE/graph.json","fetch_events":"https://pith.science/api/pith-number/ORDKPEDX22RAZSUCZFHGF2IZWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/action/storage_attestation","attest_author":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/action/author_attestation","sign_citation":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/action/citation_signature","submit_replication":"https://pith.science/pith/ORDKPEDX22RAZSUCZFHGF2IZWE/action/replication_record"}},"created_at":"2026-05-18T03:33:37.671186+00:00","updated_at":"2026-05-18T03:33:37.671186+00:00"}