{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M5W5PFCQXNRL3QNKM5P2FYW3J6","short_pith_number":"pith:M5W5PFCQ","schema_version":"1.0","canonical_sha256":"676dd79450bb62bdc1aa675fa2e2db4f9d81cdc8bcf2f1f36085da3bcbbf636b","source":{"kind":"arxiv","id":"1212.1638","version":4},"attestation_state":"computed","paper":{"title":"Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Bo Ji, Gagan R. Gupta, Manu Sharma, Ness B. Shroff, Xiaojun Lin","submitted_at":"2012-12-07T16:05:42Z","abstract_excerpt":"In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a class of $O(n^{2.5} \\log n)$-complexity hybrid scheduling policies are recently developed to guarantee both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in the general non-asymptotic setting), the"},"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":"1212.1638","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-07T16:05:42Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"c679dd345efba51ed0f9af543517cef1a207e8a5e8763b6dd0291f7a9af98904","abstract_canon_sha256":"9a4cd1c9b23592892e79f61cb95f28e52913401a60445e658932b876866b6e54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:49.990176Z","signature_b64":"H82q8BF6wqP/WPr1JEAsAsgqwVst4IBMSJqzAstzC8t4LHAlkhpr1Xq+pNy/wbrEsmBAQyfHbxXIPHAuUx5YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676dd79450bb62bdc1aa675fa2e2db4f9d81cdc8bcf2f1f36085da3bcbbf636b","last_reissued_at":"2026-05-18T02:55:49.989408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:49.989408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Bo Ji, Gagan R. Gupta, Manu Sharma, Ness B. Shroff, Xiaojun Lin","submitted_at":"2012-12-07T16:05:42Z","abstract_excerpt":"In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a class of $O(n^{2.5} \\log n)$-complexity hybrid scheduling policies are recently developed to guarantee both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in the general non-asymptotic setting), the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1638","kind":"arxiv","version":4},"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":"1212.1638","created_at":"2026-05-18T02:55:49.989541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1638v4","created_at":"2026-05-18T02:55:49.989541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1638","created_at":"2026-05-18T02:55:49.989541+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5W5PFCQXNRL","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5W5PFCQXNRL3QNK","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5W5PFCQ","created_at":"2026-05-18T12:27:14.488303+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/M5W5PFCQXNRL3QNKM5P2FYW3J6","json":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6.json","graph_json":"https://pith.science/api/pith-number/M5W5PFCQXNRL3QNKM5P2FYW3J6/graph.json","events_json":"https://pith.science/api/pith-number/M5W5PFCQXNRL3QNKM5P2FYW3J6/events.json","paper":"https://pith.science/paper/M5W5PFCQ"},"agent_actions":{"view_html":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6","download_json":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6.json","view_paper":"https://pith.science/paper/M5W5PFCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1638&json=true","fetch_graph":"https://pith.science/api/pith-number/M5W5PFCQXNRL3QNKM5P2FYW3J6/graph.json","fetch_events":"https://pith.science/api/pith-number/M5W5PFCQXNRL3QNKM5P2FYW3J6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6/action/storage_attestation","attest_author":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6/action/author_attestation","sign_citation":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6/action/citation_signature","submit_replication":"https://pith.science/pith/M5W5PFCQXNRL3QNKM5P2FYW3J6/action/replication_record"}},"created_at":"2026-05-18T02:55:49.989541+00:00","updated_at":"2026-05-18T02:55:49.989541+00:00"}