{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q452M73PBJVSNLQS7KZ36DTRT2","short_pith_number":"pith:Q452M73P","canonical_record":{"source":{"id":"1301.7566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T09:58:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47712ddc14a37d314b15a22bda00f935fe586ad82cb9e0b27951eaa0005b065e","abstract_canon_sha256":"688560137758765a3455d0146091430c9968d338102c845257f0d9d85210eb82"},"schema_version":"1.0"},"canonical_sha256":"873ba67f6f0a6b26ae12fab3bf0e719eb45539fd20823c19764189a206af13d1","source":{"kind":"arxiv","id":"1301.7566","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7566","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7566v2","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7566","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q452M73PBJVS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q452M73PBJVSNLQS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q452M73P","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q452M73PBJVSNLQS7KZ36DTRT2","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T09:58:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47712ddc14a37d314b15a22bda00f935fe586ad82cb9e0b27951eaa0005b065e","abstract_canon_sha256":"688560137758765a3455d0146091430c9968d338102c845257f0d9d85210eb82"},"schema_version":"1.0"},"canonical_sha256":"873ba67f6f0a6b26ae12fab3bf0e719eb45539fd20823c19764189a206af13d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:22.650763Z","signature_b64":"3rmJlvoaXybOns1QW9+8VqGkgTzQTZsg5fUDVJJGdnZkEs6LcWLcDaTCZNBsidWfWFKGv+yq3KcKyKYgLzXCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"873ba67f6f0a6b26ae12fab3bf0e719eb45539fd20823c19764189a206af13d1","last_reissued_at":"2026-05-18T03:26:22.649924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:22.649924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7566","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:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JuLJojLVQKCRxuBvYxsxbPmb6lQDDzuGbwtn0h49pYDWXU8gOmjMb486JHEoH3aF1GluIySuMlONSRTYEvQUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:29.694160Z"},"content_sha256":"2ba37ea5605ea9a90db3af302f8565d4cbbb4a33915f64073c3203eb161815f0","schema_version":"1.0","event_id":"sha256:2ba37ea5605ea9a90db3af302f8565d4cbbb4a33915f64073c3203eb161815f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q452M73PBJVSNLQS7KZ36DTRT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Special Classes of Gaussian Relay Networks with Orthogonal Components and Noncausal State Information at Source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Sonee, Ghosheh Abed Hodtani","submitted_at":"2013-01-31T09:58:17Z","abstract_excerpt":"In this paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case in which just the source component intended for the destination is encoded against the CSI known non-causally at the source. Also, we derive capacity for two special classes of the Gaussian structure of the model. The first class is the one for which we have obtained the upper bound and the second class is the one in which all of the source components intend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7566","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:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"670trKK4EPcmz3ZzF3m8trnzOgR9uT6F8jUUys0nRPQ8PI0lAsmcJdBeFJqYeq84ASEDH8H8w8h3mTZOvmekDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:29.694848Z"},"content_sha256":"15e28e21eba40963d951cb83cf8d9612d311d14b06ef1141bdb17f0337f4cb07","schema_version":"1.0","event_id":"sha256:15e28e21eba40963d951cb83cf8d9612d311d14b06ef1141bdb17f0337f4cb07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q452M73PBJVSNLQS7KZ36DTRT2/bundle.json","state_url":"https://pith.science/pith/Q452M73PBJVSNLQS7KZ36DTRT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q452M73PBJVSNLQS7KZ36DTRT2/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-05-25T18:01:29Z","links":{"resolver":"https://pith.science/pith/Q452M73PBJVSNLQS7KZ36DTRT2","bundle":"https://pith.science/pith/Q452M73PBJVSNLQS7KZ36DTRT2/bundle.json","state":"https://pith.science/pith/Q452M73PBJVSNLQS7KZ36DTRT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q452M73PBJVSNLQS7KZ36DTRT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q452M73PBJVSNLQS7KZ36DTRT2","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":"688560137758765a3455d0146091430c9968d338102c845257f0d9d85210eb82","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T09:58:17Z","title_canon_sha256":"47712ddc14a37d314b15a22bda00f935fe586ad82cb9e0b27951eaa0005b065e"},"schema_version":"1.0","source":{"id":"1301.7566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7566","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7566v2","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7566","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q452M73PBJVS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q452M73PBJVSNLQS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q452M73P","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:15e28e21eba40963d951cb83cf8d9612d311d14b06ef1141bdb17f0337f4cb07","target":"graph","created_at":"2026-05-18T03:26:22Z","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 paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case in which just the source component intended for the destination is encoded against the CSI known non-causally at the source. Also, we derive capacity for two special classes of the Gaussian structure of the model. The first class is the one for which we have obtained the upper bound and the second class is the one in which all of the source components intend","authors_text":"Amir Sonee, Ghosheh Abed Hodtani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T09:58:17Z","title":"On the Capacity of Special Classes of Gaussian Relay Networks with Orthogonal Components and Noncausal State Information at Source"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7566","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:2ba37ea5605ea9a90db3af302f8565d4cbbb4a33915f64073c3203eb161815f0","target":"record","created_at":"2026-05-18T03:26:22Z","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":"688560137758765a3455d0146091430c9968d338102c845257f0d9d85210eb82","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T09:58:17Z","title_canon_sha256":"47712ddc14a37d314b15a22bda00f935fe586ad82cb9e0b27951eaa0005b065e"},"schema_version":"1.0","source":{"id":"1301.7566","kind":"arxiv","version":2}},"canonical_sha256":"873ba67f6f0a6b26ae12fab3bf0e719eb45539fd20823c19764189a206af13d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"873ba67f6f0a6b26ae12fab3bf0e719eb45539fd20823c19764189a206af13d1","first_computed_at":"2026-05-18T03:26:22.649924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:22.649924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rmJlvoaXybOns1QW9+8VqGkgTzQTZsg5fUDVJJGdnZkEs6LcWLcDaTCZNBsidWfWFKGv+yq3KcKyKYgLzXCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:22.650763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ba37ea5605ea9a90db3af302f8565d4cbbb4a33915f64073c3203eb161815f0","sha256:15e28e21eba40963d951cb83cf8d9612d311d14b06ef1141bdb17f0337f4cb07"],"state_sha256":"7927ec95094000402965659eea0fa3cb60b26726b7779a86fec9ccfdd6679415"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jmi9Z/yVG5/jrOFk4p++rdUCOcsSmb9G7wJwSCrHkNYxf7hogmBJJdVjnnhBi5Vq5yospc7wEEZw2FRBRBS7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:01:29.698245Z","bundle_sha256":"c45a3749e7a08a899db0e4505f15bc96a033203196caf9f5265f2b1d8e25b26d"}}