{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SSOVJZGKC2WDSNZ5GQ4N2Q2DIS","short_pith_number":"pith:SSOVJZGK","schema_version":"1.0","canonical_sha256":"949d54e4ca16ac39373d3438dd43434492df1942eec0bcaf20634bf5a6ca703e","source":{"kind":"arxiv","id":"2408.16181","version":1},"attestation_state":"computed","paper":{"title":"A Minibatch-SGD-Based Learning Meta-Policy for Inventory Systems with Myopic Optimal Policy","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jiameng Lyu, Jinxing Xie, Shilin Yuan, Yuan Zhou","submitted_at":"2024-08-29T00:36:34Z","abstract_excerpt":"Stochastic gradient descent (SGD) has proven effective in solving many inventory control problems with demand learning. However, it often faces the pitfall of an infeasible target inventory level that is lower than the current inventory level. Several recent works (e.g., Huh and Rusmevichientong (2009), Shi et al.(2016)) are successful to resolve this issue in various inventory systems. However, their techniques are rather sophisticated and difficult to be applied to more complicated scenarios such as multi-product and multi-constraint inventory systems.\n  In this paper, we address the infeasi"},"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":"2408.16181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-29T00:36:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"72de2160613c8b23ad643a346bb66a9d4bb62e917fecfd00eca9656e278b9b7e","abstract_canon_sha256":"c0d81927921c7a6226b41cb0af764ec53dfbc276799f55f06e7514520de78cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:27.220513Z","signature_b64":"87hvlwVUrg5El2MMkpoxoyF10xxYWPHNiINDMwzxM7NeyWLYY1/i1R8H5bwOTzLO5Y+4EouS9mmeXy+2a+DJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949d54e4ca16ac39373d3438dd43434492df1942eec0bcaf20634bf5a6ca703e","last_reissued_at":"2026-07-05T09:00:27.220115Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:27.220115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Minibatch-SGD-Based Learning Meta-Policy for Inventory Systems with Myopic Optimal Policy","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jiameng Lyu, Jinxing Xie, Shilin Yuan, Yuan Zhou","submitted_at":"2024-08-29T00:36:34Z","abstract_excerpt":"Stochastic gradient descent (SGD) has proven effective in solving many inventory control problems with demand learning. However, it often faces the pitfall of an infeasible target inventory level that is lower than the current inventory level. Several recent works (e.g., Huh and Rusmevichientong (2009), Shi et al.(2016)) are successful to resolve this issue in various inventory systems. However, their techniques are rather sophisticated and difficult to be applied to more complicated scenarios such as multi-product and multi-constraint inventory systems.\n  In this paper, we address the infeasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16181","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/2408.16181/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":"2408.16181","created_at":"2026-07-05T09:00:27.220171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.16181v1","created_at":"2026-07-05T09:00:27.220171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16181","created_at":"2026-07-05T09:00:27.220171+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSOVJZGKC2WD","created_at":"2026-07-05T09:00:27.220171+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSOVJZGKC2WDSNZ5","created_at":"2026-07-05T09:00:27.220171+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSOVJZGK","created_at":"2026-07-05T09:00:27.220171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11996","citing_title":"Experimental Designs for Multi-Item Multi-Period Inventory Control","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS","json":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS.json","graph_json":"https://pith.science/api/pith-number/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/graph.json","events_json":"https://pith.science/api/pith-number/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/events.json","paper":"https://pith.science/paper/SSOVJZGK"},"agent_actions":{"view_html":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS","download_json":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS.json","view_paper":"https://pith.science/paper/SSOVJZGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.16181&json=true","fetch_graph":"https://pith.science/api/pith-number/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/graph.json","fetch_events":"https://pith.science/api/pith-number/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/action/storage_attestation","attest_author":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/action/author_attestation","sign_citation":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/action/citation_signature","submit_replication":"https://pith.science/pith/SSOVJZGKC2WDSNZ5GQ4N2Q2DIS/action/replication_record"}},"created_at":"2026-07-05T09:00:27.220171+00:00","updated_at":"2026-07-05T09:00:27.220171+00:00"}