{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:KEHX6MGKBRSIOSPNUUIDQZQF7I","short_pith_number":"pith:KEHX6MGK","canonical_record":{"source":{"id":"0907.3977","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-07-23T03:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"a287152ee2e85b13c85e8a8b33c1f784ebb30eebe7c0cbc9c4b0cb1e43e03d37","abstract_canon_sha256":"5d9538a0f7de9a83fcb30ce72912da250708050be7f6c469e78dfc67ed31ef74"},"schema_version":"1.0"},"canonical_sha256":"510f7f30ca0c648749eda510386605fa1491106581f974a377cedbc675d4e3c9","source":{"kind":"arxiv","id":"0907.3977","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.3977","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"0907.3977v3","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3977","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"KEHX6MGKBRSI","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KEHX6MGKBRSIOSPN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KEHX6MGK","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:KEHX6MGKBRSIOSPNUUIDQZQF7I","target":"record","payload":{"canonical_record":{"source":{"id":"0907.3977","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-07-23T03:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"a287152ee2e85b13c85e8a8b33c1f784ebb30eebe7c0cbc9c4b0cb1e43e03d37","abstract_canon_sha256":"5d9538a0f7de9a83fcb30ce72912da250708050be7f6c469e78dfc67ed31ef74"},"schema_version":"1.0"},"canonical_sha256":"510f7f30ca0c648749eda510386605fa1491106581f974a377cedbc675d4e3c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:13.824365Z","signature_b64":"V3tJc6fjUJkxpNxMd1Nphrg2Y6A+9iEWt/B3DsGhXM22d9O7QVsaEfyQioLYHOOGo+1Du/Xs5hRft25JYB3PBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510f7f30ca0c648749eda510386605fa1491106581f974a377cedbc675d4e3c9","last_reissued_at":"2026-05-18T04:42:13.823837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:13.823837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.3977","source_version":3,"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:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCD/8EzYDYPYf3Me3MYSSxSIXSE46Kyuox6DESoEmHCXg5sDOUQJJsj5UjmBIEiuoC8VAyv8sFGSZv9ajcW2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:20:47.126615Z"},"content_sha256":"72117993cb356e8594e4fd2d5e0f5546e34d602f4e473913745cae6741683b7a","schema_version":"1.0","event_id":"sha256:72117993cb356e8594e4fd2d5e0f5546e34d602f4e473913745cae6741683b7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:KEHX6MGKBRSIOSPNUUIDQZQF7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Lei Ying, R. Srikant, Shihuan Liu","submitted_at":"2009-07-23T03:50:01Z","abstract_excerpt":"We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to achieve the maximum throughput in the presence of flow-level dynamics. In this paper, we propose a new algorithm, called workload-based scheduling with learning, which is provably throughput-optimal, requires no prior knowledge of channels and user demands, and performs significantly better than previously suggested algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3977","kind":"arxiv","version":3},"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:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHC+BzYNAuY47sLuy8KP09tteMUocDziAHUBMz0ixLfSrC0FOUIBs87Yq9mFrGgHmcpLkYBEe7L1dMwQS4KIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:20:47.127359Z"},"content_sha256":"e8f76608221c9cae3e50a7b066cc32111f5752b6f9694da7b633d859145d0571","schema_version":"1.0","event_id":"sha256:e8f76608221c9cae3e50a7b066cc32111f5752b6f9694da7b633d859145d0571"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I/bundle.json","state_url":"https://pith.science/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I/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-08T06:20:47Z","links":{"resolver":"https://pith.science/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I","bundle":"https://pith.science/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I/bundle.json","state":"https://pith.science/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEHX6MGKBRSIOSPNUUIDQZQF7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KEHX6MGKBRSIOSPNUUIDQZQF7I","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":"5d9538a0f7de9a83fcb30ce72912da250708050be7f6c469e78dfc67ed31ef74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-07-23T03:50:01Z","title_canon_sha256":"a287152ee2e85b13c85e8a8b33c1f784ebb30eebe7c0cbc9c4b0cb1e43e03d37"},"schema_version":"1.0","source":{"id":"0907.3977","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.3977","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"0907.3977v3","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3977","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"KEHX6MGKBRSI","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KEHX6MGKBRSIOSPN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KEHX6MGK","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:e8f76608221c9cae3e50a7b066cc32111f5752b6f9694da7b633d859145d0571","target":"graph","created_at":"2026-05-18T04:42:13Z","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 multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to achieve the maximum throughput in the presence of flow-level dynamics. In this paper, we propose a new algorithm, called workload-based scheduling with learning, which is provably throughput-optimal, requires no prior knowledge of channels and user demands, and performs significantly better than previously suggested algorithms.","authors_text":"Lei Ying, R. Srikant, Shihuan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-07-23T03:50:01Z","title":"Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3977","kind":"arxiv","version":3},"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:72117993cb356e8594e4fd2d5e0f5546e34d602f4e473913745cae6741683b7a","target":"record","created_at":"2026-05-18T04:42:13Z","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":"5d9538a0f7de9a83fcb30ce72912da250708050be7f6c469e78dfc67ed31ef74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-07-23T03:50:01Z","title_canon_sha256":"a287152ee2e85b13c85e8a8b33c1f784ebb30eebe7c0cbc9c4b0cb1e43e03d37"},"schema_version":"1.0","source":{"id":"0907.3977","kind":"arxiv","version":3}},"canonical_sha256":"510f7f30ca0c648749eda510386605fa1491106581f974a377cedbc675d4e3c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"510f7f30ca0c648749eda510386605fa1491106581f974a377cedbc675d4e3c9","first_computed_at":"2026-05-18T04:42:13.823837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:13.823837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V3tJc6fjUJkxpNxMd1Nphrg2Y6A+9iEWt/B3DsGhXM22d9O7QVsaEfyQioLYHOOGo+1Du/Xs5hRft25JYB3PBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:13.824365Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.3977","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72117993cb356e8594e4fd2d5e0f5546e34d602f4e473913745cae6741683b7a","sha256:e8f76608221c9cae3e50a7b066cc32111f5752b6f9694da7b633d859145d0571"],"state_sha256":"6930030d3b2bcbff28665c91d0da2bc45b104baa00413d49426f313303a687a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gnw84GliJvMwXLEZJcmaEN6EkmU9z47R7y2N5XQp1K8N4Te9et21U7I9ndc9r1oyn2XXa352Tlp5OVASloMrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:20:47.131345Z","bundle_sha256":"11d011052ee1f1e7f42b94106e78dad608a7c973a5eff0b594f452d26e6680ad"}}