{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5AQWVINSOV6BPOBMOCKCEC6SNB","short_pith_number":"pith:5AQWVINS","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"},"canonical_sha256":"e8216aa1b2757c17b82c7094220bd268510e2393112ffcdc65b3098baa0f2197","source":{"kind":"arxiv","id":"1902.10574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10574","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10574v1","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10574","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"5AQWVINSOV6B","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5AQWVINSOV6BPOBM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5AQWVINS","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5AQWVINSOV6BPOBMOCKCEC6SNB","target":"record","payload":{"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"},"canonical_sha256":"e8216aa1b2757c17b82c7094220bd268510e2393112ffcdc65b3098baa0f2197","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"},"source_kind":"arxiv","source_id":"1902.10574","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WILlSA8Fy8mBNHrFPuFhcwdq5jO3xKi2pEPjeYXfsTy6T/u20aZ6oG+XFb8CtGjf9bi7oy8dHyxsmGFVCZy8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:05:29.635407Z"},"content_sha256":"394649fda771eac5cc5149e0c5d549290f33b097547826209a4cc9ac63fca6be","schema_version":"1.0","event_id":"sha256:394649fda771eac5cc5149e0c5d549290f33b097547826209a4cc9ac63fca6be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5AQWVINSOV6BPOBMOCKCEC6SNB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fp/wWTZMot0JZpNg/8yuW/6PepBG106pQJwbO/4+Ca6hAVT/Ma36QWAYGTjsZIxBfW2EbHEq+PuHpash6u5VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:05:29.635751Z"},"content_sha256":"f1b1e7078964d86177eb03169ddebc3975e136882f65b8ba001d6f37e0a8fb38","schema_version":"1.0","event_id":"sha256:f1b1e7078964d86177eb03169ddebc3975e136882f65b8ba001d6f37e0a8fb38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/bundle.json","state_url":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:05:29Z","links":{"resolver":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB","bundle":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/bundle.json","state":"https://pith.science/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AQWVINSOV6BPOBMOCKCEC6SNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5AQWVINSOV6BPOBMOCKCEC6SNB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c7962e9e021db83fb14dd32ccf17cbf6019baf9e59ba4a64a839a70a0a8e5148","cross_cats_sorted":["cs.NI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T15:10:15Z","title_canon_sha256":"d68312077bffcf28c8ea94a1b8ec5db8a8f72e1c7947f98176a330138e9a4bea"},"schema_version":"1.0","source":{"id":"1902.10574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10574","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10574v1","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10574","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"5AQWVINSOV6B","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5AQWVINSOV6BPOBM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5AQWVINS","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f1b1e7078964d86177eb03169ddebc3975e136882f65b8ba001d6f37e0a8fb38","target":"graph","created_at":"2026-05-17T23:52:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fu-Chun Zheng, Liuyang Lu, Mehdi Bennis, Xiaohu You, Yanxiang Jiang, Zhiguo Ding","cross_cats":["cs.NI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T15:10:15Z","title":"Distributed Edge Caching via Reinforcement Learning in Fog Radio Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10574","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:394649fda771eac5cc5149e0c5d549290f33b097547826209a4cc9ac63fca6be","target":"record","created_at":"2026-05-17T23:52:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c7962e9e021db83fb14dd32ccf17cbf6019baf9e59ba4a64a839a70a0a8e5148","cross_cats_sorted":["cs.NI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T15:10:15Z","title_canon_sha256":"d68312077bffcf28c8ea94a1b8ec5db8a8f72e1c7947f98176a330138e9a4bea"},"schema_version":"1.0","source":{"id":"1902.10574","kind":"arxiv","version":1}},"canonical_sha256":"e8216aa1b2757c17b82c7094220bd268510e2393112ffcdc65b3098baa0f2197","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8216aa1b2757c17b82c7094220bd268510e2393112ffcdc65b3098baa0f2197","first_computed_at":"2026-05-17T23:52:30.488257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:30.488257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvSIyMICkTZ63pcHSpFBogSJEcZns6Ov/5xpYn1W74PI8JQDCNtZePc28mqhV1aGVc97JSQgJYG5hYjdXiGLDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:30.488725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:394649fda771eac5cc5149e0c5d549290f33b097547826209a4cc9ac63fca6be","sha256:f1b1e7078964d86177eb03169ddebc3975e136882f65b8ba001d6f37e0a8fb38"],"state_sha256":"81de19c565389af56a76b80b8303bd618e47a189914c6a33f5b66e19f0cc3298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGjlx7XM5p5oDl9kpIkBhtUcSfZDIA/gRqoqP5Jv709nRBAnCG16VjJchevStaa7YNHXfn2rWSl7mtvAApVOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:05:29.637615Z","bundle_sha256":"27e101a929f922edf453f6162438a3e46ff436d51db14cde8d8ff6fbeb79592e"}}