{"as_of":"2026-08-16T04:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24a769d2817195d63e7480759df1352fef17c946ce2792fd471a8f4f5cc793bf","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:53:25.450502Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.06570/citation-record","integrity":"/paper/1908.06570/integrity","json":"/paper/1908.06570/citation-record.json","paper":"/paper/1908.06570"},"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-14T12:53:26.434946Z","title":"Web caching us ing access statistics,","venue":null,"work_id":"4f064a9d-5f83-4ae3-bd34-709762cf3f15","year":2001},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.072419Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:c453dc3b4c88ef247d3c966b79f8aae9d1b82fcbaa665bef0c0a821e38cfac03","observation_id":"c44da996-bad2-4bb1-ac66-794c7058133c","resolution":{"observed_at":"2026-08-14T12:53:26.439116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.421893Z","title":"Fundamental limits of ca ching,","venue":null,"work_id":"56f670e8-1e37-4aaa-841d-e27d63f6ad2b","year":2014},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.112615Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:4c4f140423a21cbd935c7b82909995e9cb96a2d4f2a5281fea1df6a520aa006e","observation_id":"b59f6d40-cab6-44eb-bd1e-134f4820a6a0","resolution":{"observed_at":"2026-08-14T12:53:26.426143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.408129Z","title":"On the optimali ty of uncoded cache placement,","venue":null,"work_id":"dba4f81f-ee2c-470d-bf1f-ec8f94323d65","year":2016},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.118113Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:b0206867a3b78b192b18b0f27a12899364e7f550b82eca02b4fdd4056870a1dc","observation_id":"2b36b077-9fdf-44c8-90b9-9891993e4ba2","resolution":{"observed_at":"2026-08-14T12:53:26.412697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.392528Z","title":"The exact r atememory tradeoff for caching with uncoded prefetching,","venue":null,"work_id":"9b04e3da-7e22-44f2-bba2-664f1aa2880a","year":2017},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.122359Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:21d26eb7e632bc286276ea8a30babcabf985c788c0c49d8601bd957df4393cd2","observation_id":"75871b67-39fb-4b91-93cc-a322288cbff6","resolution":{"observed_at":"2026-08-14T12:53:26.398716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.331087Z","title":"Caching and delivery via interferen ce elimination,","venue":null,"work_id":"75d9694f-a467-49ee-b98a-69d70a5a0fc1","year":2018},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.127819Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:0afaa97c3282dba22b0ecff7fffd161d86d49ebb0f7f103d4225dba3f1768515","observation_id":"75396ed0-beb7-4ef9-aa6d-381d0877b29b","resolution":{"observed_at":"2026-08-14T12:53:26.360888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.284279Z","title":"Coded caching with nonun iform demands,","venue":null,"work_id":"86f795a0-dbdc-4bbe-b0c5-ce65ea9dc4bb","year":2017},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.132308Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:ae13e9f2aad23c1e775aae4fda208b8d5b4cbefbc1b753fe2b9b650da847aa10","observation_id":"2bf1d2fa-b94f-43b1-85e0-188bd225df2a","resolution":{"observed_at":"2026-08-14T12:53:26.300183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.235103Z","title":"Coded caching f or files with distinct file sizes,","venue":null,"work_id":"ab6d0ec1-5c8f-4c9e-98ce-a7bd82de9191","year":2015},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.138796Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:95def6c10a29865a70e465c7600f90b8e7c2be011de2dd32132963a13c1174e8","observation_id":"f6e419b8-0a2d-428e-a000-80d80dd0d073","resolution":{"observed_at":"2026-08-14T12:53:26.254721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1504.01123","last_updated":"2015-08-29T04:09:16Z","snapshot_observed_at":"2026-08-14T22:53:37.916408Z","submitted_at":"2015-04-05T13:53:57Z","title":"Coded Caching with Heterogenous Cache Sizes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1504.01123","snapshot_observed_at":"2026-08-14T12:53:25.142934Z","title":"Coded caching with het erogenous cache sizes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.142934Z"},"links":{"cited_paper":"/paper/1504.01123","citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:68475a50a0b9bc4c7605181aa4f4b68fdf337a9dfdfd2549fec4bbfd43d58509","observation_id":"a101e00e-1c3a-456c-bdba-6e1d9eab805a","resolution":{"observed_at":"2026-08-14T12:53:25.142934Z","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-14T12:53:26.207111Z","title":"Order optima l coded delivery and caching: Multiple groupcast index codi ng","venue":null,"work_id":"7e2695ff-bcda-4086-b702-52210203e4aa","year":2014},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.147856Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:90e4583e9f119e94f03d0e0fe25fad01d3e4fa66d707854b0483a769517de1b0","observation_id":"4f0cf386-0ce9-4ad2-8a39-acf1cec44c46","resolution":{"observed_at":"2026-08-14T12:53:26.211407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.194147Z","title":"Decentralized coded ca ching attains order-optimal memory-rate tradeoff,","venue":null,"work_id":"baa5ad22-87d7-4380-8d89-c1b564023010","year":2014},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.152093Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:89d6aee8f87fab800d998fe0d0e1e07cb6c09bb7cc2d9a8d5a012c92a2b576f4","observation_id":"917efc95-4b4f-4162-90cd-9f5da55acf39","resolution":{"observed_at":"2026-08-14T12:53:26.198509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.181108Z","title":"Hierarchical coded caching,","venue":null,"work_id":"23eeecb7-2543-4f96-8cdb-7a9b8e29347f","year":2014},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.156129Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:f212f6646ff5657d5926fff4a2a4a0019a5071b3e71917bfc42b64e52bc51360","observation_id":"a4c32384-b692-418f-bd9f-4f81d0a3369b","resolution":{"observed_at":"2026-08-14T12:53:26.185134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.168475Z","title":"Finite-length analysis of caching-aided coded multicasting,","venue":null,"work_id":"190d3f04-1099-400f-b2e3-6b4cb30e3665","year":2016},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.160994Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:ee290f4cf5452d2e48a66be9412272429d4a66a2d89a28c7e1b2ed3aa87c2475","observation_id":"910f8c2e-db02-44dd-ad12-c54fe0d1ab17","resolution":{"observed_at":"2026-08-14T12:53:26.172820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.01548","last_updated":"2017-10-02T07:34:07Z","snapshot_observed_at":"2026-08-15T13:52:41.317222Z","submitted_at":"2017-03-05T03:00:17Z","title":"Coded Caching Schemes with Low Rate and Subpacketizations","version":3},"cited_work":{"arxiv_id":"1703.01548","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.01548","snapshot_observed_at":"2026-08-14T12:53:25.525659Z","title":"Coded Caching Schemes with Low Rate and Subpacketizations","venue":"cs.IT","work_id":"aeba8f00-49f4-49c5-9f50-f3b7141221cb","year":2017},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.215952Z"},"links":{"cited_paper":"/paper/1703.01548","citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:898deb88a2ac68b952e88df0960daf961c967d2672b2b9b75708afcaf02e3424","observation_id":"ae9180eb-7ad1-4d3e-ad7f-c66d238b226c","resolution":{"observed_at":"2026-08-14T12:53:25.587161Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.155588Z","title":"Coded cac hing with linear subpacketization is possible using Ruzsa- Szemer´edi graphs,","venue":null,"work_id":"e1406b8f-9088-49df-b412-d2b378b709b6","year":2017},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.350952Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:e5759f45ffad1e5d0a5f4bc329853a5e794a3a5d596f75c895f70132b79e65f1","observation_id":"1acee429-7d12-45dd-9631-5c61ac46ab7f","resolution":{"observed_at":"2026-08-14T12:53:26.159730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.141053Z","title":"On the placement d elivery array design for centralized coded caching scheme,","venue":null,"work_id":"a0dcd2a4-eac1-43d6-9de3-b82554e2092b","year":2017},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.396280Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:a7ef4cb8521e273ead3a78f5f2da251a03e38a161885c5eaffdf6ee4b4241d59","observation_id":"cea01181-be00-4a96-b3e8-07f20c417e9d","resolution":{"observed_at":"2026-08-14T12:53:26.146903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.128227Z","title":"Constructions o f Coded Caching Schemes With Flexible Memory Size,","venue":null,"work_id":"01f482ab-8946-4918-adc5-9a9ded979b52","year":2019},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.401016Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:f3186e21c6c7e0f94f68af79f4311bf114c6396a2bbf94abf3cc137dbd71f9c7","observation_id":"52dd0bac-6f95-4654-b401-1959555f591a","resolution":{"observed_at":"2026-08-14T12:53:26.132640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.114294Z","title":"Centralized Coded Ca ching Schemes: A Hypergraph Theoretical Approach,","venue":null,"work_id":"bc0979c3-3444-464e-910d-305a54f5886a","year":2018},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.404980Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:852ad798d159064c7c2649c49bf87133713de8f23554915d832e05535fbae7cb","observation_id":"1af725fb-7dfb-4007-a39e-9cc16d541002","resolution":{"observed_at":"2026-08-14T12:53:26.119149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:26.083953Z","title":"Placement delive ry array design through strong edge coloring of bipartite graphs,","venue":null,"work_id":"5a21a58a-f771-4c50-9bfe-a75dbddf4f91","year":2018},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.408748Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:f0da6a4bda0537e5d74b9a9a7736d6ee8ba43a59750c7e37efba5ade7b43f16e","observation_id":"4a26377e-0484-4659-b4e7-2a83a77c08e6","resolution":{"observed_at":"2026-08-14T12:53:26.105076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.914694Z","title":"Coded caching via line graphs of bipartit e graphs,","venue":null,"work_id":"678ee38d-9d1f-45c1-8fd6-b6a8f4751b5a","year":2018},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.413214Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:fc0489a3867fa600ea6406bb61c4837c912ad5590a4df5f1356d8ccf5ba78c43","observation_id":"507d78b1-a9db-4600-ac67-3dd0e0b6e920","resolution":{"observed_at":"2026-08-14T12:53:26.014775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.862408Z","title":"Coded caching via projective geometry: A new low subpacketizatio n scheme,","venue":null,"work_id":"ca4972e9-9ec1-4ba3-a71a-7c5df583323a","year":2019},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.417448Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:e073fc5de28403dc872da0a6c654d53f1d589fa600c22b62fd10fd914437a057","observation_id":"9e12d727-13f5-4f79-a861-76a13459940a","resolution":{"observed_at":"2026-08-14T12:53:25.866840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.848753Z","title":"Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes,","venue":null,"work_id":"fd7a68f9-6794-4de8-86d8-3ef421a51bee","year":2018},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.421911Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:291bbe0d74f636a872c38f8803c8f1ee84802011e9789326c70a226070f2e248","observation_id":"27060107-d5b5-4e1d-96a2-195f909b238f","resolution":{"observed_at":"2026-08-14T12:53:25.853387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.834931Z","title":"Coded Cachin g based on Combinatorial Designs,","venue":null,"work_id":"41307e32-c137-4c8f-9c7b-251e7b2f1a3e","year":2019},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.426317Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:fb33278fa1fb5d07e497280267f582f3c9c0cf2946c1ee5c040b96622c3a9264","observation_id":"cf86d100-c15e-4905-bcfc-1ad00686d768","resolution":{"observed_at":"2026-08-14T12:53:25.839703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.817119Z","title":"A Generalized Gr ouping Scheme in Coded Caching,","venue":null,"work_id":"3cac6025-5515-457a-b35d-0083978e853d","year":2019},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.430680Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:a21365de384ccda6cca3f6cca7896a2639d353d680074d38e00a1ab874e6f1f3","observation_id":"8b121928-04c2-4747-bf29-0f93410f696f","resolution":{"observed_at":"2026-08-14T12:53:25.824892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.796549Z","title":null,"venue":null,"work_id":"498ea5dc-556b-4fc9-a749-c7b48ad7b29b","year":2007},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.435028Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:d16183fc46382aab0d206de654331391dfc87018194eeada82dac986e2815ecd","observation_id":"07333d60-38c8-4adf-b4fc-45524cd3d653","resolution":{"observed_at":"2026-08-14T12:53:25.802861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.678646Z","title":null,"venue":null,"work_id":"91048aec-1d01-47fb-a03f-2bc6acdc73aa","year":2006},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.439046Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:734329fb9e58c1b97d3d44953d7bbbb0fd3ade62447e1aebc9ed664f7e040f0f","observation_id":"6c92e6d9-59ab-4edf-b209-2d0856432b57","resolution":{"observed_at":"2026-08-14T12:53:25.682821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.664868Z","title":"Pisanski and B","venue":null,"work_id":"d9e6f899-a5ff-4f12-8894-666a652df417","year":2013},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.442678Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:a7be448e3a68d436f9ba6af29903c8822e16595c6b5fddf754045cf866908227","observation_id":"b145a92f-b5bc-45ff-be27-9df416c266ec","resolution":{"observed_at":"2026-08-14T12:53:25.668942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.649450Z","title":null,"venue":null,"work_id":"86fed8fa-2b10-4797-9f4b-076f84d1d601","year":1979},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.446272Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:35597929858afffac082ea172543e4da276d2efea594c44948250ec6cfbde0c5","observation_id":"11e23751-95cc-4b3b-8a29-06dce7799c41","resolution":{"observed_at":"2026-08-14T12:53:25.655078Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T12:53:25.636838Z","title":"Hirschfeld, Projective Geometries Over Finite Fields","venue":null,"work_id":"d259562d-8274-44cc-83e9-f90e4b67a32b","year":1998},"citing_paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:25.450502Z"},"links":{"citing_paper":"/paper/1908.06570"},"observation_digest":"sha256:424a35c3d1317120edf91138cfdca1c3da158e86e8ed3ae56fafa519721fa78b","observation_id":"bf3436dd-67a0-4ef0-bec3-5080c20c394e","resolution":{"observed_at":"2026-08-14T12:53:25.640711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06570","last_updated":"2019-10-09T07:07:11Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T02:24:31.069839Z","submitted_at":"2019-08-19T03:01:10Z","title":"Some new Constructions of Coded Caching Schemes with Reduced Subpacketization"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":28},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:1908.06570."}