{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RG7XYOEGUXQQBHJTGTDV5WWQW6","short_pith_number":"pith:RG7XYOEG","schema_version":"1.0","canonical_sha256":"89bf7c3886a5e1009d3334c75edad0b78a78757394c95008271119f3e2f3e0c5","source":{"kind":"arxiv","id":"1710.00968","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic analysis of a multiclass queueing control problem under heavy-traffic with model uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Cohen","submitted_at":"2017-10-03T03:19:00Z","abstract_excerpt":"We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions acts to minimize a discounted cost that accounts for the uncertainty. The main result is the asymptotic optimality of a $c\\mu$-type of policy derived via underlying stochastic differential games studied in [16]. Under this policy, with high probability, rejections are not performed when the workload lies below some cut-off that depends on the ambiguity level. W"},"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":"1710.00968","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T03:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"1da19c46826db30aeced8d6e7dda076f47e2c8fb35ea7e3025bdf19ee4a47f23","abstract_canon_sha256":"cda29892e28a723d7d249fc0d612fba59a29ec9bdb729ed524197fd2ad3881ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:09.822650Z","signature_b64":"Y9ZDVJmUbWVMQEKbgO6M0/KsJS26wkw9HRUR6nJ1VOa+CRZhuaFNLbyGRn+/k6zpEOo2IxrhoZnnZnkMXQNmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89bf7c3886a5e1009d3334c75edad0b78a78757394c95008271119f3e2f3e0c5","last_reissued_at":"2026-05-17T23:51:09.822129Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:09.822129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic analysis of a multiclass queueing control problem under heavy-traffic with model uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Cohen","submitted_at":"2017-10-03T03:19:00Z","abstract_excerpt":"We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions acts to minimize a discounted cost that accounts for the uncertainty. The main result is the asymptotic optimality of a $c\\mu$-type of policy derived via underlying stochastic differential games studied in [16]. Under this policy, with high probability, rejections are not performed when the workload lies below some cut-off that depends on the ambiguity level. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00968","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":"1710.00968","created_at":"2026-05-17T23:51:09.822220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00968v2","created_at":"2026-05-17T23:51:09.822220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00968","created_at":"2026-05-17T23:51:09.822220+00:00"},{"alias_kind":"pith_short_12","alias_value":"RG7XYOEGUXQQ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RG7XYOEGUXQQBHJT","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RG7XYOEG","created_at":"2026-05-18T12:31:39.905425+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/RG7XYOEGUXQQBHJTGTDV5WWQW6","json":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6.json","graph_json":"https://pith.science/api/pith-number/RG7XYOEGUXQQBHJTGTDV5WWQW6/graph.json","events_json":"https://pith.science/api/pith-number/RG7XYOEGUXQQBHJTGTDV5WWQW6/events.json","paper":"https://pith.science/paper/RG7XYOEG"},"agent_actions":{"view_html":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6","download_json":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6.json","view_paper":"https://pith.science/paper/RG7XYOEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00968&json=true","fetch_graph":"https://pith.science/api/pith-number/RG7XYOEGUXQQBHJTGTDV5WWQW6/graph.json","fetch_events":"https://pith.science/api/pith-number/RG7XYOEGUXQQBHJTGTDV5WWQW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/action/storage_attestation","attest_author":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/action/author_attestation","sign_citation":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/action/citation_signature","submit_replication":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/action/replication_record"}},"created_at":"2026-05-17T23:51:09.822220+00:00","updated_at":"2026-05-17T23:51:09.822220+00:00"}