{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2XEF7DHRL7OLYTY5U3GYAIJBKL","short_pith_number":"pith:2XEF7DHR","canonical_record":{"source":{"id":"1007.4840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-27T22:57:43Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"3c084aed64d9933a75302e0dc918d1beb2ba69ac95b9d9e4037938c77be1edf8","abstract_canon_sha256":"c0573bf05733bea48c925325d0f82f57982948430c9dcce777587833764e56cc"},"schema_version":"1.0"},"canonical_sha256":"d5c85f8cf15fdcbc4f1da6cd80212152df10a66d6341056b85454ab8855d7986","source":{"kind":"arxiv","id":"1007.4840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4840","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4840v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4840","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"2XEF7DHRL7OL","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2XEF7DHRL7OLYTY5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2XEF7DHR","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2XEF7DHRL7OLYTY5U3GYAIJBKL","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-27T22:57:43Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"3c084aed64d9933a75302e0dc918d1beb2ba69ac95b9d9e4037938c77be1edf8","abstract_canon_sha256":"c0573bf05733bea48c925325d0f82f57982948430c9dcce777587833764e56cc"},"schema_version":"1.0"},"canonical_sha256":"d5c85f8cf15fdcbc4f1da6cd80212152df10a66d6341056b85454ab8855d7986","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.448445Z","signature_b64":"A+PA5gzFRM5sEdKClVEWxvJ1rq1leNmxqiGuilz9/oJi85ph3LFd5sZADAnOHxIeELrE7Px0hpLwhAEVyXN7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5c85f8cf15fdcbc4f1da6cd80212152df10a66d6341056b85454ab8855d7986","last_reissued_at":"2026-05-18T00:58:19.447743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.447743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4840","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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFOsM9dZLoBoY2Qg9CjqEDRG4GtEhMXyDMtLH6xFfHzNefWSMyBuIUB7zExdrld4GlrwbuHssoKI+YMgKUJoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:49:57.198012Z"},"content_sha256":"7dd76f13caabe7de4e643939c631d9238adf1e11d87bf3c6dbc274957539e687","schema_version":"1.0","event_id":"sha256:7dd76f13caabe7de4e643939c631d9238adf1e11d87bf3c6dbc274957539e687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2XEF7DHRL7OLYTY5U3GYAIJBKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Maximal Scheduling in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Qiao Li, Rohit Negi","submitted_at":"2010-07-27T22:57:43Z","abstract_excerpt":"In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4840","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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiuJbozygQtD0mlUYwXHTcpWhYxLAY1amDE/FJ5VJ8upCnKcNagumtTUxp6SRkkEyQwvndkzGYXWA28o9Rj4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:49:57.198373Z"},"content_sha256":"9a3c6b0ca4348976c408ce18115201c82a4077d785a09b1c2912403983dc221e","schema_version":"1.0","event_id":"sha256:9a3c6b0ca4348976c408ce18115201c82a4077d785a09b1c2912403983dc221e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL/bundle.json","state_url":"https://pith.science/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL/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-25T12:49:57Z","links":{"resolver":"https://pith.science/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL","bundle":"https://pith.science/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL/bundle.json","state":"https://pith.science/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XEF7DHRL7OLYTY5U3GYAIJBKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2XEF7DHRL7OLYTY5U3GYAIJBKL","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":"c0573bf05733bea48c925325d0f82f57982948430c9dcce777587833764e56cc","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-27T22:57:43Z","title_canon_sha256":"3c084aed64d9933a75302e0dc918d1beb2ba69ac95b9d9e4037938c77be1edf8"},"schema_version":"1.0","source":{"id":"1007.4840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4840","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4840v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4840","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"2XEF7DHRL7OL","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2XEF7DHRL7OLYTY5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2XEF7DHR","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:9a3c6b0ca4348976c408ce18115201c82a4077d785a09b1c2912403983dc221e","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vect","authors_text":"Qiao Li, Rohit Negi","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-27T22:57:43Z","title":"Greedy Maximal Scheduling in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4840","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:7dd76f13caabe7de4e643939c631d9238adf1e11d87bf3c6dbc274957539e687","target":"record","created_at":"2026-05-18T00:58:19Z","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":"c0573bf05733bea48c925325d0f82f57982948430c9dcce777587833764e56cc","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-27T22:57:43Z","title_canon_sha256":"3c084aed64d9933a75302e0dc918d1beb2ba69ac95b9d9e4037938c77be1edf8"},"schema_version":"1.0","source":{"id":"1007.4840","kind":"arxiv","version":1}},"canonical_sha256":"d5c85f8cf15fdcbc4f1da6cd80212152df10a66d6341056b85454ab8855d7986","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5c85f8cf15fdcbc4f1da6cd80212152df10a66d6341056b85454ab8855d7986","first_computed_at":"2026-05-18T00:58:19.447743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.447743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A+PA5gzFRM5sEdKClVEWxvJ1rq1leNmxqiGuilz9/oJi85ph3LFd5sZADAnOHxIeELrE7Px0hpLwhAEVyXN7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.448445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dd76f13caabe7de4e643939c631d9238adf1e11d87bf3c6dbc274957539e687","sha256:9a3c6b0ca4348976c408ce18115201c82a4077d785a09b1c2912403983dc221e"],"state_sha256":"1211836498298d0c8ab2909fed0cdf931c10cd8876d92ec6f898fd39722fd6d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Cei/viZUThkiE6JyT5ENqi5tMsOShvc8rO1C6dETmyGbouh9/Xt2LCrwnKZ7rVStTTIYAnrXms4Bw9qIiYoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:49:57.200381Z","bundle_sha256":"7904edba5bc945bd54d50a374fa592a6c8b22f0076ad6f9e1564ee9d3e89a605"}}