{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:USE6FDLYKET4PZYPGNHRCPNPWI","short_pith_number":"pith:USE6FDLY","canonical_record":{"source":{"id":"1801.06449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-09T07:11:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dcf5185b6d230c060ab5697f9b497990b2d4d5c512fd0fc07d39338c81e006f3","abstract_canon_sha256":"4bd151a7767e244689a65e74a3cab951b82c7096c35e16485903f4f970187ad1"},"schema_version":"1.0"},"canonical_sha256":"a489e28d785127c7e70f334f113dafb2004418cdedb1349b4a35e90033231ed7","source":{"kind":"arxiv","id":"1801.06449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06449","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06449v2","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06449","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"USE6FDLYKET4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"USE6FDLYKET4PZYP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"USE6FDLY","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:USE6FDLYKET4PZYPGNHRCPNPWI","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-09T07:11:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dcf5185b6d230c060ab5697f9b497990b2d4d5c512fd0fc07d39338c81e006f3","abstract_canon_sha256":"4bd151a7767e244689a65e74a3cab951b82c7096c35e16485903f4f970187ad1"},"schema_version":"1.0"},"canonical_sha256":"a489e28d785127c7e70f334f113dafb2004418cdedb1349b4a35e90033231ed7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.168672Z","signature_b64":"BpJ4bsIveXSKL+2iOmCU7pK/miAzIviQItQC0p4gSNeIG+D0R33NMTHeX58bQB5Sffs2/ghsYQDwM1PSmTiTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a489e28d785127c7e70f334f113dafb2004418cdedb1349b4a35e90033231ed7","last_reissued_at":"2026-05-17T23:52:34.168247Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.168247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06449","source_version":2,"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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIiCboB7b7WfcSPifzIsLGN037TudsHQUeeeZpUX2SnGzs7GXLcNKMVWJdDrqMtxTQQoYfyQ0pEiLF/C5p64Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:28:23.720215Z"},"content_sha256":"5a0daf41a8e1e7da60d95996e332a6592adfa91096ee3b2355a37f657b65a4c6","schema_version":"1.0","event_id":"sha256:5a0daf41a8e1e7da60d95996e332a6592adfa91096ee3b2355a37f657b65a4c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:USE6FDLYKET4PZYPGNHRCPNPWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"User Preference Learning Based Edge Caching for Fog Radio Access Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Fu-Chun Zheng, Mehdi Bennis, Miaoli Ma, Xiaohu You, Yanxiang Jiang","submitted_at":"2018-01-09T07:11:35Z","abstract_excerpt":"In this paper, the edge caching problem in fog radio access network (F-RAN) is investigated. By maximizing the overall cache hit rate, the edge caching optimization problem is formulated to find the optimal policy. Content popularity in terms of time and space is considered from the perspective of regional users. We propose an online content popularity prediction algorithm by leveraging the content features and user preferences, and an offline user preference learning algorithm by using the {online gradient descent} (OGD) method and the {follow the (proximally) regularized leader} (FTRL-Proxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06449","kind":"arxiv","version":2},"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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xf5NWf5fGMLxfkzHs0nsztixfXA1QxwwIWiUTqTaX02FHFYcPqNGHiUB912j+UlRMahHaQdrBGp2+IVVRY2VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:28:23.720871Z"},"content_sha256":"aeca45ea8126bd634e03b8b51a5931b58aafe591c407ecca47c4d73297fba7fc","schema_version":"1.0","event_id":"sha256:aeca45ea8126bd634e03b8b51a5931b58aafe591c407ecca47c4d73297fba7fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USE6FDLYKET4PZYPGNHRCPNPWI/bundle.json","state_url":"https://pith.science/pith/USE6FDLYKET4PZYPGNHRCPNPWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USE6FDLYKET4PZYPGNHRCPNPWI/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-01T23:28:23Z","links":{"resolver":"https://pith.science/pith/USE6FDLYKET4PZYPGNHRCPNPWI","bundle":"https://pith.science/pith/USE6FDLYKET4PZYPGNHRCPNPWI/bundle.json","state":"https://pith.science/pith/USE6FDLYKET4PZYPGNHRCPNPWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USE6FDLYKET4PZYPGNHRCPNPWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:USE6FDLYKET4PZYPGNHRCPNPWI","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":"4bd151a7767e244689a65e74a3cab951b82c7096c35e16485903f4f970187ad1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-09T07:11:35Z","title_canon_sha256":"dcf5185b6d230c060ab5697f9b497990b2d4d5c512fd0fc07d39338c81e006f3"},"schema_version":"1.0","source":{"id":"1801.06449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06449","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06449v2","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06449","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"USE6FDLYKET4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"USE6FDLYKET4PZYP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"USE6FDLY","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:aeca45ea8126bd634e03b8b51a5931b58aafe591c407ecca47c4d73297fba7fc","target":"graph","created_at":"2026-05-17T23:52:34Z","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 edge caching problem in fog radio access network (F-RAN) is investigated. By maximizing the overall cache hit rate, the edge caching optimization problem is formulated to find the optimal policy. Content popularity in terms of time and space is considered from the perspective of regional users. We propose an online content popularity prediction algorithm by leveraging the content features and user preferences, and an offline user preference learning algorithm by using the {online gradient descent} (OGD) method and the {follow the (proximally) regularized leader} (FTRL-Proxim","authors_text":"Fu-Chun Zheng, Mehdi Bennis, Miaoli Ma, Xiaohu You, Yanxiang Jiang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-09T07:11:35Z","title":"User Preference Learning Based Edge Caching for Fog Radio Access Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06449","kind":"arxiv","version":2},"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:5a0daf41a8e1e7da60d95996e332a6592adfa91096ee3b2355a37f657b65a4c6","target":"record","created_at":"2026-05-17T23:52:34Z","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":"4bd151a7767e244689a65e74a3cab951b82c7096c35e16485903f4f970187ad1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-09T07:11:35Z","title_canon_sha256":"dcf5185b6d230c060ab5697f9b497990b2d4d5c512fd0fc07d39338c81e006f3"},"schema_version":"1.0","source":{"id":"1801.06449","kind":"arxiv","version":2}},"canonical_sha256":"a489e28d785127c7e70f334f113dafb2004418cdedb1349b4a35e90033231ed7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a489e28d785127c7e70f334f113dafb2004418cdedb1349b4a35e90033231ed7","first_computed_at":"2026-05-17T23:52:34.168247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:34.168247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BpJ4bsIveXSKL+2iOmCU7pK/miAzIviQItQC0p4gSNeIG+D0R33NMTHeX58bQB5Sffs2/ghsYQDwM1PSmTiTCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:34.168672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a0daf41a8e1e7da60d95996e332a6592adfa91096ee3b2355a37f657b65a4c6","sha256:aeca45ea8126bd634e03b8b51a5931b58aafe591c407ecca47c4d73297fba7fc"],"state_sha256":"211c4fb00a594a700805447d185ec240963c1afbc62e8240b2b59130906f17f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5GHM0LZMY51a7dLb8N8SwREEWYXIUgAck/w4E4uZxSS+jSstftTp77ZDJpJbuGeXQM9DhhpmCKehSCKk95UDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:28:23.724041Z","bundle_sha256":"d2ec8433b87da71a10793cb9aee92cb6b6642deda418402f23769248b9ec81e3"}}