{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:VRMDH64E2XAZYO6VVOE3LPSWIU","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":"3ed80db375a2c92661f5b1d1c04c3cdeb8a7583f739e4acbaf1b911902d946d3","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-11-13T22:47:56Z","title_canon_sha256":"219e363922cb5854da2303ba0187a259977745bf725fb0397180d90294d90777"},"schema_version":"1.0","source":{"id":"cs/0611053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611053","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0611053v1","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611053","created_at":"2026-05-18T00:57:44Z"},{"alias_kind":"pith_short_12","alias_value":"VRMDH64E2XAZ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VRMDH64E2XAZYO6V","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VRMDH64E","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:2d08bafeef792c8416c38bf9c0c9f01568aaa4ea8845c6abfbb2b2df0234c586","target":"graph","created_at":"2026-05-18T00:57: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 capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y_1 = f(X, Y), and a separate communication link from the relay to the receiver with capacity R_0, is shown to be\n  C(R_0) = \\max_{p(x)} \\min \\{I(X;Y)+R_0, I(X;Y, Y_1) \\}.\n  Thus every bit from the relay is worth exactly one bit to the receiver. Two alternative coding schemes are presented that achieve this capacity. The first scheme, ``hash-and-forward'', is based on a simple yet novel use of random binning on the space of relay outputs, while the second scheme uses th","authors_text":"Thomas M. Cover, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-11-13T22:47:56Z","title":"Capacity of a Class of Deterministic Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611053","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:6324edf3d21d27e15afede4dd0ed002f0491a3d34ee33162b6fb18383ca8a9c9","target":"record","created_at":"2026-05-18T00:57: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":"3ed80db375a2c92661f5b1d1c04c3cdeb8a7583f739e4acbaf1b911902d946d3","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-11-13T22:47:56Z","title_canon_sha256":"219e363922cb5854da2303ba0187a259977745bf725fb0397180d90294d90777"},"schema_version":"1.0","source":{"id":"cs/0611053","kind":"arxiv","version":1}},"canonical_sha256":"ac5833fb84d5c19c3bd5ab89b5be5645071ec7de7aa10967ec9bf97ba1520433","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac5833fb84d5c19c3bd5ab89b5be5645071ec7de7aa10967ec9bf97ba1520433","first_computed_at":"2026-05-18T00:57:44.980628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:44.980628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6935uGaQzwpHTMH820Yk+WqazRvlIgBnHR84cmG7fuM855a7vq9jlh5H4CLjzJxspxTe7a+sUK/WD0yyTPq9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:44.981262Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0611053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6324edf3d21d27e15afede4dd0ed002f0491a3d34ee33162b6fb18383ca8a9c9","sha256:2d08bafeef792c8416c38bf9c0c9f01568aaa4ea8845c6abfbb2b2df0234c586"],"state_sha256":"c37667d61ba9978a077848688c46b7adc9088b2a9110c9b00ed58b58acd1d5e8"}