{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VDL5VDI3SYRQNUMJ77KRVXQGGA","short_pith_number":"pith:VDL5VDI3","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"},"canonical_sha256":"a8d7da8d1b962306d189ffd51ade06300d6e34c3dd8260157f8f59dde40aa53e","source":{"kind":"arxiv","id":"1309.6477","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6477","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6477v2","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6477","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"VDL5VDI3SYRQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VDL5VDI3SYRQNUMJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VDL5VDI3","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VDL5VDI3SYRQNUMJ77KRVXQGGA","target":"record","payload":{"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"},"canonical_sha256":"a8d7da8d1b962306d189ffd51ade06300d6e34c3dd8260157f8f59dde40aa53e","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"},"source_kind":"arxiv","source_id":"1309.6477","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-18T02:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvhJXJZEP6pmgM2OSD1/EleQBigrC7JtWVxjxr5jsmDVCONvBi8AI9Lzqg5KdjnXjayXURJ0t9VvxGjIDNhOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:20:37.327530Z"},"content_sha256":"19fd4ca9e0d9ba4d9e55cc6bc8d3ccde8e529cb5c3d85aaa37aac4a0685c565a","schema_version":"1.0","event_id":"sha256:19fd4ca9e0d9ba4d9e55cc6bc8d3ccde8e529cb5c3d85aaa37aac4a0685c565a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VDL5VDI3SYRQNUMJ77KRVXQGGA","target":"graph","payload":{"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"},"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-18T02:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2YzQZ70cRV9B/L8Y+ZxwYcnkSru1eVz1lFc1UH8rsS17fo+8ACcly7JSQDI3ZSPuOc71NH+ER0m6qTm4+opBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:20:37.327873Z"},"content_sha256":"f1e76f504486f9742612c88df5295628b2b5a3896ae3d6734f08434f7634c17c","schema_version":"1.0","event_id":"sha256:f1e76f504486f9742612c88df5295628b2b5a3896ae3d6734f08434f7634c17c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/bundle.json","state_url":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/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-22T13:20:37Z","links":{"resolver":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA","bundle":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/bundle.json","state":"https://pith.science/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDL5VDI3SYRQNUMJ77KRVXQGGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VDL5VDI3SYRQNUMJ77KRVXQGGA","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":"0ff79d6a2fc70a76a7b680fc630ebfc3066a0b9f85bb495f7312f45c95c52b29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T12:20:20Z","title_canon_sha256":"ca19509c83d0781b2a12d0ad8c31e84273435e7d0f3f8d9d80ddeda207055c80"},"schema_version":"1.0","source":{"id":"1309.6477","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6477","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6477v2","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6477","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"VDL5VDI3SYRQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VDL5VDI3SYRQNUMJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VDL5VDI3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:f1e76f504486f9742612c88df5295628b2b5a3896ae3d6734f08434f7634c17c","target":"graph","created_at":"2026-05-18T02:57:43Z","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":"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","authors_text":"Kim S. Larsen, Lene M. Favrholdt, Marie G. Christ","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T12:20:20Z","title":"Online Bin Covering: Expectations vs. Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6477","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:19fd4ca9e0d9ba4d9e55cc6bc8d3ccde8e529cb5c3d85aaa37aac4a0685c565a","target":"record","created_at":"2026-05-18T02:57:43Z","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":"0ff79d6a2fc70a76a7b680fc630ebfc3066a0b9f85bb495f7312f45c95c52b29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T12:20:20Z","title_canon_sha256":"ca19509c83d0781b2a12d0ad8c31e84273435e7d0f3f8d9d80ddeda207055c80"},"schema_version":"1.0","source":{"id":"1309.6477","kind":"arxiv","version":2}},"canonical_sha256":"a8d7da8d1b962306d189ffd51ade06300d6e34c3dd8260157f8f59dde40aa53e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8d7da8d1b962306d189ffd51ade06300d6e34c3dd8260157f8f59dde40aa53e","first_computed_at":"2026-05-18T02:57:43.475666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:43.475666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FaKyG9YBCbvxtf2qDEo0KPz0Fo5bi8EihewrGgLNpAoaCi2SbRjg26vu6ozUB/yT31eDjl12CEqla+XvmQHeDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:43.476114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6477","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19fd4ca9e0d9ba4d9e55cc6bc8d3ccde8e529cb5c3d85aaa37aac4a0685c565a","sha256:f1e76f504486f9742612c88df5295628b2b5a3896ae3d6734f08434f7634c17c"],"state_sha256":"cdcc1a93dfa1407950666cfcc7db74a13b72bd9f152f52978500762aa9c1b1fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlW41EdDeBF/A+y7Rq11DCA7vBYM1qhMD46A5lJGL4KNmBo+KMJS54s0g8EdFp8C0KfXFaX2AdLimHJK2xAEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:20:37.330086Z","bundle_sha256":"b5df715894044820e82ad30eb80612c6e0b4f5f23aa38bf130dd3598805a1c02"}}