{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:IRGYMJT7QQ4OMUN5NOOK7MYJX3","short_pith_number":"pith:IRGYMJT7","canonical_record":{"source":{"id":"cs/0607100","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-07-22T02:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"8a2eb2d440d92d30039847617aafab622da47e4633ee2bdf69b4bd3bc646a887","abstract_canon_sha256":"2a6111a08cad19e284e935e64f187533f92b3c4b0a4147c5640eb62289c02825"},"schema_version":"1.0"},"canonical_sha256":"444d86267f8438e651bd6b9cafb309beddb0e52b454f76bfbbec656b3d096380","source":{"kind":"arxiv","id":"cs/0607100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0607100","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0607100v1","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607100","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"IRGYMJT7QQ4O","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"pith_short_16","alias_value":"IRGYMJT7QQ4OMUN5","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"pith_short_8","alias_value":"IRGYMJT7","created_at":"2026-07-04T14:55:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:IRGYMJT7QQ4OMUN5NOOK7MYJX3","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0607100","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-07-22T02:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"8a2eb2d440d92d30039847617aafab622da47e4633ee2bdf69b4bd3bc646a887","abstract_canon_sha256":"2a6111a08cad19e284e935e64f187533f92b3c4b0a4147c5640eb62289c02825"},"schema_version":"1.0"},"canonical_sha256":"444d86267f8438e651bd6b9cafb309beddb0e52b454f76bfbbec656b3d096380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:55:25.264628Z","signature_b64":"iHM6b60gTwqxnxAwxUSDgE+J0RbgGNLbbLH612xT95iCEHIsTYJug+4dIJA7NF/62ACdsEo8dPlpESgKWnETCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"444d86267f8438e651bd6b9cafb309beddb0e52b454f76bfbbec656b3d096380","last_reissued_at":"2026-07-04T14:55:25.264286Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:55:25.264286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0607100","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-07-04T14:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFdSuKwVwng3PopomvDB8RW1Xo5tZQf1pbulX9o+Jr6Vrh62gdmt2Eypm+Bmm9YpdQZln7Gcpw7aJ1vV2hBDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:58:06.875720Z"},"content_sha256":"a79d96480814ec1bdd476ed3c2cc9509622de7d74056df3f053f5a2f13146ec5","schema_version":"1.0","event_id":"sha256:a79d96480814ec1bdd476ed3c2cc9509622de7d74056df3f053f5a2f13146ec5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:IRGYMJT7QQ4OMUN5NOOK7MYJX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Upper Bounds on The Approximability of 3D Strip Packing","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guochuan Zhang, Kazuo Iwama, Xin Han","submitted_at":"2006-07-22T02:06:26Z","abstract_excerpt":"In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used. Our results are below: i) we give an approximation algorithm with asymptotic worst-case ratio 1.69103, which improves the previous best bound of $2+\\epsilon$ by Jansen and Solis-Oba of SODA 2006; ii) we also present an asymptotic PTAS for the case in which all items have {\\em square} bases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607100","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0607100/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJqFmXT36mF39bsVXnWU9Gk0S2QDO8vNc20DlGDdt6OhYB42v25C3oYDYKHULHIbjtVvoasoPOkABHS5hrWDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:58:06.876079Z"},"content_sha256":"16aa46a32b12a90a8fa00ef58c7b6af8463be6020556906e4eb0d68d274df84b","schema_version":"1.0","event_id":"sha256:16aa46a32b12a90a8fa00ef58c7b6af8463be6020556906e4eb0d68d274df84b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3/bundle.json","state_url":"https://pith.science/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3/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-07-06T20:58:06Z","links":{"resolver":"https://pith.science/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3","bundle":"https://pith.science/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3/bundle.json","state":"https://pith.science/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRGYMJT7QQ4OMUN5NOOK7MYJX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:IRGYMJT7QQ4OMUN5NOOK7MYJX3","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":"2a6111a08cad19e284e935e64f187533f92b3c4b0a4147c5640eb62289c02825","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-07-22T02:06:26Z","title_canon_sha256":"8a2eb2d440d92d30039847617aafab622da47e4633ee2bdf69b4bd3bc646a887"},"schema_version":"1.0","source":{"id":"cs/0607100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0607100","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0607100v1","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607100","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"IRGYMJT7QQ4O","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"pith_short_16","alias_value":"IRGYMJT7QQ4OMUN5","created_at":"2026-07-04T14:55:25Z"},{"alias_kind":"pith_short_8","alias_value":"IRGYMJT7","created_at":"2026-07-04T14:55:25Z"}],"graph_snapshots":[{"event_id":"sha256:16aa46a32b12a90a8fa00ef58c7b6af8463be6020556906e4eb0d68d274df84b","target":"graph","created_at":"2026-07-04T14:55:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0607100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used. Our results are below: i) we give an approximation algorithm with asymptotic worst-case ratio 1.69103, which improves the previous best bound of $2+\\epsilon$ by Jansen and Solis-Oba of SODA 2006; ii) we also present an asymptotic PTAS for the case in which all items have {\\em square} bases.","authors_text":"Guochuan Zhang, Kazuo Iwama, Xin Han","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-07-22T02:06:26Z","title":"New Upper Bounds on The Approximability of 3D Strip Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607100","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:a79d96480814ec1bdd476ed3c2cc9509622de7d74056df3f053f5a2f13146ec5","target":"record","created_at":"2026-07-04T14:55:25Z","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":"2a6111a08cad19e284e935e64f187533f92b3c4b0a4147c5640eb62289c02825","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-07-22T02:06:26Z","title_canon_sha256":"8a2eb2d440d92d30039847617aafab622da47e4633ee2bdf69b4bd3bc646a887"},"schema_version":"1.0","source":{"id":"cs/0607100","kind":"arxiv","version":1}},"canonical_sha256":"444d86267f8438e651bd6b9cafb309beddb0e52b454f76bfbbec656b3d096380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"444d86267f8438e651bd6b9cafb309beddb0e52b454f76bfbbec656b3d096380","first_computed_at":"2026-07-04T14:55:25.264286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:55:25.264286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHM6b60gTwqxnxAwxUSDgE+J0RbgGNLbbLH612xT95iCEHIsTYJug+4dIJA7NF/62ACdsEo8dPlpESgKWnETCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:55:25.264628Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0607100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a79d96480814ec1bdd476ed3c2cc9509622de7d74056df3f053f5a2f13146ec5","sha256:16aa46a32b12a90a8fa00ef58c7b6af8463be6020556906e4eb0d68d274df84b"],"state_sha256":"b6f8f5595f0531e2a3383f5782a42fa51cc4da5b0a45574a139e899381157e29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejapq5I4L432quHn1o+kXFvWWuLSp87ThNuskBZjJmXkZm/VnDm4XO8WjPA1krmh2yAPQiA6ggSFeN1YwhSKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:58:06.877935Z","bundle_sha256":"8bbf08dbac81144d1767f0010ba257b13ba298e5f8ea73e5684fcdf7e554ffc3"}}