{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7HGVHBD4L33SZGSMNYDNAYCSOG","short_pith_number":"pith:7HGVHBD4","schema_version":"1.0","canonical_sha256":"f9cd53847c5ef72c9a4c6e06d0605271b6f226ab4efaee6f01b0659adbc6764f","source":{"kind":"arxiv","id":"1412.6773","version":1},"attestation_state":"computed","paper":{"title":"A differential game for a multiclass queueing model in the moderate-deviation heavy-traffic regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Cohen, Rami Atar","submitted_at":"2014-12-21T12:34:10Z","abstract_excerpt":"We study a differential game that governs the moderate-deviation heavy-traffic asymptotics of a multiclass single-server queueing control problem with a risk-sensitive cost. We consider a cost set on a finite but sufficiently large time horizon, and show that this formulation leads to stationary feedback policies for the game. Several aspects of the game are explored, including its characterization via a (one-dimensional) free boundary problem, the semi-explicit solution of an optimal strategy, and the specification of a saddle point. We emphasize the analogy to the well-known Harrison-Taksar "},"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":"1412.6773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-21T12:34:10Z","cross_cats_sorted":[],"title_canon_sha256":"3d79aae94665b7348f213ecf658745f3187d4f2464e030b3620b2be3bc60db7c","abstract_canon_sha256":"e4203bb71bc29c0fec4a5a88e02a3b252d5e1a9731f85d4442366f3cdf679c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:13.784754Z","signature_b64":"ILL+ebs86M9XRtHFdBKwI6Rd5KkZeK8CKHCPVT7mwI/IP5y/4DKb8BHxCYjCICae6tTVms6st0jhMOLW8f/lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9cd53847c5ef72c9a4c6e06d0605271b6f226ab4efaee6f01b0659adbc6764f","last_reissued_at":"2026-05-18T00:17:13.784104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:13.784104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A differential game for a multiclass queueing model in the moderate-deviation heavy-traffic regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Cohen, Rami Atar","submitted_at":"2014-12-21T12:34:10Z","abstract_excerpt":"We study a differential game that governs the moderate-deviation heavy-traffic asymptotics of a multiclass single-server queueing control problem with a risk-sensitive cost. We consider a cost set on a finite but sufficiently large time horizon, and show that this formulation leads to stationary feedback policies for the game. Several aspects of the game are explored, including its characterization via a (one-dimensional) free boundary problem, the semi-explicit solution of an optimal strategy, and the specification of a saddle point. We emphasize the analogy to the well-known Harrison-Taksar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6773","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":"1412.6773","created_at":"2026-05-18T00:17:13.784193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6773v1","created_at":"2026-05-18T00:17:13.784193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6773","created_at":"2026-05-18T00:17:13.784193+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HGVHBD4L33S","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HGVHBD4L33SZGSM","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HGVHBD4","created_at":"2026-05-18T12:28:16.859392+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/7HGVHBD4L33SZGSMNYDNAYCSOG","json":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG.json","graph_json":"https://pith.science/api/pith-number/7HGVHBD4L33SZGSMNYDNAYCSOG/graph.json","events_json":"https://pith.science/api/pith-number/7HGVHBD4L33SZGSMNYDNAYCSOG/events.json","paper":"https://pith.science/paper/7HGVHBD4"},"agent_actions":{"view_html":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG","download_json":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG.json","view_paper":"https://pith.science/paper/7HGVHBD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6773&json=true","fetch_graph":"https://pith.science/api/pith-number/7HGVHBD4L33SZGSMNYDNAYCSOG/graph.json","fetch_events":"https://pith.science/api/pith-number/7HGVHBD4L33SZGSMNYDNAYCSOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG/action/storage_attestation","attest_author":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG/action/author_attestation","sign_citation":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG/action/citation_signature","submit_replication":"https://pith.science/pith/7HGVHBD4L33SZGSMNYDNAYCSOG/action/replication_record"}},"created_at":"2026-05-18T00:17:13.784193+00:00","updated_at":"2026-05-18T00:17:13.784193+00:00"}