{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FCBBQWLH6HJ24GBVRAMWY7RGSY","short_pith_number":"pith:FCBBQWLH","schema_version":"1.0","canonical_sha256":"2882185967f1d3ae183588196c7e2696001c5154157fc708746853e31cb6c902","source":{"kind":"arxiv","id":"1712.04922","version":2},"attestation_state":"computed","paper":{"title":"Closing the gap for pseudo-polynomial strip packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Klaus Jansen, Malin Rau","submitted_at":"2017-12-13T18:48:39Z","abstract_excerpt":"The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of rectangular axis parallel items and a strip with bounded width and infinite height the objective is to find a packing of the items into the strip which minimizes the packing height. We speak of pseudo-polynomial Strip Packing if we consider algorithms with pseudo-polynomial running time with respect to the width of the strip.\n  It is known that there is no pse"},"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":"1712.04922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-13T18:48:39Z","cross_cats_sorted":[],"title_canon_sha256":"d8a7a4d040e88ee2183c359b5aaa5c57d9fe3eef13fed0cc5f1ec9a99d2573dd","abstract_canon_sha256":"4c6bea09251b737dd85485c7e47025dfc6361ab174ad927544b42186c865211e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:41.680902Z","signature_b64":"nOfWoD/CUYj3iAUNdSNh+0ELOzHvFE2/XxhswE+p8vSHkOIG6XsfeQRYo2hbkaUr0IksNUGL4PCvSwa0ynMTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2882185967f1d3ae183588196c7e2696001c5154157fc708746853e31cb6c902","last_reissued_at":"2026-05-17T23:54:41.680400Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:41.680400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closing the gap for pseudo-polynomial strip packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Klaus Jansen, Malin Rau","submitted_at":"2017-12-13T18:48:39Z","abstract_excerpt":"The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of rectangular axis parallel items and a strip with bounded width and infinite height the objective is to find a packing of the items into the strip which minimizes the packing height. We speak of pseudo-polynomial Strip Packing if we consider algorithms with pseudo-polynomial running time with respect to the width of the strip.\n  It is known that there is no pse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04922","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":"1712.04922","created_at":"2026-05-17T23:54:41.680488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04922v2","created_at":"2026-05-17T23:54:41.680488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04922","created_at":"2026-05-17T23:54:41.680488+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCBBQWLH6HJ2","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCBBQWLH6HJ24GBV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCBBQWLH","created_at":"2026-05-18T12:31:15.632608+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/FCBBQWLH6HJ24GBVRAMWY7RGSY","json":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY.json","graph_json":"https://pith.science/api/pith-number/FCBBQWLH6HJ24GBVRAMWY7RGSY/graph.json","events_json":"https://pith.science/api/pith-number/FCBBQWLH6HJ24GBVRAMWY7RGSY/events.json","paper":"https://pith.science/paper/FCBBQWLH"},"agent_actions":{"view_html":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY","download_json":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY.json","view_paper":"https://pith.science/paper/FCBBQWLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04922&json=true","fetch_graph":"https://pith.science/api/pith-number/FCBBQWLH6HJ24GBVRAMWY7RGSY/graph.json","fetch_events":"https://pith.science/api/pith-number/FCBBQWLH6HJ24GBVRAMWY7RGSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY/action/storage_attestation","attest_author":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY/action/author_attestation","sign_citation":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY/action/citation_signature","submit_replication":"https://pith.science/pith/FCBBQWLH6HJ24GBVRAMWY7RGSY/action/replication_record"}},"created_at":"2026-05-17T23:54:41.680488+00:00","updated_at":"2026-05-17T23:54:41.680488+00:00"}