{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IVDDKTK64IKHCHJN3V4VLISURN","short_pith_number":"pith:IVDDKTK6","schema_version":"1.0","canonical_sha256":"4546354d5ee214711d2ddd7955a2548b4cedab82924b453697a87b18f21f9234","source":{"kind":"arxiv","id":"1506.06390","version":1},"attestation_state":"computed","paper":{"title":"A Waterfilling Algorithm for Multiple Access Point Connectivity with Constrained Backhaul Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed Amaar Ahmad","submitted_at":"2015-06-21T17:17:13Z","abstract_excerpt":"The 4G/5G paradigm offers User Equipment (UE) simultaneous connectivity to a plurality of wireless Access Points (APs). We consider a UE communicating with its destination through multiple uplinks operating on orthogonal wireless channels with unequal bandwidth. The APs are connected via a tree-like backhaul network with destination at the root and non-ideal link capacities. We develop a power allocation scheme that achieves a near-optimal rate without explicit knowledge of the backhaul network topology at transmitter side. The proposed algorithm waterfills a dynamic subset of uplinks using a "},"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":"1506.06390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-21T17:17:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f12d65ed99f288666cd92921fa2b9e5c11717bd9845fb296b47dc7568ce7b884","abstract_canon_sha256":"30f364f0e4444bffab343f67baf0acb2141c49176dac96ed5900c1051eae9386"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.433197Z","signature_b64":"V3+zDuGLNI5Xk8i0ruzZsi4LYJaDbMVLhOyWTMBckMJpb1QRuk4FSTcKSGf7BKD5ES5RXahZisL6jN17mfAeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4546354d5ee214711d2ddd7955a2548b4cedab82924b453697a87b18f21f9234","last_reissued_at":"2026-05-18T00:58:35.432591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.432591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Waterfilling Algorithm for Multiple Access Point Connectivity with Constrained Backhaul Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed Amaar Ahmad","submitted_at":"2015-06-21T17:17:13Z","abstract_excerpt":"The 4G/5G paradigm offers User Equipment (UE) simultaneous connectivity to a plurality of wireless Access Points (APs). We consider a UE communicating with its destination through multiple uplinks operating on orthogonal wireless channels with unequal bandwidth. The APs are connected via a tree-like backhaul network with destination at the root and non-ideal link capacities. We develop a power allocation scheme that achieves a near-optimal rate without explicit knowledge of the backhaul network topology at transmitter side. The proposed algorithm waterfills a dynamic subset of uplinks using a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06390","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":"1506.06390","created_at":"2026-05-18T00:58:35.432682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06390v1","created_at":"2026-05-18T00:58:35.432682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06390","created_at":"2026-05-18T00:58:35.432682+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVDDKTK64IKH","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVDDKTK64IKHCHJN","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVDDKTK6","created_at":"2026-05-18T12:29:25.134429+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/IVDDKTK64IKHCHJN3V4VLISURN","json":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN.json","graph_json":"https://pith.science/api/pith-number/IVDDKTK64IKHCHJN3V4VLISURN/graph.json","events_json":"https://pith.science/api/pith-number/IVDDKTK64IKHCHJN3V4VLISURN/events.json","paper":"https://pith.science/paper/IVDDKTK6"},"agent_actions":{"view_html":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN","download_json":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN.json","view_paper":"https://pith.science/paper/IVDDKTK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06390&json=true","fetch_graph":"https://pith.science/api/pith-number/IVDDKTK64IKHCHJN3V4VLISURN/graph.json","fetch_events":"https://pith.science/api/pith-number/IVDDKTK64IKHCHJN3V4VLISURN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN/action/storage_attestation","attest_author":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN/action/author_attestation","sign_citation":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN/action/citation_signature","submit_replication":"https://pith.science/pith/IVDDKTK64IKHCHJN3V4VLISURN/action/replication_record"}},"created_at":"2026-05-18T00:58:35.432682+00:00","updated_at":"2026-05-18T00:58:35.432682+00:00"}