{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KSLOHQ4DQHJ5M75FE7YKM7KTSX","short_pith_number":"pith:KSLOHQ4D","schema_version":"1.0","canonical_sha256":"5496e3c38381d3d67fa527f0a67d5395d3176bfbb9fdd154a16afcba870c0b47","source":{"kind":"arxiv","id":"1610.07766","version":1},"attestation_state":"computed","paper":{"title":"Hardness of approximation for strip packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anna Adamaszek, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tomasz Kociumaka","submitted_at":"2016-10-25T07:44:21Z","abstract_excerpt":"Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, e.g. in scheduling and stock-cutting, and has been studied extensively.\n  When the dimensions of objects are allowed to be exponential in the total input size, it is known that the problem cannot be approximated within a factor better than $3/2$, unless $\\mathrm{P}=\\mathrm{NP}$. However, there was no corresponding lower bound for polynomially bounded input data. In fact, Nadir"},"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.07766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-25T07:44:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b074f9bea78fb99baca6d9fc0185e459291a9123e3c863a29d67c5af6a5d2798","abstract_canon_sha256":"b2bdff08d560bf5b07de6ead1f1e5d637f9e56040d23004d2ffd35a2736f62cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:17.668634Z","signature_b64":"fiXkhMdMvP/d6PyvlIYCLkATkFkTovh0GGgmJ1kbM4v8EGeV5aLBg75D1xs9O9AuEzlguNs1D6YNQkMtc076Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5496e3c38381d3d67fa527f0a67d5395d3176bfbb9fdd154a16afcba870c0b47","last_reissued_at":"2026-05-18T01:01:17.667979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:17.667979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of approximation for strip packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anna Adamaszek, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tomasz Kociumaka","submitted_at":"2016-10-25T07:44:21Z","abstract_excerpt":"Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, e.g. in scheduling and stock-cutting, and has been studied extensively.\n  When the dimensions of objects are allowed to be exponential in the total input size, it is known that the problem cannot be approximated within a factor better than $3/2$, unless $\\mathrm{P}=\\mathrm{NP}$. However, there was no corresponding lower bound for polynomially bounded input data. In fact, Nadir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07766","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":"1610.07766","created_at":"2026-05-18T01:01:17.668077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07766v1","created_at":"2026-05-18T01:01:17.668077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07766","created_at":"2026-05-18T01:01:17.668077+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSLOHQ4DQHJ5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSLOHQ4DQHJ5M75F","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSLOHQ4D","created_at":"2026-05-18T12:30:29.479603+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/KSLOHQ4DQHJ5M75FE7YKM7KTSX","json":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX.json","graph_json":"https://pith.science/api/pith-number/KSLOHQ4DQHJ5M75FE7YKM7KTSX/graph.json","events_json":"https://pith.science/api/pith-number/KSLOHQ4DQHJ5M75FE7YKM7KTSX/events.json","paper":"https://pith.science/paper/KSLOHQ4D"},"agent_actions":{"view_html":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX","download_json":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX.json","view_paper":"https://pith.science/paper/KSLOHQ4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07766&json=true","fetch_graph":"https://pith.science/api/pith-number/KSLOHQ4DQHJ5M75FE7YKM7KTSX/graph.json","fetch_events":"https://pith.science/api/pith-number/KSLOHQ4DQHJ5M75FE7YKM7KTSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX/action/storage_attestation","attest_author":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX/action/author_attestation","sign_citation":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX/action/citation_signature","submit_replication":"https://pith.science/pith/KSLOHQ4DQHJ5M75FE7YKM7KTSX/action/replication_record"}},"created_at":"2026-05-18T01:01:17.668077+00:00","updated_at":"2026-05-18T01:01:17.668077+00:00"}