{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GA3E6B4JRR4O3V72I6CZYONGYQ","short_pith_number":"pith:GA3E6B4J","schema_version":"1.0","canonical_sha256":"30364f07898c78edd7fa47859c39a6c43d654d7cc20a6d2158d6678b2280c5dc","source":{"kind":"arxiv","id":"1202.3974","version":1},"attestation_state":"computed","paper":{"title":"A versatile and accurate approximation for LRU cache performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Christine Fricker, James Roberts, Philippe Robert","submitted_at":"2012-02-17T17:29:12Z","abstract_excerpt":"In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite general distributions of object popularity. This paper provides a mathematical explanation for the success of the approximation, notably in configurations where the intuitive arguments of Che, et al clearly do not apply. The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other appro"},"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":"1202.3974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-17T17:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"dc4b38e2e9bf029a4a516b1b58b4a5c389cf1a66c3d7782458cbc35060dfe655","abstract_canon_sha256":"0209343e860990fd4fe4c1121f9f1e02bd09317d65490b13476129102d12af65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:02.310183Z","signature_b64":"GtpLD/htODH3AxV09UBWTkMXv492c3Ormq43Qb/ItuzX3hF96qnIyBJpEdAJbLXrfTD5E51J29XTbTzacezwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30364f07898c78edd7fa47859c39a6c43d654d7cc20a6d2158d6678b2280c5dc","last_reissued_at":"2026-05-18T04:02:02.309134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:02.309134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A versatile and accurate approximation for LRU cache performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Christine Fricker, James Roberts, Philippe Robert","submitted_at":"2012-02-17T17:29:12Z","abstract_excerpt":"In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite general distributions of object popularity. This paper provides a mathematical explanation for the success of the approximation, notably in configurations where the intuitive arguments of Che, et al clearly do not apply. The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3974","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":"1202.3974","created_at":"2026-05-18T04:02:02.309237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3974v1","created_at":"2026-05-18T04:02:02.309237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3974","created_at":"2026-05-18T04:02:02.309237+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA3E6B4JRR4O","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA3E6B4JRR4O3V72","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA3E6B4J","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14626","citing_title":"ELMoE-3D: Leveraging Intrinsic Elasticity of MoE for Hybrid-Bonding-Enabled Self-Speculative Decoding in On-Premises Serving","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ","json":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ.json","graph_json":"https://pith.science/api/pith-number/GA3E6B4JRR4O3V72I6CZYONGYQ/graph.json","events_json":"https://pith.science/api/pith-number/GA3E6B4JRR4O3V72I6CZYONGYQ/events.json","paper":"https://pith.science/paper/GA3E6B4J"},"agent_actions":{"view_html":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ","download_json":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ.json","view_paper":"https://pith.science/paper/GA3E6B4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3974&json=true","fetch_graph":"https://pith.science/api/pith-number/GA3E6B4JRR4O3V72I6CZYONGYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GA3E6B4JRR4O3V72I6CZYONGYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ/action/storage_attestation","attest_author":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ/action/author_attestation","sign_citation":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ/action/citation_signature","submit_replication":"https://pith.science/pith/GA3E6B4JRR4O3V72I6CZYONGYQ/action/replication_record"}},"created_at":"2026-05-18T04:02:02.309237+00:00","updated_at":"2026-05-18T04:02:02.309237+00:00"}