{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6DGI6ATSJIGB64APKV2VL3BD7M","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":"be2c2bdf56da6dc4db1efa2f610334b62564a8fa85024b34d471ce2ea7a79f1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T23:32:37Z","title_canon_sha256":"98d9b63bfa45a22d27c843d370588f3d2d2c8ace64238c8a8eaf9c7a6b58ff86"},"schema_version":"1.0","source":{"id":"1102.1466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1466","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1466v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1466","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"6DGI6ATSJIGB","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6DGI6ATSJIGB64AP","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6DGI6ATS","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:347ff84ff9fe484c54eecab0472873407ff3e091cbaab36ed7eadd188307d52a","target":"graph","created_at":"2026-05-18T00:58:43Z","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 propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic schedules by searching for a new basic schedule in a throughput increasing direction. We show that both of the above procedures can be achieved in a distributed manner. Specifically, we propose an ","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-02-07T23:32:37Z","title":"Distributed Throughput-optimal Scheduling in Ad Hoc Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1466","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:9cab0dd30c6955ecbc0c1f1f8c0a5df5514a55337b38ac0709be710048b5923d","target":"record","created_at":"2026-05-18T00:58:43Z","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":"be2c2bdf56da6dc4db1efa2f610334b62564a8fa85024b34d471ce2ea7a79f1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T23:32:37Z","title_canon_sha256":"98d9b63bfa45a22d27c843d370588f3d2d2c8ace64238c8a8eaf9c7a6b58ff86"},"schema_version":"1.0","source":{"id":"1102.1466","kind":"arxiv","version":1}},"canonical_sha256":"f0cc8f02724a0c1f700f557555ec23fb0430c01a2fb892a868233164581dc2d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0cc8f02724a0c1f700f557555ec23fb0430c01a2fb892a868233164581dc2d6","first_computed_at":"2026-05-18T00:58:43.661784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.661784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BM3mCLnhSHlSogj0u+xBdIsHchB6edWYM1Pjp+9fUipkzivq3sEWQrO0XQUmYL1SrEeKid8Q7ToW56ZezX2fAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.662307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cab0dd30c6955ecbc0c1f1f8c0a5df5514a55337b38ac0709be710048b5923d","sha256:347ff84ff9fe484c54eecab0472873407ff3e091cbaab36ed7eadd188307d52a"],"state_sha256":"9532a51ce6ecdcf5702aec3d6d6a078552c71cff347423e09e4aa96aeebfdb00"}