{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4WNJX7ID75LXEKEOULE5E6JNTL","short_pith_number":"pith:4WNJX7ID","canonical_record":{"source":{"id":"1001.2938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T02:14:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"329353b5fa4345fae0c665cb32f600ccd49bc9b481a4272cf82169db2a375652","abstract_canon_sha256":"b107d30cf4c855f8e847a9a73c92419b23a5d55599217a22db875fdcdc6c9390"},"schema_version":"1.0"},"canonical_sha256":"e59a9bfd03ff5772288ea2c9d2792d9accb2dd90bbd951ac880f9a1103d0cfbd","source":{"kind":"arxiv","id":"1001.2938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2938","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2938v1","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2938","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"pith_short_12","alias_value":"4WNJX7ID75LX","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4WNJX7ID75LXEKEO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4WNJX7ID","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4WNJX7ID75LXEKEOULE5E6JNTL","target":"record","payload":{"canonical_record":{"source":{"id":"1001.2938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T02:14:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"329353b5fa4345fae0c665cb32f600ccd49bc9b481a4272cf82169db2a375652","abstract_canon_sha256":"b107d30cf4c855f8e847a9a73c92419b23a5d55599217a22db875fdcdc6c9390"},"schema_version":"1.0"},"canonical_sha256":"e59a9bfd03ff5772288ea2c9d2792d9accb2dd90bbd951ac880f9a1103d0cfbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:29.424221Z","signature_b64":"9Np8vFtfBwxZRSudqwy/jTcAQDYicoyIdNqI2v7LwzBbok/fRHpF9Clv17JU2liKae+WyetATGyAvkcoVdWIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59a9bfd03ff5772288ea2c9d2792d9accb2dd90bbd951ac880f9a1103d0cfbd","last_reissued_at":"2026-05-18T04:07:29.423580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:29.423580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.2938","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-18T04:07:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zx2M2dD/GTbGDciuPvtVEdBJ9JBzsvyVnNBYPi6HmDs8pWUX8YYR4SydIKvCb3rSWIyUgx74Kl7poO2gzycPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:58:13.139861Z"},"content_sha256":"63924f1612db6e164687dea0b4d3d520ddf80913353ceb780bd48c7fa51ff33a","schema_version":"1.0","event_id":"sha256:63924f1612db6e164687dea0b4d3d520ddf80913353ceb780bd48c7fa51ff33a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4WNJX7ID75LXEKEOULE5E6JNTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chris T. K. Ng, Gerard J. Foschini","submitted_at":"2010-01-18T02:14:04Z","abstract_excerpt":"Transmit signal and bandwidth optimization is considered in multiple-antenna relay channels. Assuming all terminals have channel state information, the cut-set capacity upper bound and decode-and-forward rate under full-duplex relaying are evaluated by formulating them as convex optimization problems. For half-duplex relays, bandwidth allocation and transmit signals are optimized jointly. Moreover, achievable rates based on the compress-and-forward transmission strategy are presented using rate-distortion and Wyner-Ziv compression schemes. It is observed that when the relay is close to the sou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2938","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-18T04:07:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"He8Y8hHNAq6MfWKw7DODh5q01X1WHPP0jmUj/0rvjy4VRpfpeayC7iF2As5JVniMBxcMknPG2k/Iv6EyOOxxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:58:13.140205Z"},"content_sha256":"4200871a8890b7cc910d210df3f7825d9757d2f625ac86d22d5bfaa130df7ee5","schema_version":"1.0","event_id":"sha256:4200871a8890b7cc910d210df3f7825d9757d2f625ac86d22d5bfaa130df7ee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WNJX7ID75LXEKEOULE5E6JNTL/bundle.json","state_url":"https://pith.science/pith/4WNJX7ID75LXEKEOULE5E6JNTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WNJX7ID75LXEKEOULE5E6JNTL/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-06-03T00:58:13Z","links":{"resolver":"https://pith.science/pith/4WNJX7ID75LXEKEOULE5E6JNTL","bundle":"https://pith.science/pith/4WNJX7ID75LXEKEOULE5E6JNTL/bundle.json","state":"https://pith.science/pith/4WNJX7ID75LXEKEOULE5E6JNTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WNJX7ID75LXEKEOULE5E6JNTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4WNJX7ID75LXEKEOULE5E6JNTL","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":"b107d30cf4c855f8e847a9a73c92419b23a5d55599217a22db875fdcdc6c9390","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T02:14:04Z","title_canon_sha256":"329353b5fa4345fae0c665cb32f600ccd49bc9b481a4272cf82169db2a375652"},"schema_version":"1.0","source":{"id":"1001.2938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2938","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2938v1","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2938","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"pith_short_12","alias_value":"4WNJX7ID75LX","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4WNJX7ID75LXEKEO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4WNJX7ID","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:4200871a8890b7cc910d210df3f7825d9757d2f625ac86d22d5bfaa130df7ee5","target":"graph","created_at":"2026-05-18T04:07:29Z","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":"Transmit signal and bandwidth optimization is considered in multiple-antenna relay channels. Assuming all terminals have channel state information, the cut-set capacity upper bound and decode-and-forward rate under full-duplex relaying are evaluated by formulating them as convex optimization problems. For half-duplex relays, bandwidth allocation and transmit signals are optimized jointly. Moreover, achievable rates based on the compress-and-forward transmission strategy are presented using rate-distortion and Wyner-Ziv compression schemes. It is observed that when the relay is close to the sou","authors_text":"Chris T. K. Ng, Gerard J. Foschini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T02:14:04Z","title":"Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2938","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:63924f1612db6e164687dea0b4d3d520ddf80913353ceb780bd48c7fa51ff33a","target":"record","created_at":"2026-05-18T04:07:29Z","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":"b107d30cf4c855f8e847a9a73c92419b23a5d55599217a22db875fdcdc6c9390","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T02:14:04Z","title_canon_sha256":"329353b5fa4345fae0c665cb32f600ccd49bc9b481a4272cf82169db2a375652"},"schema_version":"1.0","source":{"id":"1001.2938","kind":"arxiv","version":1}},"canonical_sha256":"e59a9bfd03ff5772288ea2c9d2792d9accb2dd90bbd951ac880f9a1103d0cfbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e59a9bfd03ff5772288ea2c9d2792d9accb2dd90bbd951ac880f9a1103d0cfbd","first_computed_at":"2026-05-18T04:07:29.423580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:29.423580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Np8vFtfBwxZRSudqwy/jTcAQDYicoyIdNqI2v7LwzBbok/fRHpF9Clv17JU2liKae+WyetATGyAvkcoVdWIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:29.424221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.2938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63924f1612db6e164687dea0b4d3d520ddf80913353ceb780bd48c7fa51ff33a","sha256:4200871a8890b7cc910d210df3f7825d9757d2f625ac86d22d5bfaa130df7ee5"],"state_sha256":"053cee77120ec9bceea18641e8f673e8605d17024e12a0bd0f53c4ed666e8d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H71tTe1XavchER6yQE6DUjjd2r6zdzKas2P+ZulkRhhKYjK7JiPD18zvGMdSd6GnN1yTqcpk8W6SEtdFdEPMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:58:13.142162Z","bundle_sha256":"111f4b3fdc567953a73cff1b54659256e9f79b2ffbc65679eb77f345954ce40d"}}