{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XHSTGO4LBJ7MMJ3YNR6QZM2F7A","short_pith_number":"pith:XHSTGO4L","canonical_record":{"source":{"id":"1103.1448","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T06:59:50Z","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"title_canon_sha256":"be205e340c11818341cbf2b5c0f2a4ce8e6514205d4597fc8d099b1db417a32e","abstract_canon_sha256":"6c9e0f3a80208d9e8898ab3230b628377c7c7da490957d8971fbd02783cd1fa6"},"schema_version":"1.0"},"canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","source":{"kind":"arxiv","id":"1103.1448","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1448","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1448v3","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1448","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"XHSTGO4LBJ7M","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XHSTGO4LBJ7MMJ3Y","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XHSTGO4L","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XHSTGO4LBJ7MMJ3YNR6QZM2F7A","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1448","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T06:59:50Z","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"title_canon_sha256":"be205e340c11818341cbf2b5c0f2a4ce8e6514205d4597fc8d099b1db417a32e","abstract_canon_sha256":"6c9e0f3a80208d9e8898ab3230b628377c7c7da490957d8971fbd02783cd1fa6"},"schema_version":"1.0"},"canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.723465Z","signature_b64":"Wxxjg0v1o0Tdasxe6N57Rkp4Se8mIzuRXjm+8LKwHH25fsPkqkdnN/jeTlC6328gJeKBHozJ7v5UNpObQUUVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","last_reissued_at":"2026-05-18T01:03:24.722990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.722990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1448","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-18T01:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TS3RnqzuxFySM5+F3/zOZ1fICwm/MrH2DQ+dO8xOfLIRBHjOoTbgtVjEXoWDKGv/XdcDxTrN8FSaj2LfO5hXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:21:50.447095Z"},"content_sha256":"2e65f1782ad0096c4035967b5a42c552d2bd5f625f58a0c221700e31624b6df2","schema_version":"1.0","event_id":"sha256:2e65f1782ad0096c4035967b5a42c552d2bd5f625f58a0c221700e31624b6df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XHSTGO4LBJ7MMJ3YNR6QZM2F7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Multi-Server Allocation to Parallel Queues With Independent Random Queue-Server Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Hussein Al-Zubaidy, Ioannis Lambadaris, Yannis Viniotis","submitted_at":"2011-03-08T06:59:50Z","abstract_excerpt":"We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected to a subset of the K servers during any given time slot. This model has been widely used in studies of emerging 3G/4G wireless systems. We introduce the class of Most Balancing (MB) policies and provide their mathematical characterization. We prove that MB policies are optimal; we define optimality as minimization, in stochastic ordering sense, of a range of cost functions of the queue lengths, including the process "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1448","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-18T01:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxs5Vgbu7yg48d0AdPT+6/y+oA3/RXmRzWkixBnsBQ/XhnBcuBkVMXOsH/4+eHHMqTmlkaFXLWSpxMAcIrRxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:21:50.447490Z"},"content_sha256":"dba2c09aaa1a1efa4b4dfda6919e6beaa8fe66843c2c4e734f059e8a39a1097e","schema_version":"1.0","event_id":"sha256:dba2c09aaa1a1efa4b4dfda6919e6beaa8fe66843c2c4e734f059e8a39a1097e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/bundle.json","state_url":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/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-05-25T00:21:50Z","links":{"resolver":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A","bundle":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/bundle.json","state":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XHSTGO4LBJ7MMJ3YNR6QZM2F7A","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":"6c9e0f3a80208d9e8898ab3230b628377c7c7da490957d8971fbd02783cd1fa6","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T06:59:50Z","title_canon_sha256":"be205e340c11818341cbf2b5c0f2a4ce8e6514205d4597fc8d099b1db417a32e"},"schema_version":"1.0","source":{"id":"1103.1448","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1448","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1448v3","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1448","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"XHSTGO4LBJ7M","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XHSTGO4LBJ7MMJ3Y","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XHSTGO4L","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:dba2c09aaa1a1efa4b4dfda6919e6beaa8fe66843c2c4e734f059e8a39a1097e","target":"graph","created_at":"2026-05-18T01:03:24Z","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 investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected to a subset of the K servers during any given time slot. This model has been widely used in studies of emerging 3G/4G wireless systems. We introduce the class of Most Balancing (MB) policies and provide their mathematical characterization. We prove that MB policies are optimal; we define optimality as minimization, in stochastic ordering sense, of a range of cost functions of the queue lengths, including the process ","authors_text":"Hussein Al-Zubaidy, Ioannis Lambadaris, Yannis Viniotis","cross_cats":["cs.NI","cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T06:59:50Z","title":"Optimal Multi-Server Allocation to Parallel Queues With Independent Random Queue-Server Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1448","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:2e65f1782ad0096c4035967b5a42c552d2bd5f625f58a0c221700e31624b6df2","target":"record","created_at":"2026-05-18T01:03:24Z","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":"6c9e0f3a80208d9e8898ab3230b628377c7c7da490957d8971fbd02783cd1fa6","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T06:59:50Z","title_canon_sha256":"be205e340c11818341cbf2b5c0f2a4ce8e6514205d4597fc8d099b1db417a32e"},"schema_version":"1.0","source":{"id":"1103.1448","kind":"arxiv","version":3}},"canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","first_computed_at":"2026-05-18T01:03:24.722990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:24.722990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wxxjg0v1o0Tdasxe6N57Rkp4Se8mIzuRXjm+8LKwHH25fsPkqkdnN/jeTlC6328gJeKBHozJ7v5UNpObQUUVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:24.723465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1448","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e65f1782ad0096c4035967b5a42c552d2bd5f625f58a0c221700e31624b6df2","sha256:dba2c09aaa1a1efa4b4dfda6919e6beaa8fe66843c2c4e734f059e8a39a1097e"],"state_sha256":"11f7ea1171efbf245bd893cb894725814aea1047c213a4b9783f02fdcedb1708"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pM2NTT4wEOdQ3vOrICDqKNLc3dmudQKjlJ/I4L5T5re7P3boB5/tFvTfPVFxwlXFczUujVmu08cgBOOs5qCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T00:21:50.450439Z","bundle_sha256":"33e2e4da7b494c8aaac5dbad1cd9e249f4a69ca2a3c05b3644e8f904615d8a17"}}