{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FRCX3U52GLPMYV37JHK4CFJ5ZD","short_pith_number":"pith:FRCX3U52","canonical_record":{"source":{"id":"2410.23480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-30T22:12:19Z","cross_cats_sorted":[],"title_canon_sha256":"2b638157c3725b74c9e664b622dfb3d8f72473f1e39a21bb14fc652c04dcc5b6","abstract_canon_sha256":"16ff7ad2fd389aa2910c8252004802fbbe24e73bfe604df8b15a98053185e296"},"schema_version":"1.0"},"canonical_sha256":"2c457dd3ba32decc577f49d5c1153dc8cade54378e9c96796c5c74503740835e","source":{"kind":"arxiv","id":"2410.23480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23480","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23480v2","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23480","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"FRCX3U52GLPM","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"pith_short_16","alias_value":"FRCX3U52GLPMYV37","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"pith_short_8","alias_value":"FRCX3U52","created_at":"2026-06-24T01:14:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FRCX3U52GLPMYV37JHK4CFJ5ZD","target":"record","payload":{"canonical_record":{"source":{"id":"2410.23480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-30T22:12:19Z","cross_cats_sorted":[],"title_canon_sha256":"2b638157c3725b74c9e664b622dfb3d8f72473f1e39a21bb14fc652c04dcc5b6","abstract_canon_sha256":"16ff7ad2fd389aa2910c8252004802fbbe24e73bfe604df8b15a98053185e296"},"schema_version":"1.0"},"canonical_sha256":"2c457dd3ba32decc577f49d5c1153dc8cade54378e9c96796c5c74503740835e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:55.875792Z","signature_b64":"Mp3T31njU0HAc8QFUAS17pwa/Yx79XAc0S+XewulTDGT5KBC4T3JwYMNFgUpCQ6qZ5K7O4X+90/5ZZroMdaBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c457dd3ba32decc577f49d5c1153dc8cade54378e9c96796c5c74503740835e","last_reissued_at":"2026-06-24T01:14:55.875281Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:55.875281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.23480","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-06-24T01:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RY3Jcnti8LAbW5Sbk1oAG/CZEcaj+paUL4EnQ1wE4vTmcFTevxwmaUaMpiItcFAqvB30LjExui3cwVlvsIuVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:06:04.244920Z"},"content_sha256":"76544d03f4637ba317f4d67b2be0ad375afe1a08df604a2072f4dba2a7d60f98","schema_version":"1.0","event_id":"sha256:76544d03f4637ba317f4d67b2be0ad375afe1a08df604a2072f4dba2a7d60f98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FRCX3U52GLPMYV37JHK4CFJ5ZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A graph-based heuristic for the non-stationary stochastic lot-sizing problem under penalty costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Roberto Rossi, Thomas Welsh Archibald, Xiyuan Ma","submitted_at":"2024-10-30T22:12:19Z","abstract_excerpt":"This paper introduces a graph-based algorithm for solving single-item, single-location inventory lot-sizing problems under non-stationary stochastic demand using the $(R_t, S_t)$ policy and a penalty cost scheme. The proposed method relaxes the original mixed-integer linear programming (MILP) model by eliminating non-negative order quantity constraints and formulating it as a shortest-path problem on a weighted directed acyclic graph. A repetitive augmentation procedure is proposed to resolve any infeasibility in the solution. This procedure consists of three stages: (1) filtration, (2) repeat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23480","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/2410.23480/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"},"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-06-24T01:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5c0aEoazfxBkg4SW2xp45rd4So/AcMsdEE5u1qZwlgVqXB1cE6emMjwbccB4OWriGAarucuqrer5BGqJLA9FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:06:04.245565Z"},"content_sha256":"6742d9fea9b0024726239356922b48268cff80167a3064de4f4dab7adb9f9d2b","schema_version":"1.0","event_id":"sha256:6742d9fea9b0024726239356922b48268cff80167a3064de4f4dab7adb9f9d2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD/bundle.json","state_url":"https://pith.science/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD/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-25T08:06:04Z","links":{"resolver":"https://pith.science/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD","bundle":"https://pith.science/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD/bundle.json","state":"https://pith.science/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRCX3U52GLPMYV37JHK4CFJ5ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FRCX3U52GLPMYV37JHK4CFJ5ZD","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":"16ff7ad2fd389aa2910c8252004802fbbe24e73bfe604df8b15a98053185e296","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-30T22:12:19Z","title_canon_sha256":"2b638157c3725b74c9e664b622dfb3d8f72473f1e39a21bb14fc652c04dcc5b6"},"schema_version":"1.0","source":{"id":"2410.23480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23480","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23480v2","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23480","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"FRCX3U52GLPM","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"pith_short_16","alias_value":"FRCX3U52GLPMYV37","created_at":"2026-06-24T01:14:55Z"},{"alias_kind":"pith_short_8","alias_value":"FRCX3U52","created_at":"2026-06-24T01:14:55Z"}],"graph_snapshots":[{"event_id":"sha256:6742d9fea9b0024726239356922b48268cff80167a3064de4f4dab7adb9f9d2b","target":"graph","created_at":"2026-06-24T01:14:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.23480/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a graph-based algorithm for solving single-item, single-location inventory lot-sizing problems under non-stationary stochastic demand using the $(R_t, S_t)$ policy and a penalty cost scheme. The proposed method relaxes the original mixed-integer linear programming (MILP) model by eliminating non-negative order quantity constraints and formulating it as a shortest-path problem on a weighted directed acyclic graph. A repetitive augmentation procedure is proposed to resolve any infeasibility in the solution. This procedure consists of three stages: (1) filtration, (2) repeat","authors_text":"Roberto Rossi, Thomas Welsh Archibald, Xiyuan Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-30T22:12:19Z","title":"A graph-based heuristic for the non-stationary stochastic lot-sizing problem under penalty costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23480","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:76544d03f4637ba317f4d67b2be0ad375afe1a08df604a2072f4dba2a7d60f98","target":"record","created_at":"2026-06-24T01:14:55Z","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":"16ff7ad2fd389aa2910c8252004802fbbe24e73bfe604df8b15a98053185e296","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-30T22:12:19Z","title_canon_sha256":"2b638157c3725b74c9e664b622dfb3d8f72473f1e39a21bb14fc652c04dcc5b6"},"schema_version":"1.0","source":{"id":"2410.23480","kind":"arxiv","version":2}},"canonical_sha256":"2c457dd3ba32decc577f49d5c1153dc8cade54378e9c96796c5c74503740835e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c457dd3ba32decc577f49d5c1153dc8cade54378e9c96796c5c74503740835e","first_computed_at":"2026-06-24T01:14:55.875281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:55.875281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mp3T31njU0HAc8QFUAS17pwa/Yx79XAc0S+XewulTDGT5KBC4T3JwYMNFgUpCQ6qZ5K7O4X+90/5ZZroMdaBCQ==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:55.875792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.23480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76544d03f4637ba317f4d67b2be0ad375afe1a08df604a2072f4dba2a7d60f98","sha256:6742d9fea9b0024726239356922b48268cff80167a3064de4f4dab7adb9f9d2b"],"state_sha256":"fc37bd753e16adfb491966295a971d965d39096f89ccd7c9a268e826fe1d3db3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPqhMD4PFUVSe7LE4lAFgzTfT486ev6QwEOOPeI45BROSDvexgo3NaQ+DuNP+USJHGqwv1yk1VP8xTI9lxRyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:06:04.247825Z","bundle_sha256":"22806390847e329c560d2c89de2360e649e09b839744ee72c7977effc76f8484"}}