{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RG7XYOEGUXQQBHJTGTDV5WWQW6","short_pith_number":"pith:RG7XYOEG","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"},"canonical_sha256":"89bf7c3886a5e1009d3334c75edad0b78a78757394c95008271119f3e2f3e0c5","source":{"kind":"arxiv","id":"1710.00968","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00968","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00968v2","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00968","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"RG7XYOEGUXQQ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RG7XYOEGUXQQBHJT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RG7XYOEG","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RG7XYOEGUXQQBHJTGTDV5WWQW6","target":"record","payload":{"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"},"canonical_sha256":"89bf7c3886a5e1009d3334c75edad0b78a78757394c95008271119f3e2f3e0c5","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"},"source_kind":"arxiv","source_id":"1710.00968","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-05-17T23:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhU2dsDSTVEdBMBWU2ODeFGnk5gaMud/X63QHxcJBvRqaPuDDwDbnQpyrMV/XpPq5cebLmQ4n+NHg3l10Jk7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:18:06.395066Z"},"content_sha256":"ff9a3db9d414741f9f9554ad4a3439e31344a407da59a4ceb5c5f1c67af084f8","schema_version":"1.0","event_id":"sha256:ff9a3db9d414741f9f9554ad4a3439e31344a407da59a4ceb5c5f1c67af084f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RG7XYOEGUXQQBHJTGTDV5WWQW6","target":"graph","payload":{"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"},"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-17T23:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7i0As1vQ7uoVUWJCeviHFCpO7jwTXcjg7aQRk9NAQq6eMvuMAPr6X1IAWNr6uAFaGvLpkqNM7wNy9zd/vdsmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:18:06.395419Z"},"content_sha256":"c38fd53898621a0e14cd3fecace8704e093120c4736d65091201f6bf06b91c8e","schema_version":"1.0","event_id":"sha256:c38fd53898621a0e14cd3fecace8704e093120c4736d65091201f6bf06b91c8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/bundle.json","state_url":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/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-30T21:18:06Z","links":{"resolver":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6","bundle":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/bundle.json","state":"https://pith.science/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RG7XYOEGUXQQBHJTGTDV5WWQW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RG7XYOEGUXQQBHJTGTDV5WWQW6","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":"cda29892e28a723d7d249fc0d612fba59a29ec9bdb729ed524197fd2ad3881ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T03:19:00Z","title_canon_sha256":"1da19c46826db30aeced8d6e7dda076f47e2c8fb35ea7e3025bdf19ee4a47f23"},"schema_version":"1.0","source":{"id":"1710.00968","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00968","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00968v2","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00968","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"RG7XYOEGUXQQ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RG7XYOEGUXQQBHJT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RG7XYOEG","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c38fd53898621a0e14cd3fecace8704e093120c4736d65091201f6bf06b91c8e","target":"graph","created_at":"2026-05-17T23:51:09Z","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 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","authors_text":"Asaf Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T03:19:00Z","title":"Asymptotic analysis of a multiclass queueing control problem under heavy-traffic with model uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00968","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:ff9a3db9d414741f9f9554ad4a3439e31344a407da59a4ceb5c5f1c67af084f8","target":"record","created_at":"2026-05-17T23:51:09Z","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":"cda29892e28a723d7d249fc0d612fba59a29ec9bdb729ed524197fd2ad3881ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T03:19:00Z","title_canon_sha256":"1da19c46826db30aeced8d6e7dda076f47e2c8fb35ea7e3025bdf19ee4a47f23"},"schema_version":"1.0","source":{"id":"1710.00968","kind":"arxiv","version":2}},"canonical_sha256":"89bf7c3886a5e1009d3334c75edad0b78a78757394c95008271119f3e2f3e0c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89bf7c3886a5e1009d3334c75edad0b78a78757394c95008271119f3e2f3e0c5","first_computed_at":"2026-05-17T23:51:09.822129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:09.822129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y9ZDVJmUbWVMQEKbgO6M0/KsJS26wkw9HRUR6nJ1VOa+CRZhuaFNLbyGRn+/k6zpEOo2IxrhoZnnZnkMXQNmAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:09.822650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00968","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff9a3db9d414741f9f9554ad4a3439e31344a407da59a4ceb5c5f1c67af084f8","sha256:c38fd53898621a0e14cd3fecace8704e093120c4736d65091201f6bf06b91c8e"],"state_sha256":"7da6954297df143d604f4e4ba9f97ee2c712ab4d92803ae74573e7c2b2ad4ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zA55B+1USSnIGe2SN/qDZfelNfWNFeFbQ6sLNESAsDkw1hsVmy3ur9LWz3G0fQB5MOktInG8kkePefqSa3IdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:18:06.397570Z","bundle_sha256":"160fb5f6af0676326b6e170e3212a8a462f825122bd0581aaa5d9279dcfd2d18"}}