{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7VDJ3TVTIRIGZ7MRFOWCCVCPKF","short_pith_number":"pith:7VDJ3TVT","schema_version":"1.0","canonical_sha256":"fd469dceb344506cfd912bac21544f514c9e109230ee55c9e9d71e249c3b6843","source":{"kind":"arxiv","id":"1803.04675","version":1},"attestation_state":"computed","paper":{"title":"Using Grouped Linear Prediction and Accelerated Reinforcement Learning for Online Content Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kaibin Zheng, Meixia Tao, Naifu Zhang","submitted_at":"2018-03-13T08:14:59Z","abstract_excerpt":"Proactive caching is an effective way to alleviate peak-hour traffic congestion by prefetching popular contents at the wireless network edge. To maximize the caching efficiency requires the knowledge of content popularity profile, which however is often unavailable in advance. In this paper, we first propose a new linear prediction model, named grouped linear model (GLM) to estimate the future content requests based on historical data. Unlike many existing works that assumed the static content popularity profile, our model can adapt to the temporal variation of the content popularity in practi"},"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":"1803.04675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-13T08:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"c4ecd6d1fc18bf0e4b874e2b95dd110aaa44c909e9bde4afcb744c62ad14977d","abstract_canon_sha256":"dc7fd0e252e3b3fc4fa251ea0a7c7e913858ec20669264d275c4d06a59cc8bf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:18.169770Z","signature_b64":"xLNrXg8nT8NBpLVXBOdbtc01s3eehMVBhFhebCQHpy67wFraqqtj/ddQFfNYL16WZVRVG61Otq2d0rt3AkpPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd469dceb344506cfd912bac21544f514c9e109230ee55c9e9d71e249c3b6843","last_reissued_at":"2026-05-18T00:21:18.169131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:18.169131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Grouped Linear Prediction and Accelerated Reinforcement Learning for Online Content Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kaibin Zheng, Meixia Tao, Naifu Zhang","submitted_at":"2018-03-13T08:14:59Z","abstract_excerpt":"Proactive caching is an effective way to alleviate peak-hour traffic congestion by prefetching popular contents at the wireless network edge. To maximize the caching efficiency requires the knowledge of content popularity profile, which however is often unavailable in advance. In this paper, we first propose a new linear prediction model, named grouped linear model (GLM) to estimate the future content requests based on historical data. Unlike many existing works that assumed the static content popularity profile, our model can adapt to the temporal variation of the content popularity in practi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04675","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":"1803.04675","created_at":"2026-05-18T00:21:18.169233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04675v1","created_at":"2026-05-18T00:21:18.169233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04675","created_at":"2026-05-18T00:21:18.169233+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VDJ3TVTIRIG","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VDJ3TVTIRIGZ7MR","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VDJ3TVT","created_at":"2026-05-18T12:32:11.075285+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/7VDJ3TVTIRIGZ7MRFOWCCVCPKF","json":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF.json","graph_json":"https://pith.science/api/pith-number/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/graph.json","events_json":"https://pith.science/api/pith-number/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/events.json","paper":"https://pith.science/paper/7VDJ3TVT"},"agent_actions":{"view_html":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF","download_json":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF.json","view_paper":"https://pith.science/paper/7VDJ3TVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04675&json=true","fetch_graph":"https://pith.science/api/pith-number/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/graph.json","fetch_events":"https://pith.science/api/pith-number/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/action/storage_attestation","attest_author":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/action/author_attestation","sign_citation":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/action/citation_signature","submit_replication":"https://pith.science/pith/7VDJ3TVTIRIGZ7MRFOWCCVCPKF/action/replication_record"}},"created_at":"2026-05-18T00:21:18.169233+00:00","updated_at":"2026-05-18T00:21:18.169233+00:00"}