{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O65J5MYY5OISZI42IG4LCJWEOP","short_pith_number":"pith:O65J5MYY","canonical_record":{"source":{"id":"1811.11303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T23:07:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aed16b5498b873aa357c46309b4edbe617c8c4ffd082db471384f8166c21615a","abstract_canon_sha256":"2ba8d34f6c0e4cda4c2e0ad53de219f756f5067ab8fdad7a9e4ef6c1f1d5b03e"},"schema_version":"1.0"},"canonical_sha256":"77ba9eb318eb912ca39a41b8b126c473fd3a6f3e32479b45df8dd222c4b63db7","source":{"kind":"arxiv","id":"1811.11303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11303","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11303v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11303","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"O65J5MYY5OIS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O65J5MYY5OISZI42","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O65J5MYY","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O65J5MYY5OISZI42IG4LCJWEOP","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T23:07:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aed16b5498b873aa357c46309b4edbe617c8c4ffd082db471384f8166c21615a","abstract_canon_sha256":"2ba8d34f6c0e4cda4c2e0ad53de219f756f5067ab8fdad7a9e4ef6c1f1d5b03e"},"schema_version":"1.0"},"canonical_sha256":"77ba9eb318eb912ca39a41b8b126c473fd3a6f3e32479b45df8dd222c4b63db7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.232003Z","signature_b64":"o4qLRF/5HGM/kWjG4rX0TCG16xNVl1WeX81riduWSivKzE0roIGRTxVj2b6Ck/1FORCBhbdIlOlmKSeSPGldCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ba9eb318eb912ca39a41b8b126c473fd3a6f3e32479b45df8dd222c4b63db7","last_reissued_at":"2026-05-17T23:59:44.231391Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.231391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11303","source_version":1,"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-17T23:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSxwMdozv9UkyySmqAKiWFMSF3NfskOn9hTDBbQfirVfseJDEFPzGOaoZGSIpmlZfWRB5yOjGTgBWgKnUCivBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:27:35.922899Z"},"content_sha256":"596377bf7c7d4b42a7cdf5dcae73f2b11eb10d5c04ec1ccb42203162c04e8a53","schema_version":"1.0","event_id":"sha256:596377bf7c7d4b42a7cdf5dcae73f2b11eb10d5c04ec1ccb42203162c04e8a53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O65J5MYY5OISZI42IG4LCJWEOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Jingbo Liu","submitted_at":"2018-11-27T23:07:43Z","abstract_excerpt":"The primitive relay channel, introduced by Cover in 1987, is the simplest single-source single-destination network model that captures some of the most essential features and challenges of relaying in wireless networks. Recently, Wu and Ozgur developed upper bounds on the capacity of this channel that are tighter than the cutset bound. In this paper, we recover, generalize and improve their upper bounds with simpler proofs that rely on a converse technique recently introduced by Liu, van Handel and Verd\\'u that builds on reverse hypercontractivity. To our knowledge, this is the first applicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11303","kind":"arxiv","version":1},"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-17T23:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kvq7FJMq/UsEXY2eVHRmCbib05D7y4Hvw7vnQvKGA6sE3//K6cm2Za1HHyVGxwhyX9JXcCGQL65u/ZV4l1auAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:27:35.923245Z"},"content_sha256":"7d4a0100537a8f698b865b4abf1893467f88d088f1ff43fed9df0ff324276d1b","schema_version":"1.0","event_id":"sha256:7d4a0100537a8f698b865b4abf1893467f88d088f1ff43fed9df0ff324276d1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O65J5MYY5OISZI42IG4LCJWEOP/bundle.json","state_url":"https://pith.science/pith/O65J5MYY5OISZI42IG4LCJWEOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O65J5MYY5OISZI42IG4LCJWEOP/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-28T03:27:35Z","links":{"resolver":"https://pith.science/pith/O65J5MYY5OISZI42IG4LCJWEOP","bundle":"https://pith.science/pith/O65J5MYY5OISZI42IG4LCJWEOP/bundle.json","state":"https://pith.science/pith/O65J5MYY5OISZI42IG4LCJWEOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O65J5MYY5OISZI42IG4LCJWEOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O65J5MYY5OISZI42IG4LCJWEOP","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":"2ba8d34f6c0e4cda4c2e0ad53de219f756f5067ab8fdad7a9e4ef6c1f1d5b03e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T23:07:43Z","title_canon_sha256":"aed16b5498b873aa357c46309b4edbe617c8c4ffd082db471384f8166c21615a"},"schema_version":"1.0","source":{"id":"1811.11303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11303","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11303v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11303","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"O65J5MYY5OIS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O65J5MYY5OISZI42","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O65J5MYY","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:7d4a0100537a8f698b865b4abf1893467f88d088f1ff43fed9df0ff324276d1b","target":"graph","created_at":"2026-05-17T23:59:44Z","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":"The primitive relay channel, introduced by Cover in 1987, is the simplest single-source single-destination network model that captures some of the most essential features and challenges of relaying in wireless networks. Recently, Wu and Ozgur developed upper bounds on the capacity of this channel that are tighter than the cutset bound. In this paper, we recover, generalize and improve their upper bounds with simpler proofs that rely on a converse technique recently introduced by Liu, van Handel and Verd\\'u that builds on reverse hypercontractivity. To our knowledge, this is the first applicati","authors_text":"Ayfer Ozgur, Jingbo Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T23:07:43Z","title":"Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11303","kind":"arxiv","version":1},"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:596377bf7c7d4b42a7cdf5dcae73f2b11eb10d5c04ec1ccb42203162c04e8a53","target":"record","created_at":"2026-05-17T23:59:44Z","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":"2ba8d34f6c0e4cda4c2e0ad53de219f756f5067ab8fdad7a9e4ef6c1f1d5b03e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T23:07:43Z","title_canon_sha256":"aed16b5498b873aa357c46309b4edbe617c8c4ffd082db471384f8166c21615a"},"schema_version":"1.0","source":{"id":"1811.11303","kind":"arxiv","version":1}},"canonical_sha256":"77ba9eb318eb912ca39a41b8b126c473fd3a6f3e32479b45df8dd222c4b63db7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ba9eb318eb912ca39a41b8b126c473fd3a6f3e32479b45df8dd222c4b63db7","first_computed_at":"2026-05-17T23:59:44.231391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:44.231391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o4qLRF/5HGM/kWjG4rX0TCG16xNVl1WeX81riduWSivKzE0roIGRTxVj2b6Ck/1FORCBhbdIlOlmKSeSPGldCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:44.232003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596377bf7c7d4b42a7cdf5dcae73f2b11eb10d5c04ec1ccb42203162c04e8a53","sha256:7d4a0100537a8f698b865b4abf1893467f88d088f1ff43fed9df0ff324276d1b"],"state_sha256":"508704342e5b824b6b6289c8f80eeb1d458b9b2dce5dffa6ed35f62e7c994a13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kboWirWHcGioBHVPCkAEFu90jAArSb83b4imS3Nj/tWi5FWJzKU3Ww/iz1qGa9cR3kb2nNWlCJt0BJS9uLj8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:27:35.925212Z","bundle_sha256":"e736d53d49c353d47e2f361e5844d47ee4c447bdb668cecadfe9c6b1bedec364"}}