{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YNIWZE6MPJ3P737WL7JM5E4VOK","short_pith_number":"pith:YNIWZE6M","canonical_record":{"source":{"id":"1608.01350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T20:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"dbd76b77fba63f43aa615da2d6c2b538ff1f5c731f5755b04cc6884128314291","abstract_canon_sha256":"09ca472ac5497ecb72a92b165ddfdb65e4c895490700c0ad1de52fa68c0dbb55"},"schema_version":"1.0"},"canonical_sha256":"c3516c93cc7a76ffeff65fd2ce939572b35f12627dfdd597614ca0b3e9f6994c","source":{"kind":"arxiv","id":"1608.01350","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01350","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01350v3","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01350","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"YNIWZE6MPJ3P","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNIWZE6MPJ3P737W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNIWZE6M","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YNIWZE6MPJ3P737WL7JM5E4VOK","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T20:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"dbd76b77fba63f43aa615da2d6c2b538ff1f5c731f5755b04cc6884128314291","abstract_canon_sha256":"09ca472ac5497ecb72a92b165ddfdb65e4c895490700c0ad1de52fa68c0dbb55"},"schema_version":"1.0"},"canonical_sha256":"c3516c93cc7a76ffeff65fd2ce939572b35f12627dfdd597614ca0b3e9f6994c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.066706Z","signature_b64":"hzN5FFOFFVIhAEbmhxrAmhHjt0usnZjuJ8Z2bXdpUlartb6vliqrRky2XsApl/cKV6/ll5gZftYYu3CYbStMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3516c93cc7a76ffeff65fd2ce939572b35f12627dfdd597614ca0b3e9f6994c","last_reissued_at":"2026-05-18T00:39:23.065977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.065977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01350","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-05-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnKWNjo24WTiEO0eQimzicIDk2EZ5J2KYQBPoTSP6hEa76wP5+S29CsameChFrgweAViktzcwc+FARp3IpPOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:42:33.114860Z"},"content_sha256":"a382984e34006888dcb6ddd254a38f2ad0a1c7316dd948c1c02b57f85d09ea5b","schema_version":"1.0","event_id":"sha256:a382984e34006888dcb6ddd254a38f2ad0a1c7316dd948c1c02b57f85d09ea5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YNIWZE6MPJ3P737WL7JM5E4VOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistent Hashing with Bounded Loads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mikkel Thorup, Morteza Zadimoghaddam, Vahab Mirrokni","submitted_at":"2016-08-03T20:45:09Z","abstract_excerpt":"Designing algorithms for balanced allocation of clients to servers in dynamic settings is a challenging problem for a variety of reasons. Both servers and clients may be added and/or removed from the system periodically, and the main objectives of allocation algorithms are: the uniformity of the allocation, and the number of moves after adding or removing a server or a client. The most popular solution for our dynamic settings is Consistent Hashing. However, the load balancing of consistent hashing is no better than a random assignment of clients to servers, so with $n$ of each, we expect many"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01350","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"},"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-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBh5KcS9UvwGbRv9Vgjg+Ocic+1p2RXKiP76m1+QKTw/A9clnFLC1nVpq+hl/NnXgNDg/KNXgVvmMyXvMGvgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:42:33.115664Z"},"content_sha256":"304b886e2179d0db9ea5e3f788d3313ceaed66830b6c85e9739c6c1e9ebbb1d1","schema_version":"1.0","event_id":"sha256:304b886e2179d0db9ea5e3f788d3313ceaed66830b6c85e9739c6c1e9ebbb1d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNIWZE6MPJ3P737WL7JM5E4VOK/bundle.json","state_url":"https://pith.science/pith/YNIWZE6MPJ3P737WL7JM5E4VOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNIWZE6MPJ3P737WL7JM5E4VOK/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-06-10T10:42:33Z","links":{"resolver":"https://pith.science/pith/YNIWZE6MPJ3P737WL7JM5E4VOK","bundle":"https://pith.science/pith/YNIWZE6MPJ3P737WL7JM5E4VOK/bundle.json","state":"https://pith.science/pith/YNIWZE6MPJ3P737WL7JM5E4VOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNIWZE6MPJ3P737WL7JM5E4VOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YNIWZE6MPJ3P737WL7JM5E4VOK","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":"09ca472ac5497ecb72a92b165ddfdb65e4c895490700c0ad1de52fa68c0dbb55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T20:45:09Z","title_canon_sha256":"dbd76b77fba63f43aa615da2d6c2b538ff1f5c731f5755b04cc6884128314291"},"schema_version":"1.0","source":{"id":"1608.01350","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01350","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01350v3","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01350","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"YNIWZE6MPJ3P","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNIWZE6MPJ3P737W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNIWZE6M","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:304b886e2179d0db9ea5e3f788d3313ceaed66830b6c85e9739c6c1e9ebbb1d1","target":"graph","created_at":"2026-05-18T00:39:23Z","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":"Designing algorithms for balanced allocation of clients to servers in dynamic settings is a challenging problem for a variety of reasons. Both servers and clients may be added and/or removed from the system periodically, and the main objectives of allocation algorithms are: the uniformity of the allocation, and the number of moves after adding or removing a server or a client. The most popular solution for our dynamic settings is Consistent Hashing. However, the load balancing of consistent hashing is no better than a random assignment of clients to servers, so with $n$ of each, we expect many","authors_text":"Mikkel Thorup, Morteza Zadimoghaddam, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T20:45:09Z","title":"Consistent Hashing with Bounded Loads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01350","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:a382984e34006888dcb6ddd254a38f2ad0a1c7316dd948c1c02b57f85d09ea5b","target":"record","created_at":"2026-05-18T00:39:23Z","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":"09ca472ac5497ecb72a92b165ddfdb65e4c895490700c0ad1de52fa68c0dbb55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T20:45:09Z","title_canon_sha256":"dbd76b77fba63f43aa615da2d6c2b538ff1f5c731f5755b04cc6884128314291"},"schema_version":"1.0","source":{"id":"1608.01350","kind":"arxiv","version":3}},"canonical_sha256":"c3516c93cc7a76ffeff65fd2ce939572b35f12627dfdd597614ca0b3e9f6994c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3516c93cc7a76ffeff65fd2ce939572b35f12627dfdd597614ca0b3e9f6994c","first_computed_at":"2026-05-18T00:39:23.065977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:23.065977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hzN5FFOFFVIhAEbmhxrAmhHjt0usnZjuJ8Z2bXdpUlartb6vliqrRky2XsApl/cKV6/ll5gZftYYu3CYbStMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:23.066706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01350","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a382984e34006888dcb6ddd254a38f2ad0a1c7316dd948c1c02b57f85d09ea5b","sha256:304b886e2179d0db9ea5e3f788d3313ceaed66830b6c85e9739c6c1e9ebbb1d1"],"state_sha256":"732cc9ff3c2a1141e1392fd1a6e7862c5953809f88e7bddaa667c34a2faf0fa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XGaAluxzQjr/Pe4z4Hb5LCEZjlyJlW0oOt2IeN0MMb09DJdxnE1+iSyjNS0m15ox7hHKlOns8tSpE53/yh1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:42:33.119984Z","bundle_sha256":"8e1840cb603c8abd0f6842c463aa6f249df56e6c061794c4326f491f05d920c7"}}