{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DSGSRGF7DRWVPACF3HUOPYWDNU","short_pith_number":"pith:DSGSRGF7","schema_version":"1.0","canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","source":{"kind":"arxiv","id":"1111.2160","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with Proportional Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"J. B. Helonde, Rajesh Pande, S. S. Pathak, Sudhir B. Lande","submitted_at":"2011-11-09T10:23:42Z","abstract_excerpt":"This paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI) and quality state information (QSI). A suboptimal approach that separately performs subcarrier allocation and bit loading is proposed. It is shown that a near optimal solution is obtained by the proposed algorithm which has low complexity compared to that of other conventional algorithm. We will study the problem of finding an optimal sub-carrier and pow"},"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":"1111.2160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-09T10:23:42Z","cross_cats_sorted":[],"title_canon_sha256":"49ad766e987f818c2986acac84f944b64c0c187cf5f37a908a7df678d31ceeef","abstract_canon_sha256":"7e94e5b7586f4f06796e6a718899cb833becd92948775ee28efa004026bf0853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:44.003825Z","signature_b64":"3rh/AB3lERmohxWKd6iDe70VB4J5iYvdwE1DC78C2P3tV+6aNCRd0Rw+0SoEoKJ1WXD2c+x+mBmyzhI1a7aqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8d2898bf1c6d578045d9e8e7e2c36d2aef6032ec8eadee828078e9414b251a","last_reissued_at":"2026-05-18T04:08:44.003411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:44.003411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with Proportional Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"J. B. Helonde, Rajesh Pande, S. S. Pathak, Sudhir B. Lande","submitted_at":"2011-11-09T10:23:42Z","abstract_excerpt":"This paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI) and quality state information (QSI). A suboptimal approach that separately performs subcarrier allocation and bit loading is proposed. It is shown that a near optimal solution is obtained by the proposed algorithm which has low complexity compared to that of other conventional algorithm. We will study the problem of finding an optimal sub-carrier and pow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2160","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":"1111.2160","created_at":"2026-05-18T04:08:44.003468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2160v1","created_at":"2026-05-18T04:08:44.003468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2160","created_at":"2026-05-18T04:08:44.003468+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSGSRGF7DRWV","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSGSRGF7DRWVPACF","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSGSRGF7","created_at":"2026-05-18T12:26:26.731475+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/DSGSRGF7DRWVPACF3HUOPYWDNU","json":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU.json","graph_json":"https://pith.science/api/pith-number/DSGSRGF7DRWVPACF3HUOPYWDNU/graph.json","events_json":"https://pith.science/api/pith-number/DSGSRGF7DRWVPACF3HUOPYWDNU/events.json","paper":"https://pith.science/paper/DSGSRGF7"},"agent_actions":{"view_html":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU","download_json":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU.json","view_paper":"https://pith.science/paper/DSGSRGF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2160&json=true","fetch_graph":"https://pith.science/api/pith-number/DSGSRGF7DRWVPACF3HUOPYWDNU/graph.json","fetch_events":"https://pith.science/api/pith-number/DSGSRGF7DRWVPACF3HUOPYWDNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/action/storage_attestation","attest_author":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/action/author_attestation","sign_citation":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/action/citation_signature","submit_replication":"https://pith.science/pith/DSGSRGF7DRWVPACF3HUOPYWDNU/action/replication_record"}},"created_at":"2026-05-18T04:08:44.003468+00:00","updated_at":"2026-05-18T04:08:44.003468+00:00"}