Pith Number

pith:DVTUFBOC

pith:2026:DVTUFBOC2FM4KFQCDSGKYPFJFP

not attested not anchored not stored refs resolved

Time and Supply Fairness in Electricity Distribution using $k$-times bin packing

Alex Ravsky, Dinesh Kumar Baghel, Erel Segal-Halevi

Every electricity division problem can be solved exactly by k-times bin packing with k depending only on the number of households.

arxiv:2605.12812 v1 · 2026-05-12 · cs.DS · cs.MA

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{DVTUFBOC2FM4KFQCDSGKYPFJFP}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We prove that every electricity division problem can be solved by k-times bin-packing for some finite k, which depends only on the number of households.

C2weakest assumption

That household electricity demands can be represented as fixed item sizes whose sums fit the bin-capacity model without distorting the egalitarian fairness criteria, and that the required k remains independent of the specific demand values.

C3one line summary

k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation.

References

47 extracted · 47 resolved · 0 Pith anchors

[1] IEEE intelligent systems 32(1), 24–31 (2017) 2017

[2] Advances in Intelligent Systems and Computing1251 AISC, 407–424 (2021).https://doi.org/ 10.1007/978-3-030-55187-2_32 2021 · doi:10.1007/978-3-030-55187-2_32

[3] Competitive algorithms for server problems 1985

[4] Cambridge University Press (1996).https://doi.org/10.1017/CBO9780511598975 1996 · doi:10.1017/cbo9780511598975

[5] Pro- ceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020-May(Aamas), 204–212 (2020) 2020

Receipt and verification

First computed	2026-05-18T03:09:12.412963Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c

Aliases

arxiv: 2605.12812 · arxiv_version: 2605.12812v1 · doi: 10.48550/arxiv.2605.12812 · pith_short_12: DVTUFBOC2FM4 · pith_short_16: DVTUFBOC2FM4KFQC · pith_short_8: DVTUFBOC

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/DVTUFBOC2FM4KFQCDSGKYPFJFP \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 1d674285c2d159c516021c8cac3ca92bd4eb47c246c12569ff6c3ede35725b4c

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "a0ed374508435d6976724676eb53bc3b0d489fad294422ea6c83bfe5e7fdf3f6",
    "cross_cats_sorted": [
      "cs.MA"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-05-12T23:13:44Z",
    "title_canon_sha256": "d714d0e28b1ac02a97122e0a5960360cdfe7a0a27ceeccc6bdf9a2b81c77fb0f"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12812",
    "kind": "arxiv",
    "version": 1
  }
}