{"as_of":"2026-08-11T09:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3ffadf6f175f1a996dc1d26ed097d7210154f3e833a9346998243115003dd82","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:00:54.274911Z","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-09T00:46:43.174532Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"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":"2408.04122","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.04122","snapshot_observed_at":"2026-08-09T00:46:43.174532Z","title":"Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms","venue":"cs.LG","work_id":"951c23db-309f-4866-84b7-e76abcd8a602","year":2024},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:42.981233Z"},"links":{"cited_paper":"/paper/2408.04122","citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:a623f3aaf955c76cd5223d52d799827e3381028dfc0ce04b8956c18e8ce42ab7","observation_id":"b566b810-5db8-4d76-90fa-65912861f3b9","resolution":{"observed_at":"2026-08-09T00:46:43.179799Z","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/2408.04122/citation-record","integrity":"/paper/2408.04122/integrity","json":"/paper/2408.04122/citation-record.json","paper":"/paper/2408.04122"},"outbound":[],"paper":{"arxiv_id":"2408.04122","last_updated":"2024-08-07T23:15:21Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.04122."}