{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ACJRUF6F24ALHYZVJZ6PVB75WB","short_pith_number":"pith:ACJRUF6F","canonical_record":{"source":{"id":"2101.09790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-24T20:21:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58fffa3705dd95069a190a031e96c25a9a6f7f71487ceb0d8c4bf14404362782","abstract_canon_sha256":"26c5aaa7fff2508a4f3bec4de7debeb430d809b72f23966ea1eb928398982529"},"schema_version":"1.0"},"canonical_sha256":"00931a17c5d700b3e3354e7cfa87fdb05237051c74ee4daa0180818e93e6eb80","source":{"kind":"arxiv","id":"2101.09790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.09790","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"2101.09790v2","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09790","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"ACJRUF6F24AL","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"pith_short_16","alias_value":"ACJRUF6F24ALHYZV","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"pith_short_8","alias_value":"ACJRUF6F","created_at":"2026-07-05T02:38:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ACJRUF6F24ALHYZVJZ6PVB75WB","target":"record","payload":{"canonical_record":{"source":{"id":"2101.09790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-24T20:21:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58fffa3705dd95069a190a031e96c25a9a6f7f71487ceb0d8c4bf14404362782","abstract_canon_sha256":"26c5aaa7fff2508a4f3bec4de7debeb430d809b72f23966ea1eb928398982529"},"schema_version":"1.0"},"canonical_sha256":"00931a17c5d700b3e3354e7cfa87fdb05237051c74ee4daa0180818e93e6eb80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:17.248225Z","signature_b64":"Ym5dWf/5fmehSoepEprl0Oi8nOda6SrQT42hWrapTlgkyeN5tbGucAI/5H4FKkbXtiukSYSavmRQH+/sPlcVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00931a17c5d700b3e3354e7cfa87fdb05237051c74ee4daa0180818e93e6eb80","last_reissued_at":"2026-07-05T02:38:17.247723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:17.247723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.09790","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-07-05T02:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWQVVFUxleAHWMw3GpD2Ndrpdto8jW4dw+oRnpNfwVZBOY8N8VK9zic9G5PPAnCVw4bel0UibCB9g8bfhfFfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T17:15:10.615301Z"},"content_sha256":"e004210b6d51629ddf665502b1fc68f80c1632cdb7069c9dba354e525ca33ab9","schema_version":"1.0","event_id":"sha256:e004210b6d51629ddf665502b1fc68f80c1632cdb7069c9dba354e525ca33ab9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ACJRUF6F24ALHYZVJZ6PVB75WB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Bottleneck for an Oblivious Relay with Channel State Information: the Vector Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Hao Xu, Shlomo Shamai (Shitz), Tianyu Yang","submitted_at":"2021-01-24T20:21:25Z","abstract_excerpt":"This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel. Due to the bottleneck constraint, it is impossible for the oblivious relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we provide an upper bound by assuming that the destination node can get the perfect CSI at no cost and two achievable schemes with simple symbol-by-symbol relay processing and compression. Numerical results show that the lower bounds obtained by the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09790","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.09790/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqUqI6icRxzfqbnVI7IUlHHcPiZvdhSN5KYkjGhLV1YX9vC+de9mfJd3kc9c46CrWatCMu9+a7l+JYlrqwZJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T17:15:10.616145Z"},"content_sha256":"d22aa7d7dd2c6881e2cae906d0a3b593ef8419ff7770d35b1aac718a2d2ddaeb","schema_version":"1.0","event_id":"sha256:d22aa7d7dd2c6881e2cae906d0a3b593ef8419ff7770d35b1aac718a2d2ddaeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACJRUF6F24ALHYZVJZ6PVB75WB/bundle.json","state_url":"https://pith.science/pith/ACJRUF6F24ALHYZVJZ6PVB75WB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACJRUF6F24ALHYZVJZ6PVB75WB/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-07-31T17:15:10Z","links":{"resolver":"https://pith.science/pith/ACJRUF6F24ALHYZVJZ6PVB75WB","bundle":"https://pith.science/pith/ACJRUF6F24ALHYZVJZ6PVB75WB/bundle.json","state":"https://pith.science/pith/ACJRUF6F24ALHYZVJZ6PVB75WB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACJRUF6F24ALHYZVJZ6PVB75WB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ACJRUF6F24ALHYZVJZ6PVB75WB","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":"26c5aaa7fff2508a4f3bec4de7debeb430d809b72f23966ea1eb928398982529","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-24T20:21:25Z","title_canon_sha256":"58fffa3705dd95069a190a031e96c25a9a6f7f71487ceb0d8c4bf14404362782"},"schema_version":"1.0","source":{"id":"2101.09790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.09790","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"2101.09790v2","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09790","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"ACJRUF6F24AL","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"pith_short_16","alias_value":"ACJRUF6F24ALHYZV","created_at":"2026-07-05T02:38:17Z"},{"alias_kind":"pith_short_8","alias_value":"ACJRUF6F","created_at":"2026-07-05T02:38:17Z"}],"graph_snapshots":[{"event_id":"sha256:d22aa7d7dd2c6881e2cae906d0a3b593ef8419ff7770d35b1aac718a2d2ddaeb","target":"graph","created_at":"2026-07-05T02:38:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.09790/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel. Due to the bottleneck constraint, it is impossible for the oblivious relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we provide an upper bound by assuming that the destination node can get the perfect CSI at no cost and two achievable schemes with simple symbol-by-symbol relay processing and compression. Numerical results show that the lower bounds obtained by the proposed ","authors_text":"Giuseppe Caire, Hao Xu, Shlomo Shamai (Shitz), Tianyu Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-24T20:21:25Z","title":"Information Bottleneck for an Oblivious Relay with Channel State Information: the Vector Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09790","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:e004210b6d51629ddf665502b1fc68f80c1632cdb7069c9dba354e525ca33ab9","target":"record","created_at":"2026-07-05T02:38:17Z","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":"26c5aaa7fff2508a4f3bec4de7debeb430d809b72f23966ea1eb928398982529","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-24T20:21:25Z","title_canon_sha256":"58fffa3705dd95069a190a031e96c25a9a6f7f71487ceb0d8c4bf14404362782"},"schema_version":"1.0","source":{"id":"2101.09790","kind":"arxiv","version":2}},"canonical_sha256":"00931a17c5d700b3e3354e7cfa87fdb05237051c74ee4daa0180818e93e6eb80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00931a17c5d700b3e3354e7cfa87fdb05237051c74ee4daa0180818e93e6eb80","first_computed_at":"2026-07-05T02:38:17.247723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:38:17.247723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ym5dWf/5fmehSoepEprl0Oi8nOda6SrQT42hWrapTlgkyeN5tbGucAI/5H4FKkbXtiukSYSavmRQH+/sPlcVAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:38:17.248225Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.09790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e004210b6d51629ddf665502b1fc68f80c1632cdb7069c9dba354e525ca33ab9","sha256:d22aa7d7dd2c6881e2cae906d0a3b593ef8419ff7770d35b1aac718a2d2ddaeb"],"state_sha256":"9b4489c0595346e9167afa3402ab5789ed41f853271da4287528e40b62d584f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69dXPy4Bz6xXbCYGnHoSWZWpXcn8MY4en21lySo/CyyoZD4Fdl3UXbcrEQf91MUTw53b9PzS/CUQPJEC7rmkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T17:15:10.625156Z","bundle_sha256":"02b74aad1136a8fa367c205d1cb49456f2aea755cefbc8a2ca9e476dfc6c545c"}}