{"as_of":"2026-08-04T07:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c79a9441c3d1137104c4796c6bb105a4122262c550a440dc99b40e1a1792efd","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T00:28:28.815428Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2606.06216/citation-record","integrity":"/paper/2606.06216/integrity","json":"/paper/2606.06216/citation-record.json","paper":"/paper/2606.06216"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Coloringsandorientationsofgraphs.Combinatorica, 12(2):125–134, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:42f150c35e0549b44548c295a5699b08411e5739a7efe86d8b1955b131ac86c4","observation_id":"72795258-ef37-4782-bb00-159e3f629f4c","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Cranston, Anja Pruchnewski, Zsolt Tuza, and Margit Voigt","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:f5e79e8feb541737017b75ccbff7324e8285e13d086c8efa821a3b75d6e2a213","observation_id":"18b6b75a-d76c-4782-8af6-397e8962cfe4","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Degree-truncated Alon-Tarsi number of outerplanar graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:f63fb79fb8c05ad97fec9d9865df4ed655600ddfd51ebd7ceae2040d59c7c0d8","observation_id":"d7a8c0f5-699b-4c65-b7ea-83f25452b72d","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8.J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:e1d2e2d211d25ff9589f59695c7f7fa2dbde0e6e99cf4ca68580fdf6d51c9c9b","observation_id":"43b37408-5025-4840-8a0d-f9c4ccfcabf8","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Rubin, and Herbert Taylor","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:0c19ba1b710c5eb491a79bdc58b4baa7763eaeae35fd4ad600c42d2793f19bc7","observation_id":"94e7efc7-193d-4429-92a8-c0c3bc9dce2f","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Hutchinson","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:947a09eb3757d900f6927cf00a498980119939969dd22ed7c47b1c1f851162be","observation_id":"a4c85a3a-dc94-417f-b387-4cbb880f5b9e","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Degree-truncated choice number of planar graphs.Discrete Math., 349(7):Paper No","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:f54bbe1a48caf6bef5a1df125aec36de3bddfca9bc22cecea7612bcab0644746","observation_id":"c5a241d1-794d-421f-890a-deb64fafa4f1","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Degree-truncated DP- colourability ofK 2,4-minor-free graphs.European J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:4047bfbf9d8b289ceb6b0ae667c57c8d773414cf81e7b67b9493a670b1e74a6e","observation_id":"76adafe5-c4f9-42a2-b87c-09a149b60d6b","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Every planar graph is5-choosable.J","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:9c52ad91bbad2f1b99d3b0cf2afd504efac0bea11b165b2646e47d3104a2f59e","observation_id":"53650fe4-3fcf-40ec-b5a8-7b0595b6d79a","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:7b1ce4580dadd03d5eed0eabda05bc2cdf075c88da0d1f2cd205015efff369ec","observation_id":"c575e878-ffec-41b3-875e-b72a67749384","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"List colourings of planar graphs.Discrete Math., 120(1-3):215–219, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:e9c2d0f5aff0c3b79deb616c0ce725db6478376659ab9cb92874bd0a478caaf8","observation_id":"e3d91cc6-c14d-4094-9654-987c447bc81d","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T00:28:28.815428Z","title":"Degree-truncated choosability of graphs.J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T00:28:28.815428Z"},"links":{"citing_paper":"/paper/2606.06216"},"observation_digest":"sha256:b4bcc7d9dcc29eb64407c434f4f7df6d1f5ecf8af3949a81808f671f22abd8bf","observation_id":"2d79390b-efde-4fb4-bc01-e74b2073b63a","resolution":{"observed_at":"2026-06-28T00:28:28.815428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.06216","last_updated":"2026-06-04T14:30:45Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T23:46:05.829177Z","submitted_at":"2026-06-04T14:30:45Z","title":"Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":12},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2606.06216."}