{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2F26BM7LJR7OAHBDP7YPFPQFZ7","short_pith_number":"pith:2F26BM7L","schema_version":"1.0","canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","source":{"kind":"arxiv","id":"1107.1038","version":1},"attestation_state":"computed","paper":{"title":"Dynamic OFDMA Resource Allocation for QoS Guarantee and System Optimization of Best Effort and Non Real-time Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arijit Ukil, Debasish Bera, Jaydip Sen","submitted_at":"2011-07-06T06:54:55Z","abstract_excerpt":"To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a dynamic resource allocation scheme in Orthogonal Frequency Division Multiple Access (OFDMA) systems to optimize the non real-time (NRT) traffic, which requires allocation of minimum quantum of data within a predefined time that does not incur packet loss. Most existing and proposed works on resource allocation schemes focused on traffic consisting of delay cons"},"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":"1107.1038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-06T06:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"de86008babe712509834c84ac066d2f8472c041febb1cf3b1839bf5da510ab8e","abstract_canon_sha256":"1e1ad472118bf4c6ce352f12b316292ceb3bcd295580f68812b25ff865fb9bef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:45.758995Z","signature_b64":"/jKnENZ2q27ENtWcDbD6edwtLvOJJdVTyi4s7ixjMY1XoAX7riW84ByrEaFkrIyW043E6xBklGqhYarWf7E4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","last_reissued_at":"2026-05-18T04:18:45.758537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:45.758537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic OFDMA Resource Allocation for QoS Guarantee and System Optimization of Best Effort and Non Real-time Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arijit Ukil, Debasish Bera, Jaydip Sen","submitted_at":"2011-07-06T06:54:55Z","abstract_excerpt":"To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a dynamic resource allocation scheme in Orthogonal Frequency Division Multiple Access (OFDMA) systems to optimize the non real-time (NRT) traffic, which requires allocation of minimum quantum of data within a predefined time that does not incur packet loss. Most existing and proposed works on resource allocation schemes focused on traffic consisting of delay cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1038","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":"1107.1038","created_at":"2026-05-18T04:18:45.758606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1038v1","created_at":"2026-05-18T04:18:45.758606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1038","created_at":"2026-05-18T04:18:45.758606+00:00"},{"alias_kind":"pith_short_12","alias_value":"2F26BM7LJR7O","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2F26BM7LJR7OAHBD","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2F26BM7L","created_at":"2026-05-18T12:26:18.847500+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/2F26BM7LJR7OAHBDP7YPFPQFZ7","json":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7.json","graph_json":"https://pith.science/api/pith-number/2F26BM7LJR7OAHBDP7YPFPQFZ7/graph.json","events_json":"https://pith.science/api/pith-number/2F26BM7LJR7OAHBDP7YPFPQFZ7/events.json","paper":"https://pith.science/paper/2F26BM7L"},"agent_actions":{"view_html":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7","download_json":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7.json","view_paper":"https://pith.science/paper/2F26BM7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1038&json=true","fetch_graph":"https://pith.science/api/pith-number/2F26BM7LJR7OAHBDP7YPFPQFZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/2F26BM7LJR7OAHBDP7YPFPQFZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/action/storage_attestation","attest_author":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/action/author_attestation","sign_citation":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/action/citation_signature","submit_replication":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/action/replication_record"}},"created_at":"2026-05-18T04:18:45.758606+00:00","updated_at":"2026-05-18T04:18:45.758606+00:00"}