{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VRMDH64E2XAZYO6VVOE3LPSWIU","short_pith_number":"pith:VRMDH64E","schema_version":"1.0","canonical_sha256":"ac5833fb84d5c19c3bd5ab89b5be5645071ec7de7aa10967ec9bf97ba1520433","source":{"kind":"arxiv","id":"cs/0611053","version":1},"attestation_state":"computed","paper":{"title":"Capacity of a Class of Deterministic Relay Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Thomas M. Cover, Young-Han Kim","submitted_at":"2006-11-13T22:47:56Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0611053","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-11-13T22:47:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"219e363922cb5854da2303ba0187a259977745bf725fb0397180d90294d90777","abstract_canon_sha256":"3ed80db375a2c92661f5b1d1c04c3cdeb8a7583f739e4acbaf1b911902d946d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.981262Z","signature_b64":"6935uGaQzwpHTMH820Yk+WqazRvlIgBnHR84cmG7fuM855a7vq9jlh5H4CLjzJxspxTe7a+sUK/WD0yyTPq9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5833fb84d5c19c3bd5ab89b5be5645071ec7de7aa10967ec9bf97ba1520433","last_reissued_at":"2026-05-18T00:57:44.980628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.980628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of a Class of Deterministic Relay Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Thomas M. Cover, Young-Han Kim","submitted_at":"2006-11-13T22:47:56Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611053","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611053","created_at":"2026-05-18T00:57:44.980712+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0611053v1","created_at":"2026-05-18T00:57:44.980712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611053","created_at":"2026-05-18T00:57:44.980712+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRMDH64E2XAZ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRMDH64E2XAZYO6V","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRMDH64E","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU","json":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU.json","graph_json":"https://pith.science/api/pith-number/VRMDH64E2XAZYO6VVOE3LPSWIU/graph.json","events_json":"https://pith.science/api/pith-number/VRMDH64E2XAZYO6VVOE3LPSWIU/events.json","paper":"https://pith.science/paper/VRMDH64E"},"agent_actions":{"view_html":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU","download_json":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU.json","view_paper":"https://pith.science/paper/VRMDH64E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0611053&json=true","fetch_graph":"https://pith.science/api/pith-number/VRMDH64E2XAZYO6VVOE3LPSWIU/graph.json","fetch_events":"https://pith.science/api/pith-number/VRMDH64E2XAZYO6VVOE3LPSWIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU/action/storage_attestation","attest_author":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU/action/author_attestation","sign_citation":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU/action/citation_signature","submit_replication":"https://pith.science/pith/VRMDH64E2XAZYO6VVOE3LPSWIU/action/replication_record"}},"created_at":"2026-05-18T00:57:44.980712+00:00","updated_at":"2026-05-18T00:57:44.980712+00:00"}