{"as_of":"2026-08-11T11:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e360c58ef32294e62638d3416666d978d2d3297d6485d5e8f60bbba85688505f","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:00:54.413170Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:28:04.874218Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T18:28:05.087085Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"cited_work":{"arxiv_id":"2501.12770","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.12770","snapshot_observed_at":"2026-08-08T18:28:05.087085Z","title":"On Tradeoffs in Learning-Augmented Algorithms","venue":"cs.DS","work_id":"44a18a2e-f5c2-4d0b-bb65-d1a1d9334466","year":2025},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-11T01:34:31.654380Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.874218Z"},"links":{"cited_paper":"/paper/2501.12770","citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:5747c9399f802dd6c8d5e0cf8aac579e70bee153d2f420be52e07f1d03ff7e8e","observation_id":"e563865a-b86c-43e6-a8ca-c967eb2a2b80","resolution":{"observed_at":"2026-08-08T18:28:05.092639Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.12770/citation-record","integrity":"/paper/2501.12770/integrity","json":"/paper/2501.12770/citation-record.json","paper":"/paper/2501.12770"},"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-10T17:00:54.882523Z","title":"Online search with a hint","venue":null,"work_id":"ec9ca066-16c7-411c-8273-e97d517c3561","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.266295Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:24b36ca328448a443a427c61de6799668b5477e60fb2183f875ac4eab42134bd","observation_id":"3188421a-e10a-41c5-ac37-621ababaea36","resolution":{"observed_at":"2026-08-10T17:00:54.886516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.05655","last_updated":"2024-04-16T09:17:45Z","snapshot_observed_at":"2026-08-11T04:38:10.908643Z","submitted_at":"2019-05-14T15:00:41Z","title":"Online Computation with Untrusted Advice","version":4},"cited_work":{"arxiv_id":"1905.05655","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.05655","snapshot_observed_at":"2026-08-10T17:00:54.520446Z","title":"Online Computation with Untrusted Advice","venue":"cs.DS","work_id":"2329a6d7-2ce4-4bd0-af7b-0f7a71674d25","year":2019},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.270603Z"},"links":{"cited_paper":"/paper/1905.05655","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:8784d1ed05761211c2f983c93226a2d55379b7759c3ae60ac623951c1cb70c99","observation_id":"e577c8fc-8bb9-4acd-a00b-df4a91475e35","resolution":{"observed_at":"2026-08-10T17:00:54.524443Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04122","last_updated":"2024-08-07T23:15:21Z","snapshot_observed_at":"2026-08-11T04:53:16.503788Z","submitted_at":"2024-08-07T23:15:21Z","title":"Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04122","snapshot_observed_at":"2026-08-10T17:00:54.274911Z","title":"Overcoming brittleness in pareto-optimal learning-augmented algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.274911Z"},"links":{"cited_paper":"/paper/2408.04122","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:bf0816191282848e22b14e85d27b20decdbe6af8d37005fbca26fad725c2c36f","observation_id":"4ad38f3c-e5d9-44bb-be80-000ecde853d4","resolution":{"observed_at":"2026-08-10T17:00:54.274911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01149","last_updated":"2024-09-04T15:27:44Z","snapshot_observed_at":"2026-08-11T04:38:17.517520Z","submitted_at":"2024-01-02T10:59:29Z","title":"Search Games with Predictions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01149","snapshot_observed_at":"2026-08-10T17:00:54.279914Z","title":"Search games with predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.279914Z"},"links":{"cited_paper":"/paper/2401.01149","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:a41bb25d678ad473f76318c9485e16e15bc640ee8c174e0334df364b14d3df56","observation_id":"64ab6155-2be9-47ce-99ec-d11bc7c2bb80","resolution":{"observed_at":"2026-08-10T17:00:54.279914Z","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-10T17:00:54.870947Z","title":"Learning-augmented dynamic power management with multiple states via new ski rental bounds","venue":null,"work_id":"342f33ac-6ff8-4d7e-89dd-e98a91cf9447","year":2021},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.284264Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:6baf971a271c8501e0e527c60bc995d0c5345d3d097cc4ad7c7aa241be86263f","observation_id":"5db2e5eb-e2c5-413e-a54f-8b995ad154ea","resolution":{"observed_at":"2026-08-10T17:00:54.874726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.859796Z","title":"Paging with succinct predictions","venue":null,"work_id":"674cb324-8373-4900-af8a-51736a2ae334","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.288111Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:32737a40887881f513fe06dd30b46f4d9db06f6f0beddbf118dc2cc0989ecf6e","observation_id":"e1b3a6b4-1efb-4515-9100-b2e88f3027f0","resolution":{"observed_at":"2026-08-10T17:00:54.863400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.849069Z","title":"Online metric algorithms with untrusted predictions","venue":null,"work_id":"812a3c71-7dc8-44e2-9847-195cb97fcbf3","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.292127Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:e4e81907c04b5b2b63365a0d3787f9ca5a75a4b862f07695f696a84b4c876caf","observation_id":"a3540bd7-2f66-4c83-8478-b5daaf8aed49","resolution":{"observed_at":"2026-08-10T17:00:54.852825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.837668Z","title":"Worst-case running times for average-case algorithms","venue":null,"work_id":"c6cb3a78-4c26-4856-aa58-57f19bab9b78","year":2009},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.295855Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:1b673754b2b3cc05d39303f51ae5ec1a8e0644f6f4642465dc5c68a89ee73bd3","observation_id":"daec2af0-e2de-4101-baa6-caf0655095a8","resolution":{"observed_at":"2026-08-10T17:00:54.841780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.826063Z","title":"Searching in the plane","venue":null,"work_id":"2e3a4898-84b4-4124-a552-7c4f8bbf9704","year":1993},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.299619Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:20af1cf6b0cca84d9c254c315ed3e5a6cfac217c34bb5f862571505151e5b032","observation_id":"1f73e043-eeac-422a-bc2d-4360d1277723","resolution":{"observed_at":"2026-08-10T17:00:54.829661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.303263Z","title":"The primal-dual method for learning augmented algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.303263Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:6b07b79610173139815f23adfc4787b39660cb99f5f0e2b94b719ffe39062990","observation_id":"1d973f4c-9dc5-4dab-baa0-21fd95598428","resolution":{"observed_at":"2026-08-10T17:00:54.303263Z","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-10T17:00:54.806765Z","title":"On the linear search problem","venue":null,"work_id":"4fbc1ae9-0921-4400-8771-08d2c4b1607c","year":1964},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.307046Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:5b42d5e795be673b407be5363acf0c6a211054e1985cfc81d945630cba176f29","observation_id":"bbf1f91b-7995-48f4-8a02-d33591da82fd","resolution":{"observed_at":"2026-08-10T17:00:54.810808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.795250Z","title":"Yet more on the linear search problem","venue":null,"work_id":"6527b1eb-9a04-4289-97f9-5072fe8e4e14","year":1970},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.311270Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:3457d78d2410846051963033284b2e7abc731a6b2b55715d802bb12462a3f475","observation_id":"f8048df4-6f47-43f9-a129-e62a8af0cd76","resolution":{"observed_at":"2026-08-10T17:00:54.798879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04793","last_updated":"2024-11-17T21:13:54Z","snapshot_observed_at":"2026-08-07T16:45:00.337460Z","submitted_at":"2024-06-07T09:40:09Z","title":"Learning-Augmented Priority Queues","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04793","snapshot_observed_at":"2026-08-10T17:00:54.314877Z","title":"Learning-augmented priority queues","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.314877Z"},"links":{"cited_paper":"/paper/2406.04793","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:abe38e03f97e971e47bad0b56bfa61a6fbc9a9f23cc8ca36f108f81401b9ad90","observation_id":"9565c5d6-e116-4879-a319-5eccb551ff89","resolution":{"observed_at":"2026-08-10T17:00:54.314877Z","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-10T17:00:54.782025Z","title":"Advice querying under budget constraint for online algorithms","venue":null,"work_id":"8e5589a8-195c-4d84-8993-2f8101c865e6","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.318542Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:f1cad4dcf27ef033641c82f44bb68e7d03e897e449c092befeb42aee9171e276","observation_id":"89801479-5638-47d5-9ae0-55540cb4b2f5","resolution":{"observed_at":"2026-08-10T17:00:54.787300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.770619Z","title":"Non-clairvoyant scheduling with partial predictions","venue":null,"work_id":"a311705d-b092-45f2-ae69-508a9ec19706","year":2024},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.321679Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:4da67efab8d0d58c4dd330817d5092be5b8c9d5557d536330334656b7af74ada","observation_id":"97cb7eee-ca33-42f9-adbf-90f13d318e51","resolution":{"observed_at":"2026-08-10T17:00:54.774294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.759662Z","title":"Robust learning-augmented caching: An experimental study","venue":null,"work_id":"f1ba3800-ec8b-4822-8be3-094fa31f48bf","year":1920},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.324817Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:c6acbbe3f51a5efb4d9e48aae524209bb87da84e5573d1aef7c8df8c51c1937f","observation_id":"568fa644-be05-4df7-b25e-7e63f02ede80","resolution":{"observed_at":"2026-08-10T17:00:54.763618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.749217Z","title":"Average case-worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model","venue":null,"work_id":"fa2cb248-fe8a-499d-a5c7-dbc9d9e89363","year":2018},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.327869Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:9a96d13b53f10a11493dd5dec8fef697442f279489d613994ca1e45825a668f4","observation_id":"a284a7ec-d80b-4c6f-bbdd-53eadfb5d605","resolution":{"observed_at":"2026-08-10T17:00:54.752548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18263","last_updated":"2024-02-28T11:51:28Z","snapshot_observed_at":"2026-08-11T04:37:42.292321Z","submitted_at":"2024-02-28T11:51:28Z","title":"Max-Cut with $\\epsilon$-Accurate Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18263","snapshot_observed_at":"2026-08-10T17:00:54.330905Z","title":"Max-cut with -accurate predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.330905Z"},"links":{"cited_paper":"/paper/2402.18263","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:42e7f1d4d64c09585e3c6f3b094f27b715eceb6c23471880149c6e58c98b4a83","observation_id":"43753dbb-50ed-4f5f-8283-d41a19f77d46","resolution":{"observed_at":"2026-08-10T17:00:54.330905Z","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-10T17:00:54.738937Z","title":"Learning online algorithms with distributional advice","venue":null,"work_id":"e8e17d05-ad41-4578-943e-0f3da4be4056","year":2021},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.334208Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:9ebd671d0b044f8cfefbb97c63d5950a897057c23377f19db399889bc194b02d","observation_id":"5a22634e-e4f1-48ba-b1d9-8a43dd94e135","resolution":{"observed_at":"2026-08-10T17:00:54.742234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.729364Z","title":"Secretaries with advice","venue":null,"work_id":"1f42da5d-d25b-46b4-b4ee-0bab3ed72f48","year":2021},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.337706Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:3642371d42c1ba3ac597c7d17c3b6a4edf8c02cf7341f88f288c08f6857f8af6","observation_id":"bb2ebd5a-082a-4010-80e9-ccc3ef75b33d","resolution":{"observed_at":"2026-08-10T17:00:54.732458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.718924Z","title":"Optimal search and one-way trading online algorithms","venue":null,"work_id":"7184d7b8-331a-4319-b5c0-41513b8a3c79","year":2001},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.340792Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:cf3a46875baf67e6e649d8a73a3e09911fba7fc84e7f418aef76ae9c1785a238","observation_id":"48204db1-ac1f-4a7b-acb7-b08fd3c7c76d","resolution":{"observed_at":"2026-08-10T17:00:54.722807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.707367Z","title":"Online algorithms for rent-or-buy with expert advice","venue":null,"work_id":"d4f1166c-23c6-4925-b8ea-bf0e96f6b75c","year":2019},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.344342Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:72491ef1ba68784c755380dd3af517f6fdce5859b1a10f1b9980404984dcc49f","observation_id":"4658fd18-b468-46a7-9b9a-326db6f48a68","resolution":{"observed_at":"2026-08-10T17:00:54.711419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.695272Z","title":"Augmenting online algorithms with -accurate predictions","venue":null,"work_id":"03ad80f3-54ff-4df4-aefd-4903c69262ea","year":2022},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.347550Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:fbcfba502d4dd6325a227d99faf1fcbe5d4738ba4ba7f1f77a97a028d5ccbdf0","observation_id":"a92587eb-6be2-4799-b5e1-2974bff1c8c0","resolution":{"observed_at":"2026-08-10T17:00:54.699260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.16771","last_updated":"2023-09-10T16:09:28Z","snapshot_observed_at":"2026-08-10T11:23:53.682411Z","submitted_at":"2023-07-31T15:38:22Z","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.16771","snapshot_observed_at":"2026-08-10T17:00:54.350660Z","title":"On the complexity of algorithms with predictions for dynamic graph problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.350660Z"},"links":{"cited_paper":"/paper/2307.16771","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:3b3a4bea215fbba28768d09dcd40cf8285718362b619970af518b4566889ec73","observation_id":"99f85a72-f56d-4582-af83-84e4d8ed221d","resolution":{"observed_at":"2026-08-10T17:00:54.350660Z","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-10T17:00:54.683771Z","title":"Competitive snoopy caching","venue":null,"work_id":"3b4731c3-42dc-428b-b6f4-87529ed84787","year":1988},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.354150Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:64b76d97cf14215579c7fcbddc5b0c530982e712baf64e691bf2f26d9a06d070","observation_id":"494262d0-35b8-47ff-8916-b7481ab2ff94","resolution":{"observed_at":"2026-08-10T17:00:54.687485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.673178Z","title":"Karlin, Mark S","venue":null,"work_id":"2568b5d1-38db-4a1b-b4f9-876e0c073dab","year":1994},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.358252Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:ed5820f067b309f9a9171404f7c1bb97659d3af5bb0eb1aa42e6b8d30c1cc695","observation_id":"77855376-6ec1-4e2e-87be-6ea07a4e41f4","resolution":{"observed_at":"2026-08-10T17:00:54.676781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.662010Z","title":"The case for learned index structures","venue":null,"work_id":"97563d8e-a0e3-4761-9a0b-00e1e988a10f","year":2018},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.362015Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:86c6871b76b1a75c4a805e8c2e313ae16c600c760656ef83804ea850d7f9ca83","observation_id":"df8dd691-6ca5-47df-b026-ffc8d3b79e8e","resolution":{"observed_at":"2026-08-10T17:00:54.666014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.650979Z","title":"Minimalistic predictions to schedule jobs with online precedence constraints","venue":null,"work_id":"30afabe8-f8bd-459d-941d-75ad0b7651bc","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.365264Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:f7d07bceba349a6577e5dc4481e5779abdb5f5fb35a46982bc6cc9d07a85e8c4","observation_id":"c4577b1e-6512-4906-b3fc-7eff9516e902","resolution":{"observed_at":"2026-08-10T17:00:54.654716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.368645Z","title":"Learning augmented binary search trees","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.368645Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:f14e93cd3e5d9b6744dce1ed7a8b79acff4592971a5fd41ae74881636f3395e6","observation_id":"1d3d3d57-70f3-402d-bea1-70852e70ac1b","resolution":{"observed_at":"2026-08-10T17:00:54.368645Z","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-08-10T17:00:54.371759Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.371759Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:d8290403ddc6101befb5f65d2afb9b1559cfef869ddb78e325085f0d1f32e6be","observation_id":"70bdc514-add1-4b5f-ad03-2d2e754feaa9","resolution":{"observed_at":"2026-08-10T17:00:54.371759Z","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-10T17:00:54.626019Z","title":"On preemption and learning in stochastic scheduling","venue":null,"work_id":"80331da2-dca3-4ef8-b6f3-92375ce84ba8","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.375222Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:f6520fe991ffb1bed0d80cdeea81cc3f0622a4a47e7d281931980412191fe679","observation_id":"e671556b-194c-4065-968d-9cf66df290f2","resolution":{"observed_at":"2026-08-10T17:00:54.629827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.614128Z","title":"Lattices that admit logarithmic worst-case to average-case connection factors","venue":null,"work_id":"ea407367-d903-4627-8ce8-6403b46f2ff9","year":2007},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.378746Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:6bf6a8bdb7765e4bb353cde3b402f4f9888ee7fbab6c3a7d081a3a9c0a61ec53","observation_id":"586c8ec0-fef8-4859-937d-c1cad5e9f9e6","resolution":{"observed_at":"2026-08-10T17:00:54.618538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.602521Z","title":"Improving online algorithms via ml predictions","venue":null,"work_id":"221a760b-20f2-4396-9828-47d1675c7b3a","year":2018},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.382320Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:faf5ed3fd1eeef0c055bc65e6f29edabd7dd361494e6dc5e45dee6d7387c680b","observation_id":"0b87deff-f4a3-408f-bba5-f96bb5dfe2fa","resolution":{"observed_at":"2026-08-10T17:00:54.606392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.591929Z","title":"Robustness between the worst and average case","venue":null,"work_id":"4b517ee6-31bd-465d-9c4a-b5aef59b29a1","year":2021},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.386056Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:3240e192aa012ec8d510ee5649f4949645e45d30a21834290fce996d8c2ff92b","observation_id":"06e26e22-c429-4039-8e0d-b688a16f3ec9","resolution":{"observed_at":"2026-08-10T17:00:54.595347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.389482Z","title":"Probabilistically robust learning: Balancing average and worst-case performance","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.389482Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:b2373d6d25435c9f79881c0b55f67bacf05c4d22aeeca3af60c48bf51a0c4eb7","observation_id":"7603d4fd-330c-4ce4-b58a-97279f2a7ffe","resolution":{"observed_at":"2026-08-10T17:00:54.389482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06832","last_updated":"2023-02-14T05:05:03Z","snapshot_observed_at":"2026-07-06T14:51:33.651976Z","submitted_at":"2023-02-14T05:05:03Z","title":"Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis","version":1},"cited_work":{"arxiv_id":"2302.06832","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.06832","snapshot_observed_at":"2026-08-10T17:00:54.444945Z","title":"Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis","venue":"cs.DS","work_id":"c0b8ebb7-d55e-417e-9651-51ccc0ca7a40","year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.393177Z"},"links":{"cited_paper":"/paper/2302.06832","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:8639d6f67b6ae6863b1fb500c16cdf521460c5bcc4d405cc9b0225b87a0d375c","observation_id":"7985bb6f-044c-4976-9715-2d99cfe6a8f7","resolution":{"observed_at":"2026-08-10T17:00:54.453041Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.574795Z","title":"Pareto-optimal learning-augmented algorithms for online conversion problems","venue":null,"work_id":"bfeaf005-bb83-4c43-ad7e-ed51649234cb","year":2021},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.396929Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:ba960bb1490fee060b1d2abd3dab64b52b6b8788083d84eab0597bf15bd41fd9","observation_id":"e39e9db3-b010-47cf-9201-bbd96ba4cecf","resolution":{"observed_at":"2026-08-10T17:00:54.578211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.564388Z","title":"Worst-case versus average case complexity of ray-shooting","venue":null,"work_id":"d1d6d168-581c-4712-b741-6591755cd26b","year":1998},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.400557Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:e098cdaf0bd88d14d0337edbc02394a8744ad64638852180bc904f78837e1dfc","observation_id":"283cb126-798e-4753-b057-055fee2deee3","resolution":{"observed_at":"2026-08-10T17:00:54.567966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.553593Z","title":"Optimal robustness-consistency trade-offs for learning-augmented online algorithms","venue":null,"work_id":"cca58e7a-a1c1-4ff0-bdff-6532b77c506e","year":2020},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.404893Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:35159b91d9d18eaf938d43804e39d26f4e560eb4602522aaa0a84dce7a4c9570","observation_id":"d52f71ab-3015-4b8d-944c-f8494e0e7c26","resolution":{"observed_at":"2026-08-10T17:00:54.557432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.542530Z","title":"Worst-case and average-case approximations by simple randomized search heuristics","venue":null,"work_id":"f4ab1b07-66dc-468c-b7cd-c37226812727","year":2005},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.408854Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:7058b81bdfa23fc753e1f22c8c4c8acee38018f762360628c344e28299006667","observation_id":"960729a4-246b-4aa2-beaf-d1e6e9ce7765","resolution":{"observed_at":"2026-08-10T17:00:54.546299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T17:00:54.531847Z","title":"Robust learning-augmented dictionaries","venue":null,"work_id":"0d792d4a-4a20-4466-9abd-09828f5c59e9","year":null},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.413170Z"},"links":{"citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:0b31c3f898d10489e2bd5caaadc74be9aa35237f1a8b8e16f6f1f66a3b8dc4ed","observation_id":"566bc94a-4281-449e-879c-9657cc2b2953","resolution":{"observed_at":"2026-08-10T17:00:54.535291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":30},"total_outbound_references":41},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 1 inbound Pith citation observation for arXiv:2501.12770."}