{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RWHPPZPBVUWJ5TJCY4DINIGCEE","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":"df27a97ae4075840a4e0035c52365b2ce36983a448b9422f70defb50b2679def","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T03:29:36Z","title_canon_sha256":"693c68d911b3656b690362540c54723c9debeb5157c737dfe1fd61b02334a43a"},"schema_version":"1.0","source":{"id":"1609.03258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03258","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03258v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03258","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"RWHPPZPBVUWJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWHPPZPBVUWJ5TJC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWHPPZPB","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:bb55c100bd74db17db639e6d7ac4e5d65e01773cec02f6219e6539da9641a97f","target":"graph","created_at":"2026-05-18T01:04:47Z","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 investigate resource allocation for multicarrier communication systems employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. We study the joint power and subcarrier allocation design for the maximization of the weighted sum throughput of the system. The algorithm design is formulated as a mixed combinatorial non-convex optimization problem and obtaining the globally optimal solution may require prohibitively high computational complexity. Therefore, a low computational complexity suboptimal iterative algorithm exploiti","authors_text":"Derrick Wing Kwan Ng, Robert Schober, Yan Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T03:29:36Z","title":"Joint Power and Subcarrier Allocation for Multicarrier Full-Duplex Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03258","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:43eba59b3e1f7828e73f0bfd498d90d4f591fc593837eb8dddc186c81d2840fc","target":"record","created_at":"2026-05-18T01:04:47Z","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":"df27a97ae4075840a4e0035c52365b2ce36983a448b9422f70defb50b2679def","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T03:29:36Z","title_canon_sha256":"693c68d911b3656b690362540c54723c9debeb5157c737dfe1fd61b02334a43a"},"schema_version":"1.0","source":{"id":"1609.03258","kind":"arxiv","version":1}},"canonical_sha256":"8d8ef7e5e1ad2c9ecd22c70686a0c22118449c975402876e2cb857684602e2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d8ef7e5e1ad2c9ecd22c70686a0c22118449c975402876e2cb857684602e2a4","first_computed_at":"2026-05-18T01:04:47.363562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:47.363562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4kphTGg6WU8hUa3HWxAeNqeCl5pa2a27SfkLgNwloLmfMFG+/9h2nQrBR58nIIijsZ78Jq/6KAlAN4O+JjXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:47.364063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43eba59b3e1f7828e73f0bfd498d90d4f591fc593837eb8dddc186c81d2840fc","sha256:bb55c100bd74db17db639e6d7ac4e5d65e01773cec02f6219e6539da9641a97f"],"state_sha256":"021c1db2475c74307e0349a49323e3807bc2cf6a6dfbabfc614f33dda5d6750a"}