{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2NQ5KSM2IF4AVOM4RVGRS4OQTM","short_pith_number":"pith:2NQ5KSM2","canonical_record":{"source":{"id":"2401.14881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-26T14:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"b60e75f3d1c2cbfa26a45b1724a3a0c887a4491b581fe9a56ed010a32150e64a","abstract_canon_sha256":"8f192c59824a3c060791f3a08c07622455d367e7e1a049b8085ecc195ab1f6ff"},"schema_version":"1.0"},"canonical_sha256":"d361d5499a41780ab99c8d4d1971d09b0f959ec210ce5b22597c488b58300ed3","source":{"kind":"arxiv","id":"2401.14881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14881","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14881v1","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14881","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"pith_short_12","alias_value":"2NQ5KSM2IF4A","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"pith_short_16","alias_value":"2NQ5KSM2IF4AVOM4","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"pith_short_8","alias_value":"2NQ5KSM2","created_at":"2026-07-05T07:38:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2NQ5KSM2IF4AVOM4RVGRS4OQTM","target":"record","payload":{"canonical_record":{"source":{"id":"2401.14881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-26T14:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"b60e75f3d1c2cbfa26a45b1724a3a0c887a4491b581fe9a56ed010a32150e64a","abstract_canon_sha256":"8f192c59824a3c060791f3a08c07622455d367e7e1a049b8085ecc195ab1f6ff"},"schema_version":"1.0"},"canonical_sha256":"d361d5499a41780ab99c8d4d1971d09b0f959ec210ce5b22597c488b58300ed3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:03.064308Z","signature_b64":"tTurWAyDDC8YtwAkC19t9In+EuaoxeOGsFw/Z2czE6UZpngJjeIHpcoOv/vumTo2EmKxzppNgWGUWiTR5CZOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d361d5499a41780ab99c8d4d1971d09b0f959ec210ce5b22597c488b58300ed3","last_reissued_at":"2026-07-05T07:38:03.063916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:03.063916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.14881","source_version":1,"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-07-05T07:38:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5BZIv4czJgQ2r9nJPE/j85o8hsn/jyWe9RvDAz3G2/eRdEZ6FS7zuiXmv5aoEOZlJbfitazi+kjvGKpy3EPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T21:17:02.167001Z"},"content_sha256":"7a743ee5fcf6106e50e5e7e403a1f9f865c7e915c1c8304ee5ce75b830a3223e","schema_version":"1.0","event_id":"sha256:7a743ee5fcf6106e50e5e7e403a1f9f865c7e915c1c8304ee5ce75b830a3223e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2NQ5KSM2IF4AVOM4RVGRS4OQTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Bin Covering with Frequency Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Magnus Berg, Shahin Kamali","submitted_at":"2024-01-26T14:07:16Z","abstract_excerpt":"We study the discrete bin covering problem where a multiset of items from a fixed set $S \\subseteq (0,1]$ must be split into disjoint subsets while maximizing the number of subsets whose contents sum to at least $1$. We study the online discrete variant, where $S$ is finite, and items arrive sequentially. In the purely online setting, we show that the competitive ratios of best deterministic (and randomized) algorithms converge to $\\frac{1}{2}$ for large $S$, similar to the continuous setting. Therefore, we consider the problem under the prediction setting, where algorithms may access a vector"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14881","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/2401.14881/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"},"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-07-05T07:38:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/K2thq4xPGsazTxtZ4/m8b6Slm4uhRRK+JO+LyqfWGeUwY7/Kaw1KdZK/DFCBIdy2YViyXErvkKY3Vy4EgCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T21:17:02.167566Z"},"content_sha256":"b26e063d0c7d937c22a4cb9c20e709ac53cd1c796b0923b92b64fe14849defc1","schema_version":"1.0","event_id":"sha256:b26e063d0c7d937c22a4cb9c20e709ac53cd1c796b0923b92b64fe14849defc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM/bundle.json","state_url":"https://pith.science/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM/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-08-23T21:17:02Z","links":{"resolver":"https://pith.science/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM","bundle":"https://pith.science/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM/bundle.json","state":"https://pith.science/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NQ5KSM2IF4AVOM4RVGRS4OQTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2NQ5KSM2IF4AVOM4RVGRS4OQTM","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":"8f192c59824a3c060791f3a08c07622455d367e7e1a049b8085ecc195ab1f6ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-26T14:07:16Z","title_canon_sha256":"b60e75f3d1c2cbfa26a45b1724a3a0c887a4491b581fe9a56ed010a32150e64a"},"schema_version":"1.0","source":{"id":"2401.14881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14881","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14881v1","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14881","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"pith_short_12","alias_value":"2NQ5KSM2IF4A","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"pith_short_16","alias_value":"2NQ5KSM2IF4AVOM4","created_at":"2026-07-05T07:38:03Z"},{"alias_kind":"pith_short_8","alias_value":"2NQ5KSM2","created_at":"2026-07-05T07:38:03Z"}],"graph_snapshots":[{"event_id":"sha256:b26e063d0c7d937c22a4cb9c20e709ac53cd1c796b0923b92b64fe14849defc1","target":"graph","created_at":"2026-07-05T07:38:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.14881/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the discrete bin covering problem where a multiset of items from a fixed set $S \\subseteq (0,1]$ must be split into disjoint subsets while maximizing the number of subsets whose contents sum to at least $1$. We study the online discrete variant, where $S$ is finite, and items arrive sequentially. In the purely online setting, we show that the competitive ratios of best deterministic (and randomized) algorithms converge to $\\frac{1}{2}$ for large $S$, similar to the continuous setting. Therefore, we consider the problem under the prediction setting, where algorithms may access a vector","authors_text":"Magnus Berg, Shahin Kamali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-26T14:07:16Z","title":"Online Bin Covering with Frequency Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14881","kind":"arxiv","version":1},"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:7a743ee5fcf6106e50e5e7e403a1f9f865c7e915c1c8304ee5ce75b830a3223e","target":"record","created_at":"2026-07-05T07:38:03Z","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":"8f192c59824a3c060791f3a08c07622455d367e7e1a049b8085ecc195ab1f6ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-26T14:07:16Z","title_canon_sha256":"b60e75f3d1c2cbfa26a45b1724a3a0c887a4491b581fe9a56ed010a32150e64a"},"schema_version":"1.0","source":{"id":"2401.14881","kind":"arxiv","version":1}},"canonical_sha256":"d361d5499a41780ab99c8d4d1971d09b0f959ec210ce5b22597c488b58300ed3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d361d5499a41780ab99c8d4d1971d09b0f959ec210ce5b22597c488b58300ed3","first_computed_at":"2026-07-05T07:38:03.063916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:03.063916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tTurWAyDDC8YtwAkC19t9In+EuaoxeOGsFw/Z2czE6UZpngJjeIHpcoOv/vumTo2EmKxzppNgWGUWiTR5CZOAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:03.064308Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.14881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a743ee5fcf6106e50e5e7e403a1f9f865c7e915c1c8304ee5ce75b830a3223e","sha256:b26e063d0c7d937c22a4cb9c20e709ac53cd1c796b0923b92b64fe14849defc1"],"state_sha256":"254f29dfb4e6adc0b1d47870074e483b95f613242f9ab430aede4d383bb2458f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYesfytWXP3ZrSM+f10Z78buHUz/SdmMEAffkbFm6OI7C6bD5pJqW43y9N5Vh4IQy41JY+W/NerNM10os6JCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T21:17:02.171619Z","bundle_sha256":"d97468a4b9ac22b73725d6a62d0407db64b38fd75b41c6ab16fe3703b49f785a"}}