{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CEHNQ63XTJXX7PKQAWL3BZZSL2","short_pith_number":"pith:CEHNQ63X","canonical_record":{"source":{"id":"1908.08762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T11:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"ba0ce911628e0cca21c4ed3ac3b8e1146fce2d8352df3cf56b7b470bd960c53d","abstract_canon_sha256":"4ad16416c82b1e3048148fe0e827cef9c3ee751add95247cb63b163c951905de"},"schema_version":"1.0"},"canonical_sha256":"110ed87b779a6f7fbd500597b0e7325eaf788cd754b0440d0a722e5575c7a2d9","source":{"kind":"arxiv","id":"1908.08762","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08762","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08762v2","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08762","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"CEHNQ63XTJXX","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"pith_short_16","alias_value":"CEHNQ63XTJXX7PKQ","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"pith_short_8","alias_value":"CEHNQ63X","created_at":"2026-07-05T01:10:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CEHNQ63XTJXX7PKQAWL3BZZSL2","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T11:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"ba0ce911628e0cca21c4ed3ac3b8e1146fce2d8352df3cf56b7b470bd960c53d","abstract_canon_sha256":"4ad16416c82b1e3048148fe0e827cef9c3ee751add95247cb63b163c951905de"},"schema_version":"1.0"},"canonical_sha256":"110ed87b779a6f7fbd500597b0e7325eaf788cd754b0440d0a722e5575c7a2d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:27.626291Z","signature_b64":"BF9+Oq+2VKwT9xRmp7aU6FAzgwG9jkUX96CfZaY/PlY/PgDpj8MyQs7pl3iWYgIfWll1p1DWSHgeW0BHJI1oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"110ed87b779a6f7fbd500597b0e7325eaf788cd754b0440d0a722e5575c7a2d9","last_reissued_at":"2026-07-05T01:10:27.625807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:27.625807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08762","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-07-05T01:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcU925AT/t5wVig8fM38XV1tcL5xsCcCPx93H1+1pGPLlm4vipAlXSvm2A839dEuN4mnPyw1sVQxQ4ayjp9KDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:22:09.550056Z"},"content_sha256":"9b7c5f8eda0560cafecde3f545f414ddbe1fd5db745a9544660ac08b45974f49","schema_version":"1.0","event_id":"sha256:9b7c5f8eda0560cafecde3f545f414ddbe1fd5db745a9544660ac08b45974f49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CEHNQ63XTJXX7PKQAWL3BZZSL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Consistent Hashing with Bounded Loads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anshumali Shrivastava, Ben Coleman, John Chen","submitted_at":"2019-08-23T11:27:47Z","abstract_excerpt":"Dynamic load balancing lies at the heart of distributed caching. Here, the goal is to assign objects (load) to servers (computing nodes) in a way that provides load balancing while at the same time dynamically adjusts to the addition or removal of servers. One essential requirement is that the addition or removal of small servers should not require us to recompute the complete assignment. A popular and widely adopted solution is the two-decade-old Consistent Hashing (CH). Recently, an elegant extension was provided to account for server bounds. In this paper, we identify that existing methodol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08762","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08762/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjR/gjOM+2h4RMAbE5wQ4IZoXTBitdl4279spHaa1/ybslxSe2ANCEoe/jEtpXuDZDXGeRHg41/h20dIBOiqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:22:09.550541Z"},"content_sha256":"9138c4f70808cbc343f715c08c473158b134fa5c92ac15aeae41c783026045a2","schema_version":"1.0","event_id":"sha256:9138c4f70808cbc343f715c08c473158b134fa5c92ac15aeae41c783026045a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2/bundle.json","state_url":"https://pith.science/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2/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-08-16T11:22:09Z","links":{"resolver":"https://pith.science/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2","bundle":"https://pith.science/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2/bundle.json","state":"https://pith.science/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEHNQ63XTJXX7PKQAWL3BZZSL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CEHNQ63XTJXX7PKQAWL3BZZSL2","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":"4ad16416c82b1e3048148fe0e827cef9c3ee751add95247cb63b163c951905de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T11:27:47Z","title_canon_sha256":"ba0ce911628e0cca21c4ed3ac3b8e1146fce2d8352df3cf56b7b470bd960c53d"},"schema_version":"1.0","source":{"id":"1908.08762","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08762","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08762v2","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08762","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"CEHNQ63XTJXX","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"pith_short_16","alias_value":"CEHNQ63XTJXX7PKQ","created_at":"2026-07-05T01:10:27Z"},{"alias_kind":"pith_short_8","alias_value":"CEHNQ63X","created_at":"2026-07-05T01:10:27Z"}],"graph_snapshots":[{"event_id":"sha256:9138c4f70808cbc343f715c08c473158b134fa5c92ac15aeae41c783026045a2","target":"graph","created_at":"2026-07-05T01:10:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic load balancing lies at the heart of distributed caching. Here, the goal is to assign objects (load) to servers (computing nodes) in a way that provides load balancing while at the same time dynamically adjusts to the addition or removal of servers. One essential requirement is that the addition or removal of small servers should not require us to recompute the complete assignment. A popular and widely adopted solution is the two-decade-old Consistent Hashing (CH). Recently, an elegant extension was provided to account for server bounds. In this paper, we identify that existing methodol","authors_text":"Anshumali Shrivastava, Ben Coleman, John Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08762","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:9b7c5f8eda0560cafecde3f545f414ddbe1fd5db745a9544660ac08b45974f49","target":"record","created_at":"2026-07-05T01:10:27Z","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":"4ad16416c82b1e3048148fe0e827cef9c3ee751add95247cb63b163c951905de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T11:27:47Z","title_canon_sha256":"ba0ce911628e0cca21c4ed3ac3b8e1146fce2d8352df3cf56b7b470bd960c53d"},"schema_version":"1.0","source":{"id":"1908.08762","kind":"arxiv","version":2}},"canonical_sha256":"110ed87b779a6f7fbd500597b0e7325eaf788cd754b0440d0a722e5575c7a2d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"110ed87b779a6f7fbd500597b0e7325eaf788cd754b0440d0a722e5575c7a2d9","first_computed_at":"2026-07-05T01:10:27.625807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:27.625807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BF9+Oq+2VKwT9xRmp7aU6FAzgwG9jkUX96CfZaY/PlY/PgDpj8MyQs7pl3iWYgIfWll1p1DWSHgeW0BHJI1oCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:27.626291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08762","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b7c5f8eda0560cafecde3f545f414ddbe1fd5db745a9544660ac08b45974f49","sha256:9138c4f70808cbc343f715c08c473158b134fa5c92ac15aeae41c783026045a2"],"state_sha256":"7aa1e9c39b622d01820155eb7ef4affc69a7f8daf3bf141b93825c8df836fe01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEBO6WdeQAwVTpfiepqkP7rRfoDVrHmkQiyjTTgnKsuwalVgUGwpmBzlfD+n2J+06qtdq/Kn0vl62/8joS/JDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:22:09.554987Z","bundle_sha256":"f3266f42ee12aada5ec5ae4695e787c715cdfc12b7f1df90935817d8220be71c"}}