{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NBQRSIQZ4INSEDAIJ5BK2G2ZIM","short_pith_number":"pith:NBQRSIQZ","schema_version":"1.0","canonical_sha256":"6861192219e21b220c084f42ad1b594323c2f3882e9a084fd9ed16aae250a2e7","source":{"kind":"arxiv","id":"1112.1178","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.1178","created_at":"2026-05-18T02:21:27.928191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1178v2","created_at":"2026-05-18T02:21:27.928191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1178","created_at":"2026-05-18T02:21:27.928191+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBQRSIQZ4INS","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBQRSIQZ4INSEDAI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBQRSIQZ","created_at":"2026-05-18T12:26:37.096874+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/NBQRSIQZ4INSEDAIJ5BK2G2ZIM","json":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM.json","graph_json":"https://pith.science/api/pith-number/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/graph.json","events_json":"https://pith.science/api/pith-number/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/events.json","paper":"https://pith.science/paper/NBQRSIQZ"},"agent_actions":{"view_html":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM","download_json":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM.json","view_paper":"https://pith.science/paper/NBQRSIQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1178&json=true","fetch_graph":"https://pith.science/api/pith-number/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/graph.json","fetch_events":"https://pith.science/api/pith-number/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/action/storage_attestation","attest_author":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/action/author_attestation","sign_citation":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/action/citation_signature","submit_replication":"https://pith.science/pith/NBQRSIQZ4INSEDAIJ5BK2G2ZIM/action/replication_record"}},"created_at":"2026-05-18T02:21:27.928191+00:00","updated_at":"2026-05-18T02:21:27.928191+00:00"}