{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UNLDPNW3WNDDCMGFT2UAX4V7VN","short_pith_number":"pith:UNLDPNW3","schema_version":"1.0","canonical_sha256":"a35637b6dbb3463130c59ea80bf2bfab5b292cf1d9ad845c770284d692bee4b8","source":{"kind":"arxiv","id":"1610.04430","version":2},"attestation_state":"computed","paper":{"title":"Improved approximation for two dimensional strip packing with polynomial bounded width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Malin Rau","submitted_at":"2016-10-14T12:29:31Z","abstract_excerpt":"We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width $W$ with infinite height. The objective is to find a packing of these items into the strip, which minimizes the packing height. Lately, it has been shown that the lower bound of $3/2$ of the absolute approximation ratio can be beaten when we allow a pseudo-polynomial running-time of type $(n W)^{f(1/\\varepsilon)}$. If $W$ is polynomially bounded by the number of items, this is a polynomial running-time. We present a pseudo-polynomial algorithm with approximation"},"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":"1610.04430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-14T12:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"68a73a292e8d2f812210805e3d01164425bc02d6a2429157d5eea7fc408f8acf","abstract_canon_sha256":"5fb9c70fda73fb3d148515ec0d659b06c6c452fd0e3ec0911dab9ce1c488c691"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:07.199276Z","signature_b64":"RrBAgRp5U6tco/UzBGXc3M9OcI8YzDaOmagHJcPwUo5LT03YVwqYbiyIOUkHoUL62l89tdn9KHB/1N23FXRsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35637b6dbb3463130c59ea80bf2bfab5b292cf1d9ad845c770284d692bee4b8","last_reissued_at":"2026-05-18T00:28:07.198664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:07.198664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation for two dimensional strip packing with polynomial bounded width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Malin Rau","submitted_at":"2016-10-14T12:29:31Z","abstract_excerpt":"We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width $W$ with infinite height. The objective is to find a packing of these items into the strip, which minimizes the packing height. Lately, it has been shown that the lower bound of $3/2$ of the absolute approximation ratio can be beaten when we allow a pseudo-polynomial running-time of type $(n W)^{f(1/\\varepsilon)}$. If $W$ is polynomially bounded by the number of items, this is a polynomial running-time. We present a pseudo-polynomial algorithm with approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04430","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":"1610.04430","created_at":"2026-05-18T00:28:07.198760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04430v2","created_at":"2026-05-18T00:28:07.198760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04430","created_at":"2026-05-18T00:28:07.198760+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNLDPNW3WNDD","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNLDPNW3WNDDCMGF","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNLDPNW3","created_at":"2026-05-18T12:30:46.583412+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/UNLDPNW3WNDDCMGFT2UAX4V7VN","json":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN.json","graph_json":"https://pith.science/api/pith-number/UNLDPNW3WNDDCMGFT2UAX4V7VN/graph.json","events_json":"https://pith.science/api/pith-number/UNLDPNW3WNDDCMGFT2UAX4V7VN/events.json","paper":"https://pith.science/paper/UNLDPNW3"},"agent_actions":{"view_html":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN","download_json":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN.json","view_paper":"https://pith.science/paper/UNLDPNW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04430&json=true","fetch_graph":"https://pith.science/api/pith-number/UNLDPNW3WNDDCMGFT2UAX4V7VN/graph.json","fetch_events":"https://pith.science/api/pith-number/UNLDPNW3WNDDCMGFT2UAX4V7VN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN/action/storage_attestation","attest_author":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN/action/author_attestation","sign_citation":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN/action/citation_signature","submit_replication":"https://pith.science/pith/UNLDPNW3WNDDCMGFT2UAX4V7VN/action/replication_record"}},"created_at":"2026-05-18T00:28:07.198760+00:00","updated_at":"2026-05-18T00:28:07.198760+00:00"}