{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H4ODF2GAZF7BTJFEO26GZHZBFY","short_pith_number":"pith:H4ODF2GA","canonical_record":{"source":{"id":"1307.5942","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-23T04:01:30Z","cross_cats_sorted":["cs.SY","math.PR"],"title_canon_sha256":"84e1d11224923ef08a45c89e4c7e1a9f37eb294fedcaee46a5a1fff2d5194a35","abstract_canon_sha256":"057ca0c6c55ebf0f1cf1e0b09189a82a639443322e9819286c1d1dcc00d8d83a"},"schema_version":"1.0"},"canonical_sha256":"3f1c32e8c0c97e19a4a476bc6c9f212e0a46cafb2c67a8f89bf95fffdfdc805e","source":{"kind":"arxiv","id":"1307.5942","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5942","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5942v5","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5942","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"H4ODF2GAZF7B","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H4ODF2GAZF7BTJFE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H4ODF2GA","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H4ODF2GAZF7BTJFEO26GZHZBFY","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5942","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-23T04:01:30Z","cross_cats_sorted":["cs.SY","math.PR"],"title_canon_sha256":"84e1d11224923ef08a45c89e4c7e1a9f37eb294fedcaee46a5a1fff2d5194a35","abstract_canon_sha256":"057ca0c6c55ebf0f1cf1e0b09189a82a639443322e9819286c1d1dcc00d8d83a"},"schema_version":"1.0"},"canonical_sha256":"3f1c32e8c0c97e19a4a476bc6c9f212e0a46cafb2c67a8f89bf95fffdfdc805e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:39.650018Z","signature_b64":"TtnLwrs+IXfoF3lpsvLI32l+kS+sYBWYwkvIb2Vk0gxSkSAfbgjQtpSJn0vc88tpaD3/bdSxCTOLCwLPvSnLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1c32e8c0c97e19a4a476bc6c9f212e0a46cafb2c67a8f89bf95fffdfdc805e","last_reissued_at":"2026-05-18T02:42:39.649460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:39.649460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5942","source_version":5,"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-18T02:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpbRsBkRu5GIw0NwfSSF556pC0+Otyek1CbMU2wupvrZf4/qRz/QS/Od+kU0L4wULSzv05Z0I4ZPC3+A2G1fCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:25:56.134982Z"},"content_sha256":"d068e84318ae0d532dadf9cdbffdc8d0c1ac0dd01ba6f283371451417d3947c9","schema_version":"1.0","event_id":"sha256:d068e84318ae0d532dadf9cdbffdc8d0c1ac0dd01ba6f283371451417d3947c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H4ODF2GAZF7BTJFEO26GZHZBFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A unified modeling approach for the static-dynamic uncertainty strategy in stochastic lot-sizing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Onur A. Kilic, Roberto Rossi, S. Armagan Tarim","submitted_at":"2013-07-23T04:01:30Z","abstract_excerpt":"In this paper, we develop mixed integer linear programming models to compute near-optimal policy parameters for the non-stationary stochastic lot sizing problem under Bookbinder and Tan's static-dynamic uncertainty strategy. Our models build on piecewise linear upper and lower bounds of the first order loss function. We discuss different formulations of the stochastic lot sizing problem, in which the quality of service is captured by means of backorder penalty costs, non-stockout probability, or fill rate constraints. These models can be easily adapted to operate in settings in which unmet dem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5942","kind":"arxiv","version":5},"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-18T02:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27IxWRMmgqgPhDgdH72mQ+cQ11xHmpgOxJT0OZy8p40fSrrMj9WbPuOdmjNKDga7dCCvNwPbwnd6pqkjNBHDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:25:56.135774Z"},"content_sha256":"6791a677f0a0aa5c19bd8d8af5ac2926b009c375347b286df86a72fe8679b01f","schema_version":"1.0","event_id":"sha256:6791a677f0a0aa5c19bd8d8af5ac2926b009c375347b286df86a72fe8679b01f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4ODF2GAZF7BTJFEO26GZHZBFY/bundle.json","state_url":"https://pith.science/pith/H4ODF2GAZF7BTJFEO26GZHZBFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4ODF2GAZF7BTJFEO26GZHZBFY/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-30T20:25:56Z","links":{"resolver":"https://pith.science/pith/H4ODF2GAZF7BTJFEO26GZHZBFY","bundle":"https://pith.science/pith/H4ODF2GAZF7BTJFEO26GZHZBFY/bundle.json","state":"https://pith.science/pith/H4ODF2GAZF7BTJFEO26GZHZBFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4ODF2GAZF7BTJFEO26GZHZBFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H4ODF2GAZF7BTJFEO26GZHZBFY","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":"057ca0c6c55ebf0f1cf1e0b09189a82a639443322e9819286c1d1dcc00d8d83a","cross_cats_sorted":["cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-23T04:01:30Z","title_canon_sha256":"84e1d11224923ef08a45c89e4c7e1a9f37eb294fedcaee46a5a1fff2d5194a35"},"schema_version":"1.0","source":{"id":"1307.5942","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5942","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5942v5","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5942","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"H4ODF2GAZF7B","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H4ODF2GAZF7BTJFE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H4ODF2GA","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:6791a677f0a0aa5c19bd8d8af5ac2926b009c375347b286df86a72fe8679b01f","target":"graph","created_at":"2026-05-18T02:42:39Z","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":"In this paper, we develop mixed integer linear programming models to compute near-optimal policy parameters for the non-stationary stochastic lot sizing problem under Bookbinder and Tan's static-dynamic uncertainty strategy. Our models build on piecewise linear upper and lower bounds of the first order loss function. We discuss different formulations of the stochastic lot sizing problem, in which the quality of service is captured by means of backorder penalty costs, non-stockout probability, or fill rate constraints. These models can be easily adapted to operate in settings in which unmet dem","authors_text":"Onur A. Kilic, Roberto Rossi, S. Armagan Tarim","cross_cats":["cs.SY","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-23T04:01:30Z","title":"A unified modeling approach for the static-dynamic uncertainty strategy in stochastic lot-sizing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5942","kind":"arxiv","version":5},"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:d068e84318ae0d532dadf9cdbffdc8d0c1ac0dd01ba6f283371451417d3947c9","target":"record","created_at":"2026-05-18T02:42:39Z","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":"057ca0c6c55ebf0f1cf1e0b09189a82a639443322e9819286c1d1dcc00d8d83a","cross_cats_sorted":["cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-23T04:01:30Z","title_canon_sha256":"84e1d11224923ef08a45c89e4c7e1a9f37eb294fedcaee46a5a1fff2d5194a35"},"schema_version":"1.0","source":{"id":"1307.5942","kind":"arxiv","version":5}},"canonical_sha256":"3f1c32e8c0c97e19a4a476bc6c9f212e0a46cafb2c67a8f89bf95fffdfdc805e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f1c32e8c0c97e19a4a476bc6c9f212e0a46cafb2c67a8f89bf95fffdfdc805e","first_computed_at":"2026-05-18T02:42:39.649460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:39.649460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TtnLwrs+IXfoF3lpsvLI32l+kS+sYBWYwkvIb2Vk0gxSkSAfbgjQtpSJn0vc88tpaD3/bdSxCTOLCwLPvSnLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:39.650018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5942","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d068e84318ae0d532dadf9cdbffdc8d0c1ac0dd01ba6f283371451417d3947c9","sha256:6791a677f0a0aa5c19bd8d8af5ac2926b009c375347b286df86a72fe8679b01f"],"state_sha256":"e9585e4b4a1e01a83c4e40fb9410fd506839ae977f316572531670f65481cf6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StOOjrjFGCU60jNNx881QhowWZUttUVjNf/pGxa1iVASWAM+uUYTVq3wffsqfM69R/Tteofb/xEuOQ4MfTx1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:25:56.140219Z","bundle_sha256":"12f30ac442a6cdc34959afab03d2118d9db9f2f6469cd8c8f82b2c16c5fd0539"}}