{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BWY67LMC54N5VT77UJQPULA5JT","short_pith_number":"pith:BWY67LMC","canonical_record":{"source":{"id":"1812.09674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-23T08:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"44ab95bcc02367134c553883d6cc4cf6f2597fe1802e6f9df97f6624968b9596","abstract_canon_sha256":"75bf17f933ffdf727f5d259e88599257574c56cde5b293ff920ec76d04d6b066"},"schema_version":"1.0"},"canonical_sha256":"0db1efad82ef1bdacfffa260fa2c1d4cc576afb63dd659d4d54d9d1bc12bf2d8","source":{"kind":"arxiv","id":"1812.09674","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09674","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09674v2","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09674","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"BWY67LMC54N5","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"pith_short_16","alias_value":"BWY67LMC54N5VT77","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"pith_short_8","alias_value":"BWY67LMC","created_at":"2026-07-05T01:53:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BWY67LMC54N5VT77UJQPULA5JT","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-23T08:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"44ab95bcc02367134c553883d6cc4cf6f2597fe1802e6f9df97f6624968b9596","abstract_canon_sha256":"75bf17f933ffdf727f5d259e88599257574c56cde5b293ff920ec76d04d6b066"},"schema_version":"1.0"},"canonical_sha256":"0db1efad82ef1bdacfffa260fa2c1d4cc576afb63dd659d4d54d9d1bc12bf2d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:17.189617Z","signature_b64":"2Q2NfH8sVtr5J8jY/NC7u6aeWNkL5zO+AgoCCQ1z2EwGq7aZAIyCQ6Nz0rio+riNDBz3yls3BOJmq+S9OLZIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db1efad82ef1bdacfffa260fa2c1d4cc576afb63dd659d4d54d9d1bc12bf2d8","last_reissued_at":"2026-07-05T01:53:17.189232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:17.189232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09674","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:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bjnd+82QEPyoDgx9y1jsWDryw1CZtcL5zuoBjtv1xzhVwTA7VkRtXXpkgEx7L1yHLeNpqUJy++DMuaZSIVxGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:39:53.750925Z"},"content_sha256":"9299ebe0f2f28ed9e0cacd339712f3e9a4e8cbd529f672b99191dbbcbc58769c","schema_version":"1.0","event_id":"sha256:9299ebe0f2f28ed9e0cacd339712f3e9a4e8cbd529f672b99191dbbcbc58769c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BWY67LMC54N5VT77UJQPULA5JT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AnchorHash: A Scalable Consistent Hash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Orda, Dean Lorenz, Gal Mendelson, Isaac Keslassy, Katherine Barabash, Shay Vargaftik","submitted_at":"2018-12-23T08:58:51Z","abstract_excerpt":"Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solutions cannot ensure full consistency under arbitrary changes and/or cannot scale while maintaining reasonable memory footprints and update times. We present AnchorHash, a scalable and fully-consistent hashing algorithm. AnchorHash achieves high key lookup rates, a low memory footprint, and low update times. We formally establish its strong theoretical guarantees, and present advanced implementations with a memory foot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09674","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/1812.09674/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:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6kapCaKcyE8Huz+XizoBb0FDiSKENhko+G2sGTqnmfa3V2jsbFYFVJC48vtEd0EPa1E5RRy6RgZZho/iPBpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:39:53.751302Z"},"content_sha256":"dfdcb8978d083c22a989ee270dc84859b1832df4e0b936d42a361aecb4790e54","schema_version":"1.0","event_id":"sha256:dfdcb8978d083c22a989ee270dc84859b1832df4e0b936d42a361aecb4790e54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWY67LMC54N5VT77UJQPULA5JT/bundle.json","state_url":"https://pith.science/pith/BWY67LMC54N5VT77UJQPULA5JT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWY67LMC54N5VT77UJQPULA5JT/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-07-07T06:39:53Z","links":{"resolver":"https://pith.science/pith/BWY67LMC54N5VT77UJQPULA5JT","bundle":"https://pith.science/pith/BWY67LMC54N5VT77UJQPULA5JT/bundle.json","state":"https://pith.science/pith/BWY67LMC54N5VT77UJQPULA5JT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWY67LMC54N5VT77UJQPULA5JT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BWY67LMC54N5VT77UJQPULA5JT","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":"75bf17f933ffdf727f5d259e88599257574c56cde5b293ff920ec76d04d6b066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-23T08:58:51Z","title_canon_sha256":"44ab95bcc02367134c553883d6cc4cf6f2597fe1802e6f9df97f6624968b9596"},"schema_version":"1.0","source":{"id":"1812.09674","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09674","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09674v2","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09674","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"BWY67LMC54N5","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"pith_short_16","alias_value":"BWY67LMC54N5VT77","created_at":"2026-07-05T01:53:17Z"},{"alias_kind":"pith_short_8","alias_value":"BWY67LMC","created_at":"2026-07-05T01:53:17Z"}],"graph_snapshots":[{"event_id":"sha256:dfdcb8978d083c22a989ee270dc84859b1832df4e0b936d42a361aecb4790e54","target":"graph","created_at":"2026-07-05T01:53:17Z","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/1812.09674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solutions cannot ensure full consistency under arbitrary changes and/or cannot scale while maintaining reasonable memory footprints and update times. We present AnchorHash, a scalable and fully-consistent hashing algorithm. AnchorHash achieves high key lookup rates, a low memory footprint, and low update times. We formally establish its strong theoretical guarantees, and present advanced implementations with a memory foot","authors_text":"Ariel Orda, Dean Lorenz, Gal Mendelson, Isaac Keslassy, Katherine Barabash, Shay Vargaftik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-23T08:58:51Z","title":"AnchorHash: A Scalable Consistent Hash"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09674","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:9299ebe0f2f28ed9e0cacd339712f3e9a4e8cbd529f672b99191dbbcbc58769c","target":"record","created_at":"2026-07-05T01:53:17Z","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":"75bf17f933ffdf727f5d259e88599257574c56cde5b293ff920ec76d04d6b066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-23T08:58:51Z","title_canon_sha256":"44ab95bcc02367134c553883d6cc4cf6f2597fe1802e6f9df97f6624968b9596"},"schema_version":"1.0","source":{"id":"1812.09674","kind":"arxiv","version":2}},"canonical_sha256":"0db1efad82ef1bdacfffa260fa2c1d4cc576afb63dd659d4d54d9d1bc12bf2d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db1efad82ef1bdacfffa260fa2c1d4cc576afb63dd659d4d54d9d1bc12bf2d8","first_computed_at":"2026-07-05T01:53:17.189232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:17.189232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Q2NfH8sVtr5J8jY/NC7u6aeWNkL5zO+AgoCCQ1z2EwGq7aZAIyCQ6Nz0rio+riNDBz3yls3BOJmq+S9OLZIDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:17.189617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09674","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9299ebe0f2f28ed9e0cacd339712f3e9a4e8cbd529f672b99191dbbcbc58769c","sha256:dfdcb8978d083c22a989ee270dc84859b1832df4e0b936d42a361aecb4790e54"],"state_sha256":"600201adb9b0e8088158dec7bb6c43d13464ac7b8b533f98824cf098bfa38a39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESAWQREmsjbyfiZH/ee3jdmpvR7jcHpp5SowHqnJ6/smH9E0Ce1zZn/XNH70I0koJz9ZXRMfj/kewKfd47OaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:39:53.753467Z","bundle_sha256":"cf800ca3d51f4163fb46c565760397325125770a2457d251f5eb0edb3cbb3418"}}