{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V5DCANYVSBY7MNFOAXY6KBFREX","short_pith_number":"pith:V5DCANYV","schema_version":"1.0","canonical_sha256":"af462037159071f634ae05f1e504b125edd3c8eab535c909a2d113eacc8ca10b","source":{"kind":"arxiv","id":"1501.04822","version":3},"attestation_state":"computed","paper":{"title":"Self-Stabilizing Repeated Balls-into-Bins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta, Luca Becchetti","submitted_at":"2015-01-20T14:33:59Z","abstract_excerpt":"We study the following synchronous process that we call \"repeated balls-into-bins\". The process is started by assigning $n$ balls to $n$ bins in an arbitrary way. In every subsequent round, from each non-empty bin one ball is chosen according to some fixed strategy (random, FIFO, etc), and re-assigned to one of the $n$ bins uniformly at random.\n  We define a configuration \"legitimate\" if its maximum load is $\\mathcal{O}(\\log n)$. We prove that, starting from any configuration, the process will converge to a legitimate configuration in linear time and then it will only take on legitimate config"},"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":"1501.04822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-20T14:33:59Z","cross_cats_sorted":[],"title_canon_sha256":"85bca436e8027724392366197db3c141a9b44764a1069085a430afd0c1954524","abstract_canon_sha256":"72305bad79f97780873520cfbd3792f4f480dc09032d6002325c13e2bc56f91b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:09.377068Z","signature_b64":"BzJhuC4H2TE3f9CUt+VjQtKjnGmDUbwxgQ2vzB3D//LQ0UQu6SAtV5pEAz3QDIIJ/XjdKXY2Ic3BS48ThOn6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af462037159071f634ae05f1e504b125edd3c8eab535c909a2d113eacc8ca10b","last_reissued_at":"2026-05-18T01:14:09.376488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:09.376488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Stabilizing Repeated Balls-into-Bins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta, Luca Becchetti","submitted_at":"2015-01-20T14:33:59Z","abstract_excerpt":"We study the following synchronous process that we call \"repeated balls-into-bins\". The process is started by assigning $n$ balls to $n$ bins in an arbitrary way. In every subsequent round, from each non-empty bin one ball is chosen according to some fixed strategy (random, FIFO, etc), and re-assigned to one of the $n$ bins uniformly at random.\n  We define a configuration \"legitimate\" if its maximum load is $\\mathcal{O}(\\log n)$. We prove that, starting from any configuration, the process will converge to a legitimate configuration in linear time and then it will only take on legitimate config"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04822","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":""},"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":"1501.04822","created_at":"2026-05-18T01:14:09.376580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04822v3","created_at":"2026-05-18T01:14:09.376580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04822","created_at":"2026-05-18T01:14:09.376580+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5DCANYVSBY7","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5DCANYVSBY7MNFO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5DCANYV","created_at":"2026-05-18T12:29:44.643036+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/V5DCANYVSBY7MNFOAXY6KBFREX","json":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX.json","graph_json":"https://pith.science/api/pith-number/V5DCANYVSBY7MNFOAXY6KBFREX/graph.json","events_json":"https://pith.science/api/pith-number/V5DCANYVSBY7MNFOAXY6KBFREX/events.json","paper":"https://pith.science/paper/V5DCANYV"},"agent_actions":{"view_html":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX","download_json":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX.json","view_paper":"https://pith.science/paper/V5DCANYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04822&json=true","fetch_graph":"https://pith.science/api/pith-number/V5DCANYVSBY7MNFOAXY6KBFREX/graph.json","fetch_events":"https://pith.science/api/pith-number/V5DCANYVSBY7MNFOAXY6KBFREX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX/action/storage_attestation","attest_author":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX/action/author_attestation","sign_citation":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX/action/citation_signature","submit_replication":"https://pith.science/pith/V5DCANYVSBY7MNFOAXY6KBFREX/action/replication_record"}},"created_at":"2026-05-18T01:14:09.376580+00:00","updated_at":"2026-05-18T01:14:09.376580+00:00"}