{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OHPEUGARQCGJR3WN3RHAS7R7YL","short_pith_number":"pith:OHPEUGAR","canonical_record":{"source":{"id":"1607.01229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T12:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"d9138697b6e5a2acac7ef7a1f44341f6536929f26b0db6beb2e984240acec4b5","abstract_canon_sha256":"65ebb0f9b2d9e785097641f41bd74efb0cfe761f8ca3353aafab3ebeb6869aca"},"schema_version":"1.0"},"canonical_sha256":"71de4a1811808c98eecddc4e097e3fc2cca28a9df607dcc29fd064fbf49133f9","source":{"kind":"arxiv","id":"1607.01229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01229","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01229v2","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01229","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"OHPEUGARQCGJ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OHPEUGARQCGJR3WN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OHPEUGAR","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OHPEUGARQCGJR3WN3RHAS7R7YL","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T12:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"d9138697b6e5a2acac7ef7a1f44341f6536929f26b0db6beb2e984240acec4b5","abstract_canon_sha256":"65ebb0f9b2d9e785097641f41bd74efb0cfe761f8ca3353aafab3ebeb6869aca"},"schema_version":"1.0"},"canonical_sha256":"71de4a1811808c98eecddc4e097e3fc2cca28a9df607dcc29fd064fbf49133f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.580311Z","signature_b64":"7dr7PuBJ+pvN7MySzGCelNfYvCFLoSXvaR2Sx3muf4b/3BWNuCxx0JfWCXpJk/gD8c5wmkA13tENAP7qnfsHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71de4a1811808c98eecddc4e097e3fc2cca28a9df607dcc29fd064fbf49133f9","last_reissued_at":"2026-05-18T00:31:22.579875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.579875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01229","source_version":2,"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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIxD/F/8sJ+w4pzSorCi2TiC56jW0XjOHFaBaN16NQAbRkl4iCTXTsVOveSAWoGdOYUPntLHpvFOBmjX7UUBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:05:52.708380Z"},"content_sha256":"9cd60f4de980612c367cb535bc1d6df4da5ce2e9ddc64849914feb3dd6f0e95a","schema_version":"1.0","event_id":"sha256:9cd60f4de980612c367cb535bc1d6df4da5ce2e9ddc64849914feb3dd6f0e95a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OHPEUGARQCGJR3WN3RHAS7R7YL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for Online Hypercube and Rectangle Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e van Vliet, David Blitz, Gerhard J. Woeginger, Rob van Stee, Sandy Heydrich","submitted_at":"2016-07-05T12:51:03Z","abstract_excerpt":"Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and rectangles (in two dimensions) and for an important subclass, so-called Harmonic-type algorithms for hypercubes (in two or more dimensions). Lastly, we show that two adaptions of ideas from a one-dimensional packing algorithm to square packing do not help to break the barrier of 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01229","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"},"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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2f5GqmxoGZF0xDEfZ9JlHodSLAWLri3YXVsTRn6iLWi8WJYv2g+vJUHdpetNw8BI0blMs6DV75xB42ftX/TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:05:52.708723Z"},"content_sha256":"82b5df63f2395f5348d77adabd83fcd6ebf6cd039cf5db5a4cfa28861991b6d3","schema_version":"1.0","event_id":"sha256:82b5df63f2395f5348d77adabd83fcd6ebf6cd039cf5db5a4cfa28861991b6d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHPEUGARQCGJR3WN3RHAS7R7YL/bundle.json","state_url":"https://pith.science/pith/OHPEUGARQCGJR3WN3RHAS7R7YL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHPEUGARQCGJR3WN3RHAS7R7YL/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-06-23T15:05:52Z","links":{"resolver":"https://pith.science/pith/OHPEUGARQCGJR3WN3RHAS7R7YL","bundle":"https://pith.science/pith/OHPEUGARQCGJR3WN3RHAS7R7YL/bundle.json","state":"https://pith.science/pith/OHPEUGARQCGJR3WN3RHAS7R7YL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHPEUGARQCGJR3WN3RHAS7R7YL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OHPEUGARQCGJR3WN3RHAS7R7YL","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":"65ebb0f9b2d9e785097641f41bd74efb0cfe761f8ca3353aafab3ebeb6869aca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T12:51:03Z","title_canon_sha256":"d9138697b6e5a2acac7ef7a1f44341f6536929f26b0db6beb2e984240acec4b5"},"schema_version":"1.0","source":{"id":"1607.01229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01229","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01229v2","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01229","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"OHPEUGARQCGJ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OHPEUGARQCGJR3WN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OHPEUGAR","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:82b5df63f2395f5348d77adabd83fcd6ebf6cd039cf5db5a4cfa28861991b6d3","target":"graph","created_at":"2026-05-18T00:31:22Z","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":"Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and rectangles (in two dimensions) and for an important subclass, so-called Harmonic-type algorithms for hypercubes (in two or more dimensions). Lastly, we show that two adaptions of ideas from a one-dimensional packing algorithm to square packing do not help to break the barrier of 2.","authors_text":"Andr\\'e van Vliet, David Blitz, Gerhard J. Woeginger, Rob van Stee, Sandy Heydrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T12:51:03Z","title":"Improved Lower Bounds for Online Hypercube and Rectangle Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01229","kind":"arxiv","version":2},"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:9cd60f4de980612c367cb535bc1d6df4da5ce2e9ddc64849914feb3dd6f0e95a","target":"record","created_at":"2026-05-18T00:31:22Z","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":"65ebb0f9b2d9e785097641f41bd74efb0cfe761f8ca3353aafab3ebeb6869aca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T12:51:03Z","title_canon_sha256":"d9138697b6e5a2acac7ef7a1f44341f6536929f26b0db6beb2e984240acec4b5"},"schema_version":"1.0","source":{"id":"1607.01229","kind":"arxiv","version":2}},"canonical_sha256":"71de4a1811808c98eecddc4e097e3fc2cca28a9df607dcc29fd064fbf49133f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71de4a1811808c98eecddc4e097e3fc2cca28a9df607dcc29fd064fbf49133f9","first_computed_at":"2026-05-18T00:31:22.579875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:22.579875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7dr7PuBJ+pvN7MySzGCelNfYvCFLoSXvaR2Sx3muf4b/3BWNuCxx0JfWCXpJk/gD8c5wmkA13tENAP7qnfsHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:22.580311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cd60f4de980612c367cb535bc1d6df4da5ce2e9ddc64849914feb3dd6f0e95a","sha256:82b5df63f2395f5348d77adabd83fcd6ebf6cd039cf5db5a4cfa28861991b6d3"],"state_sha256":"2ac056adaad85adf8976c5a2cb347be183aeefb3d7d430250fc4df38d1859699"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVhD5U7Rb0MsqcVXnP+E89WPYBiFPSgrib3RVTecy3XBfTPoAXC+B3CXvpDS7wbQe4jycn9PaQhJulhP14jbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:05:52.710793Z","bundle_sha256":"cb96de7cea915b5bf7ffe9b365a1c00e5bd96eb88721804d40522c8d32ef50e3"}}