{"as_of":"2026-08-11T14:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0744bbf3a33d217415b7802056dd682efc62cc3cb792e69f5ba2392bf41b358","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.314877Z","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.110332Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.04793","last_updated":"2024-11-17T21:13:54Z","snapshot_observed_at":"2026-08-11T13:48:37.034904Z","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:5b3e8b178123756205192bc09ba0e65cde248af8ca5b4201bd4f14e856dd9d32","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":{"arxiv_id":"2406.04793","last_updated":"2024-11-17T21:13:54Z","snapshot_observed_at":"2026-08-11T13:48:37.034904Z","submitted_at":"2024-06-07T09:40:09Z","title":"Learning-Augmented Priority Queues","version":2},"cited_work":{"arxiv_id":"2406.04793","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.04793","snapshot_observed_at":"2026-08-08T18:28:05.110332Z","title":"Learning-Augmented Priority Queues","venue":"cs.DS","work_id":"73817e5d-4370-4c1f-b287-6ae987e2e833","year":2024},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.868190Z"},"links":{"cited_paper":"/paper/2406.04793","citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:7f26005cea0b831d7e195410b38e9153a576a0bc9e997ab5b690c142266aa52c","observation_id":"28608350-6044-4dc8-94eb-d8f0c7a595fa","resolution":{"observed_at":"2026-08-08T18:28:05.115933Z","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/2406.04793/citation-record","integrity":"/paper/2406.04793/integrity","json":"/paper/2406.04793/citation-record.json","paper":"/paper/2406.04793"},"outbound":[],"paper":{"arxiv_id":"2406.04793","last_updated":"2024-11-17T21:13:54Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T13:48:37.034904Z","submitted_at":"2024-06-07T09:40:09Z","title":"Learning-Augmented Priority Queues"},"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:2406.04793."}