{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HR6AZCMZ3DKW5W5OLJ5RTRCF4P","short_pith_number":"pith:HR6AZCMZ","canonical_record":{"source":{"id":"1411.2808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-11T13:54:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a64239fa237de97c3a31289a03adf8a82dc777b1623f069b56e91ad74cc1195a","abstract_canon_sha256":"313c02b1f466720429824e0b9095c689cbb24368109e2b2f68830a72a15e8af7"},"schema_version":"1.0"},"canonical_sha256":"3c7c0c8999d8d56edbae5a7b19c445e3d158c4b12774c3e4f4a6c96f4c88230f","source":{"kind":"arxiv","id":"1411.2808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2808","created_at":"2026-05-18T02:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2808v1","created_at":"2026-05-18T02:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2808","created_at":"2026-05-18T02:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"HR6AZCMZ3DKW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HR6AZCMZ3DKW5W5O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HR6AZCMZ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HR6AZCMZ3DKW5W5OLJ5RTRCF4P","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-11T13:54:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a64239fa237de97c3a31289a03adf8a82dc777b1623f069b56e91ad74cc1195a","abstract_canon_sha256":"313c02b1f466720429824e0b9095c689cbb24368109e2b2f68830a72a15e8af7"},"schema_version":"1.0"},"canonical_sha256":"3c7c0c8999d8d56edbae5a7b19c445e3d158c4b12774c3e4f4a6c96f4c88230f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:52.995689Z","signature_b64":"N5BHdUjJdkPk+T835CaGEnSRXkb3bsA7jK9EypYzhV1sNYiCcq1tagxpylSIoxroGc/Md7QRDySXlFw/SE44CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c7c0c8999d8d56edbae5a7b19c445e3d158c4b12774c3e4f4a6c96f4c88230f","last_reissued_at":"2026-05-18T02:37:52.995175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:52.995175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2808","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-18T02:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ELPQM/xd6MioS8vR/jRfXh1T6Z3bqp0WSgMC7Ou1I7XImEXJvjshm7GLPw9PMEThpYJ0aKDMCY59Tgv1tliCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:33:42.560206Z"},"content_sha256":"47a0d8b09d30ee6b033166811483af136a42ba9201eeaa5a927a067a08dc509b","schema_version":"1.0","event_id":"sha256:47a0d8b09d30ee6b033166811483af136a42ba9201eeaa5a927a067a08dc509b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HR6AZCMZ3DKW5W5OLJ5RTRCF4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Admission Control for Many-Server Systems with QED-Driven Revenues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"A.J.E.M. Janssen, Jaron Sanders, J.S.H. van Leeuwaarden, S.C. Borst","submitted_at":"2014-11-11T13:54:14Z","abstract_excerpt":"We consider Markovian many-server systems with admission control operating in a QED regime, where the relative utilization approaches unity while the number of servers grows large, providing natural Economies-of-Scale. In order to determine the optimal admission control policy, we adopt a revenue maximization framework, and suppose that the revenue rate attains a maximum when no customers are waiting and no servers are idling. When the revenue function scales properly with the system size, we show that a nondegenerate optimization problem arises in the limit. Detailed analysis demonstrates tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2808","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-18T02:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtzxKexZJ5WkbfclECEtCWyO47lwYHncmfBnfauYaEsI1jt2UM0/2z5VpcDuogLBO98oBprL6ZWg1CsumcIZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:33:42.560565Z"},"content_sha256":"5ecfea9ac3021980bd32d4ee092d8825c3f1a40edbab339e59f19c699d27039d","schema_version":"1.0","event_id":"sha256:5ecfea9ac3021980bd32d4ee092d8825c3f1a40edbab339e59f19c699d27039d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/bundle.json","state_url":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/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-06-03T07:33:42Z","links":{"resolver":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P","bundle":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/bundle.json","state":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HR6AZCMZ3DKW5W5OLJ5RTRCF4P","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":"313c02b1f466720429824e0b9095c689cbb24368109e2b2f68830a72a15e8af7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-11T13:54:14Z","title_canon_sha256":"a64239fa237de97c3a31289a03adf8a82dc777b1623f069b56e91ad74cc1195a"},"schema_version":"1.0","source":{"id":"1411.2808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2808","created_at":"2026-05-18T02:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2808v1","created_at":"2026-05-18T02:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2808","created_at":"2026-05-18T02:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"HR6AZCMZ3DKW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HR6AZCMZ3DKW5W5O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HR6AZCMZ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:5ecfea9ac3021980bd32d4ee092d8825c3f1a40edbab339e59f19c699d27039d","target":"graph","created_at":"2026-05-18T02:37:52Z","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 Markovian many-server systems with admission control operating in a QED regime, where the relative utilization approaches unity while the number of servers grows large, providing natural Economies-of-Scale. In order to determine the optimal admission control policy, we adopt a revenue maximization framework, and suppose that the revenue rate attains a maximum when no customers are waiting and no servers are idling. When the revenue function scales properly with the system size, we show that a nondegenerate optimization problem arises in the limit. Detailed analysis demonstrates tha","authors_text":"A.J.E.M. Janssen, Jaron Sanders, J.S.H. van Leeuwaarden, S.C. Borst","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-11T13:54:14Z","title":"Optimal Admission Control for Many-Server Systems with QED-Driven Revenues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2808","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:47a0d8b09d30ee6b033166811483af136a42ba9201eeaa5a927a067a08dc509b","target":"record","created_at":"2026-05-18T02:37:52Z","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":"313c02b1f466720429824e0b9095c689cbb24368109e2b2f68830a72a15e8af7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-11T13:54:14Z","title_canon_sha256":"a64239fa237de97c3a31289a03adf8a82dc777b1623f069b56e91ad74cc1195a"},"schema_version":"1.0","source":{"id":"1411.2808","kind":"arxiv","version":1}},"canonical_sha256":"3c7c0c8999d8d56edbae5a7b19c445e3d158c4b12774c3e4f4a6c96f4c88230f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c7c0c8999d8d56edbae5a7b19c445e3d158c4b12774c3e4f4a6c96f4c88230f","first_computed_at":"2026-05-18T02:37:52.995175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:52.995175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N5BHdUjJdkPk+T835CaGEnSRXkb3bsA7jK9EypYzhV1sNYiCcq1tagxpylSIoxroGc/Md7QRDySXlFw/SE44CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:52.995689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47a0d8b09d30ee6b033166811483af136a42ba9201eeaa5a927a067a08dc509b","sha256:5ecfea9ac3021980bd32d4ee092d8825c3f1a40edbab339e59f19c699d27039d"],"state_sha256":"9d4c9ca3af3ba15577c5c613a018b4f15b7ef03ebbbbed5982857259efad29cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EDTK/PoIVOWHgRMGZobIL4jTVKJZHGG5KCdFDNsQiGGzRAaqags3lCE8ff/dl4SV4CureZ16oNZaiWhkP8HCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:33:42.562712Z","bundle_sha256":"4df4ae282fc3481c6c6e1b5a3e80c7566cb4119fdfbb5b58fb45497c51204926"}}