{"as_of":"2026-08-17T01:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21db618520d7bc68eb0665c037686c54000105ba73e1cf507b79881bc71e6f83","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:57:22.566021Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1909.02612/citation-record","integrity":"/paper/1909.02612/integrity","json":"/paper/1909.02612/citation-record.json","paper":"/paper/1909.02612"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.678240Z","title":null,"venue":null,"work_id":"31eea634-f0d4-4ae2-b92f-a9786ae6a0c9","year":2002},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.537228Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:2300db78b1293649da52a8ad26b31a31c50263a86666a82dbb8faee0a8a81e93","observation_id":"91b023ef-cb3a-494a-8aba-c203bc8be16d","resolution":{"observed_at":"2026-08-14T04:57:22.681573Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.668462Z","title":null,"venue":null,"work_id":"2ead4b3c-594e-48b1-bae9-91f57e0b0fd5","year":2007},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.541401Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:7d7292393290ed291909334f23bb6c228294123bde1284408ce88126d5ab5180","observation_id":"f8022636-c086-4b23-89c7-56244566a209","resolution":{"observed_at":"2026-08-14T04:57:22.672103Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05269","last_updated":"2022-01-20T21:26:29Z","snapshot_observed_at":"2026-08-14T16:48:34.953864Z","submitted_at":"2019-04-10T16:13:30Z","title":"Planar graphs have bounded nonrepetitive chromatic number","version":4},"cited_work":{"arxiv_id":"1904.05269","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05269","snapshot_observed_at":"2026-08-14T04:57:22.594607Z","title":"Planar graphs have bounded nonrepetitive chromatic number","venue":"math.CO","work_id":"6090370c-0f20-4949-9ee7-8ea0f4f02285","year":2019},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.544821Z"},"links":{"cited_paper":"/paper/1904.05269","citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:e8ff7f895824e49b45760bfb30df63a6c5cddf0fdaaefd42d0856a59dcdbb13a","observation_id":"4530298b-64f3-46d0-aed6-6318426749f6","resolution":{"observed_at":"2026-08-14T04:57:22.600280Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.658517Z","title":"Fiorenzi, P","venue":null,"work_id":"9016703d-9af5-4196-ac54-aa3d4111b76e","year":2011},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.548622Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:8bc60869b6e35476f7190c9b1cbe419ddca5c9e7d3e32dfe5f9111edd8d17b60","observation_id":"9a9223ec-b879-45cb-82ec-6224d7eb9171","resolution":{"observed_at":"2026-08-14T04:57:22.661758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.647392Z","title":"Grytczuk, Nonrepetitive Colorings of Graphs - A Survey, Int","venue":null,"work_id":"c3715195-c900-40a1-b3f2-3a45e8aab55f","year":2007},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.552079Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:3966f92a7ca1e06c2adb6e2c42d272aed70fed2e1dc1e7f335ae1d2453539625","observation_id":"f84409f7-0734-4818-a78a-761551e6902b","resolution":{"observed_at":"2026-08-14T04:57:22.651682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.637642Z","title":"Grytczuk, P","venue":null,"work_id":"f86d747f-0943-4e77-b946-06a5c982e744","year":2013},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.555772Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:902ab8ca252e803667cf53ff8dec81189e3b656232fb2674fd06f9c00d14c038","observation_id":"26880b08-d715-4b0c-a933-f055701f51ad","resolution":{"observed_at":"2026-08-14T04:57:22.641015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.627677Z","title":"Micek Nonrepetitive choice number of trees, SIAM J","venue":null,"work_id":"8e00b3c6-ab15-43f3-8340-a4217ec12aec","year":2013},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.559596Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:604857ef7fc8d476fdf2131e58b7f4970cc79107b677c34e9b5d4a140c85a055","observation_id":"2b34ca55-2a9c-404f-a269-4eca6ee92ab0","resolution":{"observed_at":"2026-08-14T04:57:22.631143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.617364Z","title":"K ¨undgen, M","venue":null,"work_id":"ff1f18a8-538f-480a-8fc7-f4eb2566f232","year":2008},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.562706Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:4bf762fb5af4f5432e4cd452bb4f146ba493ddbf0e28b52b1f114ad7253abc9a","observation_id":"c697b279-bb5b-492c-be65-e204918b7313","resolution":{"observed_at":"2026-08-14T04:57:22.620685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:57:22.607405Z","title":"Thue, ¨Uber unendliche Zahlenreihen, Norske Vid Selsk Skr I Mat Nat Kl Christiana 7 (1906), 1–22","venue":null,"work_id":"e6ef39b4-a495-4980-9665-b2bcd7fc61c9","year":1906},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.566021Z"},"links":{"citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:978ba3044f074fa62c820341df6163a090f83905497e70839c8fec0a297f7043","observation_id":"e59e3e9a-acf1-4286-89ba-76155ac92f51","resolution":{"observed_at":"2026-08-14T04:57:22.610945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":6},"total_outbound_references":9},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:1909.02612."}