{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:46OW46GYZVJQBJZZ5MIZLTZ4YZ","short_pith_number":"pith:46OW46GY","schema_version":"1.0","canonical_sha256":"e79d6e78d8cd5300a739eb1195cf3cc64d845f96673593c69aefbea411c289cf","source":{"kind":"arxiv","id":"1207.3027","version":2},"attestation_state":"computed","paper":{"title":"Fundamental Limits of Communications in Interference Networks-Part II: Information Flow in Degraded Networks","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-12T17:24:38Z","abstract_excerpt":"In this second part of our multi-part papers, the information flow in degraded interference networks is studied. A full characterization of the sum-rate capacity for the degraded networks with any possible configuration is established. It is shown that a successive decoding scheme is sum-rate optimal for these networks. Also, it is proved that the transmission of only a certain subset of messages is sufficient to achieve the sum-rate capacity in such networks. Algorithms are presented to determine this subset of messages explicitly. According to these algorithms, the optimal strategy to achiev"},"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.3027","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T17:24:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20d5366d425db59e48f70d05e9b0934a748f25a0b0edc010ad76c0c2699f3ca4","abstract_canon_sha256":"edbccac531ba7b761a46a8a7492bc411525d3d4fbfd2acf75f267adfa4fb9484"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:37.691085Z","signature_b64":"FH1wCYzkfO2+76uWiEY8c0ceRiTo6v2dRN6taUYCxDlVVDbYEIqjF2iuBCyteHONnJ0O+frRfNU/9S2Bnxl9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e79d6e78d8cd5300a739eb1195cf3cc64d845f96673593c69aefbea411c289cf","last_reissued_at":"2026-05-18T03:33:37.690312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:37.690312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limits of Communications in Interference Networks-Part II: Information Flow in Degraded Networks","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-12T17:24:38Z","abstract_excerpt":"In this second part of our multi-part papers, the information flow in degraded interference networks is studied. A full characterization of the sum-rate capacity for the degraded networks with any possible configuration is established. It is shown that a successive decoding scheme is sum-rate optimal for these networks. Also, it is proved that the transmission of only a certain subset of messages is sufficient to achieve the sum-rate capacity in such networks. Algorithms are presented to determine this subset of messages explicitly. According to these algorithms, the optimal strategy to achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3027","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.3027","created_at":"2026-05-18T03:33:37.690437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3027v2","created_at":"2026-05-18T03:33:37.690437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3027","created_at":"2026-05-18T03:33:37.690437+00:00"},{"alias_kind":"pith_short_12","alias_value":"46OW46GYZVJQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"46OW46GYZVJQBJZZ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"46OW46GY","created_at":"2026-05-18T12:26:53.410803+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/46OW46GYZVJQBJZZ5MIZLTZ4YZ","json":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ.json","graph_json":"https://pith.science/api/pith-number/46OW46GYZVJQBJZZ5MIZLTZ4YZ/graph.json","events_json":"https://pith.science/api/pith-number/46OW46GYZVJQBJZZ5MIZLTZ4YZ/events.json","paper":"https://pith.science/paper/46OW46GY"},"agent_actions":{"view_html":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ","download_json":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ.json","view_paper":"https://pith.science/paper/46OW46GY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3027&json=true","fetch_graph":"https://pith.science/api/pith-number/46OW46GYZVJQBJZZ5MIZLTZ4YZ/graph.json","fetch_events":"https://pith.science/api/pith-number/46OW46GYZVJQBJZZ5MIZLTZ4YZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/action/storage_attestation","attest_author":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/action/author_attestation","sign_citation":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/action/citation_signature","submit_replication":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/action/replication_record"}},"created_at":"2026-05-18T03:33:37.690437+00:00","updated_at":"2026-05-18T03:33:37.690437+00:00"}