{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RSZ4CUCFZ4P6O2KSCZHUONGBG7","short_pith_number":"pith:RSZ4CUCF","canonical_record":{"source":{"id":"1503.04030","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T11:50:41Z","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"title_canon_sha256":"e048c90e3acabbbedcc227a66e088d6363454529aa13d0dfe8831201c64de6a1","abstract_canon_sha256":"3bde754f848b9c028772b62a63f497fd65f3cc0168060c50b313927a5916a4cc"},"schema_version":"1.0"},"canonical_sha256":"8cb3c15045cf1fe76952164f4734c137f1520adfaa2a91c2b639bba2fa172984","source":{"kind":"arxiv","id":"1503.04030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04030","created_at":"2026-05-18T01:37:31Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04030v2","created_at":"2026-05-18T01:37:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04030","created_at":"2026-05-18T01:37:31Z"},{"alias_kind":"pith_short_12","alias_value":"RSZ4CUCFZ4P6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSZ4CUCFZ4P6O2KS","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSZ4CUCF","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RSZ4CUCFZ4P6O2KSCZHUONGBG7","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04030","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T11:50:41Z","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"title_canon_sha256":"e048c90e3acabbbedcc227a66e088d6363454529aa13d0dfe8831201c64de6a1","abstract_canon_sha256":"3bde754f848b9c028772b62a63f497fd65f3cc0168060c50b313927a5916a4cc"},"schema_version":"1.0"},"canonical_sha256":"8cb3c15045cf1fe76952164f4734c137f1520adfaa2a91c2b639bba2fa172984","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:31.088914Z","signature_b64":"ytdLZ5ig2+LNM8D+/giuKmSQaf40LZzWpxZaxfb1DfBTKibsb3F4HnUDak+AhHbphf0qnSg48K1Bh5B4KUwVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb3c15045cf1fe76952164f4734c137f1520adfaa2a91c2b639bba2fa172984","last_reissued_at":"2026-05-18T01:37:31.088246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:31.088246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04030","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-05-18T01:37:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxWEDI1S8/TaQiWYtiXn9DisfPZHcEyQwwMczvbdxDPBa6uLxKZLK+YwU7ZQEToHupWJbK9sSLJ2GPQVAWUPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:20:07.392955Z"},"content_sha256":"bbdf40da1b66e30446b1de7c01b8fbda0c0a51e594e49ee03fde9a2504684e65","schema_version":"1.0","event_id":"sha256:bbdf40da1b66e30446b1de7c01b8fbda0c0a51e594e49ee03fde9a2504684e65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RSZ4CUCFZ4P6O2KSCZHUONGBG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Totally Distributed Energy-Efficient Transmission in MIMO Interference Channels","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.GT","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Cunhua Pan, Hong Ren, Jiangzhou Wang, Ming Chen, Nuo Huang, Wei Xu, Wence Zhang","submitted_at":"2015-03-13T11:50:41Z","abstract_excerpt":"In this paper, we consider the problem of maximizing the energy efficiency (EE) for multi-input multi-output (MIMO) interference channels, subject to the per-link power constraint. To avoid extensive information exchange among all links, the optimization problem is formulated as a noncooperative game, where each link maximizes its own EE. We show that this game always admits a Nash equilibrium (NE) and the sufficient condition for the uniqueness of the NE is derived for the case of arbitrary channel matrices, which can be checked in practice. To reach the NE of this game, we develop a totally "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04030","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":""},"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:37:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQYcCSjIHAGvbfhMF+QOoir8A8k/Pzf18RhKW0yKf7uZnjBwc62RGg2MlvSYgZ5Hp1+HdjeHo1+UfJVDreadBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:20:07.393577Z"},"content_sha256":"4755c239fc6fb8a894213e124c9e1ab5e8e2250a428f83736a2e135673a93163","schema_version":"1.0","event_id":"sha256:4755c239fc6fb8a894213e124c9e1ab5e8e2250a428f83736a2e135673a93163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7/bundle.json","state_url":"https://pith.science/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7/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-07T17:20:07Z","links":{"resolver":"https://pith.science/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7","bundle":"https://pith.science/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7/bundle.json","state":"https://pith.science/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSZ4CUCFZ4P6O2KSCZHUONGBG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RSZ4CUCFZ4P6O2KSCZHUONGBG7","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":"3bde754f848b9c028772b62a63f497fd65f3cc0168060c50b313927a5916a4cc","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T11:50:41Z","title_canon_sha256":"e048c90e3acabbbedcc227a66e088d6363454529aa13d0dfe8831201c64de6a1"},"schema_version":"1.0","source":{"id":"1503.04030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04030","created_at":"2026-05-18T01:37:31Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04030v2","created_at":"2026-05-18T01:37:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04030","created_at":"2026-05-18T01:37:31Z"},{"alias_kind":"pith_short_12","alias_value":"RSZ4CUCFZ4P6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSZ4CUCFZ4P6O2KS","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSZ4CUCF","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:4755c239fc6fb8a894213e124c9e1ab5e8e2250a428f83736a2e135673a93163","target":"graph","created_at":"2026-05-18T01:37:31Z","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 this paper, we consider the problem of maximizing the energy efficiency (EE) for multi-input multi-output (MIMO) interference channels, subject to the per-link power constraint. To avoid extensive information exchange among all links, the optimization problem is formulated as a noncooperative game, where each link maximizes its own EE. We show that this game always admits a Nash equilibrium (NE) and the sufficient condition for the uniqueness of the NE is derived for the case of arbitrary channel matrices, which can be checked in practice. To reach the NE of this game, we develop a totally ","authors_text":"Cunhua Pan, Hong Ren, Jiangzhou Wang, Ming Chen, Nuo Huang, Wei Xu, Wence Zhang","cross_cats":["cs.GT","cs.NI","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T11:50:41Z","title":"Totally Distributed Energy-Efficient Transmission in MIMO Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04030","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:bbdf40da1b66e30446b1de7c01b8fbda0c0a51e594e49ee03fde9a2504684e65","target":"record","created_at":"2026-05-18T01:37:31Z","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":"3bde754f848b9c028772b62a63f497fd65f3cc0168060c50b313927a5916a4cc","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T11:50:41Z","title_canon_sha256":"e048c90e3acabbbedcc227a66e088d6363454529aa13d0dfe8831201c64de6a1"},"schema_version":"1.0","source":{"id":"1503.04030","kind":"arxiv","version":2}},"canonical_sha256":"8cb3c15045cf1fe76952164f4734c137f1520adfaa2a91c2b639bba2fa172984","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cb3c15045cf1fe76952164f4734c137f1520adfaa2a91c2b639bba2fa172984","first_computed_at":"2026-05-18T01:37:31.088246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:31.088246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytdLZ5ig2+LNM8D+/giuKmSQaf40LZzWpxZaxfb1DfBTKibsb3F4HnUDak+AhHbphf0qnSg48K1Bh5B4KUwVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:31.088914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbdf40da1b66e30446b1de7c01b8fbda0c0a51e594e49ee03fde9a2504684e65","sha256:4755c239fc6fb8a894213e124c9e1ab5e8e2250a428f83736a2e135673a93163"],"state_sha256":"18fa1a46f362c71bcda9a2b252d65707eb920d510c4389f4b90ea6aa9d9e250b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwoXKd/gP8P5sWkthHVTAQs9GnkMagQiWK3LxcGNhK6gU/ifEi5RSjmFnqonzNpmLLfkflFGj2piDoKPet5PCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:20:07.396632Z","bundle_sha256":"660c01fdbefc3ea53cec4e9bb7785072d18c6e989290b040f6f666f3a98ba4ea"}}