{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VDL5VDI3SYRQNUMJ77KRVXQGGA","short_pith_number":"pith:VDL5VDI3","schema_version":"1.0","canonical_sha256":"a8d7da8d1b962306d189ffd51ade06300d6e34c3dd8260157f8f59dde40aa53e","source":{"kind":"arxiv","id":"1309.6477","version":2},"attestation_state":"computed","paper":{"title":"Online Bin Covering: Expectations vs. Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kim S. Larsen, Lene M. Favrholdt, Marie G. Christ","submitted_at":"2013-09-25T12:20:20Z","abstract_excerpt":"Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin.\n  For online bin covering, competitive analysis fails to distinguish between most algorithms of interest; all \"reasonable\" algorithms have a competitive ratio of 1/2. Thus, in order to get a better understanding of the combinatorial difficulties in solving this problem, we turn to other performance measures, namely relative worst order, random order, and max/max analysis, as well as analyzing input with restr"},"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":"1309.6477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T12:20:20Z","cross_cats_sorted":[],"title_canon_sha256":"ca19509c83d0781b2a12d0ad8c31e84273435e7d0f3f8d9d80ddeda207055c80","abstract_canon_sha256":"0ff79d6a2fc70a76a7b680fc630ebfc3066a0b9f85bb495f7312f45c95c52b29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:43.476114Z","signature_b64":"FaKyG9YBCbvxtf2qDEo0KPz0Fo5bi8EihewrGgLNpAoaCi2SbRjg26vu6ozUB/yT31eDjl12CEqla+XvmQHeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8d7da8d1b962306d189ffd51ade06300d6e34c3dd8260157f8f59dde40aa53e","last_reissued_at":"2026-05-18T02:57:43.475666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:43.475666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Bin Covering: Expectations vs. Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kim S. Larsen, Lene M. Favrholdt, Marie G. Christ","submitted_at":"2013-09-25T12:20:20Z","abstract_excerpt":"Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin.\n  For online bin covering, competitive analysis fails to distinguish between most algorithms of interest; all \"reasonable\" algorithms have a competitive ratio of 1/2. Thus, in order to get a better understanding of the combinatorial difficulties in solving this problem, we turn to other performance measures, namely relative worst order, random order, and max/max analysis, as well as analyzing input with restr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6477","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.6477","created_at":"2026-05-18T02:57:43.475739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6477v2","created_at":"2026-05-18T02:57:43.475739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6477","created_at":"2026-05-18T02:57:43.475739+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDL5VDI3SYRQ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDL5VDI3SYRQNUMJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDL5VDI3","created_at":"2026-05-18T12:28:04.890932+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/VDL5VDI3SYRQNUMJ77KRVXQGGA","json":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA.json","graph_json":"https://pith.science/api/pith-number/VDL5VDI3SYRQNUMJ77KRVXQGGA/graph.json","events_json":"https://pith.science/api/pith-number/VDL5VDI3SYRQNUMJ77KRVXQGGA/events.json","paper":"https://pith.science/paper/VDL5VDI3"},"agent_actions":{"view_html":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA","download_json":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA.json","view_paper":"https://pith.science/paper/VDL5VDI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6477&json=true","fetch_graph":"https://pith.science/api/pith-number/VDL5VDI3SYRQNUMJ77KRVXQGGA/graph.json","fetch_events":"https://pith.science/api/pith-number/VDL5VDI3SYRQNUMJ77KRVXQGGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/action/storage_attestation","attest_author":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/action/author_attestation","sign_citation":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/action/citation_signature","submit_replication":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/action/replication_record"}},"created_at":"2026-05-18T02:57:43.475739+00:00","updated_at":"2026-05-18T02:57:43.475739+00:00"}