{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DX4VGOGW2EWOKDG73JDGTBJA4F","short_pith_number":"pith:DX4VGOGW","schema_version":"1.0","canonical_sha256":"1df95338d6d12ce50cdfda46698520e1525ffc6f725704c6bcc0ae71b4d0a4b0","source":{"kind":"arxiv","id":"1605.05137","version":1},"attestation_state":"computed","paper":{"title":"User Scheduling and Optimal Power Allocation for Full-Duplex Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"George C. Alexandropoulos, Italo Atzeni, Marios Kountouris","submitted_at":"2016-05-17T12:43:56Z","abstract_excerpt":"The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we propose low complexity user scheduling algorithms aiming at maximizing the sum rate of the considered FD system. Second, we derive the optimal power allocation for the two communication links, which is then exploited to introduce efficient metrics for FD/HD mode switching in the scheduling procedure, in order to further boost the system rate performance. We analy"},"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":"1605.05137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T12:43:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"759e71ce60964b957a189371ed3a707fc6aaf645b0361ea3c48e6f86772ff6a9","abstract_canon_sha256":"49032457aeb747f89150c6860eabb783cb0048251291d9ba09328d3096b3ef85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.377299Z","signature_b64":"55FS/S70WTxa87azwLqx/pn3feFBMVutYS89M8k48awhEToHQPro8CYZWW/uOdhRR9+X+av6xLJUTiQboIfYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df95338d6d12ce50cdfda46698520e1525ffc6f725704c6bcc0ae71b4d0a4b0","last_reissued_at":"2026-05-18T00:58:09.376785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.376785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Scheduling and Optimal Power Allocation for Full-Duplex Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"George C. Alexandropoulos, Italo Atzeni, Marios Kountouris","submitted_at":"2016-05-17T12:43:56Z","abstract_excerpt":"The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we propose low complexity user scheduling algorithms aiming at maximizing the sum rate of the considered FD system. Second, we derive the optimal power allocation for the two communication links, which is then exploited to introduce efficient metrics for FD/HD mode switching in the scheduling procedure, in order to further boost the system rate performance. We analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05137","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":"1605.05137","created_at":"2026-05-18T00:58:09.376864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05137v1","created_at":"2026-05-18T00:58:09.376864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05137","created_at":"2026-05-18T00:58:09.376864+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX4VGOGW2EWO","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX4VGOGW2EWOKDG7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX4VGOGW","created_at":"2026-05-18T12:30:12.583610+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/DX4VGOGW2EWOKDG73JDGTBJA4F","json":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F.json","graph_json":"https://pith.science/api/pith-number/DX4VGOGW2EWOKDG73JDGTBJA4F/graph.json","events_json":"https://pith.science/api/pith-number/DX4VGOGW2EWOKDG73JDGTBJA4F/events.json","paper":"https://pith.science/paper/DX4VGOGW"},"agent_actions":{"view_html":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F","download_json":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F.json","view_paper":"https://pith.science/paper/DX4VGOGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05137&json=true","fetch_graph":"https://pith.science/api/pith-number/DX4VGOGW2EWOKDG73JDGTBJA4F/graph.json","fetch_events":"https://pith.science/api/pith-number/DX4VGOGW2EWOKDG73JDGTBJA4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F/action/storage_attestation","attest_author":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F/action/author_attestation","sign_citation":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F/action/citation_signature","submit_replication":"https://pith.science/pith/DX4VGOGW2EWOKDG73JDGTBJA4F/action/replication_record"}},"created_at":"2026-05-18T00:58:09.376864+00:00","updated_at":"2026-05-18T00:58:09.376864+00:00"}