{"as_of":"2026-08-07T14:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb02eb1d5d32a338fd6a71fbe81055b154a74c33b41c1747478213ba75e99335","coverage":[{"denominator":76,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":76,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T04:49:38.148978Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T19:02:17.670510Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-18T19:02:48.642819Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"cited_work":{"arxiv_id":"2501.17060","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.17060","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","venue":"cs.LO","work_id":"57f6276b-ec6b-47f9-b14d-26ae4d655ff3","year":2025},"citing_paper":{"arxiv_id":"2509.04347","last_updated":"2026-05-06T08:48:42Z","snapshot_observed_at":"2026-08-03T02:08:44.681322Z","submitted_at":"2025-09-04T16:05:38Z","title":"When Darwin met Ianus: dichotomies of expressivity","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-18T19:02:17.670510Z"},"links":{"cited_paper":"/paper/2501.17060","citing_paper":"/paper/2509.04347"},"observation_digest":"sha256:57d0e9b2a886709897dc211fb03acd821aaa3ea1d4527ca3068ace48f8d6196a","observation_id":"bae75650-f10f-4c37-bdd7-f1addbf57380","resolution":{"observed_at":"2026-05-18T19:02:48.645235Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.17060/citation-record","integrity":"/paper/2501.17060/integrity","json":"/paper/2501.17060/citation-record.json","paper":"/paper/2501.17060"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A finer redu ction of constraint problems to digraphs","venue":null,"work_id":"961ee6da-ae3b-42ef-8102-cba6bc8c8c7e","year":2015},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:1819209e615911da6ae080f2baf8ec177fcb6c11a78745d7ae623d35ce6e39fe","observation_id":"72e8f705-1a6f-46d0-8e1c-8e8e307efaee","resolution":{"observed_at":"2026-05-23T04:52:35.447826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The computational structure of monotone monadic SNP and constraint satisfaction: A study through Da talog and group theory","venue":null,"work_id":"12256404-ee80-4591-b4a3-ed55166ad7be","year":1999},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:8006c70dd046d7bfceaded0c05bca536bf386ffb454607c76da519f80d6754d5","observation_id":"c84791c3-d082-46c2-8727-1f01f20eb6be","resolution":{"observed_at":"2026-05-23T04:52:35.453984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Monotone monadic SNP and constraint satisfaction","venue":null,"work_id":"f27308c0-ebf6-4c58-86fc-a874e22cdfba","year":1993},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:ea761aae3b0b3c7e0a10d941d2c729b50cf292758b5815bca1d7331ba53c8496","observation_id":"f1e14bac-0202-49df-8e1b-e5a61391541c","resolution":{"observed_at":"2026-05-23T04:57:34.617786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The complexity of satisfiability proble ms","venue":null,"work_id":"89d04782-9704-4fc1-b113-c9b7008904e3","year":1978},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:c77b68733ab5fb7ceb46574e800bc599a17d478b3bfb91e4ed6695aa77b4f014","observation_id":"abfd2d1d-0f02-423e-ae9c-4bcb0d525750","resolution":{"observed_at":"2026-05-23T04:57:34.632898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A dichotomy theorem for nonuniform CSPs","venue":null,"work_id":"2435fbf5-942b-4a1d-979c-7d57a0d3443e","year":2017},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:c105aa84e71939c7dc8930be62842a785fc6294516abc70eae4c9186db03d755","observation_id":"a84395d9-ffc5-4534-89e8-853fe6aae6c3","resolution":{"observed_at":"2026-05-23T04:57:34.624096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A proof of CSP dichotomy conjecture","venue":null,"work_id":"efaec47c-9af6-4bdb-be5e-60c10267db37","year":2017},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:417625bdff137822ed1cbafaca31f49fea172e92270649cc68085e1cbf26486e","observation_id":"2a99a529-428a-4874-b5b0-3eff01a17f97","resolution":{"observed_at":"2026-05-23T04:57:34.723632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A proof of the CSP dichotomy conjecture","venue":null,"work_id":"2c6f7b7d-0f40-42b1-81e6-096923cbfa42","year":2020},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:875530970a66b1bfd9f43f60558402b3d0c3442a8991ce5f93b95ead7097051a","observation_id":"c97def61-e26d-4358-aaf8-4d10035cf91e","resolution":{"observed_at":"2026-05-23T04:57:34.735164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"On the structure of polynomial time reduci bility","venue":null,"work_id":"3d353319-6487-484d-8868-e4630eb3d451","year":1975},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:75cc632f30cbb7f6d194679e68df8a4b1dc4fb2b210892f33cf229d926701bd5","observation_id":"028b9c63-6613-4356-9a7b-7eccea3ddf2b","resolution":{"observed_at":"2026-05-23T04:57:34.656840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"On the complexity of H-colori ng","venue":null,"work_id":"0f2442c5-aa8d-49bb-b9a1-c8326ea99752","year":1990},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:1512062e733d91e8924a2dd3b51897e7888c9c8209f7842e18c9c13534b2f98d","observation_id":"45f01c6e-2b33-4c5f-b7bd-ff2469c67d8d","resolution":{"observed_at":"2026-05-23T04:57:34.746936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A dichotomy theorem for constraint sati sfaction prob- lems on a 3-element set","venue":null,"work_id":"26da4074-e603-43ea-8614-f2da64f79ea7","year":2006},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:ab17942501cb7df965cef5ddb2d84ab513af1f2132bebc81a75b3aab6a044cd2","observation_id":"54beec16-1b66-49d2-9e75-7247c144a918","resolution":{"observed_at":"2026-05-23T04:57:34.629210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The CSP dichotomy hold s for digraphs with no sources and no sinks (a positive answer to a c onjecture of Bang-Jensen and Hell)","venue":null,"work_id":"2590f155-8881-4b93-b37c-03026bb0f253","year":2009},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:f0a2d5c121f59c7db6646302c454d7e677c0bd1be6326f23b65b7c4c8a042051","observation_id":"ce1a858b-30f0-46d1-a2b8-03c819b48a81","resolution":{"observed_at":"2026-05-23T04:57:34.641718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Absorbing Subalgebras, Cyclic T erms and the Constraint Satisfaction Problem","venue":null,"work_id":"5459b4d6-4669-4d83-b52d-72025280da31","year":2012},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:86cd8b5b57d0def297f9c65f5dd47bda275d84244be23d11cbaf0e35b5bdb170","observation_id":"38a9925b-6cf2-422d-874c-d816d07e4c6b","resolution":{"observed_at":"2026-05-23T04:57:34.637997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Optimal s trong Mal’cev conditions for omitting type 1 in locally finite varieties","venue":null,"work_id":"2ff049d6-79bf-4da8-acc4-3921963ddc34","year":2015},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:566e8846f374adb0e5bb2699e2fe027e9cd94062b72d147016b1d7df50b22883","observation_id":"9f1612c8-54a7-4544-8751-b65a7583a3dc","resolution":{"observed_at":"2026-05-23T04:57:34.665882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Constraint satisfacti on with countable homogeneous templates","venue":null,"work_id":"bbd1e773-3f25-4d27-9104-979a4a2cf0af","year":2006},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:41fa8677b8106b787d4324fd63decf770e053456b536b484febc50fc7eaa1f8d","observation_id":"65abb200-b27e-4701-87ae-388857b916a3","resolution":{"observed_at":"2026-05-23T04:57:34.728195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Topological Birkhoff","venue":null,"work_id":"5d713624-51b9-4fac-bb38-d7fa089a8424","year":2015},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:ea032e78b9ac0389d4daf84806e1bec730cad654786467a17d467d8cd94454c7","observation_id":"1e125a35-b39d-449e-8d56-c5c635441045","resolution":{"observed_at":"2026-05-23T04:57:34.756785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The wonderland of reflections","venue":null,"work_id":"541d4024-d1c4-4d95-a6e9-a27e34e94519","year":2018},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:3efdbfcf3537d5f871fb758a4ad005fa3bc833b65ded99fc0867d5ff6a553f8c","observation_id":"b03cbf7f-ccef-4e4b-a36c-5095c4210988","resolution":{"observed_at":"2026-05-23T04:57:34.714774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Total ordering problem","venue":null,"work_id":"62fddb93-6e10-47dd-a2ba-e301ffaf186e","year":1979},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:38d9301c15f56a5cbd48938c580807da7af653d3c6c5bc2504f9d94426a3ad5e","observation_id":"d010573d-d112-4d6d-a749-ac70e7994d6d","resolution":{"observed_at":"2026-05-23T04:57:34.696594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Bodirsky, Complexity of Infinite-Domain Constraint Satisfaction , ser","venue":null,"work_id":"9b9bf82d-11b5-49c3-b02e-d6203a9fa9b6","year":2021},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:b8ed153050f69d4d308bc7ce2f359e7436b99765036c10e385d35e6300d9ec65","observation_id":"34e66024-beba-4170-b154-55d7a60825af","resolution":{"observed_at":"2026-05-23T04:57:34.710826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Current challenges in infinite-domain con straint satisfac- tion: Dilemmas of the infinite sheep","venue":null,"work_id":"e9272a21-6a9a-40ad-9e09-c3606a703810","year":2022},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:98a72b6258f913a7d915f521c40c311abaf2c5cc1037ebbec95968fc5775df35","observation_id":"793afa25-ed3a-40ae-b040-401ae1813cdf","resolution":{"observed_at":"2026-05-23T04:57:34.688017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Projective clone homo- morphisms","venue":null,"work_id":"1befddb7-e8fe-46d2-b2ed-7a08883a26e4","year":2021},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:780b4dc775e5cc58ae826e6ec73cb9a70d3fd37620da268a4d2ac73ab163ed76","observation_id":"d23877b8-b212-4138-8f20-e44b909b502d","resolution":{"observed_at":"2026-05-23T04:57:34.692243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The algebraic dichotomy conje cture for infinite domain Constraint Satisfaction Problems","venue":null,"work_id":"c219d69e-fbb1-47ed-817a-12b58305929f","year":2016},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:865e6ffd2e85e4a1372d5dd20056b4d613458e9a7c0e33c0504a571bce65a2a1","observation_id":"62e23ee0-2b95-4bf1-a887-86a5d7d8af2e","resolution":{"observed_at":"2026-05-23T04:57:34.700607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The equivalence of two dichotomy conjectures for infinite domai n constraint satisfaction problems","venue":null,"work_id":"55c68378-270e-4848-881b-2c8d0bdfb3e0","year":2017},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:7348f55503dc5f512704c93aff5a102b8323a5d288b48fee405782549ac44c11","observation_id":"bd90f07f-c04f-41b4-8483-fe6d4fcdfc02","resolution":{"observed_at":"2026-05-23T04:57:34.705889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Equations in oligomorphic clones and the constraint satis faction prob- lem for ω-categorical structures","venue":null,"work_id":"db9f081b-f4a4-40bf-905f-199b4710d087","year":2019},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:39a20d0bb9333ec34a2ddedf0b6de3778d888e0a77e5c507e06425e743caf2d4","observation_id":"3bf154ca-78c5-4f23-b5f7-dc125a2ce93c","resolution":{"observed_at":"2026-05-23T04:57:34.719471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Topology Is Irrelevant (In a Di chotomy Conjecture for Infinite Domain Constraint Satisfaction Pro blems)","venue":null,"work_id":"60f04c62-8e34-4086-842a-24b4614d1d95","year":2020},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:4dbf4ebf77b43c420658e2526fe6497f7434e5c48ddefdeda586daa8ab083887","observation_id":"87de9d39-3db6-4f5e-9eab-904eae731be5","resolution":{"observed_at":"2026-05-23T04:57:34.751688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Symmetries of Graphs and Structures that Fail to Interpret a Finite Thin g","venue":null,"work_id":"8a6436c2-c1ad-4bfe-936c-aaf63b1b5c4f","year":2023},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:82c16b531ca0535fdfa77318a1ff4b3f6b163cc30162b56a9ef5a8e768dcec69","observation_id":"24ab6b0f-6951-4964-b285-e4dc412eb074","resolution":{"observed_at":"2026-05-23T04:57:34.653059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A dichotomy theorem for constraints on a three- element set","venue":null,"work_id":"3adb7b3c-6ab1-48cc-aeac-7075d5a6751d","year":2002},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:668ab3b52fafabf4d852943ee1c2f005db2e8b285af3c42a4e0eabde1d3f961b","observation_id":"fbeac22d-f644-4051-a5c4-726c5c28cbb7","resolution":{"observed_at":"2026-05-23T04:57:34.661751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Tractable conservative constraint satisfaction problems","venue":null,"work_id":"ea9ab931-ac38-4865-87e3-bd4fb75b19aa","year":2003},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:71952392e9782dd4128cd220dbd3a3de686f7269031f7d039f1d4808f02c8019","observation_id":"d63b9ec2-9641-4139-8286-b12e8d4ea98c","resolution":{"observed_at":"2026-05-23T04:57:34.680547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The Dichotomy for Conservative Constraint S atisfaction Prob- lems Revisited","venue":null,"work_id":"ebcf8a55-eb26-48c9-b843-595874d81656","year":2011},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:c587adb31ace57cd3f5b2f20a0ff940728c5543c68f6885778ce66f27c59762b","observation_id":"e140145e-5444-4433-89b2-181fc796e9ff","resolution":{"observed_at":"2026-05-23T04:52:35.515846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"CSP for binary conservative relational stru ctures","venue":null,"work_id":"9b420b0b-11c7-47b9-8c25-88ab6b91e3b9","year":2015},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:1d237b4d6834956a752b2e885bacdc35a40a383e8b4f750cd8fbad727b9f1461","observation_id":"d45c080e-e612-4aa5-b019-c32e735b3a80","resolution":{"observed_at":"2026-05-23T04:52:35.482049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Conservative constraint satisfaction re-revisited","venue":null,"work_id":"58cf6954-de38-4fa5-8225-07a52b31361a","year":2016},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:d35ad77ed2434920a7355d1b63470a5edec5eb2094d9d644a5a838d82ce1798c","observation_id":"636a26d7-bc71-4f67-842d-c0c6b73cc9a4","resolution":{"observed_at":"2026-05-23T04:52:35.510313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The expressibility of functions on the boolean domain, wit h applica- tions to counting csps","venue":null,"work_id":"0cd7988c-f4e7-4569-90c6-cdfc49c749cf","year":2013},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:8d5a7744d677b99f868b0cc6e8c00676052dee5adf4ad72cbb0e384af8457954","observation_id":"493b51ef-7915-4d3a-9e3b-77020e46358f","resolution":{"observed_at":"2026-05-23T04:57:34.671594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The complexity of approximating conservativ e counting csps","venue":null,"work_id":"df2cc0f9-7f03-4ac6-9366-6442f1602248","year":2015},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:0792718ab4c9de0c28214a6038ca7fb478cf257636cec536b93dbb48ab9a2928","observation_id":"d47ef4e3-5998-4493-88af-b6da5db525c0","resolution":{"observed_at":"2026-05-23T04:52:35.476020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The complexity of conservative valued csps","venue":null,"work_id":"646f16f2-f57e-456e-bd51-f436a0d6bf84","year":2013},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:82ee21d24c4991d136bd1f8030e35c3867790205255c78b724bf754835a59ec9","observation_id":"226b6c16-ef7e-42a3-b52e-227cfe9fd99c","resolution":{"observed_at":"2026-05-23T04:52:35.466329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Hell and A","venue":null,"work_id":"d67cd841-64c7-4d9f-baa8-299bb2a68cac","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:d4d8495a4fcc30cd32636ad93883b4fe8e086579e8b94223cdca851dcdbf495c","observation_id":"b9e75c63-5326-4dfd-a2cd-355778d42846","resolution":{"observed_at":"2026-05-23T04:52:35.472810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Bi-arc digraphs: Recog nition algo- rithm and applications","venue":null,"work_id":"7bf84761-cf2d-49bb-aa67-aa77bca57206","year":2024},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:61e96edeb0edff27bbea0560863b9d05cdb3783bf5ffe87c8f3af73243410acb","observation_id":"d5c4e4e8-650e-4ee8-b946-e6f969f81180","resolution":{"observed_at":"2026-05-23T04:52:35.460212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fb76c0e7-5a11-4506-a546-a48b2a7df2cc","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:38b35156797b31860fa1e77268e228c73d385912759191d39acd98b926934898","observation_id":"48342494-c66c-4da3-938d-6bbb494ecfd3","resolution":{"observed_at":"2026-05-23T04:52:35.463051Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Sur certaines relations qui g´ en´ eralisent l’ordre des nombres rationnels","venue":null,"work_id":"76529d16-610f-4e23-9f20-17b96ac52db1","year":1953},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:1acae77e3e55ad34be193f06270578df4b47fb01266501556277f0f9f6d9c03a","observation_id":"87c9f319-8e4e-48da-9a3c-54eb1654db6b","resolution":{"observed_at":"2026-05-23T04:52:35.469473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Universal graphs wit h forbidden subgraphs and algebraic closure","venue":null,"work_id":"fb90cc2b-fd82-47d4-a2d1-99071a61ea0e","year":1999},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:10cc30671e790cd467a24f31b09c9aea78fba67c29e4f140201ee485a19e6b26","observation_id":"34044ead-4b77-4f07-a1c1-065e485d38fb","resolution":{"observed_at":"2026-05-23T04:52:35.478901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"All those ramsey classe s (ramsey classes with closures and forbidden homomorphisms)","venue":null,"work_id":"c1712818-1594-410f-94c9-cabceb97d6ba","year":2019},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:597baf745feddcb5d4c63c40d8993ce81a897b13fe860a917be9fe92b8cd933c","observation_id":"f2007a50-2d68-42cc-8014-aa4d095bff85","resolution":{"observed_at":"2026-05-23T04:52:35.444842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A proof of t he algebraic tractability conjecture for monotone monadic SNP","venue":null,"work_id":"68ba91f8-c3e1-4a0c-9f69-088c65e3c380","year":2021},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:3b6981f81ab6490c60da74e6d245752977173d888728d25108f6a56a304f5e7b","observation_id":"d1e8a851-1a44-4bb7-94d5-787f0aa71728","resolution":{"observed_at":"2026-05-23T04:52:35.431113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The complexity of temporal co nstraint satisfaction problems","venue":null,"work_id":"a25a4662-6948-4c67-b862-ec7e6cb25a71","year":2009},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:5bd3ea8d3c65c2b8f7a542a457401d1cb878bb8f08f50811b871c6e4e990cf37","observation_id":"87e74be9-911b-480c-885b-59786bc254cd","resolution":{"observed_at":"2026-05-23T04:52:35.438299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.22060","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minimal operations over per mutation groups","venue":null,"work_id":"536e0e0f-dfef-47f4-9c0f-02f73acb7dd4","year":2024},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:23e2455a3546560437ed5be9efc489640c181c01b8e1c689fefd1fdbfed19841","observation_id":"2c32580d-0e49-4079-8cdd-8c82cfe00401","resolution":{"observed_at":"2026-05-23T04:52:34.270033Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Smooth approximations and cs ps over finitely bounded homogeneous structures","venue":null,"work_id":"b89f9ba3-a69f-425c-a90b-39b57e38f695","year":2022},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:7181e061a2b1541e224a7bd29c8394f197b2499624277b2ed2333d2ec3eea051","observation_id":"6f962b71-f03d-4d56-b248-4d39eb0e3ba0","resolution":{"observed_at":"2026-05-23T04:52:35.434866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Schaefer’s theorem for gra phs","venue":null,"work_id":"1ffd9681-163a-4ebc-bccb-e7798fbcec75","year":2015},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:b6e2a445b8fca68a4835ad02612e0f885d580eaad75cfd940427c608f17cccae","observation_id":"14284330-b42d-4a99-b5ea-902470d4a47e","resolution":{"observed_at":"2026-05-23T04:52:35.441610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"An order out of nowhe re: a new algorithm for infinite-domain csps","venue":null,"work_id":"9049d4d9-e6e8-4c60-ad0c-6264bd0e4cc0","year":2024},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:4f23b89bdf658f47cc4d5ed78192951d0095b4722d3b05d5688dc563b6c6b78a","observation_id":"d20248c3-8aa3-414d-9326-b66e93beb318","resolution":{"observed_at":"2026-05-23T04:52:35.451049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Smooth approximations: An al gebraic approach to csps over finitely bounded homogeneous structur es","venue":null,"work_id":"df8d2cd8-994c-4171-8066-a0c18a163c0c","year":2024},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:f3ff765d6545379e303e8b747382eecce52080cc90a27cbf356b7c7f7f7253f5","observation_id":"0993f21b-b40c-4387-86dc-0fe8d74d158b","resolution":{"observed_at":"2026-05-23T04:52:35.457189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Cores of Countably Categorical Structur es","venue":null,"work_id":"9378c9b5-d0e9-4066-a4b9-7f3474328d36","year":2007},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:e253be2b57ecc742e955c47704a3c2d9672a67f09cd4b64d05d701f225c910bc","observation_id":"94a8291a-1e91-4f93-985c-9b698955ea57","resolution":{"observed_at":"2026-05-23T04:57:34.645164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Loop conditions","venue":null,"work_id":"3ae5aa67-a6d6-43b4-b01d-0b3d737e4247","year":2020},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:9d4b5b6a81d6bb9de748eb635097b60c0c105c1d9a2ff1db77ca0e4c20e13121","observation_id":"1be7c460-24ef-4217-b5a1-2c0f18d3b5f1","resolution":{"observed_at":"2026-05-23T04:57:34.676968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Pseudo-loo p conditions","venue":null,"work_id":"c953992d-9a87-4f4c-b65c-2e53f8fab279","year":2019},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:145f55abdc7561bdebbfb81bef618a31ace0bc00b3ac32fd4d58fb571ea7c2bd","observation_id":"972a1bca-8241-4328-b93e-3b5dba7b6264","resolution":{"observed_at":"2026-05-23T04:57:34.731469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A strong Mal’cev condition for varietie s omitting the unary type","venue":null,"work_id":"280e385d-219c-481b-b6a1-f733d2250310","year":2010},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:67bbc658c43ae3d2c4d2a99c5ebbfbf9766890bf371f623c429804098daeb2d3","observation_id":"4970d6a9-ff85-4738-9270-f6735b952e9f","resolution":{"observed_at":"2026-05-23T04:57:34.649663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Existence theorems for wea kly symmetric operations","venue":null,"work_id":"08ddb875-ee14-4493-9a4a-fb1ff61dcaff","year":2008},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:ae89a0897232eabde1fe01a34281a179011a1be1f9204f0d465b8b03f38646fc","observation_id":"9dce7835-6c00-48fb-a258-427e881ae0fe","resolution":{"observed_at":"2026-05-23T04:57:34.600968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Optimal strong Mal’cev conditions for congruence meet-semidistributivi ty in locally finite varieties","venue":null,"work_id":"a66a1b9a-8e65-431d-989c-f3ab3459a140","year":2016},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:65a7df70664516fce02fdaa8bb7b7bacbfafe0753964afd39a440beec642b2dd","observation_id":"0c8a9c06-3e4f-4c7b-b81d-39316b92ffc5","resolution":{"observed_at":"2026-05-23T04:57:34.604236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Canonical functions: a pro of via topo- logical dynamics","venue":null,"work_id":"b2e5d358-b5a8-4256-a48b-53addf99a19d","year":2021},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:100db9747cd34e8df79130037a9f3e91f170c514d490ca8677b4a990f30333ce","observation_id":"0ced0083-d77b-4ba0-808b-ecc185fb9634","resolution":{"observed_at":"2026-05-23T04:57:34.597877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"On the unique games conjecture","venue":null,"work_id":"292c7c3f-b10a-4ced-ab81-203fb0457362","year":2005},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:5056202510493ed48ffcb71034e5564e3118e6754c8d26e6f6e4961552b38b8a","observation_id":"5216680d-5e22-4d57-bb0d-54be7c4230d7","resolution":{"observed_at":"2026-05-23T04:57:34.607386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6e5c3656-6634-4bb6-9358-40991cc034cd","year":1970},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:909b2e5f4ef53625e78b77da05ba4babc021e20397bb7b95c6f055e94e0bc3aa","observation_id":"942acf92-ce4d-41fb-bf4c-b1246c106df4","resolution":{"observed_at":"2026-05-23T04:52:35.543649Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Mi nimal Taylor algebras as a common framework for the three algebraic appro aches to the CSP","venue":null,"work_id":"b87f41f3-1931-4fad-be59-54615c3a07a9","year":2021},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:32adbb027d036e3709c55e1123b63882d1f5bf1c61fff4041693c2bce46897a6","observation_id":"201998ae-f7e7-492c-9268-fb5614bd28ba","resolution":{"observed_at":"2026-05-23T04:52:35.546708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"60f1e107-948d-477b-bfd2-b45c0b9ccec5","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:4aa6a634c59f7a3cca1248f0c438c1bc3ab321091a422a90632f24d79fc022e8","observation_id":"8842748d-89b7-4af8-b3e9-1a93a3eb3ea3","resolution":{"observed_at":"2026-05-23T04:52:35.537877Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"07207229-dc27-461d-b9c5-1d03b154e06b","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:2e9181ee0aef40dbc6e4a26394a7d03675ef55d6e950838372b9b26b451ede84","observation_id":"f454e082-f7fe-4ebb-9b12-c1433453ab97","resolution":{"observed_at":"2026-05-23T04:52:35.540730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"752699dc-bf3a-4557-a151-fb72c0baeb6a","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:00a7d13c981502ab18eb1a7808353dbec715c21ee5c2ce9b1c12a34049893cf9","observation_id":"0c9b3225-774a-48a5-af30-1bfc0f3e97c8","resolution":{"observed_at":"2026-05-23T04:52:35.549778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c4af69ab-0ec8-4af7-9cac-0dae4e97be21","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:6f6ab48dd60f74e8aed3bd8221fa1819c1f8ca5dd674d9adc96de0b2ce8353fe","observation_id":"0c8cf585-3046-46f9-b058-54fb6f725310","resolution":{"observed_at":"2026-05-23T04:52:35.528572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"By Case 2., there exists a pair (µ 2,µ ′","venue":null,"work_id":"c9bbb9be-d5b8-4ecb-8981-b84aa38ea134","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:f8fd0ce158e8e3b503ce4123de81c44e0711c161ac0353c57ba53d4501417e54","observation_id":"98b51a13-8a11-45b8-b569-df994378d380","resolution":{"observed_at":"2026-05-23T04:52:35.531788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Finally, labelling ← by the labels (V ′,V ) and (W ′,W ), we get a pair (µ 3,µ ′","venue":null,"work_id":"93a04644-2dec-4893-9015-41d974752ceb","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:9f8d4aad5789bee7b36e8c53c986420b87005063f58dcb79ec9d24d399d7b21e","observation_id":"e4144691-b763-4ba5-bd6d-d2fc6bf92557","resolution":{"observed_at":"2026-05-23T04:52:35.522402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Now, (µ 1 +µ 2 +µ 3,µ ′ 1 +µ ′ 2 +µ ′ 3) has the required properties","venue":null,"work_id":"2181bfab-54b7-4d5f-8e08-4efc949abcfe","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:7e69af652fd4444a45218fe1d44930b15af829d3ffe76f4256a136006e78b7b5","observation_id":"fde87ced-8ba9-420d-bd4a-57ec0c78167d","resolution":{"observed_at":"2026-05-23T04:52:35.525386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Proposition VI.6","venue":null,"work_id":"b6c57af3-575c-42b3-96fc-6148004f3066","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:716c81b0a2125a72aaa0fe30e3235064be8881c38f55d04f3db707a201183bf1","observation_id":"c9ee19f3-5f31-401c-9130-8824b4ff0e30","resolution":{"observed_at":"2026-05-23T04:52:35.534865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Note that if H ={A1}, then H⊕ R =H +R","venue":null,"work_id":"c768d22c-711a-4abd-8568-89667704239d","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:54e5f1a675d1c3109c575ed8960ef7cddf9ad89eef5b032225c9c3b50f4d26aa","observation_id":"12f8d726-86e2-4212-a925-948b9dd4a760","resolution":{"observed_at":"2026-05-23T04:57:34.610554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f40bd9a3-007f-4134-8ca6-c00f89c6b1a2","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:a5af12c4296f1f388b923e4b77457c35040edd17160a86ff74854bac75ca9a40","observation_id":"0b973ea1-0bfc-4b9d-9b58-26613e3d8077","resolution":{"observed_at":"2026-05-23T04:57:34.614111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"95074695-9251-4151-a46f-cdea8f92a9be","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:f89b54259f8bcec7c3dd79ee5f60993e6b73a1cd067aaf30a47ac1dcc3f25615","observation_id":"6fc70117-c20f-4221-be6c-82ea5762a9a6","resolution":{"observed_at":"2026-05-23T04:52:35.504400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"58033859-f9b8-4bc2-8212-c6539e505b45","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:ac4731fd1afb7096ceba76d74cf469d17e2d59ca6cd787df8a65e96f5677f77a","observation_id":"a08df84c-fa4e-4e21-b7d2-f2f62478aa4a","resolution":{"observed_at":"2026-05-23T04:52:35.507415Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e256ae7d-b3ce-4036-a40b-e7f070a6f0a4","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:9323d4d2cd105e20e7267139d9474ecb0e6f637f42270205867b5b6b6b7fd547","observation_id":"cac82286-dc6d-4fcb-a831-6916f91ffa67","resolution":{"observed_at":"2026-05-23T04:52:35.501320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fda8e584-f151-4d30-8922-06f7441e583f","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:2d85260aee6d02cdc8fed3d2db5bb7b9833c16d31f3e258c5280feed33d83fef","observation_id":"7201fdab-546b-46c5-9681-acb89ea9b055","resolution":{"observed_at":"2026-05-23T04:52:35.495043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"31c736f3-dd6a-4742-9a85-1c231fd37337","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:c0d4864911ac99d1adaf6f522258c36ca69d028556840f834ad37d7f249669e7","observation_id":"2974ffd0-3d63-4ca1-a25e-bf487b2db32b","resolution":{"observed_at":"2026-05-23T04:52:35.498310Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Proposition VI.7","venue":null,"work_id":"ac156c14-726f-4198-baf1-b64f9dc3518b","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:6c2311258ac38eccfbcc80eed913da50c5c779dfd8209d35d463c0426c572dae","observation_id":"85931c9c-64d5-4936-a550-fd36c281623d","resolution":{"observed_at":"2026-05-23T04:52:35.513069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Thus, by pickinga∈ Oin for everya′∈ O′ out as above, we eventually pick a representative of every α -class in Oin","venue":null,"work_id":"231f3dd8-943c-45f2-b868-1b94f4dde16f","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:2ecea3be6d1abe155e8d428f70249c05932437b549ee6f444fcb71ab2a66764b","observation_id":"339b372e-1eed-4ed6-871a-7e875408c7fe","resolution":{"observed_at":"2026-05-23T04:52:35.518904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The following statement allows us to replicate the correspondi ng proofs from [ 25]","venue":null,"work_id":"a2020f70-e242-4dc9-8182-73a727164095","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:709e19cbe5827a2e7ec464cbdbc1c28ae4f1f67cee0a24daf3eb2aed03fab7bf","observation_id":"7d4bcdb2-5e60-452d-b14b-1f8cc0c0184c","resolution":{"observed_at":"2026-05-23T04:52:35.491969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c3351a08-c63e-418f-9ef2-5b462d471842","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:f83387de041eb2a67865171a22ba7dbcaaaacf9d3686ab018f9b2418f2896792","observation_id":"7a152bc0-d13e-49e9-8668-6e950368da4f","resolution":{"observed_at":"2026-05-23T04:52:35.485152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e1602665-f164-497a-8136-8bb6ca8411cb","year":null},"citing_paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-23T04:49:38.148978Z"},"links":{"citing_paper":"/paper/2501.17060"},"observation_digest":"sha256:3bc96ea93d8410bdc0627a4f679c93b08e99fe49ff2e9552d3962ac2a721c489","observation_id":"854f407c-ecc4-4a80-8de5-fed3f183233b","resolution":{"observed_at":"2026-05-23T04:52:35.488312Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.17060","last_updated":"2026-04-04T12:03:20Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-07-06T20:27:28.212857Z","submitted_at":"2025-01-28T16:38:13Z","title":"The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems"},"reference_resolution":{"displayed":76,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":61},"total_outbound_references":76},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 76 of 76 outbound references and 1 inbound Pith citation observation for arXiv:2501.17060."}