{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VKDSDZNN7M2I3GFJMN6DXGF66R","short_pith_number":"pith:VKDSDZNN","schema_version":"1.0","canonical_sha256":"aa8721e5adfb348d98a9637c3b98bef4503ea3a355adad60d9328ec5a7ef1f98","source":{"kind":"arxiv","id":"1607.01283","version":1},"attestation_state":"computed","paper":{"title":"Identity of King and Flajolet & al. Formulae for LRU Miss Rate Exact Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Berthet","submitted_at":"2016-07-05T14:53:54Z","abstract_excerpt":"This short paper gives a detailed proof of identity between two classic formulas for the computation of the exact Miss Rate of LRU caches. An extension to the identity of two formulas of the expected time of a partial collection in the coupon collector problem is also presented."},"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":"1607.01283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-05T14:53:54Z","cross_cats_sorted":[],"title_canon_sha256":"0dfdd1f41a81d51ac2b2ad430fa675f41f554151b1c0582f86f7382ac5e8e837","abstract_canon_sha256":"e4e909501d13760552b2a278082e5812523143b207ea5f6f1843b1866e740926"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:29.866981Z","signature_b64":"iddyvgkb/wWDMSiEAaMjCpCWHfX2Cbd1rJ1k8IGaGcLKuh/Q2lsmSdWhDwIS9unrPB+qlUdsi9w54RRNh5NACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa8721e5adfb348d98a9637c3b98bef4503ea3a355adad60d9328ec5a7ef1f98","last_reissued_at":"2026-05-18T01:11:29.866535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:29.866535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identity of King and Flajolet & al. Formulae for LRU Miss Rate Exact Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Berthet","submitted_at":"2016-07-05T14:53:54Z","abstract_excerpt":"This short paper gives a detailed proof of identity between two classic formulas for the computation of the exact Miss Rate of LRU caches. An extension to the identity of two formulas of the expected time of a partial collection in the coupon collector problem is also presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01283","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":"1607.01283","created_at":"2026-05-18T01:11:29.866602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01283v1","created_at":"2026-05-18T01:11:29.866602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01283","created_at":"2026-05-18T01:11:29.866602+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKDSDZNN7M2I","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKDSDZNN7M2I3GFJ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKDSDZNN","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.26107","citing_title":"Radial Extremality for LRU Caching and the Fill--Holst Conjecture","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R","json":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R.json","graph_json":"https://pith.science/api/pith-number/VKDSDZNN7M2I3GFJMN6DXGF66R/graph.json","events_json":"https://pith.science/api/pith-number/VKDSDZNN7M2I3GFJMN6DXGF66R/events.json","paper":"https://pith.science/paper/VKDSDZNN"},"agent_actions":{"view_html":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R","download_json":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R.json","view_paper":"https://pith.science/paper/VKDSDZNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01283&json=true","fetch_graph":"https://pith.science/api/pith-number/VKDSDZNN7M2I3GFJMN6DXGF66R/graph.json","fetch_events":"https://pith.science/api/pith-number/VKDSDZNN7M2I3GFJMN6DXGF66R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R/action/storage_attestation","attest_author":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R/action/author_attestation","sign_citation":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R/action/citation_signature","submit_replication":"https://pith.science/pith/VKDSDZNN7M2I3GFJMN6DXGF66R/action/replication_record"}},"created_at":"2026-05-18T01:11:29.866602+00:00","updated_at":"2026-05-18T01:11:29.866602+00:00"}