{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X2BYJ3AJDL6XGDJD7YUDX5EDXL","short_pith_number":"pith:X2BYJ3AJ","canonical_record":{"source":{"id":"1601.08111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-29T14:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"90d013f0f904b9cad494085695df5e8a71439e7443983a6591629051536f6428","abstract_canon_sha256":"23e14c5f1726f82a7ef44770e6e5c0150687b7897452f2aa3540bce469a0f41e"},"schema_version":"1.0"},"canonical_sha256":"be8384ec091afd730d23fe283bf483bae42d05f1233d6158b17493872482c0bf","source":{"kind":"arxiv","id":"1601.08111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08111","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08111v2","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08111","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"X2BYJ3AJDL6X","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X2BYJ3AJDL6XGDJD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X2BYJ3AJ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X2BYJ3AJDL6XGDJD7YUDX5EDXL","target":"record","payload":{"canonical_record":{"source":{"id":"1601.08111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-29T14:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"90d013f0f904b9cad494085695df5e8a71439e7443983a6591629051536f6428","abstract_canon_sha256":"23e14c5f1726f82a7ef44770e6e5c0150687b7897452f2aa3540bce469a0f41e"},"schema_version":"1.0"},"canonical_sha256":"be8384ec091afd730d23fe283bf483bae42d05f1233d6158b17493872482c0bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:25.937089Z","signature_b64":"a84Ab/lo3jLWzenY+nEyA8tqE1bVMkxHDplVRVh7FZEWh/Slfremwr+O9gj4BET4he/iw2otS2ecuU7kqmtWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be8384ec091afd730d23fe283bf483bae42d05f1233d6158b17493872482c0bf","last_reissued_at":"2026-05-18T01:08:25.936571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:25.936571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.08111","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-18T01:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCysq1STkbkQjk0M0uN2eoiIMA67TdP8/qHijH3iSwYy6WE+im38/GJ+i6Kt9n3nIIhDT1wZly5Zg9XS7f4GAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:04:51.369805Z"},"content_sha256":"294f502a12eb640dfff45fdfbef7eabcb2a7dc9ee3b553c6c71265ca15b4b33b","schema_version":"1.0","event_id":"sha256:294f502a12eb640dfff45fdfbef7eabcb2a7dc9ee3b553c6c71265ca15b4b33b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X2BYJ3AJDL6XGDJD7YUDX5EDXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji\\v{r}\\'i Sgall, Martin B\\\"ohm, Pavel Vesel\\'y, Rob van Stee","submitted_at":"2016-01-29T14:04:12Z","abstract_excerpt":"Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.\n  We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build on previous algorithms and use a two-phase approach. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08111","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-18T01:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UknfrgIKahD2CxRTVAH83VsVaI2pPT3KrXVD4+7orGzEaHWZOYQ+S8UlDSIvgs7UkEzStZpvoe0MlWL7HZxhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:04:51.370456Z"},"content_sha256":"fe23ecc481e49e19045526f4deb635a9853f0e6e23e2b6d051682ce4f248bc3d","schema_version":"1.0","event_id":"sha256:fe23ecc481e49e19045526f4deb635a9853f0e6e23e2b6d051682ce4f248bc3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL/bundle.json","state_url":"https://pith.science/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL/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-27T18:04:51Z","links":{"resolver":"https://pith.science/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL","bundle":"https://pith.science/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL/bundle.json","state":"https://pith.science/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2BYJ3AJDL6XGDJD7YUDX5EDXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X2BYJ3AJDL6XGDJD7YUDX5EDXL","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":"23e14c5f1726f82a7ef44770e6e5c0150687b7897452f2aa3540bce469a0f41e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-29T14:04:12Z","title_canon_sha256":"90d013f0f904b9cad494085695df5e8a71439e7443983a6591629051536f6428"},"schema_version":"1.0","source":{"id":"1601.08111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08111","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08111v2","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08111","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"X2BYJ3AJDL6X","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X2BYJ3AJDL6XGDJD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X2BYJ3AJ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:fe23ecc481e49e19045526f4deb635a9853f0e6e23e2b6d051682ce4f248bc3d","target":"graph","created_at":"2026-05-18T01:08: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"},"paper":{"abstract_excerpt":"Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.\n  We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build on previous algorithms and use a two-phase approach. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions.","authors_text":"Ji\\v{r}\\'i Sgall, Martin B\\\"ohm, Pavel Vesel\\'y, Rob van Stee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-29T14:04:12Z","title":"A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08111","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:294f502a12eb640dfff45fdfbef7eabcb2a7dc9ee3b553c6c71265ca15b4b33b","target":"record","created_at":"2026-05-18T01:08: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":"23e14c5f1726f82a7ef44770e6e5c0150687b7897452f2aa3540bce469a0f41e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-29T14:04:12Z","title_canon_sha256":"90d013f0f904b9cad494085695df5e8a71439e7443983a6591629051536f6428"},"schema_version":"1.0","source":{"id":"1601.08111","kind":"arxiv","version":2}},"canonical_sha256":"be8384ec091afd730d23fe283bf483bae42d05f1233d6158b17493872482c0bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be8384ec091afd730d23fe283bf483bae42d05f1233d6158b17493872482c0bf","first_computed_at":"2026-05-18T01:08:25.936571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:25.936571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a84Ab/lo3jLWzenY+nEyA8tqE1bVMkxHDplVRVh7FZEWh/Slfremwr+O9gj4BET4he/iw2otS2ecuU7kqmtWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:25.937089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.08111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:294f502a12eb640dfff45fdfbef7eabcb2a7dc9ee3b553c6c71265ca15b4b33b","sha256:fe23ecc481e49e19045526f4deb635a9853f0e6e23e2b6d051682ce4f248bc3d"],"state_sha256":"cf0aa036c7caec00ab7e489ce071519110851c3ba781e727b2ba32a83989e28c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V0hZa65qDjYU0g3v78fMS2GAGcMl61XyTYE01o8fHk/h9vueWcsmWTKgvUbcICgY7LhPtMK23fjcL97hS3SJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:04:51.373787Z","bundle_sha256":"68956c6b7ce4ae33977b9f2e4982f303e8ebed49535aab7e19ef574d5951d2ab"}}