{"as_of":"2026-08-08T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:945bcd64a3b8421b926db17c926b2723acf30cb963ef5e548935b09b06c712c9","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T22:49:28.973633Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2607.03947/citation-record","integrity":"/paper/2607.03947/integrity","json":"/paper/2607.03947/citation-record.json","paper":"/paper/2607.03947"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"https://algorithms-with-predictions.github.io/","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:6de78c9caaab2700fc0d4d7ce41a80ef06f04504cb4ac56e3d69b5a5adae2499","observation_id":"1e0ca0c0-bbfa-4ca3-ad04-e756313b8e82","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Aho, Peter J","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:c045c4427e56b7218a6c6034a255a7271abbccb4898af2adc4ade0c049b9c51b","observation_id":"7593011c-2356-4c3a-866f-1441cf0dfae1","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Page replacement for general caching problems","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:a6125d898dc79717e49177aff45ce58e831ed5d207433908bddc05191660a685","observation_id":"c0659e03-46a6-404d-936a-13771ad04ce5","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"A primal-dual randomized algorithm for weighted paging","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:4839e2731c4e071ca01b66e69c6ae4dbc466ad09eca91c248df89e5315895be0","observation_id":"f9b66401-deca-48cf-918d-c4e68d318468","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Randomized competitive algorithms for generalized caching","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:54cbd31cfccaa0a00d667c49f1bb4b7a11bb9726a5995817c16d7612e90c0cc8","observation_id":"6877fb4b-2cdc-43ec-9b15-442febe7c259","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Learning-augmented weighted paging","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:5b231d32cb29c531782e518d8255897fe978b8f1dad80e76a3a0c3745dd98304","observation_id":"b137bc19-5688-4266-a1c2-2d55ec4b557e","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Modeling locality: A probabilistic analysis of LRU and FWF","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:aade0ff04c867732a86ff6cf7d6d29c4138222acac45cb75e1f2dde11cfa4ed3","observation_id":"b6cd1645-0a26-47c4-bbda-54048045d6ab","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:6b943d89ea5b12c9d41c6cf94c62d187746984ab4e5145230291780c22ba9fed","observation_id":"685e1471-35da-4ab4-9cd1-06ff4b4433f5","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Online Computation and Competitive Analysis","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:d29fcaa0b7f517c6804448d18c29c356a30ab9346ffd84f33a80355d1ead4ca2","observation_id":"9a350b08-cc35-45f9-b4b9-9769e0c02ca2","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Competitive paging with locality of reference","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:0b780e240caf6f96b7659a02510e76c5e2eaf9de80bea7b97b3e424eb10001f0","observation_id":"fdbf7632-688b-4428-ad00-abbea5c9d997","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"K-server via multiscale entropic regularization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:a70044ad1e0fdbd977a2c227add38d31020e1cc8d68926bce9b75c4926b9e87f","observation_id":"00a2e0d7-5c08-4f78-a91f-42219124ccd6","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Competitive analysis via regularization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:8b0223dc0dea603953e3cdadeac8552bc38a084ec40e2c6d1a713e1468a219ab","observation_id":"b1d22c28-731b-4605-93a2-f8707d888083","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"The design of competitive online algorithms via a primal--dual approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:ff191ac965ce83ddf16dbb198d591afbfb7c56dfcd23521a85ea57e746ffd669","observation_id":"92ef0349-c760-406e-8b42-16b9b534d3fe","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07198","last_updated":"2023-08-02T05:53:36Z","snapshot_observed_at":"2026-07-06T12:37:51.427037Z","submitted_at":"2022-02-15T05:12:43Z","title":"A short note on an inequality between KL and TV","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07198","snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"A short note on an inequality between KL and TV","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"cited_paper":"/paper/2202.07198","citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:350c328a7bb62da1fdb204a419fca7479d2b32327ff004a2765b5ea41fbf66d9","observation_id":"7252cb18-4b32-4a42-988b-e7b6d696fa3b","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Devanur, Kamal Jain, and Robert D","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:492669c1e77b5ceacaba4668544fe8b98d86d7e95fea44654f2e6547f4b48fec","observation_id":"a86d916e-9889-4f04-80cb-4a08253a998f","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Online generalized caching with varying weights and costs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:4a59e3b59deb9134ec5ff0d517aa5f146e2508ae798c466b912db4a1cb747480","observation_id":"abc7716d-f369-4fbf-960d-40a38ee87431","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Karp, Michael Luby, Lyle A","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:3590d82303214c30191d9604e02b9ecea06bfcdb17dbe4caa2d29920d3590231","observation_id":"e49b19a1-e779-4ee5-9fea-9d9c548ae861","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Franaszek and Terry J","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:84094a02ca830698e9441fdd900a962cb58e9ed1cb46ba5bb40df907cc666d2d","observation_id":"0ab6eeac-1c03-412b-9f8b-da31518b4735","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Elastic caching","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:0166a576bf6bb40bd5ec990cc40ca6501cb64330ce031a89ad415c0df1e97117","observation_id":"12d37837-0707-4f7f-8a71-a64102e132a4","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Caching with time windows and delays","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:740bf474cf05fc3de1bb12906ac58853dab0cfaf084bd32d59dc9191c8aa1093","observation_id":"b345656f-57de-471a-850b-0f62094bddb0","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:814c96a8745904b10b96e2e385655252e60c53e8499e48da368d0b516c91b301","observation_id":"87aaf6ac-fc33-45c5-a146-633a33332c87","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Page replacement with multi-size pages and applications to web caching","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:2a97cc4ce9b367688cf0f65cc1c43629fa85c3a2f5e7d41556d8e479f2570bb3","observation_id":"fa5f22f4-2f90-4ab5-8e98-9b73d852b7ca","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Karlin, Steven J","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:21bc7169575cf4ee2f568192c16e7f02d4e37b75eec3c4848c5933444cd9f39f","observation_id":"c425f6ff-9577-4d97-8510-ea8a01d411c1","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Papadimitriou","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:af842dc4baa3673dabaa38478a70bc092247b07778fba32954bb69dcad62286e","observation_id":"325ce947-c01b-4f0d-a661-6f59b19ee9fb","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Interleaved caching with access graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:a6a11f6ac1c9f71a41f2fb4d883c424a8ce08288c80030e40f2c0706e32131f1","observation_id":"f4259648-b527-45cd-840a-ddc25ca49738","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Phillips, and Nick Reingold","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:de1f1e8bee0ddef46e6dc7c7d8b11c19554b6cf4c8162f3503752ba5c4737b29","observation_id":"0bfb14a6-2c5b-4904-b987-e656214b8079","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:04f3b5a8fe3451da821c7d97b641972a314a71d1596a8bcbc384d48f3cd31012","observation_id":"7bfaa940-09c1-4988-9c9a-21839c7ac79f","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Randomized Algorithms","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:115dde6cd1d8a46d0da8b423e4fd4462e8e5ecae2400d2e13c3b8869838f333b","observation_id":"3a31e582-11c1-485f-9c8c-b1e5ad59b4f8","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"New and improved bounds for M arkov paging","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:1f5d2a261825425606c60a2ab468a58af0b3bdc0bf50d1ddcc3f7b01a3ddbc34","observation_id":"6844d8af-7119-465f-ae06-8768730877fc","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"On adequate performance measures for paging","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:7c6bed1511fa795f2ea144c06d714b76c254bfa63021d4d7780822f4fc47d2f0","observation_id":"985c6a4c-4100-4019-8d60-604fa6c13144","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Entropy-based bounds for online algorithms","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:bd705e7bd41b530c5a93fb83e8c97fd0b83166d2bb16d0345f37a0d1cf9b7f7e","observation_id":"635cc09a-86c7-44cf-9ce7-4e424194aea7","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Beyond the Worst-Case Analysis of Algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:dacf0692fa6c96e6dfbd5f7c9d223e2c4fe7afaa675964f430919a95f36ea0f5","observation_id":"5f82735f-5c8d-4ce3-8495-243c064b7e5f","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Sleator and Robert E","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:0364347ab6834a23408c35af47961b9bbf532ad6d5034bf20c7b60b560f79f36","observation_id":"63b73bc0-6df6-47fb-be26-9ec74cba2c51","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Stochastic Calculus and Financial Applications","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:996e1a7395030c08f2cb3576bc1d737421f75903f55b3912d4f6eb54cabc5e67","observation_id":"a33f049d-4025-4524-85d7-81b5a4c69913","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":"Probabilistic computations: Toward a unified measure of complexity (extended abstract)","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:1963d76d2eb7c986b66eae914b95e310070b34405545df25b504a1fdfa983f15","observation_id":"2e12fa52-50f4-48ef-bab5-a807b5c743b6","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:a2db8886fb660b581c7a2272491fd35147f46988ce62da7ed90821fa9c36a0d1","observation_id":"079731cd-8f45-4313-bec9-21f012403c15","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:28.973633Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:28.973633Z"},"links":{"citing_paper":"/paper/2607.03947"},"observation_digest":"sha256:ef0770413f1b2b0db9d7dfba05fd6c3d2603cc544f2eee3588d1bb431dadaad8","observation_id":"af659cbc-118d-4752-b419-2a6475466a75","resolution":{"observed_at":"2026-07-11T22:49:28.973633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03947","last_updated":"2026-07-04T16:43:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-11T22:49:24.397957Z","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.03947."}