{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:55:29Z","timestamp":1781974529885,"version":"3.54.5"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3578362","type":"journal-article","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:53:00Z","timestamp":1749577980000},"page":"105199-105210","source":"Crossref","is-referenced-by-count":6,"title":["Proactive Edge Caching With Popularity Prediction and Content Replication"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3436-0261","authenticated-orcid":false,"given":"\u0130lhan","family":"Demirci","sequence":"first","affiliation":[{"name":"TÜBİITAK BİLGEM, Information Technologies Institute, Kocaeli, Turkiye"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4419-556X","authenticated-orcid":false,"given":"\u00d6mer","family":"Kor\u00e7ak","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Marmara University, Marmara University, Faculty of Engineering, Istanbul, Türkiye"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.021.2200535"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2927903"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3006891"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2734646"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2941115"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3095356"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LNET.2022.3192173"},{"key":"ref8","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60438-1_15"},{"key":"ref10","first-page":"12","article-title":"Approximation schemes for 0-1 knapsack","volume-title":"Proc. 1st Symp. Simplicity Algorithms (SOSA)","volume":"61","author":"Chan"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12061310"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/BalkanCom61808.2024.10557165"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803685105"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/app7060557"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04459-7"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11029212.pdf?arnumber=11029212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:28:52Z","timestamp":1750746532000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11029212\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3578362","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}