{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NUSSHFGDE3TWHTO5SYHJLISQAM","short_pith_number":"pith:NUSSHFGD","schema_version":"1.0","canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","source":{"kind":"arxiv","id":"1101.4211","version":4},"attestation_state":"computed","paper":{"title":"Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information","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, Changhee Joo, Ness B. Shroff","submitted_at":"2011-01-21T19:32:49Z","abstract_excerpt":"In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous "},"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":"1101.4211","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-21T19:32:49Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"c4135c62c6abab52a060a4268f9bd76050955bdca7d5f872c06e449ef7d9ddd8","abstract_canon_sha256":"133a0f674437de0cf550db22619cab8dd1826b7229ababab1a01986899d866c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:43.835942Z","signature_b64":"kTtvgYCL831EuMhg1TxKi8OyKmT3h9OKXGsAGGxbQcIPjN0Q6+mfRqybUksP1n0Qydf/YuLkWv5OD1Vg0R4VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","last_reissued_at":"2026-05-18T03:53:43.835488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:43.835488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information","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, Changhee Joo, Ness B. Shroff","submitted_at":"2011-01-21T19:32:49Z","abstract_excerpt":"In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4211","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":"1101.4211","created_at":"2026-05-18T03:53:43.835544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4211v4","created_at":"2026-05-18T03:53:43.835544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4211","created_at":"2026-05-18T03:53:43.835544+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUSSHFGDE3TW","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUSSHFGDE3TWHTO5","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUSSHFGD","created_at":"2026-05-18T12:26:37.096874+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/NUSSHFGDE3TWHTO5SYHJLISQAM","json":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM.json","graph_json":"https://pith.science/api/pith-number/NUSSHFGDE3TWHTO5SYHJLISQAM/graph.json","events_json":"https://pith.science/api/pith-number/NUSSHFGDE3TWHTO5SYHJLISQAM/events.json","paper":"https://pith.science/paper/NUSSHFGD"},"agent_actions":{"view_html":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM","download_json":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM.json","view_paper":"https://pith.science/paper/NUSSHFGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4211&json=true","fetch_graph":"https://pith.science/api/pith-number/NUSSHFGDE3TWHTO5SYHJLISQAM/graph.json","fetch_events":"https://pith.science/api/pith-number/NUSSHFGDE3TWHTO5SYHJLISQAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/action/storage_attestation","attest_author":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/action/author_attestation","sign_citation":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/action/citation_signature","submit_replication":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/action/replication_record"}},"created_at":"2026-05-18T03:53:43.835544+00:00","updated_at":"2026-05-18T03:53:43.835544+00:00"}