{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DAN4IRAYE457SV4U4PTVIWIEI3","short_pith_number":"pith:DAN4IRAY","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"},"canonical_sha256":"181bc44418273bf95794e3e754590446e12fc049e74657eaa6bb323ed40231d8","source":{"kind":"arxiv","id":"1109.3544","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3544","created_at":"2026-05-18T04:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3544v2","created_at":"2026-05-18T04:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3544","created_at":"2026-05-18T04:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"DAN4IRAYE457","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DAN4IRAYE457SV4U","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DAN4IRAY","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DAN4IRAYE457SV4U4PTVIWIEI3","target":"record","payload":{"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"},"canonical_sha256":"181bc44418273bf95794e3e754590446e12fc049e74657eaa6bb323ed40231d8","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"},"source_kind":"arxiv","source_id":"1109.3544","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-18T04:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmX1bS7sOj9rVh6FsNV9Esag89EML0pVhhX9TEAKTFl91dX+wAScUh7eo84yh5MpuQdRkwPpFxMTV3OA6amEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:55:43.772199Z"},"content_sha256":"189b105d061023f9a6f90c5f7753f3915f26ba89d634ec610f4e01ab75a32fae","schema_version":"1.0","event_id":"sha256:189b105d061023f9a6f90c5f7753f3915f26ba89d634ec610f4e01ab75a32fae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DAN4IRAYE457SV4U4PTVIWIEI3","target":"graph","payload":{"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"},"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-18T04:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCfLryavxTKBeoo6ufJIoY7RQzUgeJQj2eQm0GScnQxul9x9/Y5y8QqievUM2ab/W79VHq8MUuXS6quoGhLQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:55:43.772941Z"},"content_sha256":"8638dfc3abdacaa3aee533f9959859f2486f855cd9e6b378266411f8b25a69a5","schema_version":"1.0","event_id":"sha256:8638dfc3abdacaa3aee533f9959859f2486f855cd9e6b378266411f8b25a69a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/bundle.json","state_url":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAN4IRAYE457SV4U4PTVIWIEI3/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-10T09:55:43Z","links":{"resolver":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3","bundle":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/bundle.json","state":"https://pith.science/pith/DAN4IRAYE457SV4U4PTVIWIEI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAN4IRAYE457SV4U4PTVIWIEI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DAN4IRAYE457SV4U4PTVIWIEI3","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":"4ef69156b20f8e8faa09bdd6829d6082f6b2de72c2335144b6ad0b2669ac0981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-16T08:03:50Z","title_canon_sha256":"2c031228af7ccdf526a92e5232905640c2952d64fedef01179429410bbc8f37d"},"schema_version":"1.0","source":{"id":"1109.3544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3544","created_at":"2026-05-18T04:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3544v2","created_at":"2026-05-18T04:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3544","created_at":"2026-05-18T04:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"DAN4IRAYE457","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DAN4IRAYE457SV4U","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DAN4IRAY","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:8638dfc3abdacaa3aee533f9959859f2486f855cd9e6b378266411f8b25a69a5","target":"graph","created_at":"2026-05-18T04:01:14Z","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":"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","authors_text":"Alexander Souza, Matthias Hellwig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-16T08:03:50Z","title":"Approximation Algorithms for Variable-Sized and Generalized Bin Covering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3544","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:189b105d061023f9a6f90c5f7753f3915f26ba89d634ec610f4e01ab75a32fae","target":"record","created_at":"2026-05-18T04:01:14Z","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":"4ef69156b20f8e8faa09bdd6829d6082f6b2de72c2335144b6ad0b2669ac0981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-16T08:03:50Z","title_canon_sha256":"2c031228af7ccdf526a92e5232905640c2952d64fedef01179429410bbc8f37d"},"schema_version":"1.0","source":{"id":"1109.3544","kind":"arxiv","version":2}},"canonical_sha256":"181bc44418273bf95794e3e754590446e12fc049e74657eaa6bb323ed40231d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181bc44418273bf95794e3e754590446e12fc049e74657eaa6bb323ed40231d8","first_computed_at":"2026-05-18T04:01:14.517070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:14.517070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZvUp/yo8tOyBK2OtzAMZlCK86nFNRxpE039pKjoe+z2gb9zCYjIcpbIiApTp/zO8O4/AC7kjzNDdit34fgHDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:14.517737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:189b105d061023f9a6f90c5f7753f3915f26ba89d634ec610f4e01ab75a32fae","sha256:8638dfc3abdacaa3aee533f9959859f2486f855cd9e6b378266411f8b25a69a5"],"state_sha256":"92d1ad16e98243684c2d0fe979d8425ff707b6d0ae2f57f103bbd38e74b414f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVCspB9GFPzqaU+Yckn7OUOE2P2iN41etMAhXtAwKvOlu6RincQtTCW3vg2k7s6x/zQOnWBsjtQmRTGmN1dGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:55:43.777119Z","bundle_sha256":"8846ae06508b06a98d00d3e1fe0e7c989988754ed15f3eeb06ced6ba618799e8"}}