{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WZS265UMA3JLLMAA4325GEAOZJ","short_pith_number":"pith:WZS265UM","canonical_record":{"source":{"id":"1301.1732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-09T01:31:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"efe58981a82f74961501af694eda9f69b6529f676e170f66bd74d481d20abf09","abstract_canon_sha256":"4203381c9c937f77ef67597ea4f33fd61226bc3d681faef922d09b4293548080"},"schema_version":"1.0"},"canonical_sha256":"b665af768c06d2b5b000e6f5d3100eca6400ff35db901f506572a112342330e9","source":{"kind":"arxiv","id":"1301.1732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1732","created_at":"2026-05-18T01:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1732v1","created_at":"2026-05-18T01:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1732","created_at":"2026-05-18T01:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"WZS265UMA3JL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZS265UMA3JLLMAA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZS265UM","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WZS265UMA3JLLMAA4325GEAOZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-09T01:31:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"efe58981a82f74961501af694eda9f69b6529f676e170f66bd74d481d20abf09","abstract_canon_sha256":"4203381c9c937f77ef67597ea4f33fd61226bc3d681faef922d09b4293548080"},"schema_version":"1.0"},"canonical_sha256":"b665af768c06d2b5b000e6f5d3100eca6400ff35db901f506572a112342330e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:52:14.736197Z","signature_b64":"WxXJh0cVpXxdMWqkSaS08LQUtOEWM01Hj3bcObO7tS/3IsFo+1XOid36sT5ukVJpMOmwmCRTWP6h5C0GF23kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b665af768c06d2b5b000e6f5d3100eca6400ff35db901f506572a112342330e9","last_reissued_at":"2026-05-18T01:52:14.735509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:52:14.735509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1732","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-18T01:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r06hipvpv3Vnbhb8Gy7/xFC9ZFY7+VwzGQybqzXXDJTOCZTKIfk0WbltNSAESKStI79OYN2r8yn+Sl0mg/OiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:02:06.200598Z"},"content_sha256":"d171282af64333121a7d41c15c31d3de6bb185a19f08d835039ac5c2d89e9467","schema_version":"1.0","event_id":"sha256:d171282af64333121a7d41c15c31d3de6bb185a19f08d835039ac5c2d89e9467"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WZS265UMA3JLLMAA4325GEAOZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-Rate Maximization with Minimum Power Consumption for MIMO DF Two-Way Relaying: Part I - Relay Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hai Jiang, Jianshu Zhang, Jie Gao, Martin Haardt, Sergiy A. Vorobyov","submitted_at":"2013-01-09T01:31:39Z","abstract_excerpt":"The problem of power allocation is studied for a multiple-input multiple-output (MIMO) decode-and-forward (DF) two-way relaying system consisting of two source nodes and one relay. It is shown that achieving maximum sum-rate in such a system does not necessarily demand the consumption of all available power at the relay. Instead, the maximum sum-rate can be achieved through efficient power allocation with minimum power consumption. Deriving such power allocation, however, is nontrivial due to the fact that it generally leads to a nonconvex problem. In Part I of this two-part paper, a sum-rate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1732","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-18T01:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Hq9rK1yZc2vh5ec8p+e2D36TyO3KbIe5qT2XOq1rMvGV6GqlDtxCWLOF5A/mhv1qY4RuJep17jSJwMovqlzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:02:06.201277Z"},"content_sha256":"bc541a808892f188710e2e9a2e9fa65a91d44fcd3fca471cf3a3bbb4443197a7","schema_version":"1.0","event_id":"sha256:bc541a808892f188710e2e9a2e9fa65a91d44fcd3fca471cf3a3bbb4443197a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZS265UMA3JLLMAA4325GEAOZJ/bundle.json","state_url":"https://pith.science/pith/WZS265UMA3JLLMAA4325GEAOZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZS265UMA3JLLMAA4325GEAOZJ/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-09T16:02:06Z","links":{"resolver":"https://pith.science/pith/WZS265UMA3JLLMAA4325GEAOZJ","bundle":"https://pith.science/pith/WZS265UMA3JLLMAA4325GEAOZJ/bundle.json","state":"https://pith.science/pith/WZS265UMA3JLLMAA4325GEAOZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZS265UMA3JLLMAA4325GEAOZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WZS265UMA3JLLMAA4325GEAOZJ","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":"4203381c9c937f77ef67597ea4f33fd61226bc3d681faef922d09b4293548080","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-09T01:31:39Z","title_canon_sha256":"efe58981a82f74961501af694eda9f69b6529f676e170f66bd74d481d20abf09"},"schema_version":"1.0","source":{"id":"1301.1732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1732","created_at":"2026-05-18T01:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1732v1","created_at":"2026-05-18T01:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1732","created_at":"2026-05-18T01:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"WZS265UMA3JL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZS265UMA3JLLMAA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZS265UM","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:bc541a808892f188710e2e9a2e9fa65a91d44fcd3fca471cf3a3bbb4443197a7","target":"graph","created_at":"2026-05-18T01:52:14Z","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 problem of power allocation is studied for a multiple-input multiple-output (MIMO) decode-and-forward (DF) two-way relaying system consisting of two source nodes and one relay. It is shown that achieving maximum sum-rate in such a system does not necessarily demand the consumption of all available power at the relay. Instead, the maximum sum-rate can be achieved through efficient power allocation with minimum power consumption. Deriving such power allocation, however, is nontrivial due to the fact that it generally leads to a nonconvex problem. In Part I of this two-part paper, a sum-rate ","authors_text":"Hai Jiang, Jianshu Zhang, Jie Gao, Martin Haardt, Sergiy A. Vorobyov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-09T01:31:39Z","title":"Sum-Rate Maximization with Minimum Power Consumption for MIMO DF Two-Way Relaying: Part I - Relay Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1732","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:d171282af64333121a7d41c15c31d3de6bb185a19f08d835039ac5c2d89e9467","target":"record","created_at":"2026-05-18T01:52:14Z","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":"4203381c9c937f77ef67597ea4f33fd61226bc3d681faef922d09b4293548080","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-09T01:31:39Z","title_canon_sha256":"efe58981a82f74961501af694eda9f69b6529f676e170f66bd74d481d20abf09"},"schema_version":"1.0","source":{"id":"1301.1732","kind":"arxiv","version":1}},"canonical_sha256":"b665af768c06d2b5b000e6f5d3100eca6400ff35db901f506572a112342330e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b665af768c06d2b5b000e6f5d3100eca6400ff35db901f506572a112342330e9","first_computed_at":"2026-05-18T01:52:14.735509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:52:14.735509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WxXJh0cVpXxdMWqkSaS08LQUtOEWM01Hj3bcObO7tS/3IsFo+1XOid36sT5ukVJpMOmwmCRTWP6h5C0GF23kBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:52:14.736197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d171282af64333121a7d41c15c31d3de6bb185a19f08d835039ac5c2d89e9467","sha256:bc541a808892f188710e2e9a2e9fa65a91d44fcd3fca471cf3a3bbb4443197a7"],"state_sha256":"440572ae3c2f7882aafed6fdb25e158c7c800448446f4ceb9250311348500768"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CKW1mSqhLDVkB0z3ekTcawY9tqcm6Gbwupo62Z9dwLigeyZh1H9YlWORdZDnRnPKM9ikVkEaQUr3hZL2ZngCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:02:06.205248Z","bundle_sha256":"5412560db2454f7389fb970a02c74853f83774953cc13d76016e4999acddf3e4"}}