{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XLXRL7RW3ZFHKGL62ZQRBADJFW","short_pith_number":"pith:XLXRL7RW","schema_version":"1.0","canonical_sha256":"baef15fe36de4a75197ed6611080692d8745504b0b9401e85256d2f3e30dd546","source":{"kind":"arxiv","id":"1603.09153","version":1},"attestation_state":"computed","paper":{"title":"Content Replication in Large Distributed Caches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Nikhil Karamchandani, Sharayu Moharir","submitted_at":"2016-03-30T12:23:29Z","abstract_excerpt":"In this paper, we consider the algorithmic task of content replication and request routing in a distributed caching system consisting of a central server and a large number of caches, each with limited storage and service capabilities. We study a time-slotted system where in each time-slot, a large batch of requests has to be matched to a large number of caches, where each request can be served by any cache which stores the requested content. All requests which cannot be served by the caches are served by fetching the requested content from the central server. The goal is to minimize the trans"},"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":"1603.09153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T12:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"0459c6e748e086ac3efc9bcab41f7e06cf12dc0fe8574d34d9d778ea15548bb2","abstract_canon_sha256":"f155c1bc928ececbe55f76725a96cdf1dd7a8c33c51dafa4675dd5f6b4371e1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:01.298573Z","signature_b64":"7zSs6LBC0aDKAiC2xyR61Mh7iR+7xTYxSi29Z/81U67wn7uNP2Nk0V0w7iA/GGTletbdSFtv+b/ditT9jVCnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baef15fe36de4a75197ed6611080692d8745504b0b9401e85256d2f3e30dd546","last_reissued_at":"2026-05-18T01:18:01.297918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:01.297918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Content Replication in Large Distributed Caches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Nikhil Karamchandani, Sharayu Moharir","submitted_at":"2016-03-30T12:23:29Z","abstract_excerpt":"In this paper, we consider the algorithmic task of content replication and request routing in a distributed caching system consisting of a central server and a large number of caches, each with limited storage and service capabilities. We study a time-slotted system where in each time-slot, a large batch of requests has to be matched to a large number of caches, where each request can be served by any cache which stores the requested content. All requests which cannot be served by the caches are served by fetching the requested content from the central server. The goal is to minimize the trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09153","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.09153","created_at":"2026-05-18T01:18:01.298045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09153v1","created_at":"2026-05-18T01:18:01.298045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09153","created_at":"2026-05-18T01:18:01.298045+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLXRL7RW3ZFH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLXRL7RW3ZFHKGL6","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLXRL7RW","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW","json":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW.json","graph_json":"https://pith.science/api/pith-number/XLXRL7RW3ZFHKGL62ZQRBADJFW/graph.json","events_json":"https://pith.science/api/pith-number/XLXRL7RW3ZFHKGL62ZQRBADJFW/events.json","paper":"https://pith.science/paper/XLXRL7RW"},"agent_actions":{"view_html":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW","download_json":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW.json","view_paper":"https://pith.science/paper/XLXRL7RW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09153&json=true","fetch_graph":"https://pith.science/api/pith-number/XLXRL7RW3ZFHKGL62ZQRBADJFW/graph.json","fetch_events":"https://pith.science/api/pith-number/XLXRL7RW3ZFHKGL62ZQRBADJFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW/action/storage_attestation","attest_author":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW/action/author_attestation","sign_citation":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW/action/citation_signature","submit_replication":"https://pith.science/pith/XLXRL7RW3ZFHKGL62ZQRBADJFW/action/replication_record"}},"created_at":"2026-05-18T01:18:01.298045+00:00","updated_at":"2026-05-18T01:18:01.298045+00:00"}