{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5AQWVINSOV6BPOBMOCKCEC6SNB","short_pith_number":"pith:5AQWVINS","schema_version":"1.0","canonical_sha256":"e8216aa1b2757c17b82c7094220bd268510e2393112ffcdc65b3098baa0f2197","source":{"kind":"arxiv","id":"1902.10574","version":1},"attestation_state":"computed","paper":{"title":"Distributed Edge Caching via Reinforcement Learning in Fog Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fu-Chun Zheng, Liuyang Lu, Mehdi Bennis, Xiaohu You, Yanxiang Jiang, Zhiguo Ding","submitted_at":"2019-02-27T15:10:15Z","abstract_excerpt":"In this paper, the distributed edge caching problem in fog radio access networks (F-RANs) is investigated. By considering the unknown spatio-temporal content popularity and user preference, a user request model based on hidden Markov process is proposed to characterize the fluctuant spatio-temporal traffic demands in F-RANs. Then, the Q-learning method based on the reinforcement learning (RL) framework is put forth to seek the optimal caching policy in a distributed manner, which enables fog access points (F-APs) to learn and track the potential dynamic process without extra communications cos"},"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":"1902.10574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T15:10:15Z","cross_cats_sorted":["cs.NI","stat.ML"],"title_canon_sha256":"d68312077bffcf28c8ea94a1b8ec5db8a8f72e1c7947f98176a330138e9a4bea","abstract_canon_sha256":"c7962e9e021db83fb14dd32ccf17cbf6019baf9e59ba4a64a839a70a0a8e5148"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:30.488725Z","signature_b64":"BvSIyMICkTZ63pcHSpFBogSJEcZns6Ov/5xpYn1W74PI8JQDCNtZePc28mqhV1aGVc97JSQgJYG5hYjdXiGLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8216aa1b2757c17b82c7094220bd268510e2393112ffcdc65b3098baa0f2197","last_reissued_at":"2026-05-17T23:52:30.488257Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:30.488257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Edge Caching via Reinforcement Learning in Fog Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fu-Chun Zheng, Liuyang Lu, Mehdi Bennis, Xiaohu You, Yanxiang Jiang, Zhiguo Ding","submitted_at":"2019-02-27T15:10:15Z","abstract_excerpt":"In this paper, the distributed edge caching problem in fog radio access networks (F-RANs) is investigated. By considering the unknown spatio-temporal content popularity and user preference, a user request model based on hidden Markov process is proposed to characterize the fluctuant spatio-temporal traffic demands in F-RANs. Then, the Q-learning method based on the reinforcement learning (RL) framework is put forth to seek the optimal caching policy in a distributed manner, which enables fog access points (F-APs) to learn and track the potential dynamic process without extra communications cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10574","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":"1902.10574","created_at":"2026-05-17T23:52:30.488328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10574v1","created_at":"2026-05-17T23:52:30.488328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10574","created_at":"2026-05-17T23:52:30.488328+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AQWVINSOV6B","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AQWVINSOV6BPOBM","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AQWVINS","created_at":"2026-05-18T12:33:10.108867+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/5AQWVINSOV6BPOBMOCKCEC6SNB","json":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB.json","graph_json":"https://pith.science/api/pith-number/5AQWVINSOV6BPOBMOCKCEC6SNB/graph.json","events_json":"https://pith.science/api/pith-number/5AQWVINSOV6BPOBMOCKCEC6SNB/events.json","paper":"https://pith.science/paper/5AQWVINS"},"agent_actions":{"view_html":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB","download_json":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB.json","view_paper":"https://pith.science/paper/5AQWVINS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10574&json=true","fetch_graph":"https://pith.science/api/pith-number/5AQWVINSOV6BPOBMOCKCEC6SNB/graph.json","fetch_events":"https://pith.science/api/pith-number/5AQWVINSOV6BPOBMOCKCEC6SNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/action/storage_attestation","attest_author":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/action/author_attestation","sign_citation":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/action/citation_signature","submit_replication":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/action/replication_record"}},"created_at":"2026-05-17T23:52:30.488328+00:00","updated_at":"2026-05-17T23:52:30.488328+00:00"}