{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FGGL5SCG6OMTXURYIH2ACIJO7N","short_pith_number":"pith:FGGL5SCG","schema_version":"1.0","canonical_sha256":"298cbec846f3993bd23841f401212efb71e5a687311dd2f002d32936047ef47f","source":{"kind":"arxiv","id":"0903.0604","version":1},"attestation_state":"computed","paper":{"title":"On Stability Region and Delay Performance of Linear-Memory Randomized Scheduling for Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Ben Liang, Elvino S. Sousa, Mahdi Lotfinezhad","submitted_at":"2009-03-03T19:37:05Z","abstract_excerpt":"Throughput optimal scheduling policies in general require the solution of a complex and often NP-hard optimization problem. Related literature has shown that in the context of time-varying channels, randomized scheduling policies can be employed to reduce the complexity of the optimization problem but at the expense of a memory requirement that is exponential in the number of data flows. In this paper, we consider a Linear-Memory Randomized Scheduling Policy (LM-RSP) that is based on a pick-and-compare principle in a time-varying network with $N$ one-hop data flows. For general ergodic channel"},"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":"0903.0604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-03-03T19:37:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e3b8aef8ba607e8037e790ced16649ec8c6f4e38128fc8dcfdc11aaf7a539bdf","abstract_canon_sha256":"390dd88a16a7f90c213fc0a855d95742de0cb9b143cc49c9496087908b07c05f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.342692Z","signature_b64":"C9PQo4nxuQ19xnVnafzJ9YJBgnOwAXpadSeT2wB2+/z6ARF4m2Bd50Qx+FCK+f6cbz1U3uAT6a0dgDBsykoVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"298cbec846f3993bd23841f401212efb71e5a687311dd2f002d32936047ef47f","last_reissued_at":"2026-05-18T00:58:20.342072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.342072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Stability Region and Delay Performance of Linear-Memory Randomized Scheduling for Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Ben Liang, Elvino S. Sousa, Mahdi Lotfinezhad","submitted_at":"2009-03-03T19:37:05Z","abstract_excerpt":"Throughput optimal scheduling policies in general require the solution of a complex and often NP-hard optimization problem. Related literature has shown that in the context of time-varying channels, randomized scheduling policies can be employed to reduce the complexity of the optimization problem but at the expense of a memory requirement that is exponential in the number of data flows. In this paper, we consider a Linear-Memory Randomized Scheduling Policy (LM-RSP) that is based on a pick-and-compare principle in a time-varying network with $N$ one-hop data flows. For general ergodic channel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.0604","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":"0903.0604","created_at":"2026-05-18T00:58:20.342156+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.0604v1","created_at":"2026-05-18T00:58:20.342156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0604","created_at":"2026-05-18T00:58:20.342156+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGGL5SCG6OMT","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGGL5SCG6OMTXURY","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGGL5SCG","created_at":"2026-05-18T12:25:59.703012+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/FGGL5SCG6OMTXURYIH2ACIJO7N","json":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N.json","graph_json":"https://pith.science/api/pith-number/FGGL5SCG6OMTXURYIH2ACIJO7N/graph.json","events_json":"https://pith.science/api/pith-number/FGGL5SCG6OMTXURYIH2ACIJO7N/events.json","paper":"https://pith.science/paper/FGGL5SCG"},"agent_actions":{"view_html":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N","download_json":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N.json","view_paper":"https://pith.science/paper/FGGL5SCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.0604&json=true","fetch_graph":"https://pith.science/api/pith-number/FGGL5SCG6OMTXURYIH2ACIJO7N/graph.json","fetch_events":"https://pith.science/api/pith-number/FGGL5SCG6OMTXURYIH2ACIJO7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/action/storage_attestation","attest_author":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/action/author_attestation","sign_citation":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/action/citation_signature","submit_replication":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/action/replication_record"}},"created_at":"2026-05-18T00:58:20.342156+00:00","updated_at":"2026-05-18T00:58:20.342156+00:00"}