{"as_of":"2026-08-12T10:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4830ade24e3bbbdd4c97d97f8d132ad8b1c1426e77530fc190d72d7b2c3cc5c8","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T19:52:25.629687Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2607.16879/citation-record","integrity":"/paper/2607.16879/integrity","json":"/paper/2607.16879/citation-record.json","paper":"/paper/2607.16879"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-025-10221-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Theory of Computing Systems","work_id":"063beaf0-a514-4d87-a2f5-ffb73838b84f","year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.069195Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:530ddd48552b4c1153dc99ca574902c737b0df18db2bc8bd01448a0229c660f2","observation_id":"ef1a99c7-82fc-47e7-b6e6-53629c568385","resolution":{"observed_at":"2026-08-01T19:53:24.067558Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11653","last_updated":"2026-06-16T01:28:06Z","snapshot_observed_at":"2026-08-10T13:35:56.152518Z","submitted_at":"2024-01-22T02:20:56Z","title":"Strong odd coloring of sparse graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11653","snapshot_observed_at":"2026-08-01T19:52:25.280765Z","title":"Strong odd coloring of sparse graphs.arXiv preprint arXiv:2401.11653,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.280765Z"},"links":{"cited_paper":"/paper/2401.11653","citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:392688b6adef4ef7565d719896d4910a84d7b4483133f79591bf2988de0f67b2","observation_id":"826989b7-e32a-4ae4-9af9-0e7e4efd6393","resolution":{"observed_at":"2026-08-01T19:52:25.280765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13710","last_updated":"2022-06-29T18:00:57Z","snapshot_observed_at":"2026-08-10T01:04:43.731576Z","submitted_at":"2021-12-27T14:34:29Z","title":"Colorings with neighborhood parity condition","version":3},"cited_work":{"arxiv_id":"2112.13710","doi":"10.48550/arxiv.2112.13710","metadata_source":"pith","pith_arxiv_id":"2112.13710","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Colorings with neighborhood parity condition","venue":"math.CO","work_id":"ebcd6fce-c51e-4aaa-a58e-afc6be05d23c","year":2021},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.521398Z"},"links":{"cited_paper":"/paper/2112.13710","citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:2148877a6b2a3eefbab65504e44403f63d159e5c8f1d6cb68cc32ae5deb20d99","observation_id":"87b2b87f-36b5-413b-9941-182fd49694e6","resolution":{"observed_at":"2026-08-01T19:53:23.830945Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0012-365x(73)90138-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"10 LenoreCowen, WayneGoddard, andC.EstherJesurum","venue":"Discrete Mathematics","work_id":"a07f7850-a3c6-4e62-b253-21d48c2eeac1","year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":1973,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:24.891237Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:b351713d6563c1d84e43a599df9cf9d26bd367e6a313e94a997378c38e05a38b","observation_id":"a53445b6-cc94-4870-9b30-5548ac1728ab","resolution":{"observed_at":"2026-08-01T19:53:24.204808Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:52:25.629687Z","title":"29 Alex D","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":1978,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.629687Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:786dac3fb471631faf03745692ff95391b4149a25a40d662749da5dc476ad050","observation_id":"6e644688-37e5-4076-8f7a-06b230299818","resolution":{"observed_at":"2026-08-01T19:52:25.629687Z","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-08-01T19:52:25.129454Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":1981,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.129454Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:7e1693d460c427b40f16d1a4c2c386d366d18a5f0efb28cc1a128a43448aff96","observation_id":"a35cbbd9-f0c5-4b37-a1f3-710b9a4a186e","resolution":{"observed_at":"2026-08-01T19:52:25.129454Z","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-08-01T19:52:24.981487Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:24.981487Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:97360550df0639517f0b064d77f018861c60dcce79a3b759e4d285b3d3858f36","observation_id":"61475357-d63a-4300-8f0c-caec55606256","resolution":{"observed_at":"2026-08-01T19:52:24.981487Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(98)00146-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"18 Richard M","venue":"Discrete Applied Mathematics","work_id":"863647e6-211e-4c8c-b31f-f960d0bfa737","year":2010},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.204271Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:f2c62426c195af0601daabf589a18155048d5a3880890b557cb26c2305ce5586","observation_id":"98255990-c126-430f-9974-58ea086734f6","resolution":{"observed_at":"2026-08-01T19:53:23.946006Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":{"arxiv_id":"1201.2852","last_updated":"2012-02-21T05:13:24Z","snapshot_observed_at":"2026-08-09T14:37:39.309500Z","submitted_at":"2012-01-13T14:53:40Z","title":"A note on the history of the four-colour conjecture","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.2852","snapshot_observed_at":"2026-08-01T19:52:25.416199Z","title":"26 Mirko Petrusevski and Riste Skrekovski","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.416199Z"},"links":{"cited_paper":"/paper/1201.2852","citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:743cc162724df76bb25aac851e166729409a5d4c6df00564c908e8a21549d348","observation_id":"712f9f3a-1fee-4633-b87d-a052c7b32180","resolution":{"observed_at":"2026-08-01T19:52:25.416199Z","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-08-01T19:52:24.815781Z","title":"9 Vašek Chvátal","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:24.815781Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:a8b2e898092436d335326184d85507f7b54fec0c2ae2a88bf17a107b061c6d73","observation_id":"8f1b0c8d-f047-4fcb-b0fb-d26a9a8f013f","resolution":{"observed_at":"2026-08-01T19:52:24.815781Z","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":"10.1007/s00453-021-00830-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"5 Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Paweł Rzążewski","venue":"Algorithmica","work_id":"b2b66784-47a6-41be-b9e3-7d851417aa01","year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:24.614036Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:21a25af859446c01bf7390125379ea6b2ceaa640fe198ed5d8f3e7e5d42dd38c","observation_id":"f3e16302-d1c3-49db-b5ac-1cb64b6bc7db","resolution":{"observed_at":"2026-08-01T19:53:24.342608Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:52:25.336476Z","title":"NP-completeness of finding the chromatic index of regular graphs","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:25.336476Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:5d5feea2b2a1a2d00a8f7a36ae7dc33e2e5517764776f68e7a264b9e6e227d29","observation_id":"f2d79eac-e5c1-47e6-a09c-04bfc092b16b","resolution":{"observed_at":"2026-08-01T19:52:25.336476Z","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-08-01T19:52:24.732795Z","title":"2025.114601,doi:10.1016/J.DISC.2025.114601","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:24.732795Z"},"links":{"citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:8ff845bb40ac6d034ad4257aa1740f51ea5cee86730e753afea3f9fcfb97a32f","observation_id":"98746b4d-2330-48f6-bed7-657d21ec7390","resolution":{"observed_at":"2026-08-01T19:52:24.732795Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.26214","last_updated":"2026-05-06T11:57:15Z","snapshot_observed_at":"2026-08-06T06:43:01.418974Z","submitted_at":"2026-03-27T09:37:31Z","title":"Optimal b-Colourings and Fall Colourings in $H$-Free Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.26214","snapshot_observed_at":"2026-08-01T19:52:24.548235Z","title":"2 Jungho Ahn, Seonghyuk Im, and Sang-il Oum","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T19:52:24.548235Z"},"links":{"cited_paper":"/paper/2603.26214","citing_paper":"/paper/2607.16879"},"observation_digest":"sha256:e45f92b0b6ba4c32f597a9d3f17facde8032783a1bd4134809b3d6561bcfa684","observation_id":"8da1e45a-bc06-4896-b901-ee80321be525","resolution":{"observed_at":"2026-08-01T19:52:24.548235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16879","last_updated":"2026-07-18T16:34:49Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T01:04:17.065590Z","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":14},"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 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2607.16879."}