{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:E57KV6RSLK7OIJCIVLG5FGFDWE","short_pith_number":"pith:E57KV6RS","schema_version":"1.0","canonical_sha256":"277eaafa325abee42448aacdd298a3b13dc018c590667e256c4a995b85b8f3c8","source":{"kind":"arxiv","id":"1003.2883","version":2},"attestation_state":"computed","paper":{"title":"Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nassar Ksairi, Pascal Bianchi, Philippe Ciblat","submitted_at":"2010-03-15T10:36:53Z","abstract_excerpt":"In this paper, we propose a resource allocation algorithm for the downlink of sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical Channel State Information (CSI) and fractional frequency reuse. The proposed algorithm can be implemented in a distributed fashion without the need to any central controlling units. Its performance is analyzed assuming fast fading Rayleigh channels and Gaussian distributed multicell interference. We show that the transmit power of this simple algorithm tends, as the number of users grows to infinity, to the same limit as the minimal power r"},"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":"1003.2883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-15T10:36:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92e9a3560c53dd4b7649caa8e1481df86e26359648f75bfec7b75e0cd11d5fee","abstract_canon_sha256":"15fe930333116e98e42e06bf7782ce07acc5a82c65434712e2d0ee141d2707eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.642388Z","signature_b64":"K/7BlYeFKwbaQEOeep5YL0a1Ym6DrkWNeHvSv78UFZOAb2s6S4xkdXIOFcs2GIqOgm77RWMCPfWmeGiLNDe/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"277eaafa325abee42448aacdd298a3b13dc018c590667e256c4a995b85b8f3c8","last_reissued_at":"2026-05-18T00:58:47.641714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.641714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nassar Ksairi, Pascal Bianchi, Philippe Ciblat","submitted_at":"2010-03-15T10:36:53Z","abstract_excerpt":"In this paper, we propose a resource allocation algorithm for the downlink of sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical Channel State Information (CSI) and fractional frequency reuse. The proposed algorithm can be implemented in a distributed fashion without the need to any central controlling units. Its performance is analyzed assuming fast fading Rayleigh channels and Gaussian distributed multicell interference. We show that the transmit power of this simple algorithm tends, as the number of users grows to infinity, to the same limit as the minimal power r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.2883","kind":"arxiv","version":2},"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":"1003.2883","created_at":"2026-05-18T00:58:47.641806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.2883v2","created_at":"2026-05-18T00:58:47.641806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.2883","created_at":"2026-05-18T00:58:47.641806+00:00"},{"alias_kind":"pith_short_12","alias_value":"E57KV6RSLK7O","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"E57KV6RSLK7OIJCI","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"E57KV6RS","created_at":"2026-05-18T12:26:06.534383+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/E57KV6RSLK7OIJCIVLG5FGFDWE","json":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE.json","graph_json":"https://pith.science/api/pith-number/E57KV6RSLK7OIJCIVLG5FGFDWE/graph.json","events_json":"https://pith.science/api/pith-number/E57KV6RSLK7OIJCIVLG5FGFDWE/events.json","paper":"https://pith.science/paper/E57KV6RS"},"agent_actions":{"view_html":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE","download_json":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE.json","view_paper":"https://pith.science/paper/E57KV6RS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.2883&json=true","fetch_graph":"https://pith.science/api/pith-number/E57KV6RSLK7OIJCIVLG5FGFDWE/graph.json","fetch_events":"https://pith.science/api/pith-number/E57KV6RSLK7OIJCIVLG5FGFDWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE/action/storage_attestation","attest_author":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE/action/author_attestation","sign_citation":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE/action/citation_signature","submit_replication":"https://pith.science/pith/E57KV6RSLK7OIJCIVLG5FGFDWE/action/replication_record"}},"created_at":"2026-05-18T00:58:47.641806+00:00","updated_at":"2026-05-18T00:58:47.641806+00:00"}