{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KHJQXGJXOOXUPMV6MDFKZY43I6","short_pith_number":"pith:KHJQXGJX","schema_version":"1.0","canonical_sha256":"51d30b993773af47b2be60caace39b4785e7aca2c89a57fb8d849beaed4e63d9","source":{"kind":"arxiv","id":"1810.12086","version":1},"attestation_state":"computed","paper":{"title":"A study on load-balanced variants of the bin packing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davi Castro-Silva, Eric Gourdin","submitted_at":"2018-10-29T13:12:21Z","abstract_excerpt":"We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In these extensions, we introduce load-balancing constraints imposing that the share of each object which is assigned to a same bin must be equal. We propose a Mixed-Integer Programming (MIP) formulation and show that the problem becomes NP-hard if we limit to at most 3 the number of bins across which each object can be split.\n  We then consider a variant where the balanced allocations of objects to bins may be done in su"},"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":"1810.12086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T13:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"a93e123f78e4e02953d196a3bfeeeb55ba600cdc965eb01e6f917db2c58465a8","abstract_canon_sha256":"f0499e7d45054a3ac60d128779158c7fdf003677cfe25eab87a8be14cd6a6880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:06.455616Z","signature_b64":"yhwD7xZ7TQYuwR52kl6Rl/Yhm8upIYXydrea9iFyoE0vVxj2PFoI6yqh98S9PdeMTW4idLaddgsZO7qhy7ooBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d30b993773af47b2be60caace39b4785e7aca2c89a57fb8d849beaed4e63d9","last_reissued_at":"2026-05-18T00:02:06.454971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:06.454971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study on load-balanced variants of the bin packing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davi Castro-Silva, Eric Gourdin","submitted_at":"2018-10-29T13:12:21Z","abstract_excerpt":"We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In these extensions, we introduce load-balancing constraints imposing that the share of each object which is assigned to a same bin must be equal. We propose a Mixed-Integer Programming (MIP) formulation and show that the problem becomes NP-hard if we limit to at most 3 the number of bins across which each object can be split.\n  We then consider a variant where the balanced allocations of objects to bins may be done in su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12086","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":""},"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":"1810.12086","created_at":"2026-05-18T00:02:06.455065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12086v1","created_at":"2026-05-18T00:02:06.455065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12086","created_at":"2026-05-18T00:02:06.455065+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHJQXGJXOOXU","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHJQXGJXOOXUPMV6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHJQXGJX","created_at":"2026-05-18T12:32:33.847187+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/KHJQXGJXOOXUPMV6MDFKZY43I6","json":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6.json","graph_json":"https://pith.science/api/pith-number/KHJQXGJXOOXUPMV6MDFKZY43I6/graph.json","events_json":"https://pith.science/api/pith-number/KHJQXGJXOOXUPMV6MDFKZY43I6/events.json","paper":"https://pith.science/paper/KHJQXGJX"},"agent_actions":{"view_html":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6","download_json":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6.json","view_paper":"https://pith.science/paper/KHJQXGJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12086&json=true","fetch_graph":"https://pith.science/api/pith-number/KHJQXGJXOOXUPMV6MDFKZY43I6/graph.json","fetch_events":"https://pith.science/api/pith-number/KHJQXGJXOOXUPMV6MDFKZY43I6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/action/storage_attestation","attest_author":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/action/author_attestation","sign_citation":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/action/citation_signature","submit_replication":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/action/replication_record"}},"created_at":"2026-05-18T00:02:06.455065+00:00","updated_at":"2026-05-18T00:02:06.455065+00:00"}