{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7RSLF5OYF34YE24O4NVI2TUSMV","short_pith_number":"pith:7RSLF5OY","schema_version":"1.0","canonical_sha256":"fc64b2f5d82ef9826b8ee36a8d4e926540b981469edc70d41c4bdd18c91842bc","source":{"kind":"arxiv","id":"1707.01728","version":1},"attestation_state":"computed","paper":{"title":"A new and improved algorithm for online 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-07-06T10:55:12Z","abstract_excerpt":"We revisit the classic online bin packing problem. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called \"bins\" of total sizes no larger than 1, such that every item is assigned to a bin before the next item is presented. We use online partitioning of items into classes based on sizes, as in previous work, but we also apply a new method where items of one class can be packed into more than two types of bins, where a bin type is defined according to the number of such items grouped together. Additionally, we allow the smallest class "},"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":"1707.01728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T10:55:12Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"4bad84d6c56aab34b8582f963f9f0676c3c7717bc6addfb412c089a5320018db","abstract_canon_sha256":"372eb0eb8437048fe97e974a7fd712eaed66e3a29f2b2b63c568688e1f1697be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.668137Z","signature_b64":"6qJ+W8lHSLfe18Nhz16/zZgy60Cnami6p6TEEkuhpHsL4m5xkvkaEXzQ9R43W8rcoc+eklHymOoi4e4oqeYvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc64b2f5d82ef9826b8ee36a8d4e926540b981469edc70d41c4bdd18c91842bc","last_reissued_at":"2026-05-18T00:40:47.667561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.667561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new and improved algorithm for online 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-07-06T10:55:12Z","abstract_excerpt":"We revisit the classic online bin packing problem. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called \"bins\" of total sizes no larger than 1, such that every item is assigned to a bin before the next item is presented. We use online partitioning of items into classes based on sizes, as in previous work, but we also apply a new method where items of one class can be packed into more than two types of bins, where a bin type is defined according to the number of such items grouped together. Additionally, we allow the smallest class "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01728","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":"1707.01728","created_at":"2026-05-18T00:40:47.667635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01728v1","created_at":"2026-05-18T00:40:47.667635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01728","created_at":"2026-05-18T00:40:47.667635+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RSLF5OYF34Y","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RSLF5OYF34YE24O","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RSLF5OY","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14296","citing_title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","ref_index":274,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV","json":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV.json","graph_json":"https://pith.science/api/pith-number/7RSLF5OYF34YE24O4NVI2TUSMV/graph.json","events_json":"https://pith.science/api/pith-number/7RSLF5OYF34YE24O4NVI2TUSMV/events.json","paper":"https://pith.science/paper/7RSLF5OY"},"agent_actions":{"view_html":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV","download_json":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV.json","view_paper":"https://pith.science/paper/7RSLF5OY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01728&json=true","fetch_graph":"https://pith.science/api/pith-number/7RSLF5OYF34YE24O4NVI2TUSMV/graph.json","fetch_events":"https://pith.science/api/pith-number/7RSLF5OYF34YE24O4NVI2TUSMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV/action/storage_attestation","attest_author":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV/action/author_attestation","sign_citation":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV/action/citation_signature","submit_replication":"https://pith.science/pith/7RSLF5OYF34YE24O4NVI2TUSMV/action/replication_record"}},"created_at":"2026-05-18T00:40:47.667635+00:00","updated_at":"2026-05-18T00:40:47.667635+00:00"}