{"as_of":"2026-08-08T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4260a5b8a09239145f15318b70384bd891722ea4252a190e96a44b169454dda2","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-08T06:32:00.761636+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-01T19:52:20.389327Z","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:7e0ff1c7f3c52c870ec1ede5584abd6529d725db0827afa2beffbe00444a919b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T17:18:32.330256Z","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-01T19:52:20.389327Z","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:596c4b3916dfe1f125b5396d4a1db8bf6fd82e0dd2b40654611b50cbedee093c","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-07-06T12:22:43.206246Z","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-01T19:52:20.389327Z","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:d5ab74a61bef762b2ef4ad0964a54e78b0f2493a519cdf8e1540e221e9ce8477","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-01T19:52:20.389327Z","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:9c09cd0406d57be6ba81894742762aeac8e88d11c6088d140371eae8aee9179d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-01T19:52:20.389327Z","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:9cd25dd029625140008077e998371f187456670d5da17ccdd608bc28a115fcea","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-01T19:52:20.389327Z","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:cb987d13ea2ce51304fea251ae8e8977ea62275c437e5a5057b4cf4fb9f2e905","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-01T19:52:20.389327Z","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:7ba26656ae273cd30992a6b4e5e5b9e5bd5198366dcc5edcbb02b800c43012bb","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-01T19:52:20.389327Z","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:726620e2d61f31fbb6dda278ddfb973d206bf4384e8d85403623e0c14d70aeb0","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T02:40:52.760568Z","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-01T19:52:20.389327Z","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:e7d6b6df0aae605472fb1fc5deab35fe9f97e2979a82cb4e6f18f226d25a8175","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-01T19:52:20.389327Z","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:05e14b520a6f97a22163e19583b337ce64c88066e95e331456515de05684404a","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-01T19:52:20.389327Z","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:b594458accc6c991ba18ed14b60db969db149b2907b3c3aedcfbb46442f00a08","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-01T19:52:20.389327Z","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:0b60b494e0961960618498c45cbfdcffbdef8ef8411cd852df0eb1936db652f9","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-01T19:52:20.389327Z","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:aa88f36c266d94600c81202d8047043930a95286ee317ee0c567519662669001","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-01T19:52:20.389327Z","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:1824fe9b3c54f11e35eb880e30acd405c3a7dab19276c85c4913b66a1ca9d22c","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-01T19:52:20.389327Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2607.16879."}