{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NBQRSIQZ4INSEDAIJ5BK2G2ZIM","short_pith_number":"pith:NBQRSIQZ","canonical_record":{"source":{"id":"1112.1178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T07:28:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"04cfadc657c0da2de9207f24b10fe034a6ebc5deeb1733496c8707fa2f8e1cf8","abstract_canon_sha256":"9875f7cdd1f67160dfdfa9702551f7fa37454f1d6db4496a8167dff804bc4860"},"schema_version":"1.0"},"canonical_sha256":"6861192219e21b220c084f42ad1b594323c2f3882e9a084fd9ed16aae250a2e7","source":{"kind":"arxiv","id":"1112.1178","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1178","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1178v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1178","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"NBQRSIQZ4INS","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NBQRSIQZ4INSEDAI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NBQRSIQZ","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NBQRSIQZ4INSEDAIJ5BK2G2ZIM","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T07:28:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"04cfadc657c0da2de9207f24b10fe034a6ebc5deeb1733496c8707fa2f8e1cf8","abstract_canon_sha256":"9875f7cdd1f67160dfdfa9702551f7fa37454f1d6db4496a8167dff804bc4860"},"schema_version":"1.0"},"canonical_sha256":"6861192219e21b220c084f42ad1b594323c2f3882e9a084fd9ed16aae250a2e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.928854Z","signature_b64":"JL+Whnn90MrbN5SYufWVIGrx98bU8MX/3vgFwPWiQhFgmc7wbkeH9Iw+rwoF8cBwhWj/oquuWFGY755IsKdfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6861192219e21b220c084f42ad1b594323c2f3882e9a084fd9ed16aae250a2e7","last_reissued_at":"2026-05-18T02:21:27.928068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.928068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1178","source_version":2,"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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ml5ZEej4VTExL1gpo3rGAeXrr8xEQWvFrcMmNLttj71yfmzJ4+a/JI3cvo7zN3FJLRWSRCJRMB9cRj2V7/S5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:30:03.429989Z"},"content_sha256":"62d60f4d9357493e0bf9cbd047202102a3e79649e8fce86783fd7d8077104930","schema_version":"1.0","event_id":"sha256:62d60f4d9357493e0bf9cbd047202102a3e79649e8fce86783fd7d8077104930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NBQRSIQZ4INSEDAIJ5BK2G2ZIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Server Assignment in Multi-Server Queueing Systems with Random Connectivities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Chung-Horng Lung, Hassan Halabian, Ioannis Lambadaris, Yannis Viniotis","submitted_at":"2011-12-06T07:28:08Z","abstract_excerpt":"We study the problem of assigning $K$ identical servers to a set of $N$ parallel queues in a time-slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served by at most one server during each time slot. Such a queueing model has been used in addressing resource allocation problems in wireless networks. It has been previously proven that Maximum Weighted Matching (MWM) is a throughput-optimal server assignment policy for such a queueing system. In this paper, we prove that for a syste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1178","kind":"arxiv","version":2},"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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHWsO72rreXnfG6uKIIgp6lu9zju9wFBnPBbWV+mtGlRoJ+MlP4je2/iigwWk3S2KYTM9U3cv4qBTEziBh09AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:30:03.430657Z"},"content_sha256":"020380298b5ca5e3349595dc39cc15cdcba7fa6cc3bcc9b80f66a9880b333e89","schema_version":"1.0","event_id":"sha256:020380298b5ca5e3349595dc39cc15cdcba7fa6cc3bcc9b80f66a9880b333e89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/bundle.json","state_url":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/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-22T04:30:03Z","links":{"resolver":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM","bundle":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/bundle.json","state":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NBQRSIQZ4INSEDAIJ5BK2G2ZIM","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":"9875f7cdd1f67160dfdfa9702551f7fa37454f1d6db4496a8167dff804bc4860","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T07:28:08Z","title_canon_sha256":"04cfadc657c0da2de9207f24b10fe034a6ebc5deeb1733496c8707fa2f8e1cf8"},"schema_version":"1.0","source":{"id":"1112.1178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1178","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1178v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1178","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"NBQRSIQZ4INS","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NBQRSIQZ4INSEDAI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NBQRSIQZ","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:020380298b5ca5e3349595dc39cc15cdcba7fa6cc3bcc9b80f66a9880b333e89","target":"graph","created_at":"2026-05-18T02:21:27Z","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 study the problem of assigning $K$ identical servers to a set of $N$ parallel queues in a time-slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served by at most one server during each time slot. Such a queueing model has been used in addressing resource allocation problems in wireless networks. It has been previously proven that Maximum Weighted Matching (MWM) is a throughput-optimal server assignment policy for such a queueing system. In this paper, we prove that for a syste","authors_text":"Chung-Horng Lung, Hassan Halabian, Ioannis Lambadaris, Yannis Viniotis","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T07:28:08Z","title":"Optimal Server Assignment in Multi-Server Queueing Systems with Random Connectivities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1178","kind":"arxiv","version":2},"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:62d60f4d9357493e0bf9cbd047202102a3e79649e8fce86783fd7d8077104930","target":"record","created_at":"2026-05-18T02:21:27Z","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":"9875f7cdd1f67160dfdfa9702551f7fa37454f1d6db4496a8167dff804bc4860","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T07:28:08Z","title_canon_sha256":"04cfadc657c0da2de9207f24b10fe034a6ebc5deeb1733496c8707fa2f8e1cf8"},"schema_version":"1.0","source":{"id":"1112.1178","kind":"arxiv","version":2}},"canonical_sha256":"6861192219e21b220c084f42ad1b594323c2f3882e9a084fd9ed16aae250a2e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6861192219e21b220c084f42ad1b594323c2f3882e9a084fd9ed16aae250a2e7","first_computed_at":"2026-05-18T02:21:27.928068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:27.928068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JL+Whnn90MrbN5SYufWVIGrx98bU8MX/3vgFwPWiQhFgmc7wbkeH9Iw+rwoF8cBwhWj/oquuWFGY755IsKdfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:27.928854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62d60f4d9357493e0bf9cbd047202102a3e79649e8fce86783fd7d8077104930","sha256:020380298b5ca5e3349595dc39cc15cdcba7fa6cc3bcc9b80f66a9880b333e89"],"state_sha256":"1ac83b435debb5c06f5c48feecea128290d26d552df70a04f31e21518ea56301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq7J6v3u39pkBaUfetn5cPxUtGmOy2sDO051kcn0qctWEtNmE+vSegh7ipG909kCr0Mn6qvKPWvDc/BTuJJGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:30:03.434263Z","bundle_sha256":"671752cb15cb087cd8a7229a2ba894202706ee7532844465d3581e56b98bdaee"}}