{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XBCFICE5FJGHFTRXCSOO76U3LW","short_pith_number":"pith:XBCFICE5","schema_version":"1.0","canonical_sha256":"b84454089d2a4c72ce37149ceffa9b5db5b87e93401d80853c0f1e9233332392","source":{"kind":"arxiv","id":"1310.3482","version":1},"attestation_state":"computed","paper":{"title":"Using Information Theory to Study the Efficiency and Capacity of Caching in the Computer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Boris Ryabko","submitted_at":"2013-10-13T13:51:55Z","abstract_excerpt":"Nowadays computer networks use different kind of memory whose speeds and capacities vary widely. There exist methods of a so-called caching which are intended to use the different kinds of memory in such a way that the frequently used data are stored in the faster memory, wheres the infrequent ones are stored in the slower memory. We address the problems of estimating the caching efficiency and its capacity. We define the efficiency and capacity of the caching and suggest a method for their estimation based on the analysis of kinds of the accessible memory."},"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":"1310.3482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-13T13:51:55Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"22cec02fbba93c4cb09bf133c4a3b05490a6871d86e1d16a90cb6f8a491cca6a","abstract_canon_sha256":"9c16b409de86a7fa05167ea679c5a8e303e3e88d6805313b0ee4365c53037480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.610449Z","signature_b64":"o6n/R/xJxcLVOuTPELjeGdf7OpIiSMUA0BB557baCLAyrCRA7TDIRJSfHYot7Asq93HQ61BVVrKRckEnmXz/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b84454089d2a4c72ce37149ceffa9b5db5b87e93401d80853c0f1e9233332392","last_reissued_at":"2026-05-18T03:10:35.609834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.609834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Information Theory to Study the Efficiency and Capacity of Caching in the Computer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Boris Ryabko","submitted_at":"2013-10-13T13:51:55Z","abstract_excerpt":"Nowadays computer networks use different kind of memory whose speeds and capacities vary widely. There exist methods of a so-called caching which are intended to use the different kinds of memory in such a way that the frequently used data are stored in the faster memory, wheres the infrequent ones are stored in the slower memory. We address the problems of estimating the caching efficiency and its capacity. We define the efficiency and capacity of the caching and suggest a method for their estimation based on the analysis of kinds of the accessible memory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3482","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":"1310.3482","created_at":"2026-05-18T03:10:35.609934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3482v1","created_at":"2026-05-18T03:10:35.609934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3482","created_at":"2026-05-18T03:10:35.609934+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBCFICE5FJGH","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBCFICE5FJGHFTRX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBCFICE5","created_at":"2026-05-18T12:28:06.772260+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/XBCFICE5FJGHFTRXCSOO76U3LW","json":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW.json","graph_json":"https://pith.science/api/pith-number/XBCFICE5FJGHFTRXCSOO76U3LW/graph.json","events_json":"https://pith.science/api/pith-number/XBCFICE5FJGHFTRXCSOO76U3LW/events.json","paper":"https://pith.science/paper/XBCFICE5"},"agent_actions":{"view_html":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW","download_json":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW.json","view_paper":"https://pith.science/paper/XBCFICE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3482&json=true","fetch_graph":"https://pith.science/api/pith-number/XBCFICE5FJGHFTRXCSOO76U3LW/graph.json","fetch_events":"https://pith.science/api/pith-number/XBCFICE5FJGHFTRXCSOO76U3LW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW/action/storage_attestation","attest_author":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW/action/author_attestation","sign_citation":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW/action/citation_signature","submit_replication":"https://pith.science/pith/XBCFICE5FJGHFTRXCSOO76U3LW/action/replication_record"}},"created_at":"2026-05-18T03:10:35.609934+00:00","updated_at":"2026-05-18T03:10:35.609934+00:00"}