{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HHXHJWETH6IT2SKG6S5VGCSQGB","short_pith_number":"pith:HHXHJWET","schema_version":"1.0","canonical_sha256":"39ee74d8933f913d4946f4bb530a50306340e3c5ef96fbe415e0fbfd4bcf7c1c","source":{"kind":"arxiv","id":"2605.17149","version":1},"attestation_state":"computed","paper":{"title":"QPLEX Decision Processes: Formulation via Nonlinear Markov Chains and Optimization via Policy Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Antonius B. Dieker, Steven T. Hackman, Yunhao Yan, Zitong Wang","submitted_at":"2026-05-16T20:46:20Z","abstract_excerpt":"We introduce a QPLEX Decision Process (QDP) as a model for dynamic control of queueing systems with non-stationary arrivals, general service distributions, and service-level chance constraints. QDPs integrate QPLEX, a computational modeling methodology for transient analysis of stochastic systems, into a nonlinear Markov decision framework. Since QPLEX approximations use nonlinear transition probabilities with orders-of-magnitude smaller state spaces, QDPs circumvent the curse of dimensionality associated with general service times. Via forward and backward iterative schemes, we can rapidly co"},"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":"2605.17149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T20:46:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e0e5f5f78a2d476479cfd7a74c28b74eb76bbc8fe752ecf71cfbd02a3410f80c","abstract_canon_sha256":"3a764a182382865a87a7a5af9d4e373724305aa13e577c466def17654cf7e8d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:42.223217Z","signature_b64":"nTupJOgRWi9QIGjpKbY9I+2cLe4K79znuCEcTaeNWnlA8P1LEKkdkyYNSQowkHd2PXXfAUEPXDVOQInphBgCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ee74d8933f913d4946f4bb530a50306340e3c5ef96fbe415e0fbfd4bcf7c1c","last_reissued_at":"2026-05-20T00:03:42.222412Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:42.222412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QPLEX Decision Processes: Formulation via Nonlinear Markov Chains and Optimization via Policy Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Antonius B. Dieker, Steven T. Hackman, Yunhao Yan, Zitong Wang","submitted_at":"2026-05-16T20:46:20Z","abstract_excerpt":"We introduce a QPLEX Decision Process (QDP) as a model for dynamic control of queueing systems with non-stationary arrivals, general service distributions, and service-level chance constraints. QDPs integrate QPLEX, a computational modeling methodology for transient analysis of stochastic systems, into a nonlinear Markov decision framework. Since QPLEX approximations use nonlinear transition probabilities with orders-of-magnitude smaller state spaces, QDPs circumvent the curse of dimensionality associated with general service times. Via forward and backward iterative schemes, we can rapidly co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17149","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/2605.17149/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T22:33:23.766862Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:58.000354Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9857cd6c3099e2e0bcb1b255bf4cdbccf11715a99f595310ddd58784c6c2f8a3"},"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":"2605.17149","created_at":"2026-05-20T00:03:42.222530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17149v1","created_at":"2026-05-20T00:03:42.222530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17149","created_at":"2026-05-20T00:03:42.222530+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHXHJWETH6IT","created_at":"2026-05-20T00:03:42.222530+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHXHJWETH6IT2SKG","created_at":"2026-05-20T00:03:42.222530+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHXHJWET","created_at":"2026-05-20T00:03:42.222530+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/HHXHJWETH6IT2SKG6S5VGCSQGB","json":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB.json","graph_json":"https://pith.science/api/pith-number/HHXHJWETH6IT2SKG6S5VGCSQGB/graph.json","events_json":"https://pith.science/api/pith-number/HHXHJWETH6IT2SKG6S5VGCSQGB/events.json","paper":"https://pith.science/paper/HHXHJWET"},"agent_actions":{"view_html":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB","download_json":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB.json","view_paper":"https://pith.science/paper/HHXHJWET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17149&json=true","fetch_graph":"https://pith.science/api/pith-number/HHXHJWETH6IT2SKG6S5VGCSQGB/graph.json","fetch_events":"https://pith.science/api/pith-number/HHXHJWETH6IT2SKG6S5VGCSQGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB/action/storage_attestation","attest_author":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB/action/author_attestation","sign_citation":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB/action/citation_signature","submit_replication":"https://pith.science/pith/HHXHJWETH6IT2SKG6S5VGCSQGB/action/replication_record"}},"created_at":"2026-05-20T00:03:42.222530+00:00","updated_at":"2026-05-20T00:03:42.222530+00:00"}