{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DAN4IRAYE457SV4U4PTVIWIEI3","short_pith_number":"pith:DAN4IRAY","schema_version":"1.0","canonical_sha256":"181bc44418273bf95794e3e754590446e12fc049e74657eaa6bb323ed40231d8","source":{"kind":"arxiv","id":"1109.3544","version":2},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Variable-Sized and Generalized Bin Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Souza, Matthias Hellwig","submitted_at":"2011-09-16T08:03:50Z","abstract_excerpt":"We consider the Generalized Bin Covering (GBC) problem: We are given $m$ bin types, where each bin of type $i$ has profit $p_i$ and demand $d_i$. Furthermore, there are $n$ items, where item $j$ has size $s_j$. A bin of type $i$ is covered if the set of items assigned to it has total size at least the demand $d_i$. In that case, the profit of $p_i$ is earned and the objective is to maximize the total profit. To the best of our knowledge, only the cases $p_i = d_i = 1$ (Bin Covering) and $p_i = d_i$ (Variable-Sized Bin Covering (VSBC)) have been treated before. We study two models of bin supply"},"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":"1109.3544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-16T08:03:50Z","cross_cats_sorted":[],"title_canon_sha256":"2c031228af7ccdf526a92e5232905640c2952d64fedef01179429410bbc8f37d","abstract_canon_sha256":"4ef69156b20f8e8faa09bdd6829d6082f6b2de72c2335144b6ad0b2669ac0981"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:14.517737Z","signature_b64":"ZvUp/yo8tOyBK2OtzAMZlCK86nFNRxpE039pKjoe+z2gb9zCYjIcpbIiApTp/zO8O4/AC7kjzNDdit34fgHDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181bc44418273bf95794e3e754590446e12fc049e74657eaa6bb323ed40231d8","last_reissued_at":"2026-05-18T04:01:14.517070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:14.517070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Variable-Sized and Generalized Bin Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Souza, Matthias Hellwig","submitted_at":"2011-09-16T08:03:50Z","abstract_excerpt":"We consider the Generalized Bin Covering (GBC) problem: We are given $m$ bin types, where each bin of type $i$ has profit $p_i$ and demand $d_i$. Furthermore, there are $n$ items, where item $j$ has size $s_j$. A bin of type $i$ is covered if the set of items assigned to it has total size at least the demand $d_i$. In that case, the profit of $p_i$ is earned and the objective is to maximize the total profit. To the best of our knowledge, only the cases $p_i = d_i = 1$ (Bin Covering) and $p_i = d_i$ (Variable-Sized Bin Covering (VSBC)) have been treated before. We study two models of bin supply"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3544","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":"1109.3544","created_at":"2026-05-18T04:01:14.517178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3544v2","created_at":"2026-05-18T04:01:14.517178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3544","created_at":"2026-05-18T04:01:14.517178+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAN4IRAYE457","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAN4IRAYE457SV4U","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAN4IRAY","created_at":"2026-05-18T12:26:26.731475+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/DAN4IRAYE457SV4U4PTVIWIEI3","json":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3.json","graph_json":"https://pith.science/api/pith-number/DAN4IRAYE457SV4U4PTVIWIEI3/graph.json","events_json":"https://pith.science/api/pith-number/DAN4IRAYE457SV4U4PTVIWIEI3/events.json","paper":"https://pith.science/paper/DAN4IRAY"},"agent_actions":{"view_html":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3","download_json":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3.json","view_paper":"https://pith.science/paper/DAN4IRAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3544&json=true","fetch_graph":"https://pith.science/api/pith-number/DAN4IRAYE457SV4U4PTVIWIEI3/graph.json","fetch_events":"https://pith.science/api/pith-number/DAN4IRAYE457SV4U4PTVIWIEI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/action/storage_attestation","attest_author":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/action/author_attestation","sign_citation":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/action/citation_signature","submit_replication":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/action/replication_record"}},"created_at":"2026-05-18T04:01:14.517178+00:00","updated_at":"2026-05-18T04:01:14.517178+00:00"}