{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7VY532ABZZCPNYUE24UA3VVMLZ","short_pith_number":"pith:7VY532AB","schema_version":"1.0","canonical_sha256":"fd71dde801ce44f6e284d7280dd6ac5e7744bcadaac39a240089c58baff24ea4","source":{"kind":"arxiv","id":"2006.08067","version":2},"attestation_state":"computed","paper":{"title":"CoT: Decentralized Elastic Caches for Cloud Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Amr El Abbadi, Divyakant Agrawal, Lawrence Lim, Victor Zakhary","submitted_at":"2020-06-15T01:03:47Z","abstract_excerpt":"Distributed caches are widely deployed to serve social networks and web applications at billion-user scales. This paper presents Cache-on-Track (CoT), a decentralized, elastic, and predictive caching framework for cloud environments. CoT proposes a new cache replacement policy specifically tailored for small front-end caches that serve skewed workloads. Front-end servers use a heavy hitter tracking algorithm to continuously track the top-k hot keys. CoT dynamically caches the hottest C keys out of the tracked keys. Our experiments show that CoT's replacement policy consistently outperforms the"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2006.08067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-06-15T01:03:47Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"6441df0ce37ab60807675107f7981d9d90f4c413173142f5abba4229b3a8a89d","abstract_canon_sha256":"417638a6161af86ad9d040b2d85d06b677cf48b7eb1181a462451b4d9c5d7d05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:14.345231Z","signature_b64":"p+u6f9PV+IhqF/ZOfBGpnK6k6rQ62SGflRrg1ftXiz1WAWC9MhZFE7jYZyKPL4MdSD+M81QDrBMMQ66FyuIJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd71dde801ce44f6e284d7280dd6ac5e7744bcadaac39a240089c58baff24ea4","last_reissued_at":"2026-07-05T01:11:14.344751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:14.344751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoT: Decentralized Elastic Caches for Cloud Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Amr El Abbadi, Divyakant Agrawal, Lawrence Lim, Victor Zakhary","submitted_at":"2020-06-15T01:03:47Z","abstract_excerpt":"Distributed caches are widely deployed to serve social networks and web applications at billion-user scales. This paper presents Cache-on-Track (CoT), a decentralized, elastic, and predictive caching framework for cloud environments. CoT proposes a new cache replacement policy specifically tailored for small front-end caches that serve skewed workloads. Front-end servers use a heavy hitter tracking algorithm to continuously track the top-k hot keys. CoT dynamically caches the hottest C keys out of the tracked keys. Our experiments show that CoT's replacement policy consistently outperforms the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08067","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/2006.08067/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.08067","created_at":"2026-07-05T01:11:14.344808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08067v2","created_at":"2026-07-05T01:11:14.344808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08067","created_at":"2026-07-05T01:11:14.344808+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VY532ABZZCP","created_at":"2026-07-05T01:11:14.344808+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VY532ABZZCPNYUE","created_at":"2026-07-05T01:11:14.344808+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VY532AB","created_at":"2026-07-05T01:11:14.344808+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.00303","citing_title":"Access Paths for Efficient Ordering with Large Language Models","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ","json":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ.json","graph_json":"https://pith.science/api/pith-number/7VY532ABZZCPNYUE24UA3VVMLZ/graph.json","events_json":"https://pith.science/api/pith-number/7VY532ABZZCPNYUE24UA3VVMLZ/events.json","paper":"https://pith.science/paper/7VY532AB"},"agent_actions":{"view_html":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ","download_json":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ.json","view_paper":"https://pith.science/paper/7VY532AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08067&json=true","fetch_graph":"https://pith.science/api/pith-number/7VY532ABZZCPNYUE24UA3VVMLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7VY532ABZZCPNYUE24UA3VVMLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ/action/storage_attestation","attest_author":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ/action/author_attestation","sign_citation":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ/action/citation_signature","submit_replication":"https://pith.science/pith/7VY532ABZZCPNYUE24UA3VVMLZ/action/replication_record"}},"created_at":"2026-07-05T01:11:14.344808+00:00","updated_at":"2026-07-05T01:11:14.344808+00:00"}