{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5GHMB47VZR26KYE3L6ELSGA6AN","short_pith_number":"pith:5GHMB47V","schema_version":"1.0","canonical_sha256":"e98ec0f3f5cc75e5609b5f88b9181e036669625a1b880eb592024b00ca0db8f9","source":{"kind":"arxiv","id":"2506.09004","version":1},"attestation_state":"computed","paper":{"title":"Improving Online Bin Covering with Little Advice","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovi\\'c","submitted_at":"2025-06-10T17:23:46Z","abstract_excerpt":"The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin is at least~1. Boyar~{\\em et~al}.\\@~\\cite{boyar2021} present a strategy that with $O(\\log \\log n)$ bits of advice, where $n$ is the length of the input sequence, achieves a competitive ratio of $8/15\\approx0.5333\\ldots$. We show that with a strengthened analysis and some minor improvements, the same strategy achieves the significantly improved competitive ratio of~$135/242\\approx0.5578\\ldots$, still using $O(\\log \\log"},"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":"2506.09004","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-10T17:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"cc3784ac1370758bd555ddfc05c2fa71584fbf0423bdbe1c8ada4623dc68d59f","abstract_canon_sha256":"41005f23aad717a23c733e027e2907785eb6dafaca7d4fd6bf9b992318f8135f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:16.680778Z","signature_b64":"tmFlMv2SDL3OwA4Rv7oQx/Dy4DZFh/x5RQZk8vytOw3gA7ahKuThCFe6AJsuinYjK3wk1XsHSJC4rw06Yx7AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e98ec0f3f5cc75e5609b5f88b9181e036669625a1b880eb592024b00ca0db8f9","last_reissued_at":"2026-07-05T11:19:16.679799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:16.679799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Online Bin Covering with Little Advice","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovi\\'c","submitted_at":"2025-06-10T17:23:46Z","abstract_excerpt":"The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin is at least~1. Boyar~{\\em et~al}.\\@~\\cite{boyar2021} present a strategy that with $O(\\log \\log n)$ bits of advice, where $n$ is the length of the input sequence, achieves a competitive ratio of $8/15\\approx0.5333\\ldots$. We show that with a strengthened analysis and some minor improvements, the same strategy achieves the significantly improved competitive ratio of~$135/242\\approx0.5578\\ldots$, still using $O(\\log \\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09004","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.09004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.09004","created_at":"2026-07-05T11:19:16.679857+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.09004v1","created_at":"2026-07-05T11:19:16.679857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09004","created_at":"2026-07-05T11:19:16.679857+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GHMB47VZR26","created_at":"2026-07-05T11:19:16.679857+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GHMB47VZR26KYE3","created_at":"2026-07-05T11:19:16.679857+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GHMB47V","created_at":"2026-07-05T11:19:16.679857+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/5GHMB47VZR26KYE3L6ELSGA6AN","json":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN.json","graph_json":"https://pith.science/api/pith-number/5GHMB47VZR26KYE3L6ELSGA6AN/graph.json","events_json":"https://pith.science/api/pith-number/5GHMB47VZR26KYE3L6ELSGA6AN/events.json","paper":"https://pith.science/paper/5GHMB47V"},"agent_actions":{"view_html":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN","download_json":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN.json","view_paper":"https://pith.science/paper/5GHMB47V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.09004&json=true","fetch_graph":"https://pith.science/api/pith-number/5GHMB47VZR26KYE3L6ELSGA6AN/graph.json","fetch_events":"https://pith.science/api/pith-number/5GHMB47VZR26KYE3L6ELSGA6AN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN/action/storage_attestation","attest_author":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN/action/author_attestation","sign_citation":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN/action/citation_signature","submit_replication":"https://pith.science/pith/5GHMB47VZR26KYE3L6ELSGA6AN/action/replication_record"}},"created_at":"2026-07-05T11:19:16.679857+00:00","updated_at":"2026-07-05T11:19:16.679857+00:00"}