{"as_of":"2026-08-22T15:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d76e1ca9a7fed49b251ee7648d47ae3c15e54f30371b15555c3d0a0253f3bce","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-22T06:32:14.747728+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-16T11:14:15.902586Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T05:47:08.078851Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.03201","last_updated":"2021-03-01T01:32:48Z","snapshot_observed_at":"2026-08-14T16:08:10.816507Z","submitted_at":"2019-07-06T22:36:21Z","title":"Fast and Simple Edge-Coloring Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03201","snapshot_observed_at":"2026-08-16T11:14:15.902586Z","title":"Fast and simple edge-coloring algorithms","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2504.16470","last_updated":"2025-04-23T07:29:57Z","snapshot_observed_at":"2026-08-16T11:00:21.929236Z","submitted_at":"2025-04-23T07:29:57Z","title":"Improved Streaming Edge Coloring","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T11:14:15.902586Z"},"links":{"cited_paper":"/paper/1907.03201","citing_paper":"/paper/2504.16470"},"observation_digest":"sha256:189e6a4a97dbb0c671513d452d55b8c2e0a7aa011134ef5280892acbb3c29cc2","observation_id":"dcb6f133-c317-4e1a-80b8-b62e2412c2b9","resolution":{"observed_at":"2026-08-16T11:14:15.902586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03201","last_updated":"2021-03-01T01:32:48Z","snapshot_observed_at":"2026-08-14T16:08:10.816507Z","submitted_at":"2019-07-06T22:36:21Z","title":"Fast and Simple Edge-Coloring Algorithms","version":4},"cited_work":{"arxiv_id":"1907.03201","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.03201","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and simple edge-coloring algorithms","venue":null,"work_id":"bc6727ff-4c4d-4237-8f80-5b6167be647d","year":1907},"citing_paper":{"arxiv_id":"2507.04516","last_updated":"2026-05-05T14:40:02Z","snapshot_observed_at":"2026-08-15T05:12:23.029605Z","submitted_at":"2025-07-06T19:49:23Z","title":"The planar edge-coloring theorem of Vizing in $O(n\\log n)$ time","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T05:43:16.502919Z"},"links":{"cited_paper":"/paper/1907.03201","citing_paper":"/paper/2507.04516"},"observation_digest":"sha256:c6137cdbefa74284e5c74260f7f6102137d86a5e768b28487efaa10387eaf4cf","observation_id":"afa5a2ba-62b1-4fd2-a258-602931243857","resolution":{"observed_at":"2026-05-19T05:47:08.080860Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1907.03201/citation-record","integrity":"/paper/1907.03201/integrity","json":"/paper/1907.03201/citation-record.json","paper":"/paper/1907.03201"},"outbound":[],"paper":{"arxiv_id":"1907.03201","last_updated":"2021-03-01T01:32:48Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T16:08:10.816507Z","submitted_at":"2019-07-06T22:36:21Z","title":"Fast and Simple Edge-Coloring Algorithms"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1907.03201."}