{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MUMTH35SVH5DZNWOCHC6PPYX3K","short_pith_number":"pith:MUMTH35S","canonical_record":{"source":{"id":"2111.14104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-28T11:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"7d0c9e0fac399c5a4fd8481ac5d7bf3f893881266faee5d20814fed6fabec503","abstract_canon_sha256":"5928f765727a444efd954eb26c335520297ce41cb0083648495048545d76637b"},"schema_version":"1.0"},"canonical_sha256":"651933efb2a9fa3cb6ce11c5e7bf17daa30367b0e3ed35342ebcd3851b46b698","source":{"kind":"arxiv","id":"2111.14104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14104","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14104v2","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14104","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"MUMTH35SVH5D","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"pith_short_16","alias_value":"MUMTH35SVH5DZNWO","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"pith_short_8","alias_value":"MUMTH35S","created_at":"2026-07-05T09:57:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MUMTH35SVH5DZNWOCHC6PPYX3K","target":"record","payload":{"canonical_record":{"source":{"id":"2111.14104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-28T11:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"7d0c9e0fac399c5a4fd8481ac5d7bf3f893881266faee5d20814fed6fabec503","abstract_canon_sha256":"5928f765727a444efd954eb26c335520297ce41cb0083648495048545d76637b"},"schema_version":"1.0"},"canonical_sha256":"651933efb2a9fa3cb6ce11c5e7bf17daa30367b0e3ed35342ebcd3851b46b698","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:35.261371Z","signature_b64":"LrFsGWsa9o3BBXrVueni8qFMO/DWrZKx6oOxvNAFNkuU34xYMrQhQ7aWv47b1sbGFyg8Uysl97VbzvKzvEJlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"651933efb2a9fa3cb6ce11c5e7bf17daa30367b0e3ed35342ebcd3851b46b698","last_reissued_at":"2026-07-05T09:57:35.260903Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:35.260903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.14104","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-07-05T09:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltAxXlMMdrCBRD/Z5BwXBp8+qFroeO3o4FgLufmnTK1vuqvOMP66RNpVNvPjmo7XKufZzfbCHiM7qCBPrUX5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:45:07.748713Z"},"content_sha256":"de104266c0a75e17d660cd89f81ea876bfb960f3bf8a631029074d400cd72083","schema_version":"1.0","event_id":"sha256:de104266c0a75e17d660cd89f81ea876bfb960f3bf8a631029074d400cd72083"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MUMTH35SVH5DZNWOCHC6PPYX3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Partition for Multi-Type Queueing System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shengyu Cao, Simai He, Yifan Feng, Zizhuo Wang","submitted_at":"2021-11-28T11:01:48Z","abstract_excerpt":"We study an optimal server partition and customer assignment problem for an uncapacitated FCFS queueing system with heterogeneous types of customers. Each type of customers is associated with a Poisson arrival, a certain service time distribution, and a unit waiting cost. The goal is to minimize the expected total waiting cost by partitioning the server into sub-queues, each with a smaller service capacity, and routing customer types probabilistically. First, we show that by properly partitioning the queue, it is possible to reduce the expected waiting costs by an arbitrarily large ratio. Then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14104","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.14104/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pce4VNRJfrncZHy7T33t3Srd46rDFJ8q80CfWvZ9VnJ9UGHsI2ucdOOUVaKUD/WmKO9TqEnsM8HVj6r8xbpnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:45:07.749368Z"},"content_sha256":"c4ea2b069022444d84c7d7908437de2e1fc5a0e461314f997ddc4d1eebb00820","schema_version":"1.0","event_id":"sha256:c4ea2b069022444d84c7d7908437de2e1fc5a0e461314f997ddc4d1eebb00820"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUMTH35SVH5DZNWOCHC6PPYX3K/bundle.json","state_url":"https://pith.science/pith/MUMTH35SVH5DZNWOCHC6PPYX3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUMTH35SVH5DZNWOCHC6PPYX3K/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-08-11T11:45:07Z","links":{"resolver":"https://pith.science/pith/MUMTH35SVH5DZNWOCHC6PPYX3K","bundle":"https://pith.science/pith/MUMTH35SVH5DZNWOCHC6PPYX3K/bundle.json","state":"https://pith.science/pith/MUMTH35SVH5DZNWOCHC6PPYX3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUMTH35SVH5DZNWOCHC6PPYX3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MUMTH35SVH5DZNWOCHC6PPYX3K","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":"5928f765727a444efd954eb26c335520297ce41cb0083648495048545d76637b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-28T11:01:48Z","title_canon_sha256":"7d0c9e0fac399c5a4fd8481ac5d7bf3f893881266faee5d20814fed6fabec503"},"schema_version":"1.0","source":{"id":"2111.14104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14104","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14104v2","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14104","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"MUMTH35SVH5D","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"pith_short_16","alias_value":"MUMTH35SVH5DZNWO","created_at":"2026-07-05T09:57:35Z"},{"alias_kind":"pith_short_8","alias_value":"MUMTH35S","created_at":"2026-07-05T09:57:35Z"}],"graph_snapshots":[{"event_id":"sha256:c4ea2b069022444d84c7d7908437de2e1fc5a0e461314f997ddc4d1eebb00820","target":"graph","created_at":"2026-07-05T09:57:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.14104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study an optimal server partition and customer assignment problem for an uncapacitated FCFS queueing system with heterogeneous types of customers. Each type of customers is associated with a Poisson arrival, a certain service time distribution, and a unit waiting cost. The goal is to minimize the expected total waiting cost by partitioning the server into sub-queues, each with a smaller service capacity, and routing customer types probabilistically. First, we show that by properly partitioning the queue, it is possible to reduce the expected waiting costs by an arbitrarily large ratio. Then","authors_text":"Shengyu Cao, Simai He, Yifan Feng, Zizhuo Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-28T11:01:48Z","title":"Optimal Partition for Multi-Type Queueing System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14104","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:de104266c0a75e17d660cd89f81ea876bfb960f3bf8a631029074d400cd72083","target":"record","created_at":"2026-07-05T09:57:35Z","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":"5928f765727a444efd954eb26c335520297ce41cb0083648495048545d76637b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-28T11:01:48Z","title_canon_sha256":"7d0c9e0fac399c5a4fd8481ac5d7bf3f893881266faee5d20814fed6fabec503"},"schema_version":"1.0","source":{"id":"2111.14104","kind":"arxiv","version":2}},"canonical_sha256":"651933efb2a9fa3cb6ce11c5e7bf17daa30367b0e3ed35342ebcd3851b46b698","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"651933efb2a9fa3cb6ce11c5e7bf17daa30367b0e3ed35342ebcd3851b46b698","first_computed_at":"2026-07-05T09:57:35.260903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:35.260903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LrFsGWsa9o3BBXrVueni8qFMO/DWrZKx6oOxvNAFNkuU34xYMrQhQ7aWv47b1sbGFyg8Uysl97VbzvKzvEJlAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:35.261371Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.14104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de104266c0a75e17d660cd89f81ea876bfb960f3bf8a631029074d400cd72083","sha256:c4ea2b069022444d84c7d7908437de2e1fc5a0e461314f997ddc4d1eebb00820"],"state_sha256":"26cb2c8fe4c3e14a30e9175d36c6c67c9fcb4dac7aeebf57b5c95f4c9e964100"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tWqa/bhExDT9k+ak/7+I+DbVUmEbZF25omOzXr8IowJ7KnYQ/BMOhKbjnBQIoXELfUv00LcSOhc0Hs53IqXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:45:07.752884Z","bundle_sha256":"cf3f7b845d53a74b7bdd889a7e0d14e910c29ead76a722cae0cc7c17358b179d"}}