{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6ARTE3EQ55RHG767NVAZ7VKNN2","short_pith_number":"pith:6ARTE3EQ","schema_version":"1.0","canonical_sha256":"f023326c90ef62737fdf6d419fd54d6eb77572926923d79bab75e731abdbdba9","source":{"kind":"arxiv","id":"1310.4583","version":1},"attestation_state":"computed","paper":{"title":"Low complexity resource allocation for load minimization in OFDMA wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Moretti, Weidong Wang, Wenxiang Dong, Ying Yang","submitted_at":"2013-10-17T04:55:44Z","abstract_excerpt":"To cope with the ever increasing demand for bandwidth, future wireless networks will be designed with reuse distance equal to one. This scenario requires the implementation of techniques able to manage the strong multiple access interference each cell generates towards its neighbor cells. In particular, low complexity and reduced feedback are important requirements for practical algorithms. In this paper we study an allocation problem for OFDMA networks formulated with the objective of minimizing the load of each cell in the system subject to the constraint that each user meets its target rate"},"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":"1310.4583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-17T04:55:44Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f22faac3d4eafadcfff2829c30c9672d8668cd8b564f679789e2d7078d5e95b6","abstract_canon_sha256":"33e145fe78fde9a06d16c553caad821b4d22f6a4170c68e6dd3aadaca8d2258a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.655554Z","signature_b64":"9pJk+Naz/IQRjmzCtYLEDdjBY7x7x/GY0+Q0+wgTGPvK5qV2UlPhn24YHDW7THCjfTgD6zm02oZQ/oq4wcUFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f023326c90ef62737fdf6d419fd54d6eb77572926923d79bab75e731abdbdba9","last_reissued_at":"2026-05-18T03:10:13.655097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.655097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low complexity resource allocation for load minimization in OFDMA wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Moretti, Weidong Wang, Wenxiang Dong, Ying Yang","submitted_at":"2013-10-17T04:55:44Z","abstract_excerpt":"To cope with the ever increasing demand for bandwidth, future wireless networks will be designed with reuse distance equal to one. This scenario requires the implementation of techniques able to manage the strong multiple access interference each cell generates towards its neighbor cells. In particular, low complexity and reduced feedback are important requirements for practical algorithms. In this paper we study an allocation problem for OFDMA networks formulated with the objective of minimizing the load of each cell in the system subject to the constraint that each user meets its target rate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4583","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":"1310.4583","created_at":"2026-05-18T03:10:13.655167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4583v1","created_at":"2026-05-18T03:10:13.655167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4583","created_at":"2026-05-18T03:10:13.655167+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ARTE3EQ55RH","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ARTE3EQ55RHG767","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ARTE3EQ","created_at":"2026-05-18T12:27:36.564083+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/6ARTE3EQ55RHG767NVAZ7VKNN2","json":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2.json","graph_json":"https://pith.science/api/pith-number/6ARTE3EQ55RHG767NVAZ7VKNN2/graph.json","events_json":"https://pith.science/api/pith-number/6ARTE3EQ55RHG767NVAZ7VKNN2/events.json","paper":"https://pith.science/paper/6ARTE3EQ"},"agent_actions":{"view_html":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2","download_json":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2.json","view_paper":"https://pith.science/paper/6ARTE3EQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4583&json=true","fetch_graph":"https://pith.science/api/pith-number/6ARTE3EQ55RHG767NVAZ7VKNN2/graph.json","fetch_events":"https://pith.science/api/pith-number/6ARTE3EQ55RHG767NVAZ7VKNN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2/action/storage_attestation","attest_author":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2/action/author_attestation","sign_citation":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2/action/citation_signature","submit_replication":"https://pith.science/pith/6ARTE3EQ55RHG767NVAZ7VKNN2/action/replication_record"}},"created_at":"2026-05-18T03:10:13.655167+00:00","updated_at":"2026-05-18T03:10:13.655167+00:00"}