{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LV5MVWND6VN6E3IGYVNNPCLIFP","short_pith_number":"pith:LV5MVWND","schema_version":"1.0","canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","source":{"kind":"arxiv","id":"0810.1234","version":1},"attestation_state":"computed","paper":{"title":"On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ali ParandehGheibi, Asuman Ozdaglar, Atilla Eryilmaz, Muriel Medard","submitted_at":"2008-10-07T16:29:10Z","abstract_excerpt":"We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information theoretic capacity region of the multiple-access channel. Our policies does not require queue-length information. We consider several different scenarios. First, we address the utility maximization problem in a nonfading channel to obtain the optimal operating rates, and present an iterative gradient projection algorithm that uses approximate projection. "},"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":"0810.1234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T16:29:10Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"e13154bd8adb7f39b709ab5e9dda2052b6989ad339f46d4f5c4006bc363ab2c1","abstract_canon_sha256":"10e1a68b8770dcc0ccebe8f09aa2ba3358edde59e98cf036e0f556f752ce0854"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.649546Z","signature_b64":"75Y1xoXRe4rE+QKn6GnZPZbMTjcYDjBPlhTFJC0JjSuQ+pi2zGM88bu0d9HRFwU8K3gJyE4s4MIf7LMmvi7EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","last_reissued_at":"2026-05-18T00:59:11.649058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.649058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ali ParandehGheibi, Asuman Ozdaglar, Atilla Eryilmaz, Muriel Medard","submitted_at":"2008-10-07T16:29:10Z","abstract_excerpt":"We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information theoretic capacity region of the multiple-access channel. Our policies does not require queue-length information. We consider several different scenarios. First, we address the utility maximization problem in a nonfading channel to obtain the optimal operating rates, and present an iterative gradient projection algorithm that uses approximate projection. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1234","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":"0810.1234","created_at":"2026-05-18T00:59:11.649134+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.1234v1","created_at":"2026-05-18T00:59:11.649134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1234","created_at":"2026-05-18T00:59:11.649134+00:00"},{"alias_kind":"pith_short_12","alias_value":"LV5MVWND6VN6","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"LV5MVWND6VN6E3IG","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"LV5MVWND","created_at":"2026-05-18T12:25:57.157939+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/LV5MVWND6VN6E3IGYVNNPCLIFP","json":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP.json","graph_json":"https://pith.science/api/pith-number/LV5MVWND6VN6E3IGYVNNPCLIFP/graph.json","events_json":"https://pith.science/api/pith-number/LV5MVWND6VN6E3IGYVNNPCLIFP/events.json","paper":"https://pith.science/paper/LV5MVWND"},"agent_actions":{"view_html":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP","download_json":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP.json","view_paper":"https://pith.science/paper/LV5MVWND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.1234&json=true","fetch_graph":"https://pith.science/api/pith-number/LV5MVWND6VN6E3IGYVNNPCLIFP/graph.json","fetch_events":"https://pith.science/api/pith-number/LV5MVWND6VN6E3IGYVNNPCLIFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/action/storage_attestation","attest_author":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/action/author_attestation","sign_citation":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/action/citation_signature","submit_replication":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/action/replication_record"}},"created_at":"2026-05-18T00:59:11.649134+00:00","updated_at":"2026-05-18T00:59:11.649134+00:00"}