{"as_of":"2026-08-12T19:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a9e749c4e3d951456aad7d9e8b13088745fb71343b5284847734a957b50c31ff","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-12T06:34:41.77262+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-08T17:09:39.017966Z","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-21T04:23:57.519840Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.07089","last_updated":"2021-02-14T07:27:10Z","snapshot_observed_at":"2026-08-12T01:23:13.805102Z","submitted_at":"2021-02-14T07:27:10Z","title":"Simple vertex coloring algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07089","snapshot_observed_at":"2026-08-08T17:09:39.017966Z","title":"Morris and F","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06024","last_updated":"2025-02-09T20:40:54Z","snapshot_observed_at":"2026-08-12T01:23:54.257548Z","submitted_at":"2025-02-09T20:40:54Z","title":"Improved Sublinear Algorithms for Classical and Quantum Graph Coloring","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T17:09:39.017966Z"},"links":{"cited_paper":"/paper/2102.07089","citing_paper":"/paper/2502.06024"},"observation_digest":"sha256:940c28895b829ceba9a2ca27c84db3a680b1ad555126f72bb799107c5e2c8235","observation_id":"d9946d85-fb87-4cd1-adae-562c3aa7e4c6","resolution":{"observed_at":"2026-08-08T17:09:39.017966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07089","last_updated":"2021-02-14T07:27:10Z","snapshot_observed_at":"2026-08-12T01:23:13.805102Z","submitted_at":"2021-02-14T07:27:10Z","title":"Simple vertex coloring algorithms","version":1},"cited_work":{"arxiv_id":"2102.07089","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07089","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simple vertex coloring algorithms","venue":null,"work_id":"a4914dd9-ce69-4d8e-8523-f61c752fe8c2","year":2021},"citing_paper":{"arxiv_id":"2605.21380","last_updated":"2026-05-20T16:41:18Z","snapshot_observed_at":"2026-08-11T16:48:27.594188Z","submitted_at":"2026-05-20T16:41:18Z","title":"Modeling and Resource Optimization for Quantum Oracles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T04:21:44.228594Z"},"links":{"cited_paper":"/paper/2102.07089","citing_paper":"/paper/2605.21380"},"observation_digest":"sha256:d112b563335e49c1d1a045df1a9907f35987169d1bfbc4486ddbd7d534d52460","observation_id":"cbda084c-c426-4251-861b-4b794b84d752","resolution":{"observed_at":"2026-05-21T04:23:57.521360Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.07089/citation-record","integrity":"/paper/2102.07089/integrity","json":"/paper/2102.07089/citation-record.json","paper":"/paper/2102.07089"},"outbound":[],"paper":{"arxiv_id":"2102.07089","last_updated":"2021-02-14T07:27:10Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T01:23:13.805102Z","submitted_at":"2021-02-14T07:27:10Z","title":"Simple vertex 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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2102.07089."}