{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UYXAOWNVDJDWAR2NIF6EW7ZKOZ","short_pith_number":"pith:UYXAOWNV","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"},"canonical_sha256":"a62e0759b51a4760474d417c4b7f2a76662c4bcc57846a814e74e202bfe59b01","source":{"kind":"arxiv","id":"1802.09591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09591","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09591v1","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09591","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"UYXAOWNVDJDW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UYXAOWNVDJDWAR2N","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UYXAOWNV","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UYXAOWNVDJDWAR2NIF6EW7ZKOZ","target":"record","payload":{"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"},"canonical_sha256":"a62e0759b51a4760474d417c4b7f2a76662c4bcc57846a814e74e202bfe59b01","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"},"source_kind":"arxiv","source_id":"1802.09591","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-18T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rE0DWVd8oWXzPwyzokfAJfeNrUEVIO0GVAcxf+XME+Gw97RS7V/v447hAy2DSeR3T+bWloyB9UTa9kZ2huUrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:25:13.632054Z"},"content_sha256":"dccbb95bc2676bdb65a5eac053d7e211c6b125fd76ddc3b48cb4509ec82b3486","schema_version":"1.0","event_id":"sha256:dccbb95bc2676bdb65a5eac053d7e211c6b125fd76ddc3b48cb4509ec82b3486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UYXAOWNVDJDWAR2NIF6EW7ZKOZ","target":"graph","payload":{"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"},"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:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2PzZVw/sUKJu5YfUYWNoU40tRYxVODvvkeR18xenHSGkQRgPy20WKl2bWej5VaU+vRjyFMFTgq7IGtq8i+1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:25:13.632413Z"},"content_sha256":"def069b99c2968ebb7d4d46d665d165613c50ef90e7efc9c7b919f12c14a2fc3","schema_version":"1.0","event_id":"sha256:def069b99c2968ebb7d4d46d665d165613c50ef90e7efc9c7b919f12c14a2fc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/bundle.json","state_url":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/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-09T00:25:13Z","links":{"resolver":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ","bundle":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/bundle.json","state":"https://pith.science/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYXAOWNVDJDWAR2NIF6EW7ZKOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UYXAOWNVDJDWAR2NIF6EW7ZKOZ","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":"29f73a38dccd06bc831bda357946118bff9d9c7217da9fd6b2c038fb42f37590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-26T20:28:02Z","title_canon_sha256":"7a33825315dd1196a00e895d4a5515290ecd6d883ac3ddbbfcc676b70520e7ed"},"schema_version":"1.0","source":{"id":"1802.09591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09591","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09591v1","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09591","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"UYXAOWNVDJDW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UYXAOWNVDJDWAR2N","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UYXAOWNV","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:def069b99c2968ebb7d4d46d665d165613c50ef90e7efc9c7b919f12c14a2fc3","target":"graph","created_at":"2026-05-18T00:22:11Z","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":"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","authors_text":"Alessio Zappone, Marco Lops, Salvatore D'Oro, Sergio Palazzo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-26T20:28:02Z","title":"A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multi-Carrier Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09591","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:dccbb95bc2676bdb65a5eac053d7e211c6b125fd76ddc3b48cb4509ec82b3486","target":"record","created_at":"2026-05-18T00:22:11Z","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":"29f73a38dccd06bc831bda357946118bff9d9c7217da9fd6b2c038fb42f37590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-26T20:28:02Z","title_canon_sha256":"7a33825315dd1196a00e895d4a5515290ecd6d883ac3ddbbfcc676b70520e7ed"},"schema_version":"1.0","source":{"id":"1802.09591","kind":"arxiv","version":1}},"canonical_sha256":"a62e0759b51a4760474d417c4b7f2a76662c4bcc57846a814e74e202bfe59b01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a62e0759b51a4760474d417c4b7f2a76662c4bcc57846a814e74e202bfe59b01","first_computed_at":"2026-05-18T00:22:11.816861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:11.816861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oyRp0tAKdjbNh7NXqIIZtOa68yVklv47Wq4siGsdHr2yu462MPF0RzFRoRiLoznYF3B7QSbd3JXMw5xiej1LCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:11.817380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dccbb95bc2676bdb65a5eac053d7e211c6b125fd76ddc3b48cb4509ec82b3486","sha256:def069b99c2968ebb7d4d46d665d165613c50ef90e7efc9c7b919f12c14a2fc3"],"state_sha256":"5d3ab1b603dda4d96553ac12750f102695f614adc3e20d977f94db26edc6b56d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IfKyr+sjvquORnKI5wnczJly10cS/w4ckEgO+vYEA2R4Njh+pP5W6Cd6afYkOUAlgfPQUhjj5/dyPN8vh4QsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:25:13.634262Z","bundle_sha256":"a7ced978085380c6b0e8fabdae27d734c9bea7fb1ec67fa18d37bd756c057693"}}