{"as_of":"2026-08-07T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:096c6976916d4edd64988787bba8e803675b1ea06d8ce76066722cab11d34292","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-07T06:34:17.273281+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-07-11T12:12:44.455418Z","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":"1807.09898","last_updated":"2018-07-25T23:26:43Z","snapshot_observed_at":"2026-07-06T06:52:21.185384Z","submitted_at":"2018-07-25T23:26:43Z","title":"Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.09898","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1807.09898 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-07T00:28:34.694919Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1807.09898","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:241728a3212b93b7048f33957133dfd0016dd6efd415d7229b24dc7a5856aa18","observation_id":"76f17284-db1c-4631-b1e3-4d85f44bb11b","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1807.09898/citation-record","integrity":"/paper/1807.09898/integrity","json":"/paper/1807.09898/citation-record.json","paper":"/paper/1807.09898"},"outbound":[],"paper":{"arxiv_id":"1807.09898","last_updated":"2018-07-25T23:26:43Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T06:52:21.185384Z","submitted_at":"2018-07-25T23:26:43Z","title":"Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1807.09898."}