{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7VFWSM6HEGBKIVOUTZKLUCSMOB","short_pith_number":"pith:7VFWSM6H","schema_version":"1.0","canonical_sha256":"fd4b6933c72182a455d49e54ba0a4c7058c96a2fc987a7a9629dd4b61808ed8d","source":{"kind":"arxiv","id":"1601.03926","version":1},"attestation_state":"computed","paper":{"title":"Placing Dynamic Content in Caches with Small Population","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Georgios Paschos, Lazaros Gkatzikis, Mathieu Leconte, Moez Draief, Spyridon Vassilaras, Symeon Chouvardas","submitted_at":"2016-01-15T14:11:00Z","abstract_excerpt":"This paper addresses a fundamental limitation for the adoption of caching for wireless access networks due to small population sizes. This shortcoming is due to two main challenges: (i) making timely estimates of varying content popularity and (ii) inferring popular content from small samples. We propose a framework which alleviates such limitations.\n  To timely estimate varying popularity in a context of a single cache we propose an Age-Based Threshold (ABT) policy which caches all contents requested more times than a threshold $\\widetilde N(\\tau)$, where $\\tau$ is the content age. We show th"},"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":"1601.03926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-15T14:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"081eab2268b8f476d4b8c82181cf570eb45435493b7e33dc65ee000e6058b4ff","abstract_canon_sha256":"15d930f5ba96a5d9e7392bbb04e27c30c6ebe3a81296c9c0ce332fe5e73efcc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.288052Z","signature_b64":"p2LxYIsDouP0Kyz2HeaYBu/gCKTURXaNevx6YDMG0AUzVf7IppR0Q2lqsJ2vZDDX4t6ekB8LrZ6U9shPmXS7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd4b6933c72182a455d49e54ba0a4c7058c96a2fc987a7a9629dd4b61808ed8d","last_reissued_at":"2026-05-18T00:58:34.287463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.287463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Placing Dynamic Content in Caches with Small Population","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Georgios Paschos, Lazaros Gkatzikis, Mathieu Leconte, Moez Draief, Spyridon Vassilaras, Symeon Chouvardas","submitted_at":"2016-01-15T14:11:00Z","abstract_excerpt":"This paper addresses a fundamental limitation for the adoption of caching for wireless access networks due to small population sizes. This shortcoming is due to two main challenges: (i) making timely estimates of varying content popularity and (ii) inferring popular content from small samples. We propose a framework which alleviates such limitations.\n  To timely estimate varying popularity in a context of a single cache we propose an Age-Based Threshold (ABT) policy which caches all contents requested more times than a threshold $\\widetilde N(\\tau)$, where $\\tau$ is the content age. We show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03926","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":"1601.03926","created_at":"2026-05-18T00:58:34.287550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03926v1","created_at":"2026-05-18T00:58:34.287550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03926","created_at":"2026-05-18T00:58:34.287550+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VFWSM6HEGBK","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VFWSM6HEGBKIVOU","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VFWSM6H","created_at":"2026-05-18T12:30:04.600751+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/7VFWSM6HEGBKIVOUTZKLUCSMOB","json":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB.json","graph_json":"https://pith.science/api/pith-number/7VFWSM6HEGBKIVOUTZKLUCSMOB/graph.json","events_json":"https://pith.science/api/pith-number/7VFWSM6HEGBKIVOUTZKLUCSMOB/events.json","paper":"https://pith.science/paper/7VFWSM6H"},"agent_actions":{"view_html":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB","download_json":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB.json","view_paper":"https://pith.science/paper/7VFWSM6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03926&json=true","fetch_graph":"https://pith.science/api/pith-number/7VFWSM6HEGBKIVOUTZKLUCSMOB/graph.json","fetch_events":"https://pith.science/api/pith-number/7VFWSM6HEGBKIVOUTZKLUCSMOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB/action/storage_attestation","attest_author":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB/action/author_attestation","sign_citation":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB/action/citation_signature","submit_replication":"https://pith.science/pith/7VFWSM6HEGBKIVOUTZKLUCSMOB/action/replication_record"}},"created_at":"2026-05-18T00:58:34.287550+00:00","updated_at":"2026-05-18T00:58:34.287550+00:00"}