{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FPH7ZVKSHDPVXWSIXAJ6ZNP3XU","short_pith_number":"pith:FPH7ZVKS","canonical_record":{"source":{"id":"1212.3654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T03:51:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68f3086cbe2d93281f3a2588a5f74daa4b349372bf749eb4ed9b6fc596b9d0c8","abstract_canon_sha256":"9131126c74fe50de7d2117e65a8eefa8a48124158f51bf26258d38bbf438126c"},"schema_version":"1.0"},"canonical_sha256":"2bcffcd55238df5bda48b813ecb5fbbd07780cccd2399a3f9681c5d21db13e0b","source":{"kind":"arxiv","id":"1212.3654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3654","created_at":"2026-05-18T01:52:37Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3654v1","created_at":"2026-05-18T01:52:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3654","created_at":"2026-05-18T01:52:37Z"},{"alias_kind":"pith_short_12","alias_value":"FPH7ZVKSHDPV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FPH7ZVKSHDPVXWSI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FPH7ZVKS","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FPH7ZVKSHDPVXWSIXAJ6ZNP3XU","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T03:51:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68f3086cbe2d93281f3a2588a5f74daa4b349372bf749eb4ed9b6fc596b9d0c8","abstract_canon_sha256":"9131126c74fe50de7d2117e65a8eefa8a48124158f51bf26258d38bbf438126c"},"schema_version":"1.0"},"canonical_sha256":"2bcffcd55238df5bda48b813ecb5fbbd07780cccd2399a3f9681c5d21db13e0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:52:37.960283Z","signature_b64":"lpfwGU83F/1X5k5c28VXA3clOFYet79g1XUsIaDlHlh8h8TZMjWcYZKXz29j9Pg2IXe+CXHf6gLztLi/+11HBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bcffcd55238df5bda48b813ecb5fbbd07780cccd2399a3f9681c5d21db13e0b","last_reissued_at":"2026-05-18T01:52:37.959662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:52:37.959662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3654","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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DURCphoHLGw9Tt7N4Bbjkdwr5HndCS4Lj5bGNoTeiJIW78XZcliutAp3qUhRy9FVkPTr0ntPSA3+z1pob+0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:11:05.312356Z"},"content_sha256":"910254ba052cb02ef186614ca58171cfeb37f8965e54e5d938ae7cae6547addf","schema_version":"1.0","event_id":"sha256:910254ba052cb02ef186614ca58171cfeb37f8965e54e5d938ae7cae6547addf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FPH7ZVKSHDPVXWSIXAJ6ZNP3XU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-Rate Maximization with Minimum Power Consumption for MIMO DF Two-Way Relaying: Part II - Network 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":"2012-12-15T03:51:31Z","abstract_excerpt":"In Part II of this two-part paper, a sum-rate-maximizing power allocation with minimum power consumption is found for multiple-input multiple-output (MIMO) decode-and-forward (DF) two-way relaying (TWR) in a network optimization scenario. In this scenario, the relay and the source nodes jointly optimize their power allocation strategies to achieve network optimality. Unlike the relay optimization scenario considered in part I which features low complexity but does not achieve network optimality, the network-level optimal power allocation can be achieved in the network optimization scenario at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3654","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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"in+tncfLSQqkSytK7ExrNTPY73ZZFD4x4tJN+dUUgrToLX7by+3V/wY/WdPOSo0TgO6OC1EtBAD738OHmQ2mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:11:05.313076Z"},"content_sha256":"7efce792ae48a9576121facb5f75633fc2124004831e8df840048358401c7ba6","schema_version":"1.0","event_id":"sha256:7efce792ae48a9576121facb5f75633fc2124004831e8df840048358401c7ba6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU/bundle.json","state_url":"https://pith.science/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU/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-09T06:11:05Z","links":{"resolver":"https://pith.science/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU","bundle":"https://pith.science/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU/bundle.json","state":"https://pith.science/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPH7ZVKSHDPVXWSIXAJ6ZNP3XU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FPH7ZVKSHDPVXWSIXAJ6ZNP3XU","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":"9131126c74fe50de7d2117e65a8eefa8a48124158f51bf26258d38bbf438126c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T03:51:31Z","title_canon_sha256":"68f3086cbe2d93281f3a2588a5f74daa4b349372bf749eb4ed9b6fc596b9d0c8"},"schema_version":"1.0","source":{"id":"1212.3654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3654","created_at":"2026-05-18T01:52:37Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3654v1","created_at":"2026-05-18T01:52:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3654","created_at":"2026-05-18T01:52:37Z"},{"alias_kind":"pith_short_12","alias_value":"FPH7ZVKSHDPV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FPH7ZVKSHDPVXWSI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FPH7ZVKS","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:7efce792ae48a9576121facb5f75633fc2124004831e8df840048358401c7ba6","target":"graph","created_at":"2026-05-18T01:52:37Z","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":"In Part II of this two-part paper, a sum-rate-maximizing power allocation with minimum power consumption is found for multiple-input multiple-output (MIMO) decode-and-forward (DF) two-way relaying (TWR) in a network optimization scenario. In this scenario, the relay and the source nodes jointly optimize their power allocation strategies to achieve network optimality. Unlike the relay optimization scenario considered in part I which features low complexity but does not achieve network optimality, the network-level optimal power allocation can be achieved in the network optimization scenario at ","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":"2012-12-15T03:51:31Z","title":"Sum-Rate Maximization with Minimum Power Consumption for MIMO DF Two-Way Relaying: Part II - Network Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3654","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:910254ba052cb02ef186614ca58171cfeb37f8965e54e5d938ae7cae6547addf","target":"record","created_at":"2026-05-18T01:52:37Z","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":"9131126c74fe50de7d2117e65a8eefa8a48124158f51bf26258d38bbf438126c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T03:51:31Z","title_canon_sha256":"68f3086cbe2d93281f3a2588a5f74daa4b349372bf749eb4ed9b6fc596b9d0c8"},"schema_version":"1.0","source":{"id":"1212.3654","kind":"arxiv","version":1}},"canonical_sha256":"2bcffcd55238df5bda48b813ecb5fbbd07780cccd2399a3f9681c5d21db13e0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bcffcd55238df5bda48b813ecb5fbbd07780cccd2399a3f9681c5d21db13e0b","first_computed_at":"2026-05-18T01:52:37.959662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:52:37.959662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lpfwGU83F/1X5k5c28VXA3clOFYet79g1XUsIaDlHlh8h8TZMjWcYZKXz29j9Pg2IXe+CXHf6gLztLi/+11HBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:52:37.960283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:910254ba052cb02ef186614ca58171cfeb37f8965e54e5d938ae7cae6547addf","sha256:7efce792ae48a9576121facb5f75633fc2124004831e8df840048358401c7ba6"],"state_sha256":"2b2a5ac38121439acb6ccf2acdea4e6f4e0297855815211f76568e9e71565fea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMttsQDcN80XMYQldXqZgetmNZKPRlnnJvZfYy9grsYeFkHzXFpSk6Gfjf3sgvtIpIBAuxa2k14yQzkXRWRmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:11:05.316975Z","bundle_sha256":"c2aa67086f1e849718dbd1df41aaf2bb3f3cdeef3537a1ad624c4c529ccd1bea"}}