{"as_of":"2026-08-19T07:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54c9fcadab1e6aeb42b06d784ead3bbb00904c58c6533b73e280e2cff629f628","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:46:38.909136Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.10821/citation-record","integrity":"/paper/1908.10821/integrity","json":"/paper/1908.10821/citation-record.json","paper":"/paper/1908.10821"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.305376Z","title":"Living on the edge: The role of proactive caching in 5g wireless networks,","venue":null,"work_id":"8ae4cd13-bb07-49fc-bc5b-8b5f571e7a35","year":2014},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.785106Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:0e0b8f88eaeecb518e14a867c48b1d9a43a93bbcbbdcf2c3450c11b71a240d6d","observation_id":"b722bbb0-22dd-424c-9e0c-0e623680c6c7","resolution":{"observed_at":"2026-08-14T10:46:39.309067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.295273Z","title":"Fundamental limits of caching,","venue":null,"work_id":"35c27017-5249-402a-8fd3-31a767910bc5","year":2014},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.789465Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:e6889400d34ce09c3fa1b8981290f4164f2624d687a85b54e5e45222409edc52","observation_id":"13220df3-8c5d-4342-a98f-ccfb04524889","resolution":{"observed_at":"2026-08-14T10:46:39.298839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.285125Z","title":"On the optimality of uncoded cache placement,","venue":null,"work_id":"2be8cc07-c48c-4638-a2b5-95bc0e75b8e8","year":2016},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.793112Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:74051cabc82abe9e2792cd1b7342988ffe80948bd4cf7298aa74a74bbae48624","observation_id":"1180af3b-50ef-42fe-bfb3-7b2b7dede4dd","resolution":{"observed_at":"2026-08-14T10:46:39.288741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.274839Z","title":"Characterizing the rate-memory tradeoff in cache networks within a factor of 2,","venue":null,"work_id":"b4506a10-6e5c-4bbc-baf6-df0510f87aeb","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.797145Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:b98b7adc00ba1bbb7a3d68317773f86848281481aea6d128e7de68ade0fb48f4","observation_id":"fd5800c3-35ca-4326-b794-b498cc8045a2","resolution":{"observed_at":"2026-08-14T10:46:39.278462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.264630Z","title":"Improved lower bounds for coded caching,","venue":null,"work_id":"f91b1cf9-899b-42a9-a715-095f61e52076","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.800966Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:800b76e2df067a97ba175214ab65ac75aa3b569ba1a6f3cf153728710cd5d490","observation_id":"c8ab89f3-d435-40db-8e69-88e35da5920f","resolution":{"observed_at":"2026-08-14T10:46:39.268237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.254333Z","title":"The exact rate-memory tradeoff for caching with uncoded prefetching,","venue":null,"work_id":"536039e5-ee47-4031-9b74-d35d30cae22d","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.805052Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:cf7b6945fc463c979ace5438b9ba83d01292d99ab0e86fdad63558015ad6e57d","observation_id":"ee8fa231-bffd-4855-ae61-550c93f3daff","resolution":{"observed_at":"2026-08-14T10:46:39.258178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.243952Z","title":"Caching-aided coded multicasting with multiple random requests,","venue":null,"work_id":"bb0c3680-3da7-426a-bcc5-b18973700d50","year":2015},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.810004Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:d876c5cb2c1ae4f3107a390a20c51553eb2b5b0338fa7b1f2606aa9a835aaeee","observation_id":"ab1775b0-d0c4-47de-92b4-5aed6df029da","resolution":{"observed_at":"2026-08-14T10:46:39.247779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.233428Z","title":"Improved approximation of storage-rate tradeoff for caching with multiple demands,","venue":null,"work_id":"7c3a82b2-d173-461e-938d-fc2e60529ee0","year":1940},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.813698Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:0823c7f78868fef99e905c2bf7cfed2dbe4a242d193c9f2ee1f266a571306be5","observation_id":"c418df14-c7da-4e57-8397-fed86f87820a","resolution":{"observed_at":"2026-08-14T10:46:39.237232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.223052Z","title":"Decentralized coded caching attains order-optimal memory-rate tradeoff,","venue":null,"work_id":"85effb02-3064-4a02-85a3-d27a9003028e","year":2015},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.817259Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:65199fc08093fc3e1463799f5845040d7e20a626e1c8197cf40ae49feee7cb70","observation_id":"2f439587-d209-44ce-97be-89a631e2eaae","resolution":{"observed_at":"2026-08-14T10:46:39.226707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.213102Z","title":"Fundamental limits of caching in wireless d2d networks,","venue":null,"work_id":"1907720b-afb1-42e0-bb22-997f8025b386","year":2016},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.820779Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:4deff7a7b1c816e11c540396ce096fbedc5c9cc1b4220aff1248a46692fed507","observation_id":"5c5d0c69-9dbc-4c85-92e2-532ddaa23776","resolution":{"observed_at":"2026-08-14T10:46:39.216639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.201210Z","title":"Multi-server coded caching,","venue":null,"work_id":"e0733c9a-7ca1-4335-9f76-0f1df7047475","year":2016},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.824247Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:7e0d33a28135b81946b429a42831e019f3bd9480d70a7df8c4c3cbd50f730630","observation_id":"296e4d0d-ea82-4c76-b0c0-d9093ee114d0","resolution":{"observed_at":"2026-08-14T10:46:39.205456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.190106Z","title":"Caching in combination networks,","venue":null,"work_id":"8625eba5-330c-43c5-9529-681b9fd98efb","year":2015},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.828123Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:f8fcf43bc4b0e0a8dccbdf77553b8b5462807395ce4b08cbb8324fde0fdadad7","observation_id":"6c56ba94-6fc2-4419-b50d-7c243b49b4c4","resolution":{"observed_at":"2026-08-14T10:46:39.193554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.179136Z","title":"Caching in combination networks: Novel multicast message generation and delivery by leveraging the network topology,","venue":null,"work_id":"1d9e090f-ed11-4fea-8ea5-49b7639df919","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.831651Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:001d291e178cd7592be625f90786d8ffc3cd3ab0dbbfc01e5310ba02a03fd84e","observation_id":"6c9c0860-4bbe-417d-92b8-2f2e26971e08","resolution":{"observed_at":"2026-08-14T10:46:39.182912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.168468Z","title":"Fundamental limits of caching with secure delivery,","venue":null,"work_id":"4ff897d4-9d50-4018-a0f4-f147aa897175","year":2015},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.835143Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:7883943027a25da00c974a3e55118c6438974c57268dcc6f7cd6fa06e071bc16","observation_id":"70366603-7654-4061-a7b5-8232f1b70044","resolution":{"observed_at":"2026-08-14T10:46:39.172471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.157752Z","title":"Towards the exact rate-memory trade-off for uncoded caching with secure delivery,","venue":null,"work_id":"9451071f-bada-4a57-a0bb-1bdcf5e369ea","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.838382Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:d38a0912f39b1a7dbb51cf5360cce0bdac7937aefe53c8b5ccc96d8e11313f8d","observation_id":"247ead4f-a266-4585-8977-90d87f435d09","resolution":{"observed_at":"2026-08-14T10:46:39.161666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.147162Z","title":"Private coded caching,","venue":null,"work_id":"58c571f4-1baf-4b10-9e1f-35288c90ddad","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.841755Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:77791b0b56eb9476c103cb5650d7cb82613d5bc94fc8a05214f7f3cf2adaaf58","observation_id":"a8b9f6df-0a69-4a84-873d-a8a995ff8a56","resolution":{"observed_at":"2026-08-14T10:46:39.150751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:38.845200Z","title":"How to share a secret,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.845200Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:06620bc2713ac6f8d98a6cebb1d0e3301212140ca220e1236d9e7ad1715523fe","observation_id":"f2d3cf6f-a7e3-4388-93d6-cc0c03d43521","resolution":{"observed_at":"2026-08-14T10:46:38.845200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.06844","last_updated":"2019-05-02T21:53:15Z","snapshot_observed_at":"2026-08-14T18:26:45.637130Z","submitted_at":"2018-09-18T17:53:14Z","title":"Device-to-Device Secure Coded Caching","version":2},"cited_work":{"arxiv_id":"1809.06844","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.06844","snapshot_observed_at":"2026-08-14T10:46:39.006925Z","title":"Device-to-Device Secure Coded Caching","venue":"cs.IT","work_id":"7955ee25-7ed4-41c4-a051-7b2db9fc3cb1","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.848615Z"},"links":{"cited_paper":"/paper/1809.06844","citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:91f6b8b86ecd8f4ea9a29dd8eb6e6902880276d42b252eb27f75b6df831efbb4","observation_id":"de991c1e-60e4-432b-845b-a553ab55012f","resolution":{"observed_at":"2026-08-14T10:46:39.011728Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.130339Z","title":"Bounds on caching d2d networks with secure delivery,","venue":null,"work_id":"4743e2c9-9abe-47c1-80b3-2fd1f5cdbc76","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.852532Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:9a2eed71c2eb51dc86037da0f5b56cef50ffdb0e8d1988024b9742acbfe331c2","observation_id":"58ed3fd6-f3f8-4085-908d-92ba2893ff01","resolution":{"observed_at":"2026-08-14T10:46:39.134189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.119523Z","title":"Combination networks with or without secrecy constraints: The impact of caching relays,","venue":null,"work_id":"dd228b4f-7e90-47f4-9532-b40ee304a612","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.856004Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:9976d5ccb064656f24f0182be2d6ccf5baa8359fe8ee22faba675b4ec7bd64ec","observation_id":"2c42eb82-928e-45ed-a8b3-6a23b0609fba","resolution":{"observed_at":"2026-08-14T10:46:39.123359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.109136Z","title":"Secrecy capacity-memory tradeoff of erasure broadcast channels,","venue":null,"work_id":"fe7a2790-a84d-4624-9a78-01c61751900f","year":2019},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.859378Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:7e8ac45632b180ca1e344bf5a4477edb50a4666affcef403144b06544cfdad2d","observation_id":"813fdf39-72b0-4858-9a74-fe07826f520c","resolution":{"observed_at":"2026-08-14T10:46:39.112850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.098789Z","title":"A content-delivery protocol, exploiting the privacy benefits of coded caching,","venue":null,"work_id":"b3c2aa3f-3183-4f06-a31b-9edeb099df7a","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.862916Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:b7ef69542be5f094d36e629a782288804a5d3bef98fd58d74c6977df97fd2f9f","observation_id":"51c1880c-8be9-4d19-8ad0-a0a5911c0dd2","resolution":{"observed_at":"2026-08-14T10:46:39.102562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.088414Z","title":"Private information retrieval,","venue":null,"work_id":"e916a52e-0540-4947-81e2-df381029ee49","year":1995},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.866317Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:4f7fa44e73ec0c5377198fc53bddb04ffec883139564f2a0332df334d13010ed","observation_id":"e9709be4-4e15-4a66-a4a5-4a15fbb51e22","resolution":{"observed_at":"2026-08-14T10:46:39.092148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.077577Z","title":"The capacity of private information retrieval,","venue":null,"work_id":"0c22445a-e89f-496e-bb01-9f04f2dd9d66","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.869506Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:1ff1519f4da0a0854a7d56e6c1d387a699e20d33b0fa065b5fb3a1cff4ef0a9e","observation_id":"8084b84a-acfe-422d-8c52-0ac1531b2799","resolution":{"observed_at":"2026-08-14T10:46:39.081223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03022","last_updated":"2019-05-31T17:13:37Z","snapshot_observed_at":"2026-08-18T20:31:30.799213Z","submitted_at":"2017-09-10T00:49:08Z","title":"The Capacity of $T$-Private Information Retrieval with Private Side Information","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03022","snapshot_observed_at":"2026-08-14T10:46:38.872834Z","title":"The capacity of private information retrieval with private side information,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.872834Z"},"links":{"cited_paper":"/paper/1709.03022","citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:73e008aa31fc74d6237249b7c3d72c253e1e1be726a637bb2e940af82b94ad33","observation_id":"016e3ade-5b73-4e8f-bc2a-3f8431a34e0c","resolution":{"observed_at":"2026-08-14T10:46:38.872834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.065461Z","title":"Single-server multi-user private information retrieval with side information,","venue":null,"work_id":"7ed92df0-132c-4876-b6ac-2d8e82321db6","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.876666Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:7e0fc0e1915a3136bd6f3ddbeb4478eab8e2b76d0dc199eedd5c8b10d1bd7bfb","observation_id":"a122657f-cbf8-461b-a4f2-25357ca9dc45","resolution":{"observed_at":"2026-08-14T10:46:39.069583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.054260Z","title":"The capacity of cache aided private information retrieval,","venue":null,"work_id":"8c3f761c-e052-453a-9589-b2165c5c5c6c","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.881286Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:37581724020f423874f90f2ccfae65092da62ab818fc749312b6f3b7865be6ae","observation_id":"545bfac7-f95b-4d76-a0fa-4ab092a6e91c","resolution":{"observed_at":"2026-08-14T10:46:39.058220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.07021","last_updated":"2017-12-18T18:50:42Z","snapshot_observed_at":"2026-08-14T20:02:28.859914Z","submitted_at":"2017-12-18T18:50:42Z","title":"Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits","version":1},"cited_work":{"arxiv_id":"1712.07021","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.07021","snapshot_observed_at":"2026-08-14T10:46:38.981693Z","title":"Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits","venue":"cs.IT","work_id":"df19389d-2d4d-4475-823b-8dad95b4f51b","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.885119Z"},"links":{"cited_paper":"/paper/1712.07021","citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:26c856fc7e1ade8fa923a25cb1150dbfd6fd510711bda6594c434af6f77fc980","observation_id":"4471bfb5-36ce-4520-8035-e405fe7a54b2","resolution":{"observed_at":"2026-08-14T10:46:38.985829Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01056","last_updated":"2017-09-04T17:50:27Z","snapshot_observed_at":"2026-08-14T20:36:17.689425Z","submitted_at":"2017-09-04T17:50:27Z","title":"Fundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching","version":1},"cited_work":{"arxiv_id":"1709.01056","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01056","snapshot_observed_at":"2026-08-14T10:46:38.966441Z","title":"Fundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching","venue":"cs.IT","work_id":"b57356ba-13ad-4a2d-8b9b-a4c60a2231c5","year":2017},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.889377Z"},"links":{"cited_paper":"/paper/1709.01056","citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:0e1c8264fbc1647ec2f3f17d40a13e1126fd4b8d72459a2e5ee104ab075bb7e8","observation_id":"96c576e1-3185-4749-9a97-4ca84a7e3709","resolution":{"observed_at":"2026-08-14T10:46:38.970985Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.04104","last_updated":"2018-10-23T18:49:17Z","snapshot_observed_at":"2026-08-14T19:16:40.929293Z","submitted_at":"2018-05-10T17:59:39Z","title":"The Capacity of Private Information Retrieval from Uncoded Storage Constrained Databases","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.04104","snapshot_observed_at":"2026-08-14T10:46:38.893417Z","title":"The capacity of private information retrieval from uncoded storage constrained databases,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.893417Z"},"links":{"cited_paper":"/paper/1805.04104","citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:bebf0279d88cfb188b2a0ee04ad232c43304fe6a2fffb5b4fd779a22707dc66c","observation_id":"14ae5d20-336d-4d6e-a5bb-d4a7d7bdd4a8","resolution":{"observed_at":"2026-08-14T10:46:38.893417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.043232Z","title":"The capacity of private computation,","venue":null,"work_id":"374d6048-bbd1-4880-b980-7cbeef1d6283","year":2019},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.898383Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:0f974b4461778ddb2624531ec430c8f62882024c48882c484608ff9995c3372e","observation_id":"f1541c9b-085c-4535-851e-ddac7de51321","resolution":{"observed_at":"2026-08-14T10:46:39.046929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.031532Z","title":null,"venue":null,"work_id":"e5e4a6a4-e0eb-42db-82ba-2f8ed19f6cba","year":2011},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.901779Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:4cafa702593e4e21eb42ffc1b5117a305eeb700f1d2155dc009177dd780502e7","observation_id":"9b5218b7-181d-4b77-85ed-82d0c460d33b","resolution":{"observed_at":"2026-08-14T10:46:39.035840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05498","last_updated":"2019-05-23T20:41:35Z","snapshot_observed_at":"2026-08-14T17:59:47.876664Z","submitted_at":"2018-11-13T19:09:08Z","title":"On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications","version":2},"cited_work":{"arxiv_id":"1811.05498","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.05498","snapshot_observed_at":"2026-08-14T10:46:38.938431Z","title":"On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications","venue":"cs.IT","work_id":"eeda336e-294a-4c77-9ef0-0db0d100fd33","year":2018},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.905195Z"},"links":{"cited_paper":"/paper/1811.05498","citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:a10936e899af4be5b933a0881da7261f5aa8cdbd16e4bc72dc8437eaad398265","observation_id":"0531b4ee-0b8e-4ea0-8b33-a4f836617fb4","resolution":{"observed_at":"2026-08-14T10:46:38.944438Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:46:39.019743Z","title":"On caching with more users than files,","venue":null,"work_id":"10b66005-8218-4ab3-9685-0364a6e6f3dd","year":2016},"citing_paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T10:46:38.909136Z"},"links":{"citing_paper":"/paper/1908.10821"},"observation_digest":"sha256:44007189886305aeb1a934cb12f78a1db3cb362032c7cb4c9e3ee6dbf5a57de7","observation_id":"4a7853bc-1313-4749-a8b7-83e9cd53c242","resolution":{"observed_at":"2026-08-14T10:46:39.023682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.10821","last_updated":"2020-06-19T13:49:12Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T00:52:05.856238Z","submitted_at":"2019-08-28T16:45:22Z","title":"On Coded Caching with Private Demands"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":4,"verified_fuzzy":26},"total_outbound_references":34},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:1908.10821."}