{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KHJQXGJXOOXUPMV6MDFKZY43I6","short_pith_number":"pith:KHJQXGJX","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"},"canonical_sha256":"51d30b993773af47b2be60caace39b4785e7aca2c89a57fb8d849beaed4e63d9","source":{"kind":"arxiv","id":"1810.12086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12086","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12086v1","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12086","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"KHJQXGJXOOXU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KHJQXGJXOOXUPMV6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KHJQXGJX","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KHJQXGJXOOXUPMV6MDFKZY43I6","target":"record","payload":{"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"},"canonical_sha256":"51d30b993773af47b2be60caace39b4785e7aca2c89a57fb8d849beaed4e63d9","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"},"source_kind":"arxiv","source_id":"1810.12086","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-05-18T00:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64rdzfFXY+pn5mPrZlTDeR6hdtf1NRhkuOA2sJ/m2VYBhsloM6MUI48IdXBxKsg+VL5667k3KxGsmTtpNZuEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:54:57.297342Z"},"content_sha256":"6ad5032b26faaf6260416f06160da2454d19a8fe538800103f686de1ff3042ac","schema_version":"1.0","event_id":"sha256:6ad5032b26faaf6260416f06160da2454d19a8fe538800103f686de1ff3042ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KHJQXGJXOOXUPMV6MDFKZY43I6","target":"graph","payload":{"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"},"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-18T00:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xovtOLpigBxXfcy2/dVtoiXCdZRJdNsm5a8ioPHmFsQ+P4ZAmKcCO/9qrElcu8D+qO8i17KQS8n3Rn9fLMgyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:54:57.297679Z"},"content_sha256":"254e9c951b335cdd71de40c2ef7a3f16f8aa09f4eb996100d720e74500bda3b4","schema_version":"1.0","event_id":"sha256:254e9c951b335cdd71de40c2ef7a3f16f8aa09f4eb996100d720e74500bda3b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/bundle.json","state_url":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/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-20T07:54:57Z","links":{"resolver":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6","bundle":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/bundle.json","state":"https://pith.science/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHJQXGJXOOXUPMV6MDFKZY43I6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KHJQXGJXOOXUPMV6MDFKZY43I6","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":"f0499e7d45054a3ac60d128779158c7fdf003677cfe25eab87a8be14cd6a6880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T13:12:21Z","title_canon_sha256":"a93e123f78e4e02953d196a3bfeeeb55ba600cdc965eb01e6f917db2c58465a8"},"schema_version":"1.0","source":{"id":"1810.12086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12086","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12086v1","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12086","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"KHJQXGJXOOXU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KHJQXGJXOOXUPMV6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KHJQXGJX","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:254e9c951b335cdd71de40c2ef7a3f16f8aa09f4eb996100d720e74500bda3b4","target":"graph","created_at":"2026-05-18T00:02:06Z","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 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","authors_text":"Davi Castro-Silva, Eric Gourdin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T13:12:21Z","title":"A study on load-balanced variants of the bin packing problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12086","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:6ad5032b26faaf6260416f06160da2454d19a8fe538800103f686de1ff3042ac","target":"record","created_at":"2026-05-18T00:02:06Z","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":"f0499e7d45054a3ac60d128779158c7fdf003677cfe25eab87a8be14cd6a6880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T13:12:21Z","title_canon_sha256":"a93e123f78e4e02953d196a3bfeeeb55ba600cdc965eb01e6f917db2c58465a8"},"schema_version":"1.0","source":{"id":"1810.12086","kind":"arxiv","version":1}},"canonical_sha256":"51d30b993773af47b2be60caace39b4785e7aca2c89a57fb8d849beaed4e63d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d30b993773af47b2be60caace39b4785e7aca2c89a57fb8d849beaed4e63d9","first_computed_at":"2026-05-18T00:02:06.454971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:06.454971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhwD7xZ7TQYuwR52kl6Rl/Yhm8upIYXydrea9iFyoE0vVxj2PFoI6yqh98S9PdeMTW4idLaddgsZO7qhy7ooBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:06.455616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ad5032b26faaf6260416f06160da2454d19a8fe538800103f686de1ff3042ac","sha256:254e9c951b335cdd71de40c2ef7a3f16f8aa09f4eb996100d720e74500bda3b4"],"state_sha256":"de5c790d99c6cb2dee5c1d3cd0bdc54099154dda2779a272d52efc001bfca066"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cktPjTVr5J6p1l0YgobM9FmWOamLPbtazcDBhgC8ULk07qLchy8nDKm+m2dIAPMMulJZpsia7khISUyp2BDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:54:57.299520Z","bundle_sha256":"06cb510ce4476e1ee36b3dbe19fb38e93dc05ed82e0d7d7bb3959406e1478fd1"}}