{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NDHZGLOPERNWCV6N233HHCL3R4","short_pith_number":"pith:NDHZGLOP","canonical_record":{"source":{"id":"1805.03158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T16:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"b5a4bab0819f89f25d27d7436b5578c6813b8b70d3940a236c899cf1272fd8db","abstract_canon_sha256":"72b14ef67e634b69bfbd64c8eb5cc8ae591f21140d7ed162c2a473e4d810e3c2"},"schema_version":"1.0"},"canonical_sha256":"68cf932dcf245b6157cdd6f673897b8f003e2f175628cc708d4f4bfb69889cf2","source":{"kind":"arxiv","id":"1805.03158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03158","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03158v1","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03158","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"NDHZGLOPERNW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDHZGLOPERNWCV6N","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDHZGLOP","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NDHZGLOPERNWCV6N233HHCL3R4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T16:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"b5a4bab0819f89f25d27d7436b5578c6813b8b70d3940a236c899cf1272fd8db","abstract_canon_sha256":"72b14ef67e634b69bfbd64c8eb5cc8ae591f21140d7ed162c2a473e4d810e3c2"},"schema_version":"1.0"},"canonical_sha256":"68cf932dcf245b6157cdd6f673897b8f003e2f175628cc708d4f4bfb69889cf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:34.433860Z","signature_b64":"B+wEjVBKdHZraUGTMR5vx1KWXnML56Y6r+K1ja/2DHr+6H66mmNtxSC6V8f1HnXfJ5xP0vPtR9wILoQLVLzaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cf932dcf245b6157cdd6f673897b8f003e2f175628cc708d4f4bfb69889cf2","last_reissued_at":"2026-05-18T00:16:34.433078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:34.433078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03158","source_version":1,"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:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seNA9U5WovpZfnWUkGgZd0wiH7hXYFLBtdZHofxSapytd/Y9xBgn1zKKu/8GFarg82ik0EZSKwhF75nXKCjBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:31:23.719019Z"},"content_sha256":"c19fa5f612f0171b63628585d010ec618914b0829ee192031f79261b56e4d406","schema_version":"1.0","event_id":"sha256:c19fa5f612f0171b63628585d010ec618914b0829ee192031f79261b56e4d406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NDHZGLOPERNWCV6N233HHCL3R4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luca Versari, Roberto Grossi","submitted_at":"2018-05-08T16:48:01Z","abstract_excerpt":"This paper proposes round-hashing, which is suitable for data storage on distributed servers and for implementing external-memory tables in which each lookup retrieves at most a single block of external memory, using a stash. For data storage, round-hashing is like consistent hashing as it avoids a full rehashing of the keys when new servers are added. Experiments show that the speed to serve requests is tenfold or more than the state of the art. In distributed data storage, this guarantees better throughput for serving requests and, moreover, greatly reduces decision times for which data shou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03158","kind":"arxiv","version":1},"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:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sz4bRD+e9ACWnEvlJhZn2BfDg50BV0Go68AemwyyNev6q6eEUSUw+tJXM0AYCMWnd9R+g6Zy+QXmCQhnGGLmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:31:23.719700Z"},"content_sha256":"b243c53a28920e9bd15bf031363e2de4c06c9b05d31e03d6cb1c215d0c523b16","schema_version":"1.0","event_id":"sha256:b243c53a28920e9bd15bf031363e2de4c06c9b05d31e03d6cb1c215d0c523b16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDHZGLOPERNWCV6N233HHCL3R4/bundle.json","state_url":"https://pith.science/pith/NDHZGLOPERNWCV6N233HHCL3R4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDHZGLOPERNWCV6N233HHCL3R4/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-24T14:31:23Z","links":{"resolver":"https://pith.science/pith/NDHZGLOPERNWCV6N233HHCL3R4","bundle":"https://pith.science/pith/NDHZGLOPERNWCV6N233HHCL3R4/bundle.json","state":"https://pith.science/pith/NDHZGLOPERNWCV6N233HHCL3R4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDHZGLOPERNWCV6N233HHCL3R4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NDHZGLOPERNWCV6N233HHCL3R4","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":"72b14ef67e634b69bfbd64c8eb5cc8ae591f21140d7ed162c2a473e4d810e3c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T16:48:01Z","title_canon_sha256":"b5a4bab0819f89f25d27d7436b5578c6813b8b70d3940a236c899cf1272fd8db"},"schema_version":"1.0","source":{"id":"1805.03158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03158","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03158v1","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03158","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"NDHZGLOPERNW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDHZGLOPERNWCV6N","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDHZGLOP","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b243c53a28920e9bd15bf031363e2de4c06c9b05d31e03d6cb1c215d0c523b16","target":"graph","created_at":"2026-05-18T00:16:34Z","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":"This paper proposes round-hashing, which is suitable for data storage on distributed servers and for implementing external-memory tables in which each lookup retrieves at most a single block of external memory, using a stash. For data storage, round-hashing is like consistent hashing as it avoids a full rehashing of the keys when new servers are added. Experiments show that the speed to serve requests is tenfold or more than the state of the art. In distributed data storage, this guarantees better throughput for serving requests and, moreover, greatly reduces decision times for which data shou","authors_text":"Luca Versari, Roberto Grossi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T16:48:01Z","title":"Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03158","kind":"arxiv","version":1},"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:c19fa5f612f0171b63628585d010ec618914b0829ee192031f79261b56e4d406","target":"record","created_at":"2026-05-18T00:16:34Z","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":"72b14ef67e634b69bfbd64c8eb5cc8ae591f21140d7ed162c2a473e4d810e3c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T16:48:01Z","title_canon_sha256":"b5a4bab0819f89f25d27d7436b5578c6813b8b70d3940a236c899cf1272fd8db"},"schema_version":"1.0","source":{"id":"1805.03158","kind":"arxiv","version":1}},"canonical_sha256":"68cf932dcf245b6157cdd6f673897b8f003e2f175628cc708d4f4bfb69889cf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68cf932dcf245b6157cdd6f673897b8f003e2f175628cc708d4f4bfb69889cf2","first_computed_at":"2026-05-18T00:16:34.433078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:34.433078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+wEjVBKdHZraUGTMR5vx1KWXnML56Y6r+K1ja/2DHr+6H66mmNtxSC6V8f1HnXfJ5xP0vPtR9wILoQLVLzaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:34.433860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c19fa5f612f0171b63628585d010ec618914b0829ee192031f79261b56e4d406","sha256:b243c53a28920e9bd15bf031363e2de4c06c9b05d31e03d6cb1c215d0c523b16"],"state_sha256":"21ca8d2e36d93e915d797320e1c13a7aff3ab6552a0d75e0c5bf041e1db27485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyfQTfWXR6SfjVmN2imvnT2TAhKtI4kTaS/3jEp+FFc/Y/T+LosBrYntG+SXVtL1ujoH7ooju2tmykRfzOwjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:31:23.723071Z","bundle_sha256":"9bdeeb61c714cc2c42dc66ef25381cc5ef81a24458a1217ac7e6d59fd022a152"}}