{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:46OW46GYZVJQBJZZ5MIZLTZ4YZ","short_pith_number":"pith:46OW46GY","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"},"canonical_sha256":"e79d6e78d8cd5300a739eb1195cf3cc64d845f96673593c69aefbea411c289cf","source":{"kind":"arxiv","id":"1207.3027","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3027","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3027v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3027","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"46OW46GYZVJQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"46OW46GYZVJQBJZZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"46OW46GY","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:46OW46GYZVJQBJZZ5MIZLTZ4YZ","target":"record","payload":{"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"},"canonical_sha256":"e79d6e78d8cd5300a739eb1195cf3cc64d845f96673593c69aefbea411c289cf","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"},"source_kind":"arxiv","source_id":"1207.3027","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":"FHnIhyI76im6+lCsZxGkMvnSttWQkGNc+1WJVL4ZSSu+rs68nQbqCOvRonU9Lfu0w/EGLg8HEeT6oHSYpt4mDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:11:35.290244Z"},"content_sha256":"ae0e07fe817fc6b7622ce36fbdc3b1d10a7088432999097f2eb50811a61a392d","schema_version":"1.0","event_id":"sha256:ae0e07fe817fc6b7622ce36fbdc3b1d10a7088432999097f2eb50811a61a392d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:46OW46GYZVJQBJZZ5MIZLTZ4YZ","target":"graph","payload":{"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"},"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":"LYyGek+Bboq/39T3Ta8V2N1s7Df5HPO3A9/wi62hjuIxHVRg5ejH9tHvLStpY0daFcmJDgI/ngIAmZ38ws80Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:11:35.290605Z"},"content_sha256":"08e34ae728a3b3d2b0b002edbdd4d5f411ecbb5182475813e9575d6413412d9c","schema_version":"1.0","event_id":"sha256:08e34ae728a3b3d2b0b002edbdd4d5f411ecbb5182475813e9575d6413412d9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/bundle.json","state_url":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/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-25T05:11:35Z","links":{"resolver":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ","bundle":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/bundle.json","state":"https://pith.science/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46OW46GYZVJQBJZZ5MIZLTZ4YZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:46OW46GYZVJQBJZZ5MIZLTZ4YZ","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":"edbccac531ba7b761a46a8a7492bc411525d3d4fbfd2acf75f267adfa4fb9484","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T17:24:38Z","title_canon_sha256":"20d5366d425db59e48f70d05e9b0934a748f25a0b0edc010ad76c0c2699f3ca4"},"schema_version":"1.0","source":{"id":"1207.3027","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3027","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3027v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3027","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"46OW46GYZVJQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"46OW46GYZVJQBJZZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"46OW46GY","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:08e34ae728a3b3d2b0b002edbdd4d5f411ecbb5182475813e9575d6413412d9c","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 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","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-12T17:24:38Z","title":"Fundamental Limits of Communications in Interference Networks-Part II: Information Flow in Degraded Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3027","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:ae0e07fe817fc6b7622ce36fbdc3b1d10a7088432999097f2eb50811a61a392d","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":"edbccac531ba7b761a46a8a7492bc411525d3d4fbfd2acf75f267adfa4fb9484","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T17:24:38Z","title_canon_sha256":"20d5366d425db59e48f70d05e9b0934a748f25a0b0edc010ad76c0c2699f3ca4"},"schema_version":"1.0","source":{"id":"1207.3027","kind":"arxiv","version":2}},"canonical_sha256":"e79d6e78d8cd5300a739eb1195cf3cc64d845f96673593c69aefbea411c289cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e79d6e78d8cd5300a739eb1195cf3cc64d845f96673593c69aefbea411c289cf","first_computed_at":"2026-05-18T03:33:37.690312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:37.690312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FH1wCYzkfO2+76uWiEY8c0ceRiTo6v2dRN6taUYCxDlVVDbYEIqjF2iuBCyteHONnJ0O+frRfNU/9S2Bnxl9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:37.691085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3027","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae0e07fe817fc6b7622ce36fbdc3b1d10a7088432999097f2eb50811a61a392d","sha256:08e34ae728a3b3d2b0b002edbdd4d5f411ecbb5182475813e9575d6413412d9c"],"state_sha256":"bf19f162cc4a93e391b78b75b4b4173a88a568f9d310a5c69c832b6ad5e77c15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kP6pmCkBLbV8ZT+6d0slcpiIWJaX/8aQW0byYRzbwF8cOmvQpuzHCC2xZ4KcxMKsbaloNcKymUcGzrFDSAu9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:11:35.292561Z","bundle_sha256":"bf3bbca9b9b4e4e226dd12c88105bdabd11c8587bd8ef7fbe77450e2ad5ea8d7"}}