{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IFFXV2XPB3D34ZTVISIYF2WRV5","short_pith_number":"pith:IFFXV2XP","schema_version":"1.0","canonical_sha256":"414b7aeaef0ec7be6675449182ead1af78af63fe6741426df502cfbfbbe867d7","source":{"kind":"arxiv","id":"1210.7954","version":2},"attestation_state":"computed","paper":{"title":"A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Jakarin Chawachat, Jittat Fakcharoenphol","submitted_at":"2012-10-30T10:39:58Z","abstract_excerpt":"Random hashing is a standard method to balance loads among nodes in Peer-to-Peer networks. However, hashing destroys locality properties of object keys, the critical properties to many applications, more specifically, those that require range searching. To preserve a key order while keeping loads balanced, Ganesan, Bawa and Garcia-Molina proposed a load-balancing algorithm that supports both object insertion and deletion that guarantees a ratio of 4.237 between the maximum and minimum loads among nodes in the network using constant amortized costs. However, their algorithm is not straightforwa"},"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":"1210.7954","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-30T10:39:58Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ed17dc20f2f3ef8038663fa06eb0b6ee38883b3dc22657364849a50eb76d884d","abstract_canon_sha256":"fa1c8f4d4a1d6b9751643a71078ed666998a9ba37d443df5435695bfdfd10125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:01.390924Z","signature_b64":"iP0/zELFmhsi/98JdpOjTWxnIhuQ2L8QzRPOcI7VHnq6UxrQX3r1xgA4tWsG76lX7kJa4HPZ+jNijqOuOtUFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414b7aeaef0ec7be6675449182ead1af78af63fe6741426df502cfbfbbe867d7","last_reissued_at":"2026-05-18T03:27:01.390496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:01.390496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Jakarin Chawachat, Jittat Fakcharoenphol","submitted_at":"2012-10-30T10:39:58Z","abstract_excerpt":"Random hashing is a standard method to balance loads among nodes in Peer-to-Peer networks. However, hashing destroys locality properties of object keys, the critical properties to many applications, more specifically, those that require range searching. To preserve a key order while keeping loads balanced, Ganesan, Bawa and Garcia-Molina proposed a load-balancing algorithm that supports both object insertion and deletion that guarantees a ratio of 4.237 between the maximum and minimum loads among nodes in the network using constant amortized costs. However, their algorithm is not straightforwa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7954","kind":"arxiv","version":2},"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":"1210.7954","created_at":"2026-05-18T03:27:01.390567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7954v2","created_at":"2026-05-18T03:27:01.390567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7954","created_at":"2026-05-18T03:27:01.390567+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFFXV2XPB3D3","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFFXV2XPB3D34ZTV","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFFXV2XP","created_at":"2026-05-18T12:27:09.501522+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/IFFXV2XPB3D34ZTVISIYF2WRV5","json":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5.json","graph_json":"https://pith.science/api/pith-number/IFFXV2XPB3D34ZTVISIYF2WRV5/graph.json","events_json":"https://pith.science/api/pith-number/IFFXV2XPB3D34ZTVISIYF2WRV5/events.json","paper":"https://pith.science/paper/IFFXV2XP"},"agent_actions":{"view_html":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5","download_json":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5.json","view_paper":"https://pith.science/paper/IFFXV2XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7954&json=true","fetch_graph":"https://pith.science/api/pith-number/IFFXV2XPB3D34ZTVISIYF2WRV5/graph.json","fetch_events":"https://pith.science/api/pith-number/IFFXV2XPB3D34ZTVISIYF2WRV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/action/storage_attestation","attest_author":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/action/author_attestation","sign_citation":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/action/citation_signature","submit_replication":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/action/replication_record"}},"created_at":"2026-05-18T03:27:01.390567+00:00","updated_at":"2026-05-18T03:27:01.390567+00:00"}