{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QRNEBZZY3RHN5I6MDVOCJNPUWO","short_pith_number":"pith:QRNEBZZY","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"},"canonical_sha256":"845a40e738dc4edea3cc1d5c24b5f4b3a8f6f17cc1ebccd370b540456a267c47","source":{"kind":"arxiv","id":"1112.0539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0539","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0539v1","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0539","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"QRNEBZZY3RHN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QRNEBZZY3RHN5I6M","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QRNEBZZY","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QRNEBZZY3RHN5I6MDVOCJNPUWO","target":"record","payload":{"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"},"canonical_sha256":"845a40e738dc4edea3cc1d5c24b5f4b3a8f6f17cc1ebccd370b540456a267c47","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"},"source_kind":"arxiv","source_id":"1112.0539","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:07:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5H0CMI7NxrZdXIcV7VqvLG8IxJ0Z3/KWF5dHBxgKKzDPF7s4QtD/Y+QxaXmPc/0FfBcV8XdQD0AxALk4IWxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:09:18.342284Z"},"content_sha256":"ffc4eb5cb8469c6ec2078fdfd381655930eee46b781648640dcc142f827c7165","schema_version":"1.0","event_id":"sha256:ffc4eb5cb8469c6ec2078fdfd381655930eee46b781648640dcc142f827c7165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QRNEBZZY3RHN5I6MDVOCJNPUWO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:07:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBK5qYSQ6stD0V3flttGA21d9WzCJrdSJULJhvV9K010HBHEwIo0lxmNp3PHWjW+Wz9BYKCjilDczqk7rn4YAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:09:18.342646Z"},"content_sha256":"2adac4a6b0babe0c050a5afe5312cfc75058a99355a786781325b7d7ce23e324","schema_version":"1.0","event_id":"sha256:2adac4a6b0babe0c050a5afe5312cfc75058a99355a786781325b7d7ce23e324"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/bundle.json","state_url":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T10:09:18Z","links":{"resolver":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO","bundle":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/bundle.json","state":"https://pith.science/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRNEBZZY3RHN5I6MDVOCJNPUWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QRNEBZZY3RHN5I6MDVOCJNPUWO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"521fa72f31ea9a90683b3820af89ba07565f7a5e9db06ff94d495b441c1973dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-02T18:46:31Z","title_canon_sha256":"c651cd12b0d47747b634bde81887d165869a829102cd70ab843e8a510a23751f"},"schema_version":"1.0","source":{"id":"1112.0539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0539","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0539v1","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0539","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"QRNEBZZY3RHN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QRNEBZZY3RHN5I6M","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QRNEBZZY","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:2adac4a6b0babe0c050a5afe5312cfc75058a99355a786781325b7d7ce23e324","target":"graph","created_at":"2026-05-18T04:07:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Qiao Li, Rohit Negi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-02T18:46:31Z","title":"Maximal Scheduling in Wireless Networks with Priorities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0539","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ffc4eb5cb8469c6ec2078fdfd381655930eee46b781648640dcc142f827c7165","target":"record","created_at":"2026-05-18T04:07:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"521fa72f31ea9a90683b3820af89ba07565f7a5e9db06ff94d495b441c1973dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-02T18:46:31Z","title_canon_sha256":"c651cd12b0d47747b634bde81887d165869a829102cd70ab843e8a510a23751f"},"schema_version":"1.0","source":{"id":"1112.0539","kind":"arxiv","version":1}},"canonical_sha256":"845a40e738dc4edea3cc1d5c24b5f4b3a8f6f17cc1ebccd370b540456a267c47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"845a40e738dc4edea3cc1d5c24b5f4b3a8f6f17cc1ebccd370b540456a267c47","first_computed_at":"2026-05-18T04:07:07.085016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:07.085016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"weG4aVCihAyZIgGO3XMpOCmiSrkhz6hccDe24C5Fk454HjyAfQ6e0csoNDa4dnULVnhITvfz1xL5uQWaPLrhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:07.085458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc4eb5cb8469c6ec2078fdfd381655930eee46b781648640dcc142f827c7165","sha256:2adac4a6b0babe0c050a5afe5312cfc75058a99355a786781325b7d7ce23e324"],"state_sha256":"bd302b26727af26037519530711a09da20106a1be9a053bb15543e5424a08f09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAPgxtILXj/mHR7/XMxBJwwO5FMTr/1hKIpDWyRyBScWPzWGVcylnj2gDBWxIvGDcDPqiH6ljXo0ui9yi9FHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:09:18.344605Z","bundle_sha256":"8d8fedb6595a0e5ad0015554613eca7aac111f01ad4f31a4a85430c92325c697"}}