{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WLPMIFBEGGOZZ4XXEVECGGVX3V","short_pith_number":"pith:WLPMIFBE","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"},"canonical_sha256":"b2dec41424319d9cf2f72548231ab7dd5eaab5612907357da0cf26b10cf0db76","source":{"kind":"arxiv","id":"2311.16742","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.16742","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"2311.16742v3","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16742","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"WLPMIFBEGGOZ","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"pith_short_16","alias_value":"WLPMIFBEGGOZZ4XX","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"pith_short_8","alias_value":"WLPMIFBE","created_at":"2026-07-05T10:02:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WLPMIFBEGGOZZ4XXEVECGGVX3V","target":"record","payload":{"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"},"canonical_sha256":"b2dec41424319d9cf2f72548231ab7dd5eaab5612907357da0cf26b10cf0db76","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"},"source_kind":"arxiv","source_id":"2311.16742","source_version":3,"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-07-05T10:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjxBmGsRPymW3vlxenA4MkWjm0dYCKoiTbZlLdnaIW75aN9seEQQNnpqwKxSWfF9knzPtUuGQfHDGt4SnVEyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:26:53.884767Z"},"content_sha256":"49de76fdfe8c1bfb9a5424fceb6fee06e69366ff04ad1652e9d30ba78a97a66d","schema_version":"1.0","event_id":"sha256:49de76fdfe8c1bfb9a5424fceb6fee06e69366ff04ad1652e9d30ba78a97a66d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WLPMIFBEGGOZZ4XXEVECGGVX3V","target":"graph","payload":{"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"},"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-07-05T10:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAtmHI+RaKasOzcdJWrpV9VFp0Q6E9w8G0Ux5+gRxolwohpHa97s55kjiBL0eHkuBZCm3/CM+bLcpuryzzfSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:26:53.885256Z"},"content_sha256":"0be8ba31072a17af0d0f6936317dbdaa147c01b0f865b62a26aab35534d419c4","schema_version":"1.0","event_id":"sha256:0be8ba31072a17af0d0f6936317dbdaa147c01b0f865b62a26aab35534d419c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/bundle.json","state_url":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/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-08-08T22:26:53Z","links":{"resolver":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V","bundle":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/bundle.json","state":"https://pith.science/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLPMIFBEGGOZZ4XXEVECGGVX3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WLPMIFBEGGOZZ4XXEVECGGVX3V","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":"512b67be47f1500039e394c82e34e23b94688d7ca6f754b02c93c04497770239","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T12:41:42Z","title_canon_sha256":"6f1bea4367c3266c863bc77de14038888866bd2db4b68eb953b077b71d29589b"},"schema_version":"1.0","source":{"id":"2311.16742","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.16742","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"2311.16742v3","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16742","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"WLPMIFBEGGOZ","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"pith_short_16","alias_value":"WLPMIFBEGGOZZ4XX","created_at":"2026-07-05T10:02:21Z"},{"alias_kind":"pith_short_8","alias_value":"WLPMIFBE","created_at":"2026-07-05T10:02:21Z"}],"graph_snapshots":[{"event_id":"sha256:0be8ba31072a17af0d0f6936317dbdaa147c01b0f865b62a26aab35534d419c4","target":"graph","created_at":"2026-07-05T10:02:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.16742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Alex Ravsky, Dinesh Kumar Baghel, Erel Segal-Halevi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T12:41:42Z","title":"$k$-times bin packing and its application to fair electricity distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16742","kind":"arxiv","version":3},"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:49de76fdfe8c1bfb9a5424fceb6fee06e69366ff04ad1652e9d30ba78a97a66d","target":"record","created_at":"2026-07-05T10:02:21Z","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":"512b67be47f1500039e394c82e34e23b94688d7ca6f754b02c93c04497770239","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T12:41:42Z","title_canon_sha256":"6f1bea4367c3266c863bc77de14038888866bd2db4b68eb953b077b71d29589b"},"schema_version":"1.0","source":{"id":"2311.16742","kind":"arxiv","version":3}},"canonical_sha256":"b2dec41424319d9cf2f72548231ab7dd5eaab5612907357da0cf26b10cf0db76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2dec41424319d9cf2f72548231ab7dd5eaab5612907357da0cf26b10cf0db76","first_computed_at":"2026-07-05T10:02:21.904478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:02:21.904478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qrVW7UxQM0fIwAOpl6TaHGsv2WWsRPPFELNJfTvuHmmJCz6L905Ehjis8vT2kXKFu7yFLoed0Ns3HwO/K7YWBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:02:21.905039Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.16742","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49de76fdfe8c1bfb9a5424fceb6fee06e69366ff04ad1652e9d30ba78a97a66d","sha256:0be8ba31072a17af0d0f6936317dbdaa147c01b0f865b62a26aab35534d419c4"],"state_sha256":"b7c56e357362bbf309df7e0a8fb06bf92a6854b2417de360879add0bbff6a414"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRCNMBZImVVYmgQLO+mQRPmJo8yNwgSZUTpkoojgvpOogW3DoVSQN+bKiWXinAiMk8Z6Qo+QelvXoyRr0ac4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T22:26:53.888871Z","bundle_sha256":"bb5e83a8e99d32ae5925647b94ab400768ab5e76bc75dc9f90a8e3e1dff1e000"}}