{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4CAFROQ5NP3S4R5SEJKDLJK7TI","short_pith_number":"pith:4CAFROQ5","canonical_record":{"source":{"id":"1708.01673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-08-04T22:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"67cac98f5e25eaf50c7db59ef2bd8d163142388296716ca7aa35c46d5237bbf9","abstract_canon_sha256":"39d2be750b46dcf9b5a21516e49e879feaba0a02d82dbf78e0774ed4e0f505e8"},"schema_version":"1.0"},"canonical_sha256":"e08058ba1d6bf72e47b2225435a55f9a1cbc65badd6b83daa8eed5b451d997e9","source":{"kind":"arxiv","id":"1708.01673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01673","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01673v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01673","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"4CAFROQ5NP3S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4CAFROQ5NP3S4R5S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4CAFROQ5","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4CAFROQ5NP3S4R5SEJKDLJK7TI","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-08-04T22:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"67cac98f5e25eaf50c7db59ef2bd8d163142388296716ca7aa35c46d5237bbf9","abstract_canon_sha256":"39d2be750b46dcf9b5a21516e49e879feaba0a02d82dbf78e0774ed4e0f505e8"},"schema_version":"1.0"},"canonical_sha256":"e08058ba1d6bf72e47b2225435a55f9a1cbc65badd6b83daa8eed5b451d997e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.225764Z","signature_b64":"hvO45lclp926byMCugrwuumbqHRS5CdtjsUyzimGOHEccuDo9+tes4LDyIc4FZvUI38n4B/LwAn9iUbIcLgECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e08058ba1d6bf72e47b2225435a55f9a1cbc65badd6b83daa8eed5b451d997e9","last_reissued_at":"2026-05-18T00:38:35.225272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.225272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01673","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JHglCjDKNtw4DnrfNCD2KMnz4SKRHQlriG8z8dqjtzqOS0YYR4Wou5Gch/NFGQPgUe9KEyaK0Wg8CPM+YhqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:39:56.020807Z"},"content_sha256":"ff61f34c997ddfdb6ae90b1bc8bd06603d6f16eac758b44a3aef055a9faf73e8","schema_version":"1.0","event_id":"sha256:ff61f34c997ddfdb6ae90b1bc8bd06603d6f16eac758b44a3aef055a9faf73e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4CAFROQ5NP3S4R5SEJKDLJK7TI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Resource Pooling and Separation for LRU Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Guocong Quan, Jian Tan, Kaiyi Ji, Ness Shroff","submitted_at":"2017-08-04T22:16:15Z","abstract_excerpt":"Caching systems using the Least Recently Used (LRU) principle have now become ubiquitous. A fundamental question for these systems is whether the cache space should be pooled together or divided to serve multiple flows of data item requests in order to minimize the miss probabilities. In this paper, we show that there is no straight yes or no answer to this question, depending on complex combinations of critical factors, including, e.g., request rates, overlapped data items across different request flows, data item popularities and their sizes. Specifically, we characterize the asymptotic miss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01673","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zX3Xdhz2VPVdX/toSe9YLnLp8LuWN3Z2H33+JNGzXrVdt98ginee9xQUTmauFFXRYE5uoATiaq50jzYBn1xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:39:56.021629Z"},"content_sha256":"114e9dad46d2966c3bdfff1062d461becb926451ced55dce2ce7b0c61d53cf40","schema_version":"1.0","event_id":"sha256:114e9dad46d2966c3bdfff1062d461becb926451ced55dce2ce7b0c61d53cf40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI/bundle.json","state_url":"https://pith.science/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI/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-30T12:39:56Z","links":{"resolver":"https://pith.science/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI","bundle":"https://pith.science/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI/bundle.json","state":"https://pith.science/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CAFROQ5NP3S4R5SEJKDLJK7TI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4CAFROQ5NP3S4R5SEJKDLJK7TI","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":"39d2be750b46dcf9b5a21516e49e879feaba0a02d82dbf78e0774ed4e0f505e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-08-04T22:16:15Z","title_canon_sha256":"67cac98f5e25eaf50c7db59ef2bd8d163142388296716ca7aa35c46d5237bbf9"},"schema_version":"1.0","source":{"id":"1708.01673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01673","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01673v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01673","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"4CAFROQ5NP3S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4CAFROQ5NP3S4R5S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4CAFROQ5","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:114e9dad46d2966c3bdfff1062d461becb926451ced55dce2ce7b0c61d53cf40","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"Caching systems using the Least Recently Used (LRU) principle have now become ubiquitous. A fundamental question for these systems is whether the cache space should be pooled together or divided to serve multiple flows of data item requests in order to minimize the miss probabilities. In this paper, we show that there is no straight yes or no answer to this question, depending on complex combinations of critical factors, including, e.g., request rates, overlapped data items across different request flows, data item popularities and their sizes. Specifically, we characterize the asymptotic miss","authors_text":"Guocong Quan, Jian Tan, Kaiyi Ji, Ness Shroff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-08-04T22:16:15Z","title":"On Resource Pooling and Separation for LRU Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01673","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:ff61f34c997ddfdb6ae90b1bc8bd06603d6f16eac758b44a3aef055a9faf73e8","target":"record","created_at":"2026-05-18T00:38:35Z","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":"39d2be750b46dcf9b5a21516e49e879feaba0a02d82dbf78e0774ed4e0f505e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-08-04T22:16:15Z","title_canon_sha256":"67cac98f5e25eaf50c7db59ef2bd8d163142388296716ca7aa35c46d5237bbf9"},"schema_version":"1.0","source":{"id":"1708.01673","kind":"arxiv","version":1}},"canonical_sha256":"e08058ba1d6bf72e47b2225435a55f9a1cbc65badd6b83daa8eed5b451d997e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e08058ba1d6bf72e47b2225435a55f9a1cbc65badd6b83daa8eed5b451d997e9","first_computed_at":"2026-05-18T00:38:35.225272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.225272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvO45lclp926byMCugrwuumbqHRS5CdtjsUyzimGOHEccuDo9+tes4LDyIc4FZvUI38n4B/LwAn9iUbIcLgECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.225764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff61f34c997ddfdb6ae90b1bc8bd06603d6f16eac758b44a3aef055a9faf73e8","sha256:114e9dad46d2966c3bdfff1062d461becb926451ced55dce2ce7b0c61d53cf40"],"state_sha256":"f4065408aa2633de276be4c48151ee4e07a77d6935353a27a5542ec74dcc2915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JF6IAmuEWQdzDdsBiRWCt8ATaIFNO1ifbThCseIVhoUbgB/3rmm/6I8QsQ7shDBS6qNoN2/sDUUCgVCnhuv+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:39:56.026029Z","bundle_sha256":"21a46f17d2be2ea485763821bfa9e5e2f9952804b99c23e7e03a822291f87dc9"}}