{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QRNEBZZY3RHN5I6MDVOCJNPUWO","short_pith_number":"pith:QRNEBZZY","schema_version":"1.0","canonical_sha256":"845a40e738dc4edea3cc1d5c24b5f4b3a8f6f17cc1ebccd370b540456a267c47","source":{"kind":"arxiv","id":"1112.0539","version":1},"attestation_state":"computed","paper":{"title":"Maximal Scheduling in Wireless Networks with Priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qiao Li, Rohit Negi","submitted_at":"2011-12-02T18:46:31Z","abstract_excerpt":"We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain pre-specified static priorities. The proposed scheduling scheme is simple, which is easily amendable for distributed implementation in practice, such as using inter-frame space (IFS) parameters under the ubiquitous 802.11 protocols. To obtain throughput guarantees, we first analyze the case of maximal scheduling with a fixed priority vector, and formulate a lower bo"},"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":"1112.0539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-02T18:46:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c651cd12b0d47747b634bde81887d165869a829102cd70ab843e8a510a23751f","abstract_canon_sha256":"521fa72f31ea9a90683b3820af89ba07565f7a5e9db06ff94d495b441c1973dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:07.085458Z","signature_b64":"weG4aVCihAyZIgGO3XMpOCmiSrkhz6hccDe24C5Fk454HjyAfQ6e0csoNDa4dnULVnhITvfz1xL5uQWaPLrhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"845a40e738dc4edea3cc1d5c24b5f4b3a8f6f17cc1ebccd370b540456a267c47","last_reissued_at":"2026-05-18T04:07:07.085016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:07.085016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Scheduling in Wireless Networks with Priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qiao Li, Rohit Negi","submitted_at":"2011-12-02T18:46:31Z","abstract_excerpt":"We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain pre-specified static priorities. The proposed scheduling scheme is simple, which is easily amendable for distributed implementation in practice, such as using inter-frame space (IFS) parameters under the ubiquitous 802.11 protocols. To obtain throughput guarantees, we first analyze the case of maximal scheduling with a fixed priority vector, and formulate a lower bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0539","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":"1112.0539","created_at":"2026-05-18T04:07:07.085081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0539v1","created_at":"2026-05-18T04:07:07.085081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0539","created_at":"2026-05-18T04:07:07.085081+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRNEBZZY3RHN","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRNEBZZY3RHN5I6M","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRNEBZZY","created_at":"2026-05-18T12:26:39.201973+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/QRNEBZZY3RHN5I6MDVOCJNPUWO","json":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO.json","graph_json":"https://pith.science/api/pith-number/QRNEBZZY3RHN5I6MDVOCJNPUWO/graph.json","events_json":"https://pith.science/api/pith-number/QRNEBZZY3RHN5I6MDVOCJNPUWO/events.json","paper":"https://pith.science/paper/QRNEBZZY"},"agent_actions":{"view_html":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO","download_json":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO.json","view_paper":"https://pith.science/paper/QRNEBZZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0539&json=true","fetch_graph":"https://pith.science/api/pith-number/QRNEBZZY3RHN5I6MDVOCJNPUWO/graph.json","fetch_events":"https://pith.science/api/pith-number/QRNEBZZY3RHN5I6MDVOCJNPUWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/action/storage_attestation","attest_author":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/action/author_attestation","sign_citation":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/action/citation_signature","submit_replication":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/action/replication_record"}},"created_at":"2026-05-18T04:07:07.085081+00:00","updated_at":"2026-05-18T04:07:07.085081+00:00"}