{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HAK2QV5TXH5CR6DAW3AD2GCHTP","short_pith_number":"pith:HAK2QV5T","canonical_record":{"source":{"id":"1602.03275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-10T06:16:35Z","cross_cats_sorted":["cs.SY","math.PR"],"title_canon_sha256":"0865f5a3b109ca4d1a930ca0242cfd7ca5ad7183641e37b6595efc650bc0c19d","abstract_canon_sha256":"8a1f32449dd831b08d5b5ce5fcb85a97194a6276afeb04ace2e40fdea052cae9"},"schema_version":"1.0"},"canonical_sha256":"3815a857b3b9fa28f860b6c03d18479bcba7ec6d2cb60431b07c8250f731930d","source":{"kind":"arxiv","id":"1602.03275","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03275","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03275v3","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03275","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"HAK2QV5TXH5C","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HAK2QV5TXH5CR6DA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HAK2QV5T","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HAK2QV5TXH5CR6DAW3AD2GCHTP","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-10T06:16:35Z","cross_cats_sorted":["cs.SY","math.PR"],"title_canon_sha256":"0865f5a3b109ca4d1a930ca0242cfd7ca5ad7183641e37b6595efc650bc0c19d","abstract_canon_sha256":"8a1f32449dd831b08d5b5ce5fcb85a97194a6276afeb04ace2e40fdea052cae9"},"schema_version":"1.0"},"canonical_sha256":"3815a857b3b9fa28f860b6c03d18479bcba7ec6d2cb60431b07c8250f731930d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:00.621969Z","signature_b64":"8PkFDDEOriP5dFSIr6vw1S1Fg4WmrMzcSucc9QOqQxSZ22NG9TY2TjVa4V/0Bc7+FAPhWsGad8B3o+gZhJrqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3815a857b3b9fa28f860b6c03d18479bcba7ec6d2cb60431b07c8250f731930d","last_reissued_at":"2026-05-17T23:51:00.621401Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:00.621401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03275","source_version":3,"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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GxNgDJNuZCoRAkAIoTbAMB+Pm5yP66wIAdcyqTmPf5Pwh6DSJvZ2oZn46m+7x8x10+bLrCHdjnrzIE7AkeyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:15:14.155946Z"},"content_sha256":"f89120cf3a8960336d06620aac10095c7cacdf7adb74fb191df49e1c01071052","schema_version":"1.0","event_id":"sha256:f89120cf3a8960336d06620aac10095c7cacdf7adb74fb191df49e1c01071052"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HAK2QV5TXH5CR6DAW3AD2GCHTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite Horizon Average Optimality of the N-network Queueing Model in the Halfin-Whitt Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Ari Arapostathis, Guodong Pang","submitted_at":"2016-02-10T06:16:35Z","abstract_excerpt":"We study the infinite horizon optimal control problem for N-network queueing systems, which consist of two customer classes and two server pools, under average (ergodic) criteria in the Halfin-Whitt regime. We consider three control objectives: 1) minimizing the queueing (and idleness) cost, 2) minimizing the queueing cost while imposing a constraint on idleness at each server pool, and 3) minimizing the queueing cost while requiring fairness on idleness. The running costs can be any nonnegative convex functions having at most polynomial growth.\n  For all three problems we establish asymptotic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03275","kind":"arxiv","version":3},"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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dS3az/68Sdi80FVC6ROPs2kzvW+Rl18PsPgIplm+3ILfhh4UMtfDYMdcnQiIO3qF282rE9OyYrsvuJJ7MAiRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:15:14.156301Z"},"content_sha256":"3c05d715f19d3ec5b92f82f2afeae790ec2efc7da95687b4cbdf849aa8d37460","schema_version":"1.0","event_id":"sha256:3c05d715f19d3ec5b92f82f2afeae790ec2efc7da95687b4cbdf849aa8d37460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP/bundle.json","state_url":"https://pith.science/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP/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-28T13:15:14Z","links":{"resolver":"https://pith.science/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP","bundle":"https://pith.science/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP/bundle.json","state":"https://pith.science/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAK2QV5TXH5CR6DAW3AD2GCHTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HAK2QV5TXH5CR6DAW3AD2GCHTP","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":"8a1f32449dd831b08d5b5ce5fcb85a97194a6276afeb04ace2e40fdea052cae9","cross_cats_sorted":["cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-10T06:16:35Z","title_canon_sha256":"0865f5a3b109ca4d1a930ca0242cfd7ca5ad7183641e37b6595efc650bc0c19d"},"schema_version":"1.0","source":{"id":"1602.03275","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03275","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03275v3","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03275","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"HAK2QV5TXH5C","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HAK2QV5TXH5CR6DA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HAK2QV5T","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:3c05d715f19d3ec5b92f82f2afeae790ec2efc7da95687b4cbdf849aa8d37460","target":"graph","created_at":"2026-05-17T23:51:00Z","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 the infinite horizon optimal control problem for N-network queueing systems, which consist of two customer classes and two server pools, under average (ergodic) criteria in the Halfin-Whitt regime. We consider three control objectives: 1) minimizing the queueing (and idleness) cost, 2) minimizing the queueing cost while imposing a constraint on idleness at each server pool, and 3) minimizing the queueing cost while requiring fairness on idleness. The running costs can be any nonnegative convex functions having at most polynomial growth.\n  For all three problems we establish asymptotic","authors_text":"Ari Arapostathis, Guodong Pang","cross_cats":["cs.SY","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-10T06:16:35Z","title":"Infinite Horizon Average Optimality of the N-network Queueing Model in the Halfin-Whitt Regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03275","kind":"arxiv","version":3},"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:f89120cf3a8960336d06620aac10095c7cacdf7adb74fb191df49e1c01071052","target":"record","created_at":"2026-05-17T23:51:00Z","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":"8a1f32449dd831b08d5b5ce5fcb85a97194a6276afeb04ace2e40fdea052cae9","cross_cats_sorted":["cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-10T06:16:35Z","title_canon_sha256":"0865f5a3b109ca4d1a930ca0242cfd7ca5ad7183641e37b6595efc650bc0c19d"},"schema_version":"1.0","source":{"id":"1602.03275","kind":"arxiv","version":3}},"canonical_sha256":"3815a857b3b9fa28f860b6c03d18479bcba7ec6d2cb60431b07c8250f731930d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3815a857b3b9fa28f860b6c03d18479bcba7ec6d2cb60431b07c8250f731930d","first_computed_at":"2026-05-17T23:51:00.621401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:00.621401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8PkFDDEOriP5dFSIr6vw1S1Fg4WmrMzcSucc9QOqQxSZ22NG9TY2TjVa4V/0Bc7+FAPhWsGad8B3o+gZhJrqAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:00.621969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03275","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f89120cf3a8960336d06620aac10095c7cacdf7adb74fb191df49e1c01071052","sha256:3c05d715f19d3ec5b92f82f2afeae790ec2efc7da95687b4cbdf849aa8d37460"],"state_sha256":"a9f3ebe69bf6e527247e16789663c0a32b0672b5decc77d550373854803141d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zB8eMHfRg7TQUMKvfpywN1nPr37uzTfv+ZUUM1GOs5GNCAfL8zXKxpJLuBBYZAdHuywUhQdTc+Ehw/jMNSUqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:15:14.158328Z","bundle_sha256":"aa6ef5177e0080b6a8e7fe69c666978cf28c840927b1bc0376d5e3a56ad4681c"}}