{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LWTA7JJQSNFBHEZX3Z6MZMEU5M","short_pith_number":"pith:LWTA7JJQ","canonical_record":{"source":{"id":"1801.02436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-01-08T14:27:19Z","cross_cats_sorted":[],"title_canon_sha256":"b487fd8ba07b22e38ccc7920987ef211e3b2523ff8e6f0e6a200c1adf9180295","abstract_canon_sha256":"0d24dfba05f52e71f64a641fba650b81da38ad198959b5e2530d4b148026a31b"},"schema_version":"1.0"},"canonical_sha256":"5da60fa530934a139337de7cccb094eb0930b2bd664ec6f0a28c447e2a40d882","source":{"kind":"arxiv","id":"1801.02436","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02436","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02436v2","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02436","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"LWTA7JJQSNFB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LWTA7JJQSNFBHEZX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LWTA7JJQ","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LWTA7JJQSNFBHEZX3Z6MZMEU5M","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-01-08T14:27:19Z","cross_cats_sorted":[],"title_canon_sha256":"b487fd8ba07b22e38ccc7920987ef211e3b2523ff8e6f0e6a200c1adf9180295","abstract_canon_sha256":"0d24dfba05f52e71f64a641fba650b81da38ad198959b5e2530d4b148026a31b"},"schema_version":"1.0"},"canonical_sha256":"5da60fa530934a139337de7cccb094eb0930b2bd664ec6f0a28c447e2a40d882","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:14.096628Z","signature_b64":"KyMfhD6Pr8RiBTlv4QBfnB6NMEKwlfo2HlFgvQEcA6R8Y8NHaUNRECPvwtMN9fJ0fDR/QHYiEelUFGHioM4fDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da60fa530934a139337de7cccb094eb0930b2bd664ec6f0a28c447e2a40d882","last_reissued_at":"2026-05-18T00:26:14.096036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:14.096036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02436","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-18T00:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seF1vL82DpriJQDuMOK7E2rAyT07XoWnoPYBCPj1YypqelGvglYMWBur8hCaotPCAJM/bezPWdpuSHaGz8bvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:04:01.468308Z"},"content_sha256":"30d10adace3db8fafec63a0a8eb2d7e05ff6c4e699750521ed687e0223b7addd","schema_version":"1.0","event_id":"sha256:30d10adace3db8fafec63a0a8eb2d7e05ff6c4e699750521ed687e0223b7addd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LWTA7JJQSNFBHEZX3Z6MZMEU5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Miss Ratio of LRU Caching with Consistent Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Guocong Quan, Jian Tan, Kaiyi Ji","submitted_at":"2018-01-08T14:27:19Z","abstract_excerpt":"To efficiently scale data caching infrastructure to support emerging big data applications, many caching systems rely on consistent hashing to group a large number of servers to form a cooperative cluster. These servers are organized together according to a random hash function. They jointly provide a unified but distributed hash table to serve swift and voluminous data item requests. Different from the single least-recently-used (LRU) server that has already been extensively studied, theoretically characterizing a cluster that consists of multiple LRU servers remains yet to be explored. These"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02436","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-18T00:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWFPEsYEz0PleNknFfxuApenv8palS2krJ5OgSQhejxtu02jhpZGp6iI+Skhkp6h2ymMZCugmaG2ojtdfS+zBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:04:01.468987Z"},"content_sha256":"de63df8c92c1cc22fa4422db5dd0534fc08bd190820d07ce35410f0a69602706","schema_version":"1.0","event_id":"sha256:de63df8c92c1cc22fa4422db5dd0534fc08bd190820d07ce35410f0a69602706"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M/bundle.json","state_url":"https://pith.science/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M/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-25T03:04:01Z","links":{"resolver":"https://pith.science/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M","bundle":"https://pith.science/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M/bundle.json","state":"https://pith.science/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWTA7JJQSNFBHEZX3Z6MZMEU5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LWTA7JJQSNFBHEZX3Z6MZMEU5M","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":"0d24dfba05f52e71f64a641fba650b81da38ad198959b5e2530d4b148026a31b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-01-08T14:27:19Z","title_canon_sha256":"b487fd8ba07b22e38ccc7920987ef211e3b2523ff8e6f0e6a200c1adf9180295"},"schema_version":"1.0","source":{"id":"1801.02436","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02436","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02436v2","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02436","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"LWTA7JJQSNFB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LWTA7JJQSNFBHEZX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LWTA7JJQ","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:de63df8c92c1cc22fa4422db5dd0534fc08bd190820d07ce35410f0a69602706","target":"graph","created_at":"2026-05-18T00:26:14Z","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":"To efficiently scale data caching infrastructure to support emerging big data applications, many caching systems rely on consistent hashing to group a large number of servers to form a cooperative cluster. These servers are organized together according to a random hash function. They jointly provide a unified but distributed hash table to serve swift and voluminous data item requests. Different from the single least-recently-used (LRU) server that has already been extensively studied, theoretically characterizing a cluster that consists of multiple LRU servers remains yet to be explored. These","authors_text":"Guocong Quan, Jian Tan, Kaiyi Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-01-08T14:27:19Z","title":"Asymptotic Miss Ratio of LRU Caching with Consistent Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02436","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:30d10adace3db8fafec63a0a8eb2d7e05ff6c4e699750521ed687e0223b7addd","target":"record","created_at":"2026-05-18T00:26:14Z","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":"0d24dfba05f52e71f64a641fba650b81da38ad198959b5e2530d4b148026a31b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-01-08T14:27:19Z","title_canon_sha256":"b487fd8ba07b22e38ccc7920987ef211e3b2523ff8e6f0e6a200c1adf9180295"},"schema_version":"1.0","source":{"id":"1801.02436","kind":"arxiv","version":2}},"canonical_sha256":"5da60fa530934a139337de7cccb094eb0930b2bd664ec6f0a28c447e2a40d882","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5da60fa530934a139337de7cccb094eb0930b2bd664ec6f0a28c447e2a40d882","first_computed_at":"2026-05-18T00:26:14.096036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:14.096036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KyMfhD6Pr8RiBTlv4QBfnB6NMEKwlfo2HlFgvQEcA6R8Y8NHaUNRECPvwtMN9fJ0fDR/QHYiEelUFGHioM4fDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:14.096628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02436","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30d10adace3db8fafec63a0a8eb2d7e05ff6c4e699750521ed687e0223b7addd","sha256:de63df8c92c1cc22fa4422db5dd0534fc08bd190820d07ce35410f0a69602706"],"state_sha256":"17984591302ecd6a0ee5ef1d0a7de3bf5cc88f1b5f6380de7df83b6927a8114f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8EcTUoBPpVfasolzID4aH7drMKYtyxPDwt4LD1NNboPDaqyW+EghTFS8wQnMuJqGKBsibcAj5dSQAWQgKudDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:04:01.472532Z","bundle_sha256":"3fd96624709ab0c8c2f6adf0e6b93e7909087a6671906424b8cea362da0b9d64"}}