{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T3XLNMS5WICVWOOML5ERKDKQDV","short_pith_number":"pith:T3XLNMS5","schema_version":"1.0","canonical_sha256":"9eeeb6b25db2055b39cc5f49150d501d6d89b99cf91b3da562580cc362bcbb1d","source":{"kind":"arxiv","id":"1801.02889","version":1},"attestation_state":"computed","paper":{"title":"Optimal Content Replication and Request Matching in Large Caching Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Arpan Mukhopadhyay, Marc Lelarge, Nidhi Hegde","submitted_at":"2018-01-09T11:21:27Z","abstract_excerpt":"We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth. In such systems, the throughput crucially depends on how contents are replicated across servers and how the requests of specific contents are matched to servers storing those contents. In this paper, we first formulate the problem of computing the optimal replication policy which if combined with the optimal matching policy maximizes the throughput of the caching system in the stationary regime. It is shown that computing the optimal replication policy for a given s"},"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":"1801.02889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-01-09T11:21:27Z","cross_cats_sorted":[],"title_canon_sha256":"1ac74369cc2489746c692ab90108424e1432c3079ae071de11367ff8d69580e3","abstract_canon_sha256":"d7c4b39ec90b1e701d783443e0de3a0bfdb808a775310d0e60654bcdb64c27cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:22.151185Z","signature_b64":"sL58V9+7M4sovT1017kdhHjfXuMUqyzOG2G1yJTYgIa5lZpHuETDm0Ee6luSEiSFh/vUu5Lq781h9rXrX/lYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eeeb6b25db2055b39cc5f49150d501d6d89b99cf91b3da562580cc362bcbb1d","last_reissued_at":"2026-05-18T00:26:22.150498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:22.150498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Content Replication and Request Matching in Large Caching Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Arpan Mukhopadhyay, Marc Lelarge, Nidhi Hegde","submitted_at":"2018-01-09T11:21:27Z","abstract_excerpt":"We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth. In such systems, the throughput crucially depends on how contents are replicated across servers and how the requests of specific contents are matched to servers storing those contents. In this paper, we first formulate the problem of computing the optimal replication policy which if combined with the optimal matching policy maximizes the throughput of the caching system in the stationary regime. It is shown that computing the optimal replication policy for a given s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02889","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":"1801.02889","created_at":"2026-05-18T00:26:22.150592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02889v1","created_at":"2026-05-18T00:26:22.150592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02889","created_at":"2026-05-18T00:26:22.150592+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3XLNMS5WICV","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3XLNMS5WICVWOOM","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3XLNMS5","created_at":"2026-05-18T12:32:53.628368+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/T3XLNMS5WICVWOOML5ERKDKQDV","json":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV.json","graph_json":"https://pith.science/api/pith-number/T3XLNMS5WICVWOOML5ERKDKQDV/graph.json","events_json":"https://pith.science/api/pith-number/T3XLNMS5WICVWOOML5ERKDKQDV/events.json","paper":"https://pith.science/paper/T3XLNMS5"},"agent_actions":{"view_html":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV","download_json":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV.json","view_paper":"https://pith.science/paper/T3XLNMS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02889&json=true","fetch_graph":"https://pith.science/api/pith-number/T3XLNMS5WICVWOOML5ERKDKQDV/graph.json","fetch_events":"https://pith.science/api/pith-number/T3XLNMS5WICVWOOML5ERKDKQDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV/action/storage_attestation","attest_author":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV/action/author_attestation","sign_citation":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV/action/citation_signature","submit_replication":"https://pith.science/pith/T3XLNMS5WICVWOOML5ERKDKQDV/action/replication_record"}},"created_at":"2026-05-18T00:26:22.150592+00:00","updated_at":"2026-05-18T00:26:22.150592+00:00"}