{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WEYOKG2X6A46HQUPCTOGTDS372","short_pith_number":"pith:WEYOKG2X","schema_version":"1.0","canonical_sha256":"b130e51b57f039e3c28f14dc698e5bfe9e4bf564db896f8de97cec9e31cb374c","source":{"kind":"arxiv","id":"1509.07278","version":2},"attestation_state":"computed","paper":{"title":"Integer Programming Models and Parameterized Algorithms for Controlling Palletizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Egon Wanke, Frank Gurski, Jochen Rethmann","submitted_at":"2015-09-24T09:03:49Z","abstract_excerpt":"We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p, the goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. The FIFO Stack-Up problem asks whether there is some processing of the sequences of bins such that at most p stack-up places are used. In this paper we strengthen the hardness of the FIFO Stack-Up by considering practical cases and the distribution of the pallets "},"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":"1509.07278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T09:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"095971dfabdeb9fee12dbe4946ac9aad61bb05e8a3aaf7b74ceabc124391614a","abstract_canon_sha256":"a58e15422011c365eb57345197c3a9a83c3084fecef7283ba917680c783b8866"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:15.037680Z","signature_b64":"1oGLZgRnT5FWt33tUBK0uN6UpuD0FSnbgl6M/45qqA7B2llH6gYyO5sV73kjyiIyqbQdh0/S/OUwbXJod1c9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b130e51b57f039e3c28f14dc698e5bfe9e4bf564db896f8de97cec9e31cb374c","last_reissued_at":"2026-05-18T01:10:15.037243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:15.037243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integer Programming Models and Parameterized Algorithms for Controlling Palletizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Egon Wanke, Frank Gurski, Jochen Rethmann","submitted_at":"2015-09-24T09:03:49Z","abstract_excerpt":"We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p, the goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. The FIFO Stack-Up problem asks whether there is some processing of the sequences of bins such that at most p stack-up places are used. In this paper we strengthen the hardness of the FIFO Stack-Up by considering practical cases and the distribution of the pallets "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07278","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.07278","created_at":"2026-05-18T01:10:15.037303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07278v2","created_at":"2026-05-18T01:10:15.037303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07278","created_at":"2026-05-18T01:10:15.037303+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEYOKG2X6A46","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEYOKG2X6A46HQUP","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEYOKG2X","created_at":"2026-05-18T12:29:47.479230+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/WEYOKG2X6A46HQUPCTOGTDS372","json":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372.json","graph_json":"https://pith.science/api/pith-number/WEYOKG2X6A46HQUPCTOGTDS372/graph.json","events_json":"https://pith.science/api/pith-number/WEYOKG2X6A46HQUPCTOGTDS372/events.json","paper":"https://pith.science/paper/WEYOKG2X"},"agent_actions":{"view_html":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372","download_json":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372.json","view_paper":"https://pith.science/paper/WEYOKG2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07278&json=true","fetch_graph":"https://pith.science/api/pith-number/WEYOKG2X6A46HQUPCTOGTDS372/graph.json","fetch_events":"https://pith.science/api/pith-number/WEYOKG2X6A46HQUPCTOGTDS372/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372/action/storage_attestation","attest_author":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372/action/author_attestation","sign_citation":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372/action/citation_signature","submit_replication":"https://pith.science/pith/WEYOKG2X6A46HQUPCTOGTDS372/action/replication_record"}},"created_at":"2026-05-18T01:10:15.037303+00:00","updated_at":"2026-05-18T01:10:15.037303+00:00"}