{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HLEM6AWXBROOHVCUU3J6H7EPW3","short_pith_number":"pith:HLEM6AWX","schema_version":"1.0","canonical_sha256":"3ac8cf02d70c5ce3d454a6d3e3fc8fb6c0464fbd05f37963e39cd4bb9e363a5a","source":{"kind":"arxiv","id":"1807.07034","version":1},"attestation_state":"computed","paper":{"title":"Heuristic Policies for Stochastic Knapsack Problem with Time-Varying Random Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yingdong Lu","submitted_at":"2018-07-18T16:38:44Z","abstract_excerpt":"In this paper, we consider the classic stochastic (dynamic) knapsack problem, a fundamental mathematical model in revenue management, with general time-varying random demand. Our main goal is to study the optimal policies, which can be obtained by solving the dynamic programming formulated for the problem, both qualitatively and quantitatively. It is well-known that when the demand size is fixed and the demand distribution is stationary over time, the value function of the dynamic programming exhibits extremely useful first and second order monotonicity properties, which lead to monotonicity p"},"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":"1807.07034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-18T16:38:44Z","cross_cats_sorted":[],"title_canon_sha256":"b38bbfe3c0d4f736f7e3ab7cb4bad8086e4ce1c027e9a83725397dc16be14373","abstract_canon_sha256":"c8d07c8e1c949b2869270a7264670405e7548d01ee419a219672f7ce95a87a5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.031522Z","signature_b64":"nsIoabv43SjbovgqZ3mnZULK54IdVwm1ZnHcynK9M+2/+6uSdLfnrksvgyq9/toly4ra1r/eA7Fs8T97hSE4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac8cf02d70c5ce3d454a6d3e3fc8fb6c0464fbd05f37963e39cd4bb9e363a5a","last_reissued_at":"2026-05-18T00:10:25.030931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.030931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristic Policies for Stochastic Knapsack Problem with Time-Varying Random Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yingdong Lu","submitted_at":"2018-07-18T16:38:44Z","abstract_excerpt":"In this paper, we consider the classic stochastic (dynamic) knapsack problem, a fundamental mathematical model in revenue management, with general time-varying random demand. Our main goal is to study the optimal policies, which can be obtained by solving the dynamic programming formulated for the problem, both qualitatively and quantitatively. It is well-known that when the demand size is fixed and the demand distribution is stationary over time, the value function of the dynamic programming exhibits extremely useful first and second order monotonicity properties, which lead to monotonicity p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07034","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.07034","created_at":"2026-05-18T00:10:25.031019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07034v1","created_at":"2026-05-18T00:10:25.031019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07034","created_at":"2026-05-18T00:10:25.031019+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLEM6AWXBROO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLEM6AWXBROOHVCU","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLEM6AWX","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3","json":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3.json","graph_json":"https://pith.science/api/pith-number/HLEM6AWXBROOHVCUU3J6H7EPW3/graph.json","events_json":"https://pith.science/api/pith-number/HLEM6AWXBROOHVCUU3J6H7EPW3/events.json","paper":"https://pith.science/paper/HLEM6AWX"},"agent_actions":{"view_html":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3","download_json":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3.json","view_paper":"https://pith.science/paper/HLEM6AWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07034&json=true","fetch_graph":"https://pith.science/api/pith-number/HLEM6AWXBROOHVCUU3J6H7EPW3/graph.json","fetch_events":"https://pith.science/api/pith-number/HLEM6AWXBROOHVCUU3J6H7EPW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3/action/storage_attestation","attest_author":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3/action/author_attestation","sign_citation":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3/action/citation_signature","submit_replication":"https://pith.science/pith/HLEM6AWXBROOHVCUU3J6H7EPW3/action/replication_record"}},"created_at":"2026-05-18T00:10:25.031019+00:00","updated_at":"2026-05-18T00:10:25.031019+00:00"}