{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WLPMIFBEGGOZZ4XXEVECGGVX3V","short_pith_number":"pith:WLPMIFBE","schema_version":"1.0","canonical_sha256":"b2dec41424319d9cf2f72548231ab7dd5eaab5612907357da0cf26b10cf0db76","source":{"kind":"arxiv","id":"2311.16742","version":3},"attestation_state":"computed","paper":{"title":"$k$-times bin packing and its application to fair electricity distribution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Ravsky, Dinesh Kumar Baghel, Erel Segal-Halevi","submitted_at":"2023-11-28T12:41:42Z","abstract_excerpt":"Given items of different sizes and a fixed bin capacity, the bin-packing problem is to pack these items into a minimum number of bins such that the sum of item sizes in a bin does not exceed the capacity. We define a new variant called \\emph{$k$-times bin-packing ($k$BP)}, where the goal is to pack the items such that each item appears exactly $k$ times, in $k$ different bins. We generalize some existing approximation algorithms for bin-packing to solve $k$BP, and analyze their performance ratio.\n  The study of $k$BP is motivated by the problem of \\emph{fair electricity distribution}. In many "},"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":"2311.16742","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T12:41:42Z","cross_cats_sorted":[],"title_canon_sha256":"6f1bea4367c3266c863bc77de14038888866bd2db4b68eb953b077b71d29589b","abstract_canon_sha256":"512b67be47f1500039e394c82e34e23b94688d7ca6f754b02c93c04497770239"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:21.905039Z","signature_b64":"qrVW7UxQM0fIwAOpl6TaHGsv2WWsRPPFELNJfTvuHmmJCz6L905Ehjis8vT2kXKFu7yFLoed0Ns3HwO/K7YWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2dec41424319d9cf2f72548231ab7dd5eaab5612907357da0cf26b10cf0db76","last_reissued_at":"2026-07-05T10:02:21.904478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:21.904478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-times bin packing and its application to fair electricity distribution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Ravsky, Dinesh Kumar Baghel, Erel Segal-Halevi","submitted_at":"2023-11-28T12:41:42Z","abstract_excerpt":"Given items of different sizes and a fixed bin capacity, the bin-packing problem is to pack these items into a minimum number of bins such that the sum of item sizes in a bin does not exceed the capacity. We define a new variant called \\emph{$k$-times bin-packing ($k$BP)}, where the goal is to pack the items such that each item appears exactly $k$ times, in $k$ different bins. We generalize some existing approximation algorithms for bin-packing to solve $k$BP, and analyze their performance ratio.\n  The study of $k$BP is motivated by the problem of \\emph{fair electricity distribution}. In many "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16742","kind":"arxiv","version":3},"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/2311.16742/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.16742","created_at":"2026-07-05T10:02:21.904558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16742v3","created_at":"2026-07-05T10:02:21.904558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16742","created_at":"2026-07-05T10:02:21.904558+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLPMIFBEGGOZ","created_at":"2026-07-05T10:02:21.904558+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLPMIFBEGGOZZ4XX","created_at":"2026-07-05T10:02:21.904558+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLPMIFBE","created_at":"2026-07-05T10:02:21.904558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02193","citing_title":"Fairly Wired: Towards Leximin-Optimal Division of Electricity","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V","json":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V.json","graph_json":"https://pith.science/api/pith-number/WLPMIFBEGGOZZ4XXEVECGGVX3V/graph.json","events_json":"https://pith.science/api/pith-number/WLPMIFBEGGOZZ4XXEVECGGVX3V/events.json","paper":"https://pith.science/paper/WLPMIFBE"},"agent_actions":{"view_html":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V","download_json":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V.json","view_paper":"https://pith.science/paper/WLPMIFBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16742&json=true","fetch_graph":"https://pith.science/api/pith-number/WLPMIFBEGGOZZ4XXEVECGGVX3V/graph.json","fetch_events":"https://pith.science/api/pith-number/WLPMIFBEGGOZZ4XXEVECGGVX3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/action/storage_attestation","attest_author":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/action/author_attestation","sign_citation":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/action/citation_signature","submit_replication":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/action/replication_record"}},"created_at":"2026-07-05T10:02:21.904558+00:00","updated_at":"2026-07-05T10:02:21.904558+00:00"}