{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TVIHSQUZU6Y47DWX5S5H7BUFMZ","short_pith_number":"pith:TVIHSQUZ","canonical_record":{"source":{"id":"2103.04199","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-06T21:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"0dbfec3889d9772707e3b3e43d945fe94461d1b7c1f9293fb4cb8d0927671d51","abstract_canon_sha256":"2f7845d1ad68d7f1be725762f916f45694d95bcd12648a80481ea54b8d64302c"},"schema_version":"1.0"},"canonical_sha256":"9d50794299a7b1cf8ed7ecba7f868566414c3ab28d03387b29221eda796bcfaa","source":{"kind":"arxiv","id":"2103.04199","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.04199","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"2103.04199v2","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04199","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"TVIHSQUZU6Y4","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"TVIHSQUZU6Y47DWX","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"TVIHSQUZ","created_at":"2026-07-05T04:34:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TVIHSQUZU6Y47DWX5S5H7BUFMZ","target":"record","payload":{"canonical_record":{"source":{"id":"2103.04199","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-06T21:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"0dbfec3889d9772707e3b3e43d945fe94461d1b7c1f9293fb4cb8d0927671d51","abstract_canon_sha256":"2f7845d1ad68d7f1be725762f916f45694d95bcd12648a80481ea54b8d64302c"},"schema_version":"1.0"},"canonical_sha256":"9d50794299a7b1cf8ed7ecba7f868566414c3ab28d03387b29221eda796bcfaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:25.759953Z","signature_b64":"sNbMLI/tXbFfcZQotSgRZuJOCCGpHMaOjm/WWtwPegRGVqptM/QzISCA4SDODvFd3O4/dZKte/mv/kHW2TLdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d50794299a7b1cf8ed7ecba7f868566414c3ab28d03387b29221eda796bcfaa","last_reissued_at":"2026-07-05T04:34:25.759567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:25.759567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.04199","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-07-05T04:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05v8Zw2f6BvXrmUr6A4Uy1LLlvvbJduUH7h307gdTLY5yG2uQeFW8Sw3vS7EnwHmsyy1zNpI6eVJ7YQbtySmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:00:16.629685Z"},"content_sha256":"45e77af5d3b389e7c2759b085f12956f4930de46d45138698d149fbfac2de903","schema_version":"1.0","event_id":"sha256:45e77af5d3b389e7c2759b085f12956f4930de46d45138698d149fbfac2de903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TVIHSQUZU6Y47DWX5S5H7BUFMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Lai, Emrah Demir, Nico Dellaert, Tom Van Woensel, Yijun Li","submitted_at":"2021-03-06T21:22:58Z","abstract_excerpt":"The Capacitated Lot-Sizing Problem (CLSP) and its variants are important and challenging optimization problems. Constructive heuristics are known to be the most intuitive and fastest methods for finding good feasible solutions for the CLSPs and therefore are often used as a subroutine in building more sophisticated exact or metaheuristic approaches. Classical constructive heuristics, such as period-by-period heuristics and lot elimination heuristics, are widely used by researchers. This paper introduces four perturbation strategies to the period-by-period and lot elimination heuristics to furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04199","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/2103.04199/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-07-05T04:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQiC9mnloqeBNAkIC9Q5iNt0xMsD4/YYiBxFE9wmqq5fTozSu+xWsG6biMUi5EJWdF40B09ueO5B+RFG7bD0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:00:16.630061Z"},"content_sha256":"76366d59a5f25d4abeb243bad9aec84f56e802c31304704c34b3b364dfa1830b","schema_version":"1.0","event_id":"sha256:76366d59a5f25d4abeb243bad9aec84f56e802c31304704c34b3b364dfa1830b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ/bundle.json","state_url":"https://pith.science/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ/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-07-07T10:00:16Z","links":{"resolver":"https://pith.science/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ","bundle":"https://pith.science/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ/bundle.json","state":"https://pith.science/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVIHSQUZU6Y47DWX5S5H7BUFMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TVIHSQUZU6Y47DWX5S5H7BUFMZ","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":"2f7845d1ad68d7f1be725762f916f45694d95bcd12648a80481ea54b8d64302c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-06T21:22:58Z","title_canon_sha256":"0dbfec3889d9772707e3b3e43d945fe94461d1b7c1f9293fb4cb8d0927671d51"},"schema_version":"1.0","source":{"id":"2103.04199","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.04199","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"2103.04199v2","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04199","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"TVIHSQUZU6Y4","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"TVIHSQUZU6Y47DWX","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"TVIHSQUZ","created_at":"2026-07-05T04:34:25Z"}],"graph_snapshots":[{"event_id":"sha256:76366d59a5f25d4abeb243bad9aec84f56e802c31304704c34b3b364dfa1830b","target":"graph","created_at":"2026-07-05T04:34:25Z","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/2103.04199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Capacitated Lot-Sizing Problem (CLSP) and its variants are important and challenging optimization problems. Constructive heuristics are known to be the most intuitive and fastest methods for finding good feasible solutions for the CLSPs and therefore are often used as a subroutine in building more sophisticated exact or metaheuristic approaches. Classical constructive heuristics, such as period-by-period heuristics and lot elimination heuristics, are widely used by researchers. This paper introduces four perturbation strategies to the period-by-period and lot elimination heuristics to furt","authors_text":"David Lai, Emrah Demir, Nico Dellaert, Tom Van Woensel, Yijun Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-06T21:22:58Z","title":"Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04199","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:45e77af5d3b389e7c2759b085f12956f4930de46d45138698d149fbfac2de903","target":"record","created_at":"2026-07-05T04:34:25Z","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":"2f7845d1ad68d7f1be725762f916f45694d95bcd12648a80481ea54b8d64302c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-03-06T21:22:58Z","title_canon_sha256":"0dbfec3889d9772707e3b3e43d945fe94461d1b7c1f9293fb4cb8d0927671d51"},"schema_version":"1.0","source":{"id":"2103.04199","kind":"arxiv","version":2}},"canonical_sha256":"9d50794299a7b1cf8ed7ecba7f868566414c3ab28d03387b29221eda796bcfaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d50794299a7b1cf8ed7ecba7f868566414c3ab28d03387b29221eda796bcfaa","first_computed_at":"2026-07-05T04:34:25.759567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:25.759567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sNbMLI/tXbFfcZQotSgRZuJOCCGpHMaOjm/WWtwPegRGVqptM/QzISCA4SDODvFd3O4/dZKte/mv/kHW2TLdBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:25.759953Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.04199","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45e77af5d3b389e7c2759b085f12956f4930de46d45138698d149fbfac2de903","sha256:76366d59a5f25d4abeb243bad9aec84f56e802c31304704c34b3b364dfa1830b"],"state_sha256":"75c2a6276b33e7037dd013cdf610a0abea3bc61b0efcf9fd243506c19dd7d71e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxNa/Tps3UvxQ/T1/C6vCl4IKxDgWeO7tyUooE9Lg32kHii3EELckaw/RKd8B3C/nkMUhVozF6+BuD26uDDwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:00:16.632001Z","bundle_sha256":"e728338ed51ab112dc2c3cb0027b38dc836f8bbf8622ce191171708a440ff225"}}