{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HP2SGAIODTFUKJSO7OCHQ34WOI","short_pith_number":"pith:HP2SGAIO","canonical_record":{"source":{"id":"1907.02405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T13:57:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c79188ecd4b52ae4ebfbb4dfe5ea3da2e25872b47160c9e273767ac158458abf","abstract_canon_sha256":"9e3a148e53dc9d71ff0367b6750d53ba546aadbbcf0f34048616fad87238d1be"},"schema_version":"1.0"},"canonical_sha256":"3bf523010e1ccb45264efb84786f967233a5702a083b071aaa067200fd3d3603","source":{"kind":"arxiv","id":"1907.02405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02405","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02405v1","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02405","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"HP2SGAIODTFU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HP2SGAIODTFUKJSO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HP2SGAIO","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HP2SGAIODTFUKJSO7OCHQ34WOI","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T13:57:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c79188ecd4b52ae4ebfbb4dfe5ea3da2e25872b47160c9e273767ac158458abf","abstract_canon_sha256":"9e3a148e53dc9d71ff0367b6750d53ba546aadbbcf0f34048616fad87238d1be"},"schema_version":"1.0"},"canonical_sha256":"3bf523010e1ccb45264efb84786f967233a5702a083b071aaa067200fd3d3603","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:28.690081Z","signature_b64":"rkwR+XZxEOXGg0vWXsISp8rFZB2a9N4r/kPBnwhCbJrMbrgUBvpotN8sbCwFU76Bqlwh84L7zknBZP12euG9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf523010e1ccb45264efb84786f967233a5702a083b071aaa067200fd3d3603","last_reissued_at":"2026-05-17T23:41:28.689097Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:28.689097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02405","source_version":1,"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-17T23:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgEJkEmEXXfz+P6D+kS1xNAytKSxTQ9yuP0MXDwJUbdcO7+UMyWGuVBpAuUsaqQ+i8Vrf4kYCRadkZn0H+AOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:47:33.706839Z"},"content_sha256":"d08b7de324c22606072085087a0fd05385a5f08c0c78655a7d150ec467d58d8c","schema_version":"1.0","event_id":"sha256:d08b7de324c22606072085087a0fd05385a5f08c0c78655a7d150ec467d58d8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HP2SGAIODTFUKJSO7OCHQ34WOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A global constraint for the capacitated single-item lot-sizing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Bernard Penz, Grigori German, Hadrien Cambazard, Jean-Philippe Gayon","submitted_at":"2019-07-04T13:57:39Z","abstract_excerpt":"The goal of this paper is to set a constraint programming framework to solve lot-sizing problems. More specifically, we consider a single-item lot-sizing problem with time-varying lower and upper bounds for production and inventory. The cost structure includes time-varying holding costs, unitary production costs and setup costs. We establish a new lower bound for this problem by using a subtle time decomposition. We formulate this NP-hard problem as a global constraint and show that bound consistency can be achieved in pseudo-polynomial time and when not including the costs, in polynomial time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02405","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"},"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-17T23:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MF8D1tI+slVLlgVN+ibcx6M7IKYuttHY0wh3Edj3cnqAoEZdWhfG+2FD0IoDfeud0nJ3nvKGa8+Qcz5jYzmRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:47:33.707164Z"},"content_sha256":"c8c10ab296564f6d5db3aa7711ae8f2ff3e841335e3e7cac98dda27d14cb318a","schema_version":"1.0","event_id":"sha256:c8c10ab296564f6d5db3aa7711ae8f2ff3e841335e3e7cac98dda27d14cb318a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/bundle.json","state_url":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/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-24T19:47:33Z","links":{"resolver":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI","bundle":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/bundle.json","state":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HP2SGAIODTFUKJSO7OCHQ34WOI","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":"9e3a148e53dc9d71ff0367b6750d53ba546aadbbcf0f34048616fad87238d1be","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T13:57:39Z","title_canon_sha256":"c79188ecd4b52ae4ebfbb4dfe5ea3da2e25872b47160c9e273767ac158458abf"},"schema_version":"1.0","source":{"id":"1907.02405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02405","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02405v1","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02405","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"HP2SGAIODTFU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HP2SGAIODTFUKJSO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HP2SGAIO","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:c8c10ab296564f6d5db3aa7711ae8f2ff3e841335e3e7cac98dda27d14cb318a","target":"graph","created_at":"2026-05-17T23:41:28Z","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":"The goal of this paper is to set a constraint programming framework to solve lot-sizing problems. More specifically, we consider a single-item lot-sizing problem with time-varying lower and upper bounds for production and inventory. The cost structure includes time-varying holding costs, unitary production costs and setup costs. We establish a new lower bound for this problem by using a subtle time decomposition. We formulate this NP-hard problem as a global constraint and show that bound consistency can be achieved in pseudo-polynomial time and when not including the costs, in polynomial time","authors_text":"Bernard Penz, Grigori German, Hadrien Cambazard, Jean-Philippe Gayon","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T13:57:39Z","title":"A global constraint for the capacitated single-item lot-sizing problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02405","kind":"arxiv","version":1},"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:d08b7de324c22606072085087a0fd05385a5f08c0c78655a7d150ec467d58d8c","target":"record","created_at":"2026-05-17T23:41:28Z","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":"9e3a148e53dc9d71ff0367b6750d53ba546aadbbcf0f34048616fad87238d1be","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T13:57:39Z","title_canon_sha256":"c79188ecd4b52ae4ebfbb4dfe5ea3da2e25872b47160c9e273767ac158458abf"},"schema_version":"1.0","source":{"id":"1907.02405","kind":"arxiv","version":1}},"canonical_sha256":"3bf523010e1ccb45264efb84786f967233a5702a083b071aaa067200fd3d3603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bf523010e1ccb45264efb84786f967233a5702a083b071aaa067200fd3d3603","first_computed_at":"2026-05-17T23:41:28.689097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:28.689097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rkwR+XZxEOXGg0vWXsISp8rFZB2a9N4r/kPBnwhCbJrMbrgUBvpotN8sbCwFU76Bqlwh84L7zknBZP12euG9Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:28.690081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d08b7de324c22606072085087a0fd05385a5f08c0c78655a7d150ec467d58d8c","sha256:c8c10ab296564f6d5db3aa7711ae8f2ff3e841335e3e7cac98dda27d14cb318a"],"state_sha256":"abf9c1bfd3deb8a9929ad57b2ac13c35dc2f3907378e169f1ac63043a36f6646"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKMCT5jPQQEI4sdSi84wd+ED78D2X6Yc491knHSl2L38p2XPhkIwuzVQogDdzDpiOtSUtkMg4edAdRcPtk2qAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:47:33.708968Z","bundle_sha256":"5987b7e089765408a62d1af0a6c275b6b00a10ceca1a53625bb463d928c6d880"}}