{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XCFA3LNFPK6GXTSM463ETRBYJD","short_pith_number":"pith:XCFA3LNF","canonical_record":{"source":{"id":"1801.07541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T14:03:48Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0aeb37a4b64ddcc764132a0c5977f6aaac9af07ef7f04e89d361cb5bddb695dc","abstract_canon_sha256":"92132cb817a7ccb338af1ff26f4a97e7647c4475ea2900d3fea9aab1ee6a4962"},"schema_version":"1.0"},"canonical_sha256":"b88a0dada57abc6bce4ce7b649c43848db93acb8228efaeb126872572a235f90","source":{"kind":"arxiv","id":"1801.07541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07541","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07541v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07541","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"XCFA3LNFPK6G","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XCFA3LNFPK6GXTSM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XCFA3LNF","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XCFA3LNFPK6GXTSM463ETRBYJD","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T14:03:48Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0aeb37a4b64ddcc764132a0c5977f6aaac9af07ef7f04e89d361cb5bddb695dc","abstract_canon_sha256":"92132cb817a7ccb338af1ff26f4a97e7647c4475ea2900d3fea9aab1ee6a4962"},"schema_version":"1.0"},"canonical_sha256":"b88a0dada57abc6bce4ce7b649c43848db93acb8228efaeb126872572a235f90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.618143Z","signature_b64":"WKkMtcjJ3ALM402EZjSfX4svuLhDZzRZuQqzHEUTRO0AxqT4kDhXpfNWXVnz7+nrIfKgOPKQGXWXgTcKhGakDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b88a0dada57abc6bce4ce7b649c43848db93acb8228efaeb126872572a235f90","last_reissued_at":"2026-05-18T00:25:12.617740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.617740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07541","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87+obVF1ub44RLUmeiutqoMlHOMORKsL4a2fjT77nNdR422GoV5X1s/LJIbh496f+cWYkXC7SKQBszOQIRlQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:50:38.394621Z"},"content_sha256":"6faade6baa8436822d51d59ecdee76ac546d5d8cf58c438640ff7783d8876b1d","schema_version":"1.0","event_id":"sha256:6faade6baa8436822d51d59ecdee76ac546d5d8cf58c438640ff7783d8876b1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XCFA3LNFPK6GXTSM463ETRBYJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Pseudo-Polynomial-Time Approximation for Strip Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Arindam Khan, Fabrizio Grandoni, Salvatore Ingala, Waldo G\\'alvez","submitted_at":"2018-01-23T14:03:48Z","abstract_excerpt":"We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in the two-dimensional plane and the goal is to pack them in a vertical strip of a fixed width such that the height of the obtained packing is minimized. The packing must be non-overlapping and the rectangles cannot be rotated. A reduction from the partition problem shows that no approximation better than 3/2 is possible for strip packing in polynomial time (assuming P$\\neq$NP). Nadiradze and Wiese [SODA16] overcame th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07541","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11sMX4yUUFc1dHkBwnKh/mUMmAoZALz++n4el1reIO8lK237ampRyCSX+Tb/MllsC865pPdlYydXPQ6bnGLvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:50:38.395177Z"},"content_sha256":"fab79a9405e1a5eb071bfdcfb5ea298368557b05a842b34dcd93d52e0e3fe5d1","schema_version":"1.0","event_id":"sha256:fab79a9405e1a5eb071bfdcfb5ea298368557b05a842b34dcd93d52e0e3fe5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCFA3LNFPK6GXTSM463ETRBYJD/bundle.json","state_url":"https://pith.science/pith/XCFA3LNFPK6GXTSM463ETRBYJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCFA3LNFPK6GXTSM463ETRBYJD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T23:50:38Z","links":{"resolver":"https://pith.science/pith/XCFA3LNFPK6GXTSM463ETRBYJD","bundle":"https://pith.science/pith/XCFA3LNFPK6GXTSM463ETRBYJD/bundle.json","state":"https://pith.science/pith/XCFA3LNFPK6GXTSM463ETRBYJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCFA3LNFPK6GXTSM463ETRBYJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XCFA3LNFPK6GXTSM463ETRBYJD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"92132cb817a7ccb338af1ff26f4a97e7647c4475ea2900d3fea9aab1ee6a4962","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T14:03:48Z","title_canon_sha256":"0aeb37a4b64ddcc764132a0c5977f6aaac9af07ef7f04e89d361cb5bddb695dc"},"schema_version":"1.0","source":{"id":"1801.07541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07541","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07541v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07541","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"XCFA3LNFPK6G","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XCFA3LNFPK6GXTSM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XCFA3LNF","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:fab79a9405e1a5eb071bfdcfb5ea298368557b05a842b34dcd93d52e0e3fe5d1","target":"graph","created_at":"2026-05-18T00:25:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in the two-dimensional plane and the goal is to pack them in a vertical strip of a fixed width such that the height of the obtained packing is minimized. The packing must be non-overlapping and the rectangles cannot be rotated. A reduction from the partition problem shows that no approximation better than 3/2 is possible for strip packing in polynomial time (assuming P$\\neq$NP). Nadiradze and Wiese [SODA16] overcame th","authors_text":"Arindam Khan, Fabrizio Grandoni, Salvatore Ingala, Waldo G\\'alvez","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T14:03:48Z","title":"Improved Pseudo-Polynomial-Time Approximation for Strip Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07541","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6faade6baa8436822d51d59ecdee76ac546d5d8cf58c438640ff7783d8876b1d","target":"record","created_at":"2026-05-18T00:25:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"92132cb817a7ccb338af1ff26f4a97e7647c4475ea2900d3fea9aab1ee6a4962","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T14:03:48Z","title_canon_sha256":"0aeb37a4b64ddcc764132a0c5977f6aaac9af07ef7f04e89d361cb5bddb695dc"},"schema_version":"1.0","source":{"id":"1801.07541","kind":"arxiv","version":1}},"canonical_sha256":"b88a0dada57abc6bce4ce7b649c43848db93acb8228efaeb126872572a235f90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b88a0dada57abc6bce4ce7b649c43848db93acb8228efaeb126872572a235f90","first_computed_at":"2026-05-18T00:25:12.617740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:12.617740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WKkMtcjJ3ALM402EZjSfX4svuLhDZzRZuQqzHEUTRO0AxqT4kDhXpfNWXVnz7+nrIfKgOPKQGXWXgTcKhGakDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:12.618143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6faade6baa8436822d51d59ecdee76ac546d5d8cf58c438640ff7783d8876b1d","sha256:fab79a9405e1a5eb071bfdcfb5ea298368557b05a842b34dcd93d52e0e3fe5d1"],"state_sha256":"216cf751746ce882175f06b95abece1c09c5df8c5126523c57d5eda074812511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzKLl6J3CNZsGvePslhWk40bvEWJSp8ULqwAvNft01ptg6smy+t0Q9wMFWsX2u3YwBWbZSTQhzYbhGqFMQ1LBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:50:38.398471Z","bundle_sha256":"1bd8d0541744424142e412a1b0958c9284afe79f1423dd7bad386bc1c41d4dd7"}}