{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IFFXV2XPB3D34ZTVISIYF2WRV5","short_pith_number":"pith:IFFXV2XP","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"},"canonical_sha256":"414b7aeaef0ec7be6675449182ead1af78af63fe6741426df502cfbfbbe867d7","source":{"kind":"arxiv","id":"1210.7954","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7954","created_at":"2026-05-18T03:27:01Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7954v2","created_at":"2026-05-18T03:27:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7954","created_at":"2026-05-18T03:27:01Z"},{"alias_kind":"pith_short_12","alias_value":"IFFXV2XPB3D3","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IFFXV2XPB3D34ZTV","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IFFXV2XP","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IFFXV2XPB3D34ZTVISIYF2WRV5","target":"record","payload":{"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"},"canonical_sha256":"414b7aeaef0ec7be6675449182ead1af78af63fe6741426df502cfbfbbe867d7","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"},"source_kind":"arxiv","source_id":"1210.7954","source_version":2,"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-05-18T03:27:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wXMhc80PufIoH9aPe+Km1QclZAiM1QY1UAoS+d6hNoIAvUG9Y6NTE+jYSNDi4aH6RrNEfvETqUGzPjkixLUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:24:07.713707Z"},"content_sha256":"854d9595eccbf107389a16ee926f580ab62ae9181a735f9996f1c805ec666f91","schema_version":"1.0","event_id":"sha256:854d9595eccbf107389a16ee926f580ab62ae9181a735f9996f1c805ec666f91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IFFXV2XPB3D34ZTVISIYF2WRV5","target":"graph","payload":{"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"},"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-05-18T03:27:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QA4fmzjwqjHM6UIowc80pB+tymeuhYq5XnUJtV2vV7aEd7JL0UfVbuS3YhxhDRYY3aYRwHC9vLDXVkv589pNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:24:07.714090Z"},"content_sha256":"9de8e3114f700f30560430e9d7d4536291fa90506302423502123723a1d6eb69","schema_version":"1.0","event_id":"sha256:9de8e3114f700f30560430e9d7d4536291fa90506302423502123723a1d6eb69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/bundle.json","state_url":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/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-05-27T22:24:07Z","links":{"resolver":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5","bundle":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/bundle.json","state":"https://pith.science/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFFXV2XPB3D34ZTVISIYF2WRV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IFFXV2XPB3D34ZTVISIYF2WRV5","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":"fa1c8f4d4a1d6b9751643a71078ed666998a9ba37d443df5435695bfdfd10125","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-30T10:39:58Z","title_canon_sha256":"ed17dc20f2f3ef8038663fa06eb0b6ee38883b3dc22657364849a50eb76d884d"},"schema_version":"1.0","source":{"id":"1210.7954","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7954","created_at":"2026-05-18T03:27:01Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7954v2","created_at":"2026-05-18T03:27:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7954","created_at":"2026-05-18T03:27:01Z"},{"alias_kind":"pith_short_12","alias_value":"IFFXV2XPB3D3","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IFFXV2XPB3D34ZTV","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IFFXV2XP","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:9de8e3114f700f30560430e9d7d4536291fa90506302423502123723a1d6eb69","target":"graph","created_at":"2026-05-18T03:27:01Z","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"},"paper":{"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","authors_text":"Jakarin Chawachat, Jittat Fakcharoenphol","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-30T10:39:58Z","title":"A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7954","kind":"arxiv","version":2},"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:854d9595eccbf107389a16ee926f580ab62ae9181a735f9996f1c805ec666f91","target":"record","created_at":"2026-05-18T03:27:01Z","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":"fa1c8f4d4a1d6b9751643a71078ed666998a9ba37d443df5435695bfdfd10125","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-30T10:39:58Z","title_canon_sha256":"ed17dc20f2f3ef8038663fa06eb0b6ee38883b3dc22657364849a50eb76d884d"},"schema_version":"1.0","source":{"id":"1210.7954","kind":"arxiv","version":2}},"canonical_sha256":"414b7aeaef0ec7be6675449182ead1af78af63fe6741426df502cfbfbbe867d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"414b7aeaef0ec7be6675449182ead1af78af63fe6741426df502cfbfbbe867d7","first_computed_at":"2026-05-18T03:27:01.390496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:01.390496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iP0/zELFmhsi/98JdpOjTWxnIhuQ2L8QzRPOcI7VHnq6UxrQX3r1xgA4tWsG76lX7kJa4HPZ+jNijqOuOtUFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:01.390924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7954","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:854d9595eccbf107389a16ee926f580ab62ae9181a735f9996f1c805ec666f91","sha256:9de8e3114f700f30560430e9d7d4536291fa90506302423502123723a1d6eb69"],"state_sha256":"8d4a75fa8b83a34947af902934803404a5bae67712bdd3c9b10a3805b04b2b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIFFNVhE7ceFrO8OuNS6fawjaXVvUP33LtlB83ilkIZVoTX1Tm2sEmzx5Ho99ZLY7c377X7zH4NiFQ3aHbcFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:24:07.716735Z","bundle_sha256":"10de1150be1e06a78afa8c3d69104d5557eab8c265d2b59cf74b0323b247c9d3"}}