{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UYXAOWNVDJDWAR2NIF6EW7ZKOZ","short_pith_number":"pith:UYXAOWNV","schema_version":"1.0","canonical_sha256":"a62e0759b51a4760474d417c4b7f2a76662c4bcc57846a814e74e202bfe59b01","source":{"kind":"arxiv","id":"1802.09591","version":1},"attestation_state":"computed","paper":{"title":"A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multi-Carrier Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alessio Zappone, Marco Lops, Salvatore D'Oro, Sergio Palazzo","submitted_at":"2018-02-26T20:28:02Z","abstract_excerpt":"This paper proposes computationally efficient algorithms to maximize the energy efficiency in multi-carrier wireless interference networks, by a suitable allocation of the system radio resources, namely the transmit powers and subcarrier assignment. The problem is formulated as the maximization of the system Global Energy-Efficiency subject to both maximum power and minimum rate constraints. This leads to a challenging non-convex fractional problem, which is tackled through an interplay of fractional programming, learning, and game theory. The proposed algorithmic framework is provably converg"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.09591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-26T20:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"7a33825315dd1196a00e895d4a5515290ecd6d883ac3ddbbfcc676b70520e7ed","abstract_canon_sha256":"29f73a38dccd06bc831bda357946118bff9d9c7217da9fd6b2c038fb42f37590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.817380Z","signature_b64":"oyRp0tAKdjbNh7NXqIIZtOa68yVklv47Wq4siGsdHr2yu462MPF0RzFRoRiLoznYF3B7QSbd3JXMw5xiej1LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a62e0759b51a4760474d417c4b7f2a76662c4bcc57846a814e74e202bfe59b01","last_reissued_at":"2026-05-18T00:22:11.816861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.816861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multi-Carrier Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alessio Zappone, Marco Lops, Salvatore D'Oro, Sergio Palazzo","submitted_at":"2018-02-26T20:28:02Z","abstract_excerpt":"This paper proposes computationally efficient algorithms to maximize the energy efficiency in multi-carrier wireless interference networks, by a suitable allocation of the system radio resources, namely the transmit powers and subcarrier assignment. The problem is formulated as the maximization of the system Global Energy-Efficiency subject to both maximum power and minimum rate constraints. This leads to a challenging non-convex fractional problem, which is tackled through an interplay of fractional programming, learning, and game theory. The proposed algorithmic framework is provably converg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09591","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.09591","created_at":"2026-05-18T00:22:11.816949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09591v1","created_at":"2026-05-18T00:22:11.816949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09591","created_at":"2026-05-18T00:22:11.816949+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYXAOWNVDJDW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYXAOWNVDJDWAR2N","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYXAOWNV","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ","json":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ.json","graph_json":"https://pith.science/api/pith-number/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/graph.json","events_json":"https://pith.science/api/pith-number/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/events.json","paper":"https://pith.science/paper/UYXAOWNV"},"agent_actions":{"view_html":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ","download_json":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ.json","view_paper":"https://pith.science/paper/UYXAOWNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09591&json=true","fetch_graph":"https://pith.science/api/pith-number/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/action/storage_attestation","attest_author":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/action/author_attestation","sign_citation":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/action/citation_signature","submit_replication":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/action/replication_record"}},"created_at":"2026-05-18T00:22:11.816949+00:00","updated_at":"2026-05-18T00:22:11.816949+00:00"}