{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2QMBL72DQFSIIZNT5SA7TFEFVT","short_pith_number":"pith:2QMBL72D","canonical_record":{"source":{"id":"1602.08540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-27T00:56:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52587b55d89d398f1a1dbfa2ab90957f56fbb8b222f5e0cb4e877f5220b283fd","abstract_canon_sha256":"15817d6d280800d0f7fef3f32cac650c7cbe7e156e28eb1b25c664d32aa40be3"},"schema_version":"1.0"},"canonical_sha256":"d41815ff4381648465b3ec81f99485ace6e67ac82fb97dd45a0aca3b40db3c4c","source":{"kind":"arxiv","id":"1602.08540","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08540","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08540v2","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08540","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"2QMBL72DQFSI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QMBL72DQFSIIZNT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QMBL72D","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2QMBL72DQFSIIZNT5SA7TFEFVT","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-27T00:56:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52587b55d89d398f1a1dbfa2ab90957f56fbb8b222f5e0cb4e877f5220b283fd","abstract_canon_sha256":"15817d6d280800d0f7fef3f32cac650c7cbe7e156e28eb1b25c664d32aa40be3"},"schema_version":"1.0"},"canonical_sha256":"d41815ff4381648465b3ec81f99485ace6e67ac82fb97dd45a0aca3b40db3c4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:03.126966Z","signature_b64":"Kyrpi9gEYRDzltR6cmoETq4sadDc4d58dgV/v9LDfVyVZPF+CCl5wWwxQ6g10/KUFAXFRaT3S3ix4fivB+5TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d41815ff4381648465b3ec81f99485ace6e67ac82fb97dd45a0aca3b40db3c4c","last_reissued_at":"2026-05-18T01:18:03.126259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:03.126259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08540","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-18T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nub1MeokTCD9jUkwrNW/FUdy/snRM57jnI74b+a3dQHyY5wD3NUlsyIUKREv+dh4fw0iGIe9kPVL4dxmfw9zBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:02:23.935269Z"},"content_sha256":"be450f64ebf6f351adf8c19a6235fd873cca76dfd1e78c2300725fa8921ceab4","schema_version":"1.0","event_id":"sha256:be450f64ebf6f351adf8c19a6235fd873cca76dfd1e78c2300725fa8921ceab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2QMBL72DQFSIIZNT5SA7TFEFVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Liang-Liang Xie, Xiugang Wu","submitted_at":"2016-02-27T00:56:06Z","abstract_excerpt":"We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free digital link of rate $R_0$, while $Y$ and $Z$ are conditionally independent and identically distributed given $X$. We develop two new upper bounds on the capacity of this channel that are tighter than existing bounds, including the celebrated cut-set bound. Our approach significantly deviates from the standard information-theoretic approach for proving upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08540","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-18T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WWZnDBeNAbVDTyPOkeFyCWZrBRYMJWor1wIs8y+dgM10HFYIOCBktta/LW6QgMJyRjuIHGArv2PNFMSSG3N2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:02:23.935647Z"},"content_sha256":"d002c55adc6490cada9918a880bf7fc756431de6ca6fa426a03eea5285403a14","schema_version":"1.0","event_id":"sha256:d002c55adc6490cada9918a880bf7fc756431de6ca6fa426a03eea5285403a14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QMBL72DQFSIIZNT5SA7TFEFVT/bundle.json","state_url":"https://pith.science/pith/2QMBL72DQFSIIZNT5SA7TFEFVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QMBL72DQFSIIZNT5SA7TFEFVT/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-28T09:02:23Z","links":{"resolver":"https://pith.science/pith/2QMBL72DQFSIIZNT5SA7TFEFVT","bundle":"https://pith.science/pith/2QMBL72DQFSIIZNT5SA7TFEFVT/bundle.json","state":"https://pith.science/pith/2QMBL72DQFSIIZNT5SA7TFEFVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QMBL72DQFSIIZNT5SA7TFEFVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2QMBL72DQFSIIZNT5SA7TFEFVT","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":"15817d6d280800d0f7fef3f32cac650c7cbe7e156e28eb1b25c664d32aa40be3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-27T00:56:06Z","title_canon_sha256":"52587b55d89d398f1a1dbfa2ab90957f56fbb8b222f5e0cb4e877f5220b283fd"},"schema_version":"1.0","source":{"id":"1602.08540","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08540","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08540v2","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08540","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"2QMBL72DQFSI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QMBL72DQFSIIZNT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QMBL72D","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:d002c55adc6490cada9918a880bf7fc756431de6ca6fa426a03eea5285403a14","target":"graph","created_at":"2026-05-18T01:18:03Z","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":"We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free digital link of rate $R_0$, while $Y$ and $Z$ are conditionally independent and identically distributed given $X$. We develop two new upper bounds on the capacity of this channel that are tighter than existing bounds, including the celebrated cut-set bound. Our approach significantly deviates from the standard information-theoretic approach for proving upper bound","authors_text":"Ayfer Ozgur, Liang-Liang Xie, Xiugang Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-27T00:56:06Z","title":"Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08540","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:be450f64ebf6f351adf8c19a6235fd873cca76dfd1e78c2300725fa8921ceab4","target":"record","created_at":"2026-05-18T01:18:03Z","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":"15817d6d280800d0f7fef3f32cac650c7cbe7e156e28eb1b25c664d32aa40be3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-27T00:56:06Z","title_canon_sha256":"52587b55d89d398f1a1dbfa2ab90957f56fbb8b222f5e0cb4e877f5220b283fd"},"schema_version":"1.0","source":{"id":"1602.08540","kind":"arxiv","version":2}},"canonical_sha256":"d41815ff4381648465b3ec81f99485ace6e67ac82fb97dd45a0aca3b40db3c4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d41815ff4381648465b3ec81f99485ace6e67ac82fb97dd45a0aca3b40db3c4c","first_computed_at":"2026-05-18T01:18:03.126259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:03.126259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kyrpi9gEYRDzltR6cmoETq4sadDc4d58dgV/v9LDfVyVZPF+CCl5wWwxQ6g10/KUFAXFRaT3S3ix4fivB+5TBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:03.126966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08540","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be450f64ebf6f351adf8c19a6235fd873cca76dfd1e78c2300725fa8921ceab4","sha256:d002c55adc6490cada9918a880bf7fc756431de6ca6fa426a03eea5285403a14"],"state_sha256":"a70029ede1eb5364234a57a3711eb484a010eef62b81d398a81d597e3b9ff522"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hw+acohYx9Y3w/VAI0iHGJXxmvE/Q5kYHhR6WschVg5srCch6tPRLQdv0ARP4KrYmCp455ZX6EtpOc5Zc/q2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:02:23.937587Z","bundle_sha256":"6389081c97d54f6553247a8450db54d97f2113e441214146100b955c680c8928"}}