{"as_of":"2026-08-08T22:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3bc0bddac8567bda063be79b1591038c12faf36f5cc93870b223d3e499662c08","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-08T06:32:00.761636+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-06T14:43:03.870747Z","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-07-10T10:27:02.353103Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.09123","last_updated":"2020-06-16T13:13:28Z","snapshot_observed_at":"2026-08-02T22:17:57.034314Z","submitted_at":"2020-06-16T13:13:28Z","title":"Algorithms with Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09123","snapshot_observed_at":"2026-08-06T14:43:03.870747Z","title":"Algorithms with predictions","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.00882","last_updated":"2025-07-24T04:23:52Z","snapshot_observed_at":"2026-08-07T12:39:13.019125Z","submitted_at":"2025-07-24T04:23:52Z","title":"Learned LSM-trees: Two Approaches Using Learned Bloom Filters","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T14:43:03.870747Z"},"links":{"cited_paper":"/paper/2006.09123","citing_paper":"/paper/2508.00882"},"observation_digest":"sha256:a665549a85a3304ce1ceccd8d029aa095bf0121c2b9d15c035633170bace3125","observation_id":"f974e7eb-8bb4-4c6e-ba2d-d7220c2a953d","resolution":{"observed_at":"2026-08-06T14:43:03.870747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09123","last_updated":"2020-06-16T13:13:28Z","snapshot_observed_at":"2026-08-02T22:17:57.034314Z","submitted_at":"2020-06-16T13:13:28Z","title":"Algorithms with Predictions","version":1},"cited_work":{"arxiv_id":"2006.09123","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.09123","snapshot_observed_at":"2026-07-10T10:27:02.353103Z","title":"Algorithms with Predictions","venue":"cs.DS","work_id":"c649ddd4-0845-4643-a593-e762e57e2d51","year":2020},"citing_paper":{"arxiv_id":"2607.08262","last_updated":"2026-07-09T09:05:59Z","snapshot_observed_at":"2026-08-08T20:01:49.465830Z","submitted_at":"2026-07-09T09:05:59Z","title":"Primal-Dual Online Algorithms for the Parking Permit Problem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-10T10:26:00.195413Z"},"links":{"cited_paper":"/paper/2006.09123","citing_paper":"/paper/2607.08262"},"observation_digest":"sha256:7af1db34531e46ca37635b55578e7f80add33e3f248d137768adf8a8871e438e","observation_id":"d147cfd7-0502-40d9-bc5a-08a29520a489","resolution":{"observed_at":"2026-07-10T10:27:02.354325Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.09123/citation-record","integrity":"/paper/2006.09123/integrity","json":"/paper/2006.09123/citation-record.json","paper":"/paper/2006.09123"},"outbound":[],"paper":{"arxiv_id":"2006.09123","last_updated":"2020-06-16T13:13:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T22:17:57.034314Z","submitted_at":"2020-06-16T13:13:28Z","title":"Algorithms with Predictions"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2006.09123."}