{"as_of":"2026-08-08T15:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b086d0edb5a7489548013b7712d68bc8f379f93939cd23a11be867c0daf7da64","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-08T06:32:00.761636+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-07T11:55:01.659984Z","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-07T11:55:02.005262Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.05490","last_updated":"2020-06-09T20:08:09Z","snapshot_observed_at":"2026-07-06T09:27:28.721506Z","submitted_at":"2020-06-09T20:08:09Z","title":"Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation","version":1},"cited_work":{"arxiv_id":"2006.05490","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.05490","snapshot_observed_at":"2026-08-07T11:55:02.005262Z","title":"Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation","venue":"cs.DS","work_id":"d54bc496-1ebc-49f6-847a-4df696a184b1","year":2020},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.659984Z"},"links":{"cited_paper":"/paper/2006.05490","citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:f229af7a54611e7b5c3485cacf3b5a4a6a3cb2d0bf2dc533f4fe3c07d703399a","observation_id":"13936342-7c07-4707-9a5c-994189cf933a","resolution":{"observed_at":"2026-08-07T11:55:02.018121Z","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.05490/citation-record","integrity":"/paper/2006.05490/integrity","json":"/paper/2006.05490/citation-record.json","paper":"/paper/2006.05490"},"outbound":[],"paper":{"arxiv_id":"2006.05490","last_updated":"2020-06-09T20:08:09Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T09:27:28.721506Z","submitted_at":"2020-06-09T20:08:09Z","title":"Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation"},"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 1 inbound Pith citation observation for arXiv:2006.05490."}