{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JMGAQXA545F5N4RVFH5IU4HKLG","short_pith_number":"pith:JMGAQXA5","schema_version":"1.0","canonical_sha256":"4b0c085c1de74bd6f23529fa8a70ea5988069a141abcab0008f911acae34bda7","source":{"kind":"arxiv","id":"2309.13830","version":2},"attestation_state":"computed","paper":{"title":"Deep Neural Newsvendor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guohao Shen, Jinhui Han, Ming Hu","submitted_at":"2023-09-25T02:34:13Z","abstract_excerpt":"We consider a data-driven newsvendor problem, where one has access to past demand data and the associated feature information. We solve the problem by estimating the target quantile function using a deep neural network (DNN). The remarkable representational power of DNN allows our framework to incorporate or approximate various extant data-driven models. We provide theoretical guarantees in terms of excess risk bounds for the DNN solution characterized by the network structure and sample size in a non-asymptotic manner, which justify the applicability of DNNs in the relevant contexts. Specific"},"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.13830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-25T02:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"5cfbbc012f7d7c6163760818ee6230875bc2ccb50a72a549c7de4ecf4ed5aac0","abstract_canon_sha256":"a479d1702e72a29e81bab4878d3b9a52f4f37d84a2d7b7fc6322f519ebe8e8ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:13:33.620112Z","signature_b64":"fFDoagoF5WrSB9cbV0yKudmRaeRnQeFGVfkGT7NHV4EbFQE5mMFDDl1awJL4CH8ve2A0QOELeaqu3yoTEbTFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0c085c1de74bd6f23529fa8a70ea5988069a141abcab0008f911acae34bda7","last_reissued_at":"2026-07-05T09:13:33.619611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:13:33.619611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Neural Newsvendor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guohao Shen, Jinhui Han, Ming Hu","submitted_at":"2023-09-25T02:34:13Z","abstract_excerpt":"We consider a data-driven newsvendor problem, where one has access to past demand data and the associated feature information. We solve the problem by estimating the target quantile function using a deep neural network (DNN). The remarkable representational power of DNN allows our framework to incorporate or approximate various extant data-driven models. We provide theoretical guarantees in terms of excess risk bounds for the DNN solution characterized by the network structure and sample size in a non-asymptotic manner, which justify the applicability of DNNs in the relevant contexts. Specific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13830","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/2309.13830/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.13830","created_at":"2026-07-05T09:13:33.619669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.13830v2","created_at":"2026-07-05T09:13:33.619669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13830","created_at":"2026-07-05T09:13:33.619669+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMGAQXA545F5","created_at":"2026-07-05T09:13:33.619669+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMGAQXA545F5N4RV","created_at":"2026-07-05T09:13:33.619669+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMGAQXA5","created_at":"2026-07-05T09:13:33.619669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00369","citing_title":"InvEvolve: Evolving White-Box Inventory Policies via Large Language Models with Performance Guarantees","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00369","citing_title":"InvEvolve: Evolving White-Box Inventory Policies via Large Language Models with Performance Guarantees","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG","json":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG.json","graph_json":"https://pith.science/api/pith-number/JMGAQXA545F5N4RVFH5IU4HKLG/graph.json","events_json":"https://pith.science/api/pith-number/JMGAQXA545F5N4RVFH5IU4HKLG/events.json","paper":"https://pith.science/paper/JMGAQXA5"},"agent_actions":{"view_html":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG","download_json":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG.json","view_paper":"https://pith.science/paper/JMGAQXA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.13830&json=true","fetch_graph":"https://pith.science/api/pith-number/JMGAQXA545F5N4RVFH5IU4HKLG/graph.json","fetch_events":"https://pith.science/api/pith-number/JMGAQXA545F5N4RVFH5IU4HKLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG/action/storage_attestation","attest_author":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG/action/author_attestation","sign_citation":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG/action/citation_signature","submit_replication":"https://pith.science/pith/JMGAQXA545F5N4RVFH5IU4HKLG/action/replication_record"}},"created_at":"2026-07-05T09:13:33.619669+00:00","updated_at":"2026-07-05T09:13:33.619669+00:00"}