{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:K22GBHHKTBSVH3OGFVNF7F3FTP","short_pith_number":"pith:K22GBHHK","schema_version":"1.0","canonical_sha256":"56b4609cea986553edc62d5a5f97659be46d41c5261342ca1d319d14ad0e030a","source":{"kind":"arxiv","id":"2309.11651","version":4},"attestation_state":"computed","paper":{"title":"Drift Control of High-Dimensional RBM: A Computational Method Based on Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.AP","math.OC"],"primary_cat":"eess.SY","authors_text":"Baris Ata, J. Michael Harrison, Nian Si","submitted_at":"2023-09-20T21:32:58Z","abstract_excerpt":"Motivated by applications in queueing theory, we consider a stochastic control problem whose state space is the $d$-dimensional positive orthant. The controlled process $Z$ evolves as a reflected Brownian motion whose covariance matrix is exogenously specified, as are its directions of reflection from the orthant's boundary surfaces. A system manager chooses a drift vector $\\theta(t)$ at each time $t$ based on the history of $Z$, and the cost rate at time $t$ depends on both $Z(t)$ and $\\theta(t)$. In our initial problem formulation, the objective is to minimize expected discounted cost over 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":"2309.11651","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-09-20T21:32:58Z","cross_cats_sorted":["cs.LG","cs.SY","math.AP","math.OC"],"title_canon_sha256":"241bf9f6895b00c0951a9840f51e9c1d2a43b9479281e400a18e01a8556dc322","abstract_canon_sha256":"a74bb043bf7ad0fddc3e2a87d3817a77baa4fb1d248996f71ab3a1b956bb8987"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:17.284246Z","signature_b64":"SSExff/zZgqRQxhRh5ekfiOJKyJHsTp6jPjlXX1xVg3QU06SxCvJk8/XeKPHSabMtaYdAZq+1SEo1xZiPTG9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56b4609cea986553edc62d5a5f97659be46d41c5261342ca1d319d14ad0e030a","last_reissued_at":"2026-07-05T08:53:17.283768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:17.283768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drift Control of High-Dimensional RBM: A Computational Method Based on Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.AP","math.OC"],"primary_cat":"eess.SY","authors_text":"Baris Ata, J. Michael Harrison, Nian Si","submitted_at":"2023-09-20T21:32:58Z","abstract_excerpt":"Motivated by applications in queueing theory, we consider a stochastic control problem whose state space is the $d$-dimensional positive orthant. The controlled process $Z$ evolves as a reflected Brownian motion whose covariance matrix is exogenously specified, as are its directions of reflection from the orthant's boundary surfaces. A system manager chooses a drift vector $\\theta(t)$ at each time $t$ based on the history of $Z$, and the cost rate at time $t$ depends on both $Z(t)$ and $\\theta(t)$. In our initial problem formulation, the objective is to minimize expected discounted cost over a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.11651","kind":"arxiv","version":4},"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/2309.11651/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":"2309.11651","created_at":"2026-07-05T08:53:17.283823+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.11651v4","created_at":"2026-07-05T08:53:17.283823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.11651","created_at":"2026-07-05T08:53:17.283823+00:00"},{"alias_kind":"pith_short_12","alias_value":"K22GBHHKTBSV","created_at":"2026-07-05T08:53:17.283823+00:00"},{"alias_kind":"pith_short_16","alias_value":"K22GBHHKTBSVH3OG","created_at":"2026-07-05T08:53:17.283823+00:00"},{"alias_kind":"pith_short_8","alias_value":"K22GBHHK","created_at":"2026-07-05T08:53:17.283823+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17032","citing_title":"A brief review of the Deep BSDE method for solving high-dimensional partial differential equations","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP","json":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP.json","graph_json":"https://pith.science/api/pith-number/K22GBHHKTBSVH3OGFVNF7F3FTP/graph.json","events_json":"https://pith.science/api/pith-number/K22GBHHKTBSVH3OGFVNF7F3FTP/events.json","paper":"https://pith.science/paper/K22GBHHK"},"agent_actions":{"view_html":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP","download_json":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP.json","view_paper":"https://pith.science/paper/K22GBHHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.11651&json=true","fetch_graph":"https://pith.science/api/pith-number/K22GBHHKTBSVH3OGFVNF7F3FTP/graph.json","fetch_events":"https://pith.science/api/pith-number/K22GBHHKTBSVH3OGFVNF7F3FTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP/action/storage_attestation","attest_author":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP/action/author_attestation","sign_citation":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP/action/citation_signature","submit_replication":"https://pith.science/pith/K22GBHHKTBSVH3OGFVNF7F3FTP/action/replication_record"}},"created_at":"2026-07-05T08:53:17.283823+00:00","updated_at":"2026-07-05T08:53:17.283823+00:00"}