{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UTA4TZKMOYZIERTG2LDXI4JI75","short_pith_number":"pith:UTA4TZKM","schema_version":"1.0","canonical_sha256":"a4c1c9e54c7632824666d2c7747128ff7a9d0e2c72967e5fe6db7cd86affc350","source":{"kind":"arxiv","id":"1708.03228","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for several online variants of bin packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Gy\\\"orgy D\\'osa, J\\'anos Balogh, J\\'ozsef B\\'ek\\'esi, Leah Epstein","submitted_at":"2017-08-10T14:13:45Z","abstract_excerpt":"We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75."},"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":"1708.03228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T14:13:45Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"ea0ad3b67d83cdd74b556fd767c22d5126d1818194e597026706fe6b02bea74b","abstract_canon_sha256":"99e36710c60dfdff098c9cde4f52f80956e2504447e7599dd38d057b54917153"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:14.417895Z","signature_b64":"XC2bIboPO9eSz+VkSKssvtbma6iZa+pRIMQr9uulSv5CI1hbCS5E4XIvdQfB6vrQU6TBNCNEQJ2Xb+qeYtyKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c1c9e54c7632824666d2c7747128ff7a9d0e2c72967e5fe6db7cd86affc350","last_reissued_at":"2026-05-18T00:38:14.417218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:14.417218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for several online variants of bin packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Gy\\\"orgy D\\'osa, J\\'anos Balogh, J\\'ozsef B\\'ek\\'esi, Leah Epstein","submitted_at":"2017-08-10T14:13:45Z","abstract_excerpt":"We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03228","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":"1708.03228","created_at":"2026-05-18T00:38:14.417326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03228v1","created_at":"2026-05-18T00:38:14.417326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03228","created_at":"2026-05-18T00:38:14.417326+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTA4TZKMOYZI","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTA4TZKMOYZIERTG","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTA4TZKM","created_at":"2026-05-18T12:31:49.984773+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/UTA4TZKMOYZIERTG2LDXI4JI75","json":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75.json","graph_json":"https://pith.science/api/pith-number/UTA4TZKMOYZIERTG2LDXI4JI75/graph.json","events_json":"https://pith.science/api/pith-number/UTA4TZKMOYZIERTG2LDXI4JI75/events.json","paper":"https://pith.science/paper/UTA4TZKM"},"agent_actions":{"view_html":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75","download_json":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75.json","view_paper":"https://pith.science/paper/UTA4TZKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03228&json=true","fetch_graph":"https://pith.science/api/pith-number/UTA4TZKMOYZIERTG2LDXI4JI75/graph.json","fetch_events":"https://pith.science/api/pith-number/UTA4TZKMOYZIERTG2LDXI4JI75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75/action/storage_attestation","attest_author":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75/action/author_attestation","sign_citation":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75/action/citation_signature","submit_replication":"https://pith.science/pith/UTA4TZKMOYZIERTG2LDXI4JI75/action/replication_record"}},"created_at":"2026-05-18T00:38:14.417326+00:00","updated_at":"2026-05-18T00:38:14.417326+00:00"}