{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BSAYWCI4EJJDSHQCSATQZAZOKE","short_pith_number":"pith:BSAYWCI4","schema_version":"1.0","canonical_sha256":"0c818b091c2252391e0290270c832e511f4eff6d1d04ddbcb356135f5a6badaa","source":{"kind":"arxiv","id":"2511.11830","version":2},"attestation_state":"computed","paper":{"title":"A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Bar{\\i}\\c{s} Ata, Wouter van Eekelen, Yuan Zhong","submitted_at":"2025-11-14T19:45:23Z","abstract_excerpt":"We consider a discrete-time formulation for a class of high-dimensional stochastic joint replenishment problems. First, we approximate the problem by a continuous-time impulse control problem. Exploiting connections among the impulse control problem, backward stochastic differential equations (BSDEs) with jumps, and the stochastic target problem, we develop a novel, simulation-based computational method that relies on deep neural networks to solve the impulse control problem. Based on that solution, we propose an implementable inventory control policy for the original (discrete-time) stochasti"},"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":"2511.11830","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-14T19:45:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"42de170c2b097722714b27983258ba00998c02f8348e845d3cc86c7119981b47","abstract_canon_sha256":"37d2a55e7936b6a0344df39fc8e066b2ef79b4df3ca3514bd176b10cbe1276ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:04:58.194401Z","signature_b64":"rSVTW5AoZKDg6S50r3+fXdZAgY0PDvJlP2TxhTEw8cglnU3j24x2f54WCLe1do9CaaeGNXRlYIJsmjKynwcVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c818b091c2252391e0290270c832e511f4eff6d1d04ddbcb356135f5a6badaa","last_reissued_at":"2026-05-29T01:04:58.193549Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:04:58.193549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Bar{\\i}\\c{s} Ata, Wouter van Eekelen, Yuan Zhong","submitted_at":"2025-11-14T19:45:23Z","abstract_excerpt":"We consider a discrete-time formulation for a class of high-dimensional stochastic joint replenishment problems. First, we approximate the problem by a continuous-time impulse control problem. Exploiting connections among the impulse control problem, backward stochastic differential equations (BSDEs) with jumps, and the stochastic target problem, we develop a novel, simulation-based computational method that relies on deep neural networks to solve the impulse control problem. Based on that solution, we propose an implementable inventory control policy for the original (discrete-time) stochasti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.11830","kind":"arxiv","version":2},"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/2511.11830/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":"2511.11830","created_at":"2026-05-29T01:04:58.193652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.11830v2","created_at":"2026-05-29T01:04:58.193652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.11830","created_at":"2026-05-29T01:04:58.193652+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSAYWCI4EJJD","created_at":"2026-05-29T01:04:58.193652+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSAYWCI4EJJDSHQC","created_at":"2026-05-29T01:04:58.193652+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSAYWCI4","created_at":"2026-05-29T01:04:58.193652+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.08091","citing_title":"Deep Learning Method for Stationary Distribution of Reflected Brownian Motion","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14297","citing_title":"Policy Optimization in Hybrid Discrete-Continuous Action Spaces via Mixed Gradients","ref_index":115,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE","json":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE.json","graph_json":"https://pith.science/api/pith-number/BSAYWCI4EJJDSHQCSATQZAZOKE/graph.json","events_json":"https://pith.science/api/pith-number/BSAYWCI4EJJDSHQCSATQZAZOKE/events.json","paper":"https://pith.science/paper/BSAYWCI4"},"agent_actions":{"view_html":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE","download_json":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE.json","view_paper":"https://pith.science/paper/BSAYWCI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.11830&json=true","fetch_graph":"https://pith.science/api/pith-number/BSAYWCI4EJJDSHQCSATQZAZOKE/graph.json","fetch_events":"https://pith.science/api/pith-number/BSAYWCI4EJJDSHQCSATQZAZOKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE/action/storage_attestation","attest_author":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE/action/author_attestation","sign_citation":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE/action/citation_signature","submit_replication":"https://pith.science/pith/BSAYWCI4EJJDSHQCSATQZAZOKE/action/replication_record"}},"created_at":"2026-05-29T01:04:58.193652+00:00","updated_at":"2026-05-29T01:04:58.193652+00:00"}