{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DZLQA7ZHG6FIB2EX444GSRU7RM","short_pith_number":"pith:DZLQA7ZH","schema_version":"1.0","canonical_sha256":"1e57007f27378a80e897e73869469f8b34f91889f6cea3eaf676f9ed78be7f9a","source":{"kind":"arxiv","id":"1711.03709","version":4},"attestation_state":"computed","paper":{"title":"Practical Bounds on Optimal Caching with Variable Object Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Daniel S. Berger, Mor Harchol-Balter, Nathan Beckmann","submitted_at":"2017-11-10T06:27:08Z","abstract_excerpt":"Many recent caching systems aim to improve miss ratios, but there is no good sense among practitioners of how much further miss ratios can be improved. In other words, should the systems community continue working on this problem? Currently, there is no principled answer to this question. In practice, object sizes often vary by several orders of magnitude, where computing the optimal miss ratio (OPT) is known to be NP-hard. The few known results on caching with variable object sizes provide very weak bounds and are impractical to compute on traces of realistic length.\n  We propose a new method"},"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":"1711.03709","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-11-10T06:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"6c619d8fc5e1b9342a17fb8816fb96ed474738a6d20502c8af4baee95795316d","abstract_canon_sha256":"b722ac580d558ce61efff8bc2fdde05dd6cba25e7182d5f240f442f0ac186d9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:23.664384Z","signature_b64":"JkbY1P5cCLLmCG3w1pVLxVRGx/Qz0rb8U/UabiunJSfYSaUhDfm3iLAd5/xfkGBYOXlH3YUUt34hvjFFdUutAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e57007f27378a80e897e73869469f8b34f91889f6cea3eaf676f9ed78be7f9a","last_reissued_at":"2026-05-18T00:11:23.663879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:23.663879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Bounds on Optimal Caching with Variable Object Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Daniel S. Berger, Mor Harchol-Balter, Nathan Beckmann","submitted_at":"2017-11-10T06:27:08Z","abstract_excerpt":"Many recent caching systems aim to improve miss ratios, but there is no good sense among practitioners of how much further miss ratios can be improved. In other words, should the systems community continue working on this problem? Currently, there is no principled answer to this question. In practice, object sizes often vary by several orders of magnitude, where computing the optimal miss ratio (OPT) is known to be NP-hard. The few known results on caching with variable object sizes provide very weak bounds and are impractical to compute on traces of realistic length.\n  We propose a new method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03709","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":"1711.03709","created_at":"2026-05-18T00:11:23.663953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03709v4","created_at":"2026-05-18T00:11:23.663953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03709","created_at":"2026-05-18T00:11:23.663953+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZLQA7ZHG6FI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZLQA7ZHG6FIB2EX","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZLQA7ZH","created_at":"2026-05-18T12:31:12.930513+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/DZLQA7ZHG6FIB2EX444GSRU7RM","json":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM.json","graph_json":"https://pith.science/api/pith-number/DZLQA7ZHG6FIB2EX444GSRU7RM/graph.json","events_json":"https://pith.science/api/pith-number/DZLQA7ZHG6FIB2EX444GSRU7RM/events.json","paper":"https://pith.science/paper/DZLQA7ZH"},"agent_actions":{"view_html":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM","download_json":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM.json","view_paper":"https://pith.science/paper/DZLQA7ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03709&json=true","fetch_graph":"https://pith.science/api/pith-number/DZLQA7ZHG6FIB2EX444GSRU7RM/graph.json","fetch_events":"https://pith.science/api/pith-number/DZLQA7ZHG6FIB2EX444GSRU7RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM/action/storage_attestation","attest_author":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM/action/author_attestation","sign_citation":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM/action/citation_signature","submit_replication":"https://pith.science/pith/DZLQA7ZHG6FIB2EX444GSRU7RM/action/replication_record"}},"created_at":"2026-05-18T00:11:23.663953+00:00","updated_at":"2026-05-18T00:11:23.663953+00:00"}