{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WMF73L4LWPQOLAFR63WRNDBOXJ","short_pith_number":"pith:WMF73L4L","schema_version":"1.0","canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","source":{"kind":"arxiv","id":"1009.4954","version":2},"attestation_state":"computed","paper":{"title":"Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongyue Xue, Eylem Ekici","submitted_at":"2010-09-24T22:07:49Z","abstract_excerpt":"In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput \"epsilon-close\" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to solve a joint congestion control, routing, and scheduling problem in a multi-hop wireless network while satisfying per-flow average end-to-end delay guarantees and minimum data rate requirements. This problem has been solved for both backlogged as well as arbitrary arrival rate systems. Moreover, we discuss the design of a class of low-complexity suboptimal algo"},"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":"1009.4954","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-24T22:07:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00a6f60a1f24c52e75fe0c0a3621b951f822edfbed72f55e03152d63cc0dc092","abstract_canon_sha256":"cc22ea23d9a42e1e58eb583519ac77c7259d6e21b2c54560bdb3f60735f40300"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:59.520088Z","signature_b64":"wlFGxte5FGxv8pwtBIIDvlCtDeChXYh35E/EG25dXyqjKKYvRcKJu11tslm+DRT0kbbBFxFG+MFQEj4nsYafCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","last_reissued_at":"2026-05-18T04:30:59.519307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:59.519307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongyue Xue, Eylem Ekici","submitted_at":"2010-09-24T22:07:49Z","abstract_excerpt":"In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput \"epsilon-close\" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to solve a joint congestion control, routing, and scheduling problem in a multi-hop wireless network while satisfying per-flow average end-to-end delay guarantees and minimum data rate requirements. This problem has been solved for both backlogged as well as arbitrary arrival rate systems. Moreover, we discuss the design of a class of low-complexity suboptimal algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4954","kind":"arxiv","version":2},"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":"1009.4954","created_at":"2026-05-18T04:30:59.519447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4954v2","created_at":"2026-05-18T04:30:59.519447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4954","created_at":"2026-05-18T04:30:59.519447+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMF73L4LWPQO","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMF73L4LWPQOLAFR","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMF73L4L","created_at":"2026-05-18T12:26:15.391820+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/WMF73L4LWPQOLAFR63WRNDBOXJ","json":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ.json","graph_json":"https://pith.science/api/pith-number/WMF73L4LWPQOLAFR63WRNDBOXJ/graph.json","events_json":"https://pith.science/api/pith-number/WMF73L4LWPQOLAFR63WRNDBOXJ/events.json","paper":"https://pith.science/paper/WMF73L4L"},"agent_actions":{"view_html":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ","download_json":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ.json","view_paper":"https://pith.science/paper/WMF73L4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4954&json=true","fetch_graph":"https://pith.science/api/pith-number/WMF73L4LWPQOLAFR63WRNDBOXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WMF73L4LWPQOLAFR63WRNDBOXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/action/storage_attestation","attest_author":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/action/author_attestation","sign_citation":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/action/citation_signature","submit_replication":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/action/replication_record"}},"created_at":"2026-05-18T04:30:59.519447+00:00","updated_at":"2026-05-18T04:30:59.519447+00:00"}