{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:FGGL5SCG6OMTXURYIH2ACIJO7N","short_pith_number":"pith:FGGL5SCG","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"},"canonical_sha256":"298cbec846f3993bd23841f401212efb71e5a687311dd2f002d32936047ef47f","source":{"kind":"arxiv","id":"0903.0604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.0604","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0903.0604v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0604","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"FGGL5SCG6OMT","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FGGL5SCG6OMTXURY","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FGGL5SCG","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:FGGL5SCG6OMTXURYIH2ACIJO7N","target":"record","payload":{"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"},"canonical_sha256":"298cbec846f3993bd23841f401212efb71e5a687311dd2f002d32936047ef47f","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"},"source_kind":"arxiv","source_id":"0903.0604","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dL2i08Rjkt1KmHthbXZ7RMxDnig1sghVh8GGaZnq0Z7IJQQCrfHDIrdBI8x9ar1dqse24Ij9qXhf0mHaPKqsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:40:18.238557Z"},"content_sha256":"2919a509fd3e987e41c2870a3a0ca0361612853f05b6c03676530a4e00d2e6ab","schema_version":"1.0","event_id":"sha256:2919a509fd3e987e41c2870a3a0ca0361612853f05b6c03676530a4e00d2e6ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:FGGL5SCG6OMTXURYIH2ACIJO7N","target":"graph","payload":{"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"},"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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMBmsKRulX1Xfz9aiS/rpKkMjfr4JSRtUHY2tmjfzxZ+kvyqMq4E2orJuA0XFBGPDsqgkgPmGn0kTPEYjd2qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:40:18.238902Z"},"content_sha256":"528dcea99eb3152ab430c629f1fc20d2f8fd9f61d6aa5966aabdcb810c1e1758","schema_version":"1.0","event_id":"sha256:528dcea99eb3152ab430c629f1fc20d2f8fd9f61d6aa5966aabdcb810c1e1758"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/bundle.json","state_url":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/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-09T09:40:18Z","links":{"resolver":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N","bundle":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/bundle.json","state":"https://pith.science/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGGL5SCG6OMTXURYIH2ACIJO7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:FGGL5SCG6OMTXURYIH2ACIJO7N","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":"390dd88a16a7f90c213fc0a855d95742de0cb9b143cc49c9496087908b07c05f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-03-03T19:37:05Z","title_canon_sha256":"e3b8aef8ba607e8037e790ced16649ec8c6f4e38128fc8dcfdc11aaf7a539bdf"},"schema_version":"1.0","source":{"id":"0903.0604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.0604","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0903.0604v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0604","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"FGGL5SCG6OMT","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FGGL5SCG6OMTXURY","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FGGL5SCG","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:528dcea99eb3152ab430c629f1fc20d2f8fd9f61d6aa5966aabdcb810c1e1758","target":"graph","created_at":"2026-05-18T00:58:20Z","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":"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","authors_text":"Ben Liang, Elvino S. Sousa, Mahdi Lotfinezhad","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-03-03T19:37:05Z","title":"On Stability Region and Delay Performance of Linear-Memory Randomized Scheduling for Time-Varying Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.0604","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:2919a509fd3e987e41c2870a3a0ca0361612853f05b6c03676530a4e00d2e6ab","target":"record","created_at":"2026-05-18T00:58:20Z","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":"390dd88a16a7f90c213fc0a855d95742de0cb9b143cc49c9496087908b07c05f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-03-03T19:37:05Z","title_canon_sha256":"e3b8aef8ba607e8037e790ced16649ec8c6f4e38128fc8dcfdc11aaf7a539bdf"},"schema_version":"1.0","source":{"id":"0903.0604","kind":"arxiv","version":1}},"canonical_sha256":"298cbec846f3993bd23841f401212efb71e5a687311dd2f002d32936047ef47f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"298cbec846f3993bd23841f401212efb71e5a687311dd2f002d32936047ef47f","first_computed_at":"2026-05-18T00:58:20.342072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.342072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C9PQo4nxuQ19xnVnafzJ9YJBgnOwAXpadSeT2wB2+/z6ARF4m2Bd50Qx+FCK+f6cbz1U3uAT6a0dgDBsykoVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.342692Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.0604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2919a509fd3e987e41c2870a3a0ca0361612853f05b6c03676530a4e00d2e6ab","sha256:528dcea99eb3152ab430c629f1fc20d2f8fd9f61d6aa5966aabdcb810c1e1758"],"state_sha256":"8d2bde1d3369bd9ae8047b405795b873028b89094a1f106cbbeec7a998521efb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1F+wRX8Co9nFshEsuRv46RyjTiccgrWNbNMQT92E78nS8O5AczmBZTaLS1p0kniqQj0IwkkUWvyMl+3sXFhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:40:18.241298Z","bundle_sha256":"376c9d4c9d5b4b2fc8282c0013525766406422e6ea49fe5013c6a35627a4b04c"}}