{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LDC4JTTLUON76O5AR4A6CDHYUA","short_pith_number":"pith:LDC4JTTL","canonical_record":{"source":{"id":"1602.02923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-09T10:18:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"69afabdf14127874eda786328a9801e51b1b40197194625f0f8a576667f41bd5","abstract_canon_sha256":"ee691675c4d694eaf888c6a4cb9c7b716b1458ec5311118b43dd0db4658d21c8"},"schema_version":"1.0"},"canonical_sha256":"58c5c4ce6ba39bff3ba08f01e10cf8a03e2dd85d19f5ae282cbb095cf127a368","source":{"kind":"arxiv","id":"1602.02923","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02923","created_at":"2026-05-18T00:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02923v2","created_at":"2026-05-18T00:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02923","created_at":"2026-05-18T00:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"LDC4JTTLUON7","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDC4JTTLUON76O5A","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDC4JTTL","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LDC4JTTLUON76O5AR4A6CDHYUA","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-09T10:18:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"69afabdf14127874eda786328a9801e51b1b40197194625f0f8a576667f41bd5","abstract_canon_sha256":"ee691675c4d694eaf888c6a4cb9c7b716b1458ec5311118b43dd0db4658d21c8"},"schema_version":"1.0"},"canonical_sha256":"58c5c4ce6ba39bff3ba08f01e10cf8a03e2dd85d19f5ae282cbb095cf127a368","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:50.094441Z","signature_b64":"hymxsXPXX9oGzDq8mysk+KdwUfYCJL0MS1T59x7i7UgVvBR7nmg+jA7hYzI01Wt33116gmHd69oUe+uTJwzICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c5c4ce6ba39bff3ba08f01e10cf8a03e2dd85d19f5ae282cbb095cf127a368","last_reissued_at":"2026-05-18T00:45:50.093955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:50.093955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02923","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-18T00:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bovDVYfp67OKphUhXutpiLg3TGVsSiEevdVN5hIubnPJNBFcnIfRuuXSwnuN9ut2h3J7mrmfG6YR52HoqrkRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:05:21.868298Z"},"content_sha256":"acbf4d392e52e95446c827031b972bb43a8b5ed39d841a9eee21324eb23dd228","schema_version":"1.0","event_id":"sha256:acbf4d392e52e95446c827031b972bb43a8b5ed39d841a9eee21324eb23dd228"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LDC4JTTLUON76O5AR4A6CDHYUA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Globally Optimal Energy-Efficient Power Control and Receiver Design in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Alessio Zappone, Eduard Jorswieck, Emil Bj\\\"ornson, Luca Sanguinetti","submitted_at":"2016-02-09T10:18:11Z","abstract_excerpt":"The characterization of the global maximum of energy efficiency (EE) problems in wireless networks is a challenging problem due to the non-convex nature of investigated problems in interference channels. The aim of this work is to develop a new and general framework to achieve globally optimal solutions. First, the hidden monotonic structure of the most common EE maximization problems is exploited jointly with fractional programming theory to obtain globally optimal solutions with exponential complexity in the number of network links. To overcome this issue, we also propose a framework to comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02923","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-18T00:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwpNDS0X1NBzKUIi6hhA8r3Tzh1n1LDyW1nOIdwzoZSQNtlRF6RnmEC3bmiXw2A40w648XxycliU5XDawRWiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:05:21.869014Z"},"content_sha256":"f967e3c3702f86bf50dcace06bf8787d7b603cbd345736ad1221be6d6951c996","schema_version":"1.0","event_id":"sha256:f967e3c3702f86bf50dcace06bf8787d7b603cbd345736ad1221be6d6951c996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDC4JTTLUON76O5AR4A6CDHYUA/bundle.json","state_url":"https://pith.science/pith/LDC4JTTLUON76O5AR4A6CDHYUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDC4JTTLUON76O5AR4A6CDHYUA/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-05-28T22:05:21Z","links":{"resolver":"https://pith.science/pith/LDC4JTTLUON76O5AR4A6CDHYUA","bundle":"https://pith.science/pith/LDC4JTTLUON76O5AR4A6CDHYUA/bundle.json","state":"https://pith.science/pith/LDC4JTTLUON76O5AR4A6CDHYUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDC4JTTLUON76O5AR4A6CDHYUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LDC4JTTLUON76O5AR4A6CDHYUA","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":"ee691675c4d694eaf888c6a4cb9c7b716b1458ec5311118b43dd0db4658d21c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-09T10:18:11Z","title_canon_sha256":"69afabdf14127874eda786328a9801e51b1b40197194625f0f8a576667f41bd5"},"schema_version":"1.0","source":{"id":"1602.02923","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02923","created_at":"2026-05-18T00:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02923v2","created_at":"2026-05-18T00:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02923","created_at":"2026-05-18T00:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"LDC4JTTLUON7","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDC4JTTLUON76O5A","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDC4JTTL","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:f967e3c3702f86bf50dcace06bf8787d7b603cbd345736ad1221be6d6951c996","target":"graph","created_at":"2026-05-18T00:45:50Z","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 characterization of the global maximum of energy efficiency (EE) problems in wireless networks is a challenging problem due to the non-convex nature of investigated problems in interference channels. The aim of this work is to develop a new and general framework to achieve globally optimal solutions. First, the hidden monotonic structure of the most common EE maximization problems is exploited jointly with fractional programming theory to obtain globally optimal solutions with exponential complexity in the number of network links. To overcome this issue, we also propose a framework to comp","authors_text":"Alessio Zappone, Eduard Jorswieck, Emil Bj\\\"ornson, Luca Sanguinetti","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-09T10:18:11Z","title":"Globally Optimal Energy-Efficient Power Control and Receiver Design in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02923","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:acbf4d392e52e95446c827031b972bb43a8b5ed39d841a9eee21324eb23dd228","target":"record","created_at":"2026-05-18T00:45:50Z","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":"ee691675c4d694eaf888c6a4cb9c7b716b1458ec5311118b43dd0db4658d21c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-09T10:18:11Z","title_canon_sha256":"69afabdf14127874eda786328a9801e51b1b40197194625f0f8a576667f41bd5"},"schema_version":"1.0","source":{"id":"1602.02923","kind":"arxiv","version":2}},"canonical_sha256":"58c5c4ce6ba39bff3ba08f01e10cf8a03e2dd85d19f5ae282cbb095cf127a368","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c5c4ce6ba39bff3ba08f01e10cf8a03e2dd85d19f5ae282cbb095cf127a368","first_computed_at":"2026-05-18T00:45:50.093955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:50.093955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hymxsXPXX9oGzDq8mysk+KdwUfYCJL0MS1T59x7i7UgVvBR7nmg+jA7hYzI01Wt33116gmHd69oUe+uTJwzICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:50.094441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02923","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acbf4d392e52e95446c827031b972bb43a8b5ed39d841a9eee21324eb23dd228","sha256:f967e3c3702f86bf50dcace06bf8787d7b603cbd345736ad1221be6d6951c996"],"state_sha256":"7a199b2c34bdcdff47e24f4901317c8d6094975078e75020fd5fa93dc8a075aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjhUIv2o87k4va1VnYgcPBWq3cXPDH/mpx1LnCVPnkZ7DHMuZaYS4/wjSpaWRI7psXTjsRx/8pTMKAFZ6im9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:05:21.872895Z","bundle_sha256":"a975f750dafd9e9bea308ea108d9f47b0c8fe9a4ffcb1f3725fd289cd6795fb5"}}