{"as_of":"2026-08-11T05:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ba118660c4924247243133a37b998148baf3111dfd0be07a488ee33712769ce","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:00:54.330905Z","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-09T17:46:06.591491Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"2402.18263","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.18263","snapshot_observed_at":"2026-08-09T17:46:06.591491Z","title":"Max-Cut with $\\epsilon$-Accurate Predictions","venue":"cs.DS","work_id":"32337723-cf4c-4f51-9758-f682e16d2c25","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-11T04:37:34.577274Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.449371Z"},"links":{"cited_paper":"/paper/2402.18263","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:6331806d304cb471672eee2f982e5594e3f9c71761aabcb03e0becef4cbeb68a","observation_id":"07774c55-5669-48ab-a624-02999e396a0a","resolution":{"observed_at":"2026-08-09T17:46:06.595897Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-02T01:57:56.652293Z","title":"Max-cut with -accurate predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:56.652293Z"},"links":{"cited_paper":"/paper/2402.18263","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:e5fcea8034a79c40d66c062d9de73a825896529b109623e3325b96afc4169828","observation_id":"3d54b3dd-037b-47e3-a8bb-1203e1882c94","resolution":{"observed_at":"2026-08-02T01:57:56.652293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.18263/citation-record","integrity":"/paper/2402.18263/integrity","json":"/paper/2402.18263/citation-record.json","paper":"/paper/2402.18263"},"outbound":[],"paper":{"arxiv_id":"2402.18263","last_updated":"2024-02-28T11:51:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T04:37:42.292321Z","submitted_at":"2024-02-28T11:51:28Z","title":"Max-Cut with $\\epsilon$-Accurate 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.18263."}