{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3NGFUN4DLPV46XH26FT2RQZDVF","short_pith_number":"pith:3NGFUN4D","canonical_record":{"source":{"id":"1710.05739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T14:33:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e640ce6a98e98cfd5960d5d18e3a16eb820563155293c099463d07d1fef469a9","abstract_canon_sha256":"cad587932b3ef9a62fb6e2b9e9974f51d9d5462d50ea4053c14cd1b624b34e7f"},"schema_version":"1.0"},"canonical_sha256":"db4c5a37835bebcf5cfaf167a8c323a972f10967743fbb10be31638de7bd2f11","source":{"kind":"arxiv","id":"1710.05739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05739","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05739v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05739","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"3NGFUN4DLPV4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3NGFUN4DLPV46XH2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3NGFUN4D","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3NGFUN4DLPV46XH26FT2RQZDVF","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T14:33:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e640ce6a98e98cfd5960d5d18e3a16eb820563155293c099463d07d1fef469a9","abstract_canon_sha256":"cad587932b3ef9a62fb6e2b9e9974f51d9d5462d50ea4053c14cd1b624b34e7f"},"schema_version":"1.0"},"canonical_sha256":"db4c5a37835bebcf5cfaf167a8c323a972f10967743fbb10be31638de7bd2f11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:48.327358Z","signature_b64":"SQw2bX+K7xrkLGQ/nFghvYi+YqNv8H7vIClz22nk/sKukhQRxXzYcbfvQ5WiFQRHtgE20CWlsFcIcBb0TIkABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db4c5a37835bebcf5cfaf167a8c323a972f10967743fbb10be31638de7bd2f11","last_reissued_at":"2026-05-18T00:32:48.326585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:48.326585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05739","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1W0rLGlP8EdNT0Wqf7gxxB5Dp4XSKUD6De/n0zvO+hjGdcBd+h5wptfzKfIyu6UfKzSy+dwVeMhVG+JStGwXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:16:33.446250Z"},"content_sha256":"6854b1932c38e41b5ac63195ae9a75f02bbf14a305618b4b5597299528f35936","schema_version":"1.0","event_id":"sha256:6854b1932c38e41b5ac63195ae9a75f02bbf14a305618b4b5597299528f35936"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3NGFUN4DLPV46XH26FT2RQZDVF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of Inventory Management with Censored Demand Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"G\\'abor Lugosi, Gergely Neu, Mihalis G. Markakis","submitted_at":"2017-10-16T14:33:59Z","abstract_excerpt":"We consider a repeated newsvendor problem where the inventory manager has no prior information about the demand, and can access only censored/sales data. In analogy to multi-armed bandit problems, the manager needs to simultaneously \"explore\" and \"exploit\" with her inventory decisions, in order to minimize the cumulative cost. We make no probabilistic assumptions---importantly, independence or time stationarity---regarding the mechanism that creates the demand sequence. Our goal is to shed light on the hardness of the problem, and to develop policies that perform well with respect to the regre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05739","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4ivClnb1vWMzHuNPYNlLhjQr1QoR2JRRshZ9kAiEgaZAYIQB84/KZPBupGMj3eFv+XNeWdoupqANfZW4UWZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:16:33.446972Z"},"content_sha256":"87315777b166370689a1ab686a96384cc7c4e3766b14ce72373ddf97ba892491","schema_version":"1.0","event_id":"sha256:87315777b166370689a1ab686a96384cc7c4e3766b14ce72373ddf97ba892491"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NGFUN4DLPV46XH26FT2RQZDVF/bundle.json","state_url":"https://pith.science/pith/3NGFUN4DLPV46XH26FT2RQZDVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NGFUN4DLPV46XH26FT2RQZDVF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T22:16:33Z","links":{"resolver":"https://pith.science/pith/3NGFUN4DLPV46XH26FT2RQZDVF","bundle":"https://pith.science/pith/3NGFUN4DLPV46XH26FT2RQZDVF/bundle.json","state":"https://pith.science/pith/3NGFUN4DLPV46XH26FT2RQZDVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NGFUN4DLPV46XH26FT2RQZDVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3NGFUN4DLPV46XH26FT2RQZDVF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cad587932b3ef9a62fb6e2b9e9974f51d9d5462d50ea4053c14cd1b624b34e7f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T14:33:59Z","title_canon_sha256":"e640ce6a98e98cfd5960d5d18e3a16eb820563155293c099463d07d1fef469a9"},"schema_version":"1.0","source":{"id":"1710.05739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05739","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05739v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05739","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"3NGFUN4DLPV4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3NGFUN4DLPV46XH2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3NGFUN4D","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:87315777b166370689a1ab686a96384cc7c4e3766b14ce72373ddf97ba892491","target":"graph","created_at":"2026-05-18T00:32:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a repeated newsvendor problem where the inventory manager has no prior information about the demand, and can access only censored/sales data. In analogy to multi-armed bandit problems, the manager needs to simultaneously \"explore\" and \"exploit\" with her inventory decisions, in order to minimize the cumulative cost. We make no probabilistic assumptions---importantly, independence or time stationarity---regarding the mechanism that creates the demand sequence. Our goal is to shed light on the hardness of the problem, and to develop policies that perform well with respect to the regre","authors_text":"G\\'abor Lugosi, Gergely Neu, Mihalis G. Markakis","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T14:33:59Z","title":"On the Hardness of Inventory Management with Censored Demand Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05739","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6854b1932c38e41b5ac63195ae9a75f02bbf14a305618b4b5597299528f35936","target":"record","created_at":"2026-05-18T00:32:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cad587932b3ef9a62fb6e2b9e9974f51d9d5462d50ea4053c14cd1b624b34e7f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T14:33:59Z","title_canon_sha256":"e640ce6a98e98cfd5960d5d18e3a16eb820563155293c099463d07d1fef469a9"},"schema_version":"1.0","source":{"id":"1710.05739","kind":"arxiv","version":1}},"canonical_sha256":"db4c5a37835bebcf5cfaf167a8c323a972f10967743fbb10be31638de7bd2f11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db4c5a37835bebcf5cfaf167a8c323a972f10967743fbb10be31638de7bd2f11","first_computed_at":"2026-05-18T00:32:48.326585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:48.326585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SQw2bX+K7xrkLGQ/nFghvYi+YqNv8H7vIClz22nk/sKukhQRxXzYcbfvQ5WiFQRHtgE20CWlsFcIcBb0TIkABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:48.327358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6854b1932c38e41b5ac63195ae9a75f02bbf14a305618b4b5597299528f35936","sha256:87315777b166370689a1ab686a96384cc7c4e3766b14ce72373ddf97ba892491"],"state_sha256":"a593297b2c03b6a154e5c5f27aa32b5758459b0bfcf9be178a088f3b5d8a0a29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFhxmmP75i9prKilwe4KsRDnNtlXWMUBOq/uNxXNcAlHCx20nvounzMwNAbLjk9CL6gUrx8yvM/ZfnRGlre7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T22:16:33.450743Z","bundle_sha256":"59a331f8af7ba5f0d5e257df568935ccf16c4f90f18ab956c8e50c9f27d895e3"}}