{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H6QMCFJNB47WUFBT5SJJB5UZOE","short_pith_number":"pith:H6QMCFJN","canonical_record":{"source":{"id":"1701.02043","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T01:11:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4934997ef79af15faf536efcff07495766ffae254bba3640061f83f8e820903","abstract_canon_sha256":"701f23b7bada1ac8ab646429e993ba73749bb66d02926d978b03c6e39ee98bb3"},"schema_version":"1.0"},"canonical_sha256":"3fa0c1152d0f3f6a1433ec9290f699711f53b5ca7b181c38a9bfa3c82b74fc71","source":{"kind":"arxiv","id":"1701.02043","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02043","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02043v4","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02043","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"H6QMCFJNB47W","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H6QMCFJNB47WUFBT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H6QMCFJN","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H6QMCFJNB47WUFBT5SJJB5UZOE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02043","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T01:11:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4934997ef79af15faf536efcff07495766ffae254bba3640061f83f8e820903","abstract_canon_sha256":"701f23b7bada1ac8ab646429e993ba73749bb66d02926d978b03c6e39ee98bb3"},"schema_version":"1.0"},"canonical_sha256":"3fa0c1152d0f3f6a1433ec9290f699711f53b5ca7b181c38a9bfa3c82b74fc71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:57.178535Z","signature_b64":"JCHtqFhLMtspZ+E5x2vVetg9kqGQdBedNFo7hdVn5Req51Qqg10iyEypJndALXQ4gwLy1dkevDfiZNKcMfANAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fa0c1152d0f3f6a1433ec9290f699711f53b5ca7b181c38a9bfa3c82b74fc71","last_reissued_at":"2026-05-18T00:03:57.177814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:57.177814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02043","source_version":4,"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-18T00:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/io3bfYqlzVuecnaoZVehWt/br2mzNPhw+6bl0eRHBYlHHtrfYKPEOUlHDjGv2KSBfuDBp/7CikIEi3I4elqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:06:39.520224Z"},"content_sha256":"edf10f574ae29c382a5770456850921b6363ebbf0cc76e40754eece110be1934","schema_version":"1.0","event_id":"sha256:edf10f574ae29c382a5770456850921b6363ebbf0cc76e40754eece110be1934"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H6QMCFJNB47WUFBT5SJJB5UZOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"\"The Capacity of the Relay Channel\": Solution to Cover's Problem in the Gaussian Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Leighton Pate Barnes, Xiugang Wu","submitted_at":"2017-01-09T01:11:12Z","abstract_excerpt":"Consider a memoryless relay channel, where the relay is connected to the destination with an isolated bit pipe of capacity $C_0$. Let $C(C_0)$ denote the capacity of this channel as a function of $C_0$. What is the critical value of $C_0$ such that $C(C_0)$ first equals $C(\\infty)$? This is a long-standing open problem posed by Cover and named \"The Capacity of the Relay Channel,\" in $Open \\ Problems \\ in \\ Communication \\ and \\ Computation$, Springer-Verlag, 1987. In this paper, we answer this question in the Gaussian case and show that $C(C_0)$ can not equal to $C(\\infty)$ unless $C_0=\\infty$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02043","kind":"arxiv","version":4},"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-18T00:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZChi+4L1NsoRYRSWWUAcTBnV7XMHtP53HMuu/qUIz78mi4tI1dmABvpeRx++ieKQBv8cJ2za1zZq0QIM8IfRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:06:39.520584Z"},"content_sha256":"60d9c690e3a2bc7651ff2e00f80555c97fbc225e9673d2883ccd6b09033e8589","schema_version":"1.0","event_id":"sha256:60d9c690e3a2bc7651ff2e00f80555c97fbc225e9673d2883ccd6b09033e8589"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6QMCFJNB47WUFBT5SJJB5UZOE/bundle.json","state_url":"https://pith.science/pith/H6QMCFJNB47WUFBT5SJJB5UZOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6QMCFJNB47WUFBT5SJJB5UZOE/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-24T13:06:39Z","links":{"resolver":"https://pith.science/pith/H6QMCFJNB47WUFBT5SJJB5UZOE","bundle":"https://pith.science/pith/H6QMCFJNB47WUFBT5SJJB5UZOE/bundle.json","state":"https://pith.science/pith/H6QMCFJNB47WUFBT5SJJB5UZOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6QMCFJNB47WUFBT5SJJB5UZOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H6QMCFJNB47WUFBT5SJJB5UZOE","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":"701f23b7bada1ac8ab646429e993ba73749bb66d02926d978b03c6e39ee98bb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T01:11:12Z","title_canon_sha256":"d4934997ef79af15faf536efcff07495766ffae254bba3640061f83f8e820903"},"schema_version":"1.0","source":{"id":"1701.02043","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02043","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02043v4","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02043","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"H6QMCFJNB47W","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H6QMCFJNB47WUFBT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H6QMCFJN","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:60d9c690e3a2bc7651ff2e00f80555c97fbc225e9673d2883ccd6b09033e8589","target":"graph","created_at":"2026-05-18T00:03:57Z","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":"Consider a memoryless relay channel, where the relay is connected to the destination with an isolated bit pipe of capacity $C_0$. Let $C(C_0)$ denote the capacity of this channel as a function of $C_0$. What is the critical value of $C_0$ such that $C(C_0)$ first equals $C(\\infty)$? This is a long-standing open problem posed by Cover and named \"The Capacity of the Relay Channel,\" in $Open \\ Problems \\ in \\ Communication \\ and \\ Computation$, Springer-Verlag, 1987. In this paper, we answer this question in the Gaussian case and show that $C(C_0)$ can not equal to $C(\\infty)$ unless $C_0=\\infty$","authors_text":"Ayfer Ozgur, Leighton Pate Barnes, Xiugang Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T01:11:12Z","title":"\"The Capacity of the Relay Channel\": Solution to Cover's Problem in the Gaussian Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02043","kind":"arxiv","version":4},"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:edf10f574ae29c382a5770456850921b6363ebbf0cc76e40754eece110be1934","target":"record","created_at":"2026-05-18T00:03:57Z","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":"701f23b7bada1ac8ab646429e993ba73749bb66d02926d978b03c6e39ee98bb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T01:11:12Z","title_canon_sha256":"d4934997ef79af15faf536efcff07495766ffae254bba3640061f83f8e820903"},"schema_version":"1.0","source":{"id":"1701.02043","kind":"arxiv","version":4}},"canonical_sha256":"3fa0c1152d0f3f6a1433ec9290f699711f53b5ca7b181c38a9bfa3c82b74fc71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fa0c1152d0f3f6a1433ec9290f699711f53b5ca7b181c38a9bfa3c82b74fc71","first_computed_at":"2026-05-18T00:03:57.177814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:57.177814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JCHtqFhLMtspZ+E5x2vVetg9kqGQdBedNFo7hdVn5Req51Qqg10iyEypJndALXQ4gwLy1dkevDfiZNKcMfANAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:57.178535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02043","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edf10f574ae29c382a5770456850921b6363ebbf0cc76e40754eece110be1934","sha256:60d9c690e3a2bc7651ff2e00f80555c97fbc225e9673d2883ccd6b09033e8589"],"state_sha256":"ae4dacfba2d260d377ed2ebd0361be444a1658df6f89897deea0d325fe2f7ee4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeirsWFs+Z3STkT86SZiQK1oZfG4whZK69mWNcRWZ50Pm7Efyzal9mZ11jBM52dzqmsJElMNqx6iRJJxxNcNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:06:39.522511Z","bundle_sha256":"f4ead8dfab453bb6d24b7219fc660ac935cb466069b6dab970788fd27ca96df9"}}