{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GLJZFMC2E36M6LUNJ2GQXU24GE","short_pith_number":"pith:GLJZFMC2","schema_version":"1.0","canonical_sha256":"32d392b05a26fccf2e8d4e8d0bd35c3138206f02cdbfd41b5c5ee311f4a5fccb","source":{"kind":"arxiv","id":"2310.17168","version":2},"attestation_state":"computed","paper":{"title":"Learning an Inventory Control Policy with General Inventory Arrival Dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carson Eisenach, Dean Foster, Dhruv Madeka, Kari Torkkola, Randy Jia, Sham Kakade, Sohrab Andaz","submitted_at":"2023-10-26T05:49:13Z","abstract_excerpt":"In this paper we address the problem of learning and backtesting inventory control policies in the presence of general arrival dynamics -- which we term as a quantity-over-time arrivals model (QOT). We also allow for order quantities to be modified as a post-processing step to meet vendor constraints such as order minimum and batch size constraints -- a common practice in real supply chains. To the best of our knowledge this is the first work to handle either arbitrary arrival dynamics or an arbitrary downstream post-processing of order quantities. Building upon recent work (Madeka et al., 202"},"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":"2310.17168","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T05:49:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a70c433ba590e9591c5fefd3d03ed5e232bf6926da6a6b36c47607616db759e","abstract_canon_sha256":"84efa1ae27311f05b604daee0f99eb241456aa595a84279563b3ec8de21acd0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:04.242503Z","signature_b64":"iEj2PJP92QeupoT9HILr6WHiCkLF3+HmFUaCzhq/N4M2Me2y131ipmrf9J+qkL6et5eL23ZMm6QPzBbjty5/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d392b05a26fccf2e8d4e8d0bd35c3138206f02cdbfd41b5c5ee311f4a5fccb","last_reissued_at":"2026-07-05T07:36:04.242122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:04.242122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning an Inventory Control Policy with General Inventory Arrival Dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carson Eisenach, Dean Foster, Dhruv Madeka, Kari Torkkola, Randy Jia, Sham Kakade, Sohrab Andaz","submitted_at":"2023-10-26T05:49:13Z","abstract_excerpt":"In this paper we address the problem of learning and backtesting inventory control policies in the presence of general arrival dynamics -- which we term as a quantity-over-time arrivals model (QOT). We also allow for order quantities to be modified as a post-processing step to meet vendor constraints such as order minimum and batch size constraints -- a common practice in real supply chains. To the best of our knowledge this is the first work to handle either arbitrary arrival dynamics or an arbitrary downstream post-processing of order quantities. Building upon recent work (Madeka et al., 202"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17168","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/2310.17168/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":"2310.17168","created_at":"2026-07-05T07:36:04.242174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.17168v2","created_at":"2026-07-05T07:36:04.242174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17168","created_at":"2026-07-05T07:36:04.242174+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLJZFMC2E36M","created_at":"2026-07-05T07:36:04.242174+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLJZFMC2E36M6LUN","created_at":"2026-07-05T07:36:04.242174+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLJZFMC2","created_at":"2026-07-05T07:36:04.242174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13900","citing_title":"Ready from Day 1: Population-Aware Coordination for Large-Scale Constrained Multi-Agent Systems","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13900","citing_title":"Ready from Day 1: Population-Aware Coordination for Large-Scale Constrained Multi-Agent Systems","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE","json":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE.json","graph_json":"https://pith.science/api/pith-number/GLJZFMC2E36M6LUNJ2GQXU24GE/graph.json","events_json":"https://pith.science/api/pith-number/GLJZFMC2E36M6LUNJ2GQXU24GE/events.json","paper":"https://pith.science/paper/GLJZFMC2"},"agent_actions":{"view_html":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE","download_json":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE.json","view_paper":"https://pith.science/paper/GLJZFMC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.17168&json=true","fetch_graph":"https://pith.science/api/pith-number/GLJZFMC2E36M6LUNJ2GQXU24GE/graph.json","fetch_events":"https://pith.science/api/pith-number/GLJZFMC2E36M6LUNJ2GQXU24GE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE/action/storage_attestation","attest_author":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE/action/author_attestation","sign_citation":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE/action/citation_signature","submit_replication":"https://pith.science/pith/GLJZFMC2E36M6LUNJ2GQXU24GE/action/replication_record"}},"created_at":"2026-07-05T07:36:04.242174+00:00","updated_at":"2026-07-05T07:36:04.242174+00:00"}