{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KGUCMDVW2HKJR5VPRIXA3W3Z4Z","short_pith_number":"pith:KGUCMDVW","canonical_record":{"source":{"id":"1605.01442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"782eb86f8854391d2f80c037bf49b1ae925b98a3c1daca64aa2b652b6e679402","abstract_canon_sha256":"dbb31649a09448ab2db7f8c857cd0f1f91e138809c98a60fe2c2a0a5ba849fa2"},"schema_version":"1.0"},"canonical_sha256":"51a8260eb6d1d498f6af8a2e0ddb79e65736f607aed757bfed5273339abeba70","source":{"kind":"arxiv","id":"1605.01442","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01442","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01442v2","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01442","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"KGUCMDVW2HKJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KGUCMDVW2HKJR5VP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KGUCMDVW","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KGUCMDVW2HKJR5VPRIXA3W3Z4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"782eb86f8854391d2f80c037bf49b1ae925b98a3c1daca64aa2b652b6e679402","abstract_canon_sha256":"dbb31649a09448ab2db7f8c857cd0f1f91e138809c98a60fe2c2a0a5ba849fa2"},"schema_version":"1.0"},"canonical_sha256":"51a8260eb6d1d498f6af8a2e0ddb79e65736f607aed757bfed5273339abeba70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:22.207877Z","signature_b64":"noZ/D5GgTw83rt41cEPDK9NEB0G7DpYt7xf4f7CSWgnwqgjZKmhwBthd8y1koeBLR3iL2RVtjiowr9aT3Do1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a8260eb6d1d498f6af8a2e0ddb79e65736f607aed757bfed5273339abeba70","last_reissued_at":"2026-05-18T01:15:22.207265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:22.207265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01442","source_version":2,"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-18T01:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMeIA8TDIXQ2wjHacMhKfDX2uDXO5sMCNFRJNSBszF7QXsgN75Yuv8J83eho7wXsXeOPx/+J7aWaDfHd0MKlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:38:22.978812Z"},"content_sha256":"9b2c632ebe5b5870056972f2ee89fd297793e688e4cec6d61b26e9d355fca8fa","schema_version":"1.0","event_id":"sha256:9b2c632ebe5b5870056972f2ee89fd297793e688e4cec6d61b26e9d355fca8fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KGUCMDVW2HKJR5VPRIXA3W3Z4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2-Approximation Algorithms for Perishable Inventory Control When FIFO Is an Optimal Issuing Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Can Zhang, Chelsea C. White III, Turgay Ayer","submitted_at":"2016-05-04T21:46:02Z","abstract_excerpt":"We consider a periodic-review, fixed-lifetime perishable inventory control problem where demand is a general stochastic process. The optimal solution for this problem is intractable due to \"curse of dimensionality\". In this paper, we first present a computationally efficient algorithm that we call the marginal-cost dual-balancing policy for perishable inventory control problem. We then prove that a myopic policy under the so-called marginal-cost accounting scheme provides a lower bound on the optimal ordering quantity. By combining the specific lower bound we derive and any upper bound on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01442","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":""},"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-18T01:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+Ub8hiecusZ5xc/hOzfyebWNfadA8+/Wr8uMZWEwqfJLWjES1JmJ+0Syb+z4V0BwdWJrLd6qADMvOXbbU3IBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:38:22.979162Z"},"content_sha256":"c17469d06335c3450c08780e1b47052d86f0a31d8c41f97f1767f053a9d1bb84","schema_version":"1.0","event_id":"sha256:c17469d06335c3450c08780e1b47052d86f0a31d8c41f97f1767f053a9d1bb84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z/bundle.json","state_url":"https://pith.science/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z/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-06-24T04:38:22Z","links":{"resolver":"https://pith.science/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z","bundle":"https://pith.science/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z/bundle.json","state":"https://pith.science/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGUCMDVW2HKJR5VPRIXA3W3Z4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KGUCMDVW2HKJR5VPRIXA3W3Z4Z","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":"dbb31649a09448ab2db7f8c857cd0f1f91e138809c98a60fe2c2a0a5ba849fa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:46:02Z","title_canon_sha256":"782eb86f8854391d2f80c037bf49b1ae925b98a3c1daca64aa2b652b6e679402"},"schema_version":"1.0","source":{"id":"1605.01442","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01442","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01442v2","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01442","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"KGUCMDVW2HKJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KGUCMDVW2HKJR5VP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KGUCMDVW","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:c17469d06335c3450c08780e1b47052d86f0a31d8c41f97f1767f053a9d1bb84","target":"graph","created_at":"2026-05-18T01:15:22Z","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 periodic-review, fixed-lifetime perishable inventory control problem where demand is a general stochastic process. The optimal solution for this problem is intractable due to \"curse of dimensionality\". In this paper, we first present a computationally efficient algorithm that we call the marginal-cost dual-balancing policy for perishable inventory control problem. We then prove that a myopic policy under the so-called marginal-cost accounting scheme provides a lower bound on the optimal ordering quantity. By combining the specific lower bound we derive and any upper bound on the ","authors_text":"Can Zhang, Chelsea C. White III, Turgay Ayer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:46:02Z","title":"2-Approximation Algorithms for Perishable Inventory Control When FIFO Is an Optimal Issuing Policy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01442","kind":"arxiv","version":2},"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:9b2c632ebe5b5870056972f2ee89fd297793e688e4cec6d61b26e9d355fca8fa","target":"record","created_at":"2026-05-18T01:15:22Z","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":"dbb31649a09448ab2db7f8c857cd0f1f91e138809c98a60fe2c2a0a5ba849fa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:46:02Z","title_canon_sha256":"782eb86f8854391d2f80c037bf49b1ae925b98a3c1daca64aa2b652b6e679402"},"schema_version":"1.0","source":{"id":"1605.01442","kind":"arxiv","version":2}},"canonical_sha256":"51a8260eb6d1d498f6af8a2e0ddb79e65736f607aed757bfed5273339abeba70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51a8260eb6d1d498f6af8a2e0ddb79e65736f607aed757bfed5273339abeba70","first_computed_at":"2026-05-18T01:15:22.207265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:22.207265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"noZ/D5GgTw83rt41cEPDK9NEB0G7DpYt7xf4f7CSWgnwqgjZKmhwBthd8y1koeBLR3iL2RVtjiowr9aT3Do1BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:22.207877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01442","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b2c632ebe5b5870056972f2ee89fd297793e688e4cec6d61b26e9d355fca8fa","sha256:c17469d06335c3450c08780e1b47052d86f0a31d8c41f97f1767f053a9d1bb84"],"state_sha256":"f026f75df923aa27528d2353ac7a67a493b621b0afae7c0594bb822d258c8320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpfDCVY9yxNScZXovFEmYhxHkx7+NvNHeEgUO7sEdIThJlkDfQ6vnHMORIbWOAph01AxjVPiAy3o+I1t8frODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:38:22.981162Z","bundle_sha256":"2e014eb0698975f6886bff4d570f882ce8e5dd4da4c02bf366ec746ee7218c9a"}}