{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LSIC5WTWPJKYANJXUXE3N7DZ4Y","short_pith_number":"pith:LSIC5WTW","schema_version":"1.0","canonical_sha256":"5c902eda767a55803537a5c9b6fc79e60b4ee8f01c6b8a4c5053d83b9568594c","source":{"kind":"arxiv","id":"1007.2694","version":4},"attestation_state":"computed","paper":{"title":"Cache Me If You Can: Capacitated Selfish Replication Games in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"C. Pandu Rangan, Dimitrios Kanoulas, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, Rajmohan Rajaraman, Ravi Sundaram","submitted_at":"2010-07-16T04:16:39Z","abstract_excerpt":"In Peer-to-Peer (P2P) network systems, content (object) delivery between nodes is often required. One way to study such a distributed system is by defining games, which involve selfish nodes that make strategic choices on replicating content in their local limited memory (cache) or accessing content from other nodes for a cost. These Selfish Replication games have been introduced in [8] for nodes that do not have any capacity limits, leaving the capacitated problem, i.e. Capacitated Selfish Replication (CSR) games, open.\n  In this work, we first form the model of the CSR games, for which we pe"},"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":"1007.2694","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-07-16T04:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"d804a3ac63cc28f08d52d4599eaad87df93b8eeb7265c4f844ddb75c7bdb7542","abstract_canon_sha256":"432847d740e90e9d1e29f4db82b78a70c1fd8aa81cdf9c2df4e2b68fbd3c5325"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.365246Z","signature_b64":"TDww+MVB8eicrhb9ZzguiPNtg/o3kq2suU5sRlC2Wzus42Qt+3WZQOe9e2Y2wJzzGLgLQgDzIc7TohdVj3ZCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c902eda767a55803537a5c9b6fc79e60b4ee8f01c6b8a4c5053d83b9568594c","last_reissued_at":"2026-05-17T23:42:49.364578Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.364578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache Me If You Can: Capacitated Selfish Replication Games in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"C. Pandu Rangan, Dimitrios Kanoulas, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, Rajmohan Rajaraman, Ravi Sundaram","submitted_at":"2010-07-16T04:16:39Z","abstract_excerpt":"In Peer-to-Peer (P2P) network systems, content (object) delivery between nodes is often required. One way to study such a distributed system is by defining games, which involve selfish nodes that make strategic choices on replicating content in their local limited memory (cache) or accessing content from other nodes for a cost. These Selfish Replication games have been introduced in [8] for nodes that do not have any capacity limits, leaving the capacitated problem, i.e. Capacitated Selfish Replication (CSR) games, open.\n  In this work, we first form the model of the CSR games, for which we pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2694","kind":"arxiv","version":4},"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":"1007.2694","created_at":"2026-05-17T23:42:49.364689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2694v4","created_at":"2026-05-17T23:42:49.364689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2694","created_at":"2026-05-17T23:42:49.364689+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSIC5WTWPJKY","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSIC5WTWPJKYANJX","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSIC5WTW","created_at":"2026-05-18T12:26:10.704358+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/LSIC5WTWPJKYANJXUXE3N7DZ4Y","json":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y.json","graph_json":"https://pith.science/api/pith-number/LSIC5WTWPJKYANJXUXE3N7DZ4Y/graph.json","events_json":"https://pith.science/api/pith-number/LSIC5WTWPJKYANJXUXE3N7DZ4Y/events.json","paper":"https://pith.science/paper/LSIC5WTW"},"agent_actions":{"view_html":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y","download_json":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y.json","view_paper":"https://pith.science/paper/LSIC5WTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2694&json=true","fetch_graph":"https://pith.science/api/pith-number/LSIC5WTWPJKYANJXUXE3N7DZ4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/LSIC5WTWPJKYANJXUXE3N7DZ4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y/action/storage_attestation","attest_author":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y/action/author_attestation","sign_citation":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y/action/citation_signature","submit_replication":"https://pith.science/pith/LSIC5WTWPJKYANJXUXE3N7DZ4Y/action/replication_record"}},"created_at":"2026-05-17T23:42:49.364689+00:00","updated_at":"2026-05-17T23:42:49.364689+00:00"}