{"as_of":"2026-08-06T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ad7ee1b1166484f95b1686e54b4449faa9fe29ecbd58cab06b1165adb4068e0","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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-02T01:57:54.641353Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-07-06T21:33:17.306281Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23967","snapshot_observed_at":"2026-08-02T01:57:54.641353Z","title":"Improved approximations for hard graph problems using predictions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-02T01:57:51.587602Z","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":1,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.641353Z"},"links":{"cited_paper":"/paper/2505.23967","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:4da9800958011f5e27a4150f9f1818db20d2611b1ec091cd367d693c6f7df150","observation_id":"84871680-e607-4ea7-850a-98a5b0d54fcc","resolution":{"observed_at":"2026-08-02T01:57:54.641353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.23967/citation-record","integrity":"/paper/2505.23967/integrity","json":"/paper/2505.23967/citation-record.json","paper":"/paper/2505.23967"},"outbound":[],"paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T21:33:17.306281Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2505.23967."}