{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QGY2GF4PVKRYINY76DVYID54M4","short_pith_number":"pith:QGY2GF4P","schema_version":"1.0","canonical_sha256":"81b1a3178faaa384371ff0eb840fbc672a34612a1d6d7b3986b40e3a29df16be","source":{"kind":"arxiv","id":"1908.01068","version":1},"attestation_state":"computed","paper":{"title":"Ergodic control of diffusions with compound Poisson jumps under a general structural hypothesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Ari Arapostathis, Guodong Pang, Yi Zheng","submitted_at":"2019-08-02T21:14:56Z","abstract_excerpt":"We study the ergodic control problem for a class of controlled jump diffusions driven by a compound Poisson process. This extends the results of [SIAM J. Control Optim. 57 (2019), no. 2, 1516-1540] to running costs that are not near-monotone. This generality is needed in applications such as optimal scheduling of large-scale parallel server networks.\n  We provide a full characterization of optimality via the Hamilton-Jacobi-Bellman (HJB) equation, for which we additionally exhibit regularity of solutions under mild hypotheses. In addition, we show that optimal stationary Markov controls are a."},"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":"1908.01068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-02T21:14:56Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8fbde91d65223601299b394644621438b160fe8d097e2f56c92ce52e95c23420","abstract_canon_sha256":"aaa7b0332b55e4c240afcbb80068b9c346303fa423abd9059c77ff2aec1c5dc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:13.935079Z","signature_b64":"AN0Q4NUjWcGnFKLe0KHjyWEwCWuVc7Iqskv6f0MS2IkVs1XYCC3Kf7+GZOPGduMiguPSFeTpvIlZyAu95ouVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b1a3178faaa384371ff0eb840fbc672a34612a1d6d7b3986b40e3a29df16be","last_reissued_at":"2026-07-05T02:03:13.934559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:13.934559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ergodic control of diffusions with compound Poisson jumps under a general structural hypothesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Ari Arapostathis, Guodong Pang, Yi Zheng","submitted_at":"2019-08-02T21:14:56Z","abstract_excerpt":"We study the ergodic control problem for a class of controlled jump diffusions driven by a compound Poisson process. This extends the results of [SIAM J. Control Optim. 57 (2019), no. 2, 1516-1540] to running costs that are not near-monotone. This generality is needed in applications such as optimal scheduling of large-scale parallel server networks.\n  We provide a full characterization of optimality via the Hamilton-Jacobi-Bellman (HJB) equation, for which we additionally exhibit regularity of solutions under mild hypotheses. In addition, we show that optimal stationary Markov controls are a."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01068","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01068/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.01068","created_at":"2026-07-05T02:03:13.934628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01068v1","created_at":"2026-07-05T02:03:13.934628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01068","created_at":"2026-07-05T02:03:13.934628+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGY2GF4PVKRY","created_at":"2026-07-05T02:03:13.934628+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGY2GF4PVKRYINY7","created_at":"2026-07-05T02:03:13.934628+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGY2GF4P","created_at":"2026-07-05T02:03:13.934628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06329","citing_title":"Optimal scheduling of critically loaded multiclass GI/M/n+M queues in an alternating renewal environment","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4","json":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4.json","graph_json":"https://pith.science/api/pith-number/QGY2GF4PVKRYINY76DVYID54M4/graph.json","events_json":"https://pith.science/api/pith-number/QGY2GF4PVKRYINY76DVYID54M4/events.json","paper":"https://pith.science/paper/QGY2GF4P"},"agent_actions":{"view_html":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4","download_json":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4.json","view_paper":"https://pith.science/paper/QGY2GF4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01068&json=true","fetch_graph":"https://pith.science/api/pith-number/QGY2GF4PVKRYINY76DVYID54M4/graph.json","fetch_events":"https://pith.science/api/pith-number/QGY2GF4PVKRYINY76DVYID54M4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4/action/storage_attestation","attest_author":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4/action/author_attestation","sign_citation":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4/action/citation_signature","submit_replication":"https://pith.science/pith/QGY2GF4PVKRYINY76DVYID54M4/action/replication_record"}},"created_at":"2026-07-05T02:03:13.934628+00:00","updated_at":"2026-07-05T02:03:13.934628+00:00"}