{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HR6AZCMZ3DKW5W5OLJ5RTRCF4P","short_pith_number":"pith:HR6AZCMZ","schema_version":"1.0","canonical_sha256":"3c7c0c8999d8d56edbae5a7b19c445e3d158c4b12774c3e4f4a6c96f4c88230f","source":{"kind":"arxiv","id":"1411.2808","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.2808","created_at":"2026-05-18T02:37:52.995269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2808v1","created_at":"2026-05-18T02:37:52.995269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2808","created_at":"2026-05-18T02:37:52.995269+00:00"},{"alias_kind":"pith_short_12","alias_value":"HR6AZCMZ3DKW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HR6AZCMZ3DKW5W5O","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HR6AZCMZ","created_at":"2026-05-18T12:28:30.664211+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/HR6AZCMZ3DKW5W5OLJ5RTRCF4P","json":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P.json","graph_json":"https://pith.science/api/pith-number/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/graph.json","events_json":"https://pith.science/api/pith-number/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/events.json","paper":"https://pith.science/paper/HR6AZCMZ"},"agent_actions":{"view_html":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P","download_json":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P.json","view_paper":"https://pith.science/paper/HR6AZCMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2808&json=true","fetch_graph":"https://pith.science/api/pith-number/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/graph.json","fetch_events":"https://pith.science/api/pith-number/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/action/storage_attestation","attest_author":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/action/author_attestation","sign_citation":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/action/citation_signature","submit_replication":"https://pith.science/pith/HR6AZCMZ3DKW5W5OLJ5RTRCF4P/action/replication_record"}},"created_at":"2026-05-18T02:37:52.995269+00:00","updated_at":"2026-05-18T02:37:52.995269+00:00"}