{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HP2SGAIODTFUKJSO7OCHQ34WOI","short_pith_number":"pith:HP2SGAIO","schema_version":"1.0","canonical_sha256":"3bf523010e1ccb45264efb84786f967233a5702a083b071aaa067200fd3d3603","source":{"kind":"arxiv","id":"1907.02405","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.02405","created_at":"2026-05-17T23:41:28.689273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02405v1","created_at":"2026-05-17T23:41:28.689273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02405","created_at":"2026-05-17T23:41:28.689273+00:00"},{"alias_kind":"pith_short_12","alias_value":"HP2SGAIODTFU","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HP2SGAIODTFUKJSO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HP2SGAIO","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI","json":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI.json","graph_json":"https://pith.science/api/pith-number/HP2SGAIODTFUKJSO7OCHQ34WOI/graph.json","events_json":"https://pith.science/api/pith-number/HP2SGAIODTFUKJSO7OCHQ34WOI/events.json","paper":"https://pith.science/paper/HP2SGAIO"},"agent_actions":{"view_html":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI","download_json":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI.json","view_paper":"https://pith.science/paper/HP2SGAIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02405&json=true","fetch_graph":"https://pith.science/api/pith-number/HP2SGAIODTFUKJSO7OCHQ34WOI/graph.json","fetch_events":"https://pith.science/api/pith-number/HP2SGAIODTFUKJSO7OCHQ34WOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/action/storage_attestation","attest_author":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/action/author_attestation","sign_citation":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/action/citation_signature","submit_replication":"https://pith.science/pith/HP2SGAIODTFUKJSO7OCHQ34WOI/action/replication_record"}},"created_at":"2026-05-17T23:41:28.689273+00:00","updated_at":"2026-05-17T23:41:28.689273+00:00"}