{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YXPI7WFGBMQXUKM2EJQFXIZOS3","short_pith_number":"pith:YXPI7WFG","canonical_record":{"source":{"id":"1304.6701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"195845910c20b8e5fb287132f46b30c09ca95b5b2d744cf4edef2c94dafd90d5","abstract_canon_sha256":"8e92ebfb9ead88f11c795697d610fbe3b064e3ecb7557b197dc4fe1f06f8a49f"},"schema_version":"1.0"},"canonical_sha256":"c5de8fd8a60b217a299a22605ba32e96cf208d77934e257a50b4c6b7dabec3be","source":{"kind":"arxiv","id":"1304.6701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6701","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6701v1","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6701","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"YXPI7WFGBMQX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YXPI7WFGBMQXUKM2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YXPI7WFG","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YXPI7WFGBMQXUKM2EJQFXIZOS3","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"195845910c20b8e5fb287132f46b30c09ca95b5b2d744cf4edef2c94dafd90d5","abstract_canon_sha256":"8e92ebfb9ead88f11c795697d610fbe3b064e3ecb7557b197dc4fe1f06f8a49f"},"schema_version":"1.0"},"canonical_sha256":"c5de8fd8a60b217a299a22605ba32e96cf208d77934e257a50b4c6b7dabec3be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:12.330966Z","signature_b64":"qcjT//nBxTNcTerQunn6r6thQHSgEnUNAmMdHkVwo2ub/ix2dNsfWhe9onlEmfA3LX1rFjADgEpmpMamNyblDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5de8fd8a60b217a299a22605ba32e96cf208d77934e257a50b4c6b7dabec3be","last_reissued_at":"2026-05-18T03:27:12.330242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:12.330242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6701","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-18T03:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Md20mfzDIYCBnx+woHWypI1grUsmsri/fBWYVH2sNzpK7mGaDRHIxTJwhAzSOk8qAMhgmNe93kSAEDyTiwLTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:15.736436Z"},"content_sha256":"5260e22cc39739431c615c723b7941ec45ad1b5462e1be19c675c71f2441a867","schema_version":"1.0","event_id":"sha256:5260e22cc39739431c615c723b7941ec45ad1b5462e1be19c675c71f2441a867"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YXPI7WFGBMQXUKM2EJQFXIZOS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Staffing Large Service Systems Under Arrival-rate Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David P. Morton, Jing Zan, John J. Hasenbein","submitted_at":"2013-04-24T19:33:27Z","abstract_excerpt":"We consider the problem of staffing large-scale service systems with multiple customer classes and multiple dedicated server pools under joint quality-of-service (QoS) constraints. We first analyze the case in which arrival rates are deterministic and the QoS metric is the probability a customer is queued, given by the Erlang-C formula. We use the Janssen-Van Leeuwaarden-Zwart bounds to obtain asymptotically optimal solutions to this problem. The second model considered is one in which the arrival rates are not completely known in advance (before the server staffing levels are chosen), but rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6701","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-18T03:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtwqQXaNprg1AAmmp1uEfMJKtFgF2NnI9RbU4t98oGBIqWoRXJf55+Eu5L/BRnjuB+AuWaNfGRE0noogpsmEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:15.737034Z"},"content_sha256":"f8678e914066044e50ec55379322cc83f7a2dbbc1c64ea68d654c53d189e58cf","schema_version":"1.0","event_id":"sha256:f8678e914066044e50ec55379322cc83f7a2dbbc1c64ea68d654c53d189e58cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3/bundle.json","state_url":"https://pith.science/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3/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-26T15:48:15Z","links":{"resolver":"https://pith.science/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3","bundle":"https://pith.science/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3/bundle.json","state":"https://pith.science/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXPI7WFGBMQXUKM2EJQFXIZOS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YXPI7WFGBMQXUKM2EJQFXIZOS3","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":"8e92ebfb9ead88f11c795697d610fbe3b064e3ecb7557b197dc4fe1f06f8a49f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:33:27Z","title_canon_sha256":"195845910c20b8e5fb287132f46b30c09ca95b5b2d744cf4edef2c94dafd90d5"},"schema_version":"1.0","source":{"id":"1304.6701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6701","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6701v1","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6701","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"YXPI7WFGBMQX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YXPI7WFGBMQXUKM2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YXPI7WFG","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:f8678e914066044e50ec55379322cc83f7a2dbbc1c64ea68d654c53d189e58cf","target":"graph","created_at":"2026-05-18T03:27:12Z","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 consider the problem of staffing large-scale service systems with multiple customer classes and multiple dedicated server pools under joint quality-of-service (QoS) constraints. We first analyze the case in which arrival rates are deterministic and the QoS metric is the probability a customer is queued, given by the Erlang-C formula. We use the Janssen-Van Leeuwaarden-Zwart bounds to obtain asymptotically optimal solutions to this problem. The second model considered is one in which the arrival rates are not completely known in advance (before the server staffing levels are chosen), but rat","authors_text":"David P. Morton, Jing Zan, John J. Hasenbein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:33:27Z","title":"Staffing Large Service Systems Under Arrival-rate Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6701","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:5260e22cc39739431c615c723b7941ec45ad1b5462e1be19c675c71f2441a867","target":"record","created_at":"2026-05-18T03:27:12Z","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":"8e92ebfb9ead88f11c795697d610fbe3b064e3ecb7557b197dc4fe1f06f8a49f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:33:27Z","title_canon_sha256":"195845910c20b8e5fb287132f46b30c09ca95b5b2d744cf4edef2c94dafd90d5"},"schema_version":"1.0","source":{"id":"1304.6701","kind":"arxiv","version":1}},"canonical_sha256":"c5de8fd8a60b217a299a22605ba32e96cf208d77934e257a50b4c6b7dabec3be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5de8fd8a60b217a299a22605ba32e96cf208d77934e257a50b4c6b7dabec3be","first_computed_at":"2026-05-18T03:27:12.330242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:12.330242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qcjT//nBxTNcTerQunn6r6thQHSgEnUNAmMdHkVwo2ub/ix2dNsfWhe9onlEmfA3LX1rFjADgEpmpMamNyblDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:12.330966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5260e22cc39739431c615c723b7941ec45ad1b5462e1be19c675c71f2441a867","sha256:f8678e914066044e50ec55379322cc83f7a2dbbc1c64ea68d654c53d189e58cf"],"state_sha256":"1f5dedd8fbb39d9fea3f18b7b504aa7c9f5af28f98fa505ea04c568df5a8f39a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxFjJU8HSX0C//4x8m7T9IhsfQzEmhejXOnmoaBc9MCRwpe7X66vHYOk/lmBlTQ6sgTVcZ3O8Kd00T8QBXLQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:48:15.740079Z","bundle_sha256":"b862c9b4c6a8ed31ce3755588e8546a544eabd451aa40a9d1b98ac5cf1297c7e"}}