Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-23T04:49:38.148978Z
Paper Citation Record · LEDGER
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-18T19:02:17.670510Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-05-18T19:02:48.642819Z
Reference resolution
76 of 76 outbound references displayed
- verified exact1
- verified fuzzy61
- unresolved14
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 72e8f705-1a6f-46d0-8e1c-8e8e307efaee · outbound
This paper cites A finer redu ction of constraint problems to digraphs.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A finer redu ction of constraint problems to digraphs
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.447826Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c84791c3-d082-46c2-8727-1f01f20eb6be · outbound
This paper cites The computational structure of monotone monadic SNP and constraint satisfaction: A study through Da talog and group theory.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The computational structure of monotone monadic SNP and constraint satisfaction: A study through Da talog and group theory
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.453984Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f1e14bac-0202-49df-8e1b-e5a61391541c · outbound
This paper cites Monotone monadic SNP and constraint satisfaction.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Monotone monadic SNP and constraint satisfaction
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.617786Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation abfd2d1d-0f02-423e-ae9c-4bcb0d525750 · outbound
This paper cites The complexity of satisfiability proble ms.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The complexity of satisfiability proble ms
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.632898Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a84395d9-ffc5-4534-89e8-853fe6aae6c3 · outbound
This paper cites A dichotomy theorem for nonuniform CSPs.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A dichotomy theorem for nonuniform CSPs
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.624096Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 2a99a529-428a-4874-b5b0-3eff01a17f97 · outbound
This paper cites A proof of CSP dichotomy conjecture.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A proof of CSP dichotomy conjecture
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.723632Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c97def61-e26d-4358-aaf8-4d10035cf91e · outbound
This paper cites A proof of the CSP dichotomy conjecture.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A proof of the CSP dichotomy conjecture
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.735164Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 028b9c63-6613-4356-9a7b-7eccea3ddf2b · outbound
This paper cites On the structure of polynomial time reduci bility.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems On the structure of polynomial time reduci bility
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.656840Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 45f01c6e-2b33-4c5f-b7bd-ff2469c67d8d · outbound
This paper cites On the complexity of H-colori ng.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems On the complexity of H-colori ng
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.746936Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 54beec16-1b66-49d2-9e75-7247c144a918 · outbound
This paper cites A dichotomy theorem for constraint sati sfaction prob- lems on a 3-element set.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A dichotomy theorem for constraint sati sfaction prob- lems on a 3-element set
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.629210Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ce1a858b-30f0-46d1-a2b8-03c819b48a81 · outbound
This paper cites 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).
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems 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)
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.641718Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 38a9925b-6cf2-422d-874c-d816d07e4c6b · outbound
This paper cites Absorbing Subalgebras, Cyclic T erms and the Constraint Satisfaction Problem.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Absorbing Subalgebras, Cyclic T erms and the Constraint Satisfaction Problem
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.637997Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9f1612c8-54a7-4544-8751-b65a7583a3dc · outbound
This paper cites Optimal s trong Mal’cev conditions for omitting type 1 in locally finite varieties.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Optimal s trong Mal’cev conditions for omitting type 1 in locally finite varieties
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.665882Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 65abb200-b27e-4701-87ae-388857b916a3 · outbound
This paper cites Constraint satisfacti on with countable homogeneous templates.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Constraint satisfacti on with countable homogeneous templates
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.728195Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 1e125a35-b39d-449e-8d56-c5c635441045 · outbound
This paper cites Topological Birkhoff.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Topological Birkhoff
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.756785Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b03cbf7f-ccef-4e4b-a36c-5095c4210988 · outbound
This paper cites The wonderland of reflections.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The wonderland of reflections
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.714774Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d010573d-d112-4d6d-a749-ac70e7994d6d · outbound
This paper cites Total ordering problem.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Total ordering problem
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.696594Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 34e66024-beba-4170-b154-55d7a60825af · outbound
This paper cites Bodirsky, Complexity of Infinite-Domain Constraint Satisfaction , ser.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Bodirsky, Complexity of Infinite-Domain Constraint Satisfaction , ser
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.710826Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 793afa25-ed3a-40ae-b040-401ae1813cdf · outbound
This paper cites Current challenges in infinite-domain con straint satisfac- tion: Dilemmas of the infinite sheep.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Current challenges in infinite-domain con straint satisfac- tion: Dilemmas of the infinite sheep
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.688017Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d23877b8-b212-4138-8f20-e44b909b502d · outbound
This paper cites Projective clone homo- morphisms.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Projective clone homo- morphisms
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.692243Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 62e23ee0-2b95-4bf1-a887-86a5d7d8af2e · outbound
This paper cites The algebraic dichotomy conje cture for infinite domain Constraint Satisfaction Problems.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The algebraic dichotomy conje cture for infinite domain Constraint Satisfaction Problems
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.700607Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation bd90f07f-c04f-41b4-8483-fe6d4fcdfc02 · outbound
This paper cites The equivalence of two dichotomy conjectures for infinite domai n constraint satisfaction problems.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The equivalence of two dichotomy conjectures for infinite domai n constraint satisfaction problems
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.705889Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3bf154ca-78c5-4f23-b5f7-dc125a2ce93c · outbound
This paper cites Equations in oligomorphic clones and the constraint satis faction prob- lem for ω-categorical structures.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Equations in oligomorphic clones and the constraint satis faction prob- lem for ω-categorical structures
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.719471Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 87de9d39-3db6-4f5e-9eab-904eae731be5 · outbound
This paper cites Topology Is Irrelevant (In a Di chotomy Conjecture for Infinite Domain Constraint Satisfaction Pro blems).
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Topology Is Irrelevant (In a Di chotomy Conjecture for Infinite Domain Constraint Satisfaction Pro blems)
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.751688Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 24ab6b0f-6951-4964-b285-e4dc412eb074 · outbound
This paper cites Symmetries of Graphs and Structures that Fail to Interpret a Finite Thin g.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Symmetries of Graphs and Structures that Fail to Interpret a Finite Thin g
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.653059Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fbeac22d-f644-4051-a5c4-726c5c28cbb7 · outbound
This paper cites A dichotomy theorem for constraints on a three- element set.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A dichotomy theorem for constraints on a three- element set
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.661751Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d63b9ec2-9641-4139-8286-b12e8d4ea98c · outbound
This paper cites Tractable conservative constraint satisfaction problems.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Tractable conservative constraint satisfaction problems
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.680547Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e140145e-5444-4433-89b2-181fc796e9ff · outbound
This paper cites The Dichotomy for Conservative Constraint S atisfaction Prob- lems Revisited.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The Dichotomy for Conservative Constraint S atisfaction Prob- lems Revisited
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.515846Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d45c080e-e612-4aa5-b019-c32e735b3a80 · outbound
This paper cites CSP for binary conservative relational stru ctures.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems CSP for binary conservative relational stru ctures
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.482049Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 636a26d7-bc71-4f67-842d-c0c6b73cc9a4 · outbound
This paper cites Conservative constraint satisfaction re-revisited.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Conservative constraint satisfaction re-revisited
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.510313Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 493b51ef-7915-4d3a-9e3b-77020e46358f · outbound
This paper cites The expressibility of functions on the boolean domain, wit h applica- tions to counting csps.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The expressibility of functions on the boolean domain, wit h applica- tions to counting csps
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.671594Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d47ef4e3-5998-4493-88af-b6da5db525c0 · outbound
This paper cites The complexity of approximating conservativ e counting csps.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The complexity of approximating conservativ e counting csps
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.476020Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 226b6c16-ef7e-42a3-b52e-227cfe9fd99c · outbound
This paper cites The complexity of conservative valued csps.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The complexity of conservative valued csps
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.466329Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b9e75c63-5326-4dfd-a2cd-355778d42846 · outbound
This paper cites Hell and A.
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.472810Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d5c4e4e8-650e-4ee8-b946-e6f969f81180 · outbound
This paper cites Bi-arc digraphs: Recog nition algo- rithm and applications.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Bi-arc digraphs: Recog nition algo- rithm and applications
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.460212Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 48342494-c66c-4da3-938d-6bbb494ecfd3 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 36
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.463051Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 87c9f319-8e4e-48da-9a3c-54eb1654db6b · outbound
This paper cites Sur certaines relations qui g´ en´ eralisent l’ordre des nombres rationnels.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Sur certaines relations qui g´ en´ eralisent l’ordre des nombres rationnels
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.469473Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 34044ead-4b77-4f07-a1c1-065e485d38fb · outbound
This paper cites Universal graphs wit h forbidden subgraphs and algebraic closure.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Universal graphs wit h forbidden subgraphs and algebraic closure
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.478901Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f2007a50-2d68-42cc-8014-aa4d095bff85 · outbound
This paper cites All those ramsey classe s (ramsey classes with closures and forbidden homomorphisms).
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems All those ramsey classe s (ramsey classes with closures and forbidden homomorphisms)
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.444842Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d1e8a851-1a44-4bb7-94d5-787f0aa71728 · outbound
This paper cites A proof of t he algebraic tractability conjecture for monotone monadic SNP.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A proof of t he algebraic tractability conjecture for monotone monadic SNP
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.431113Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 87e74be9-911b-480c-885b-59786bc254cd · outbound
This paper cites The complexity of temporal co nstraint satisfaction problems.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The complexity of temporal co nstraint satisfaction problems
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.438299Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 2c32580d-0e49-4079-8cdd-8c82cfe00401 · outbound
This paper cites Minimal operations over per mutation groups.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Minimal operations over per mutation groups
Reference 42
- Resolution
- verified exact
- arxiv_id, observed 2026-05-23T04:52:34.270033Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6f962b71-f03d-4d56-b248-4d39eb0e3ba0 · outbound
This paper cites Smooth approximations and cs ps over finitely bounded homogeneous structures.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Smooth approximations and cs ps over finitely bounded homogeneous structures
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.434866Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 14284330-b42d-4a99-b5ea-902470d4a47e · outbound
This paper cites Schaefer’s theorem for gra phs.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Schaefer’s theorem for gra phs
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.441610Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d20248c3-8aa3-414d-9326-b66e93beb318 · outbound
This paper cites An order out of nowhe re: a new algorithm for infinite-domain csps.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems An order out of nowhe re: a new algorithm for infinite-domain csps
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.451049Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0993f21b-b40c-4387-86dc-0fe8d74d158b · outbound
This paper cites Smooth approximations: An al gebraic approach to csps over finitely bounded homogeneous structur es.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Smooth approximations: An al gebraic approach to csps over finitely bounded homogeneous structur es
Reference 46
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.457189Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 94a8291a-1e91-4f93-985c-9b698955ea57 · outbound
This paper cites Cores of Countably Categorical Structur es.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Cores of Countably Categorical Structur es
Reference 47
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.645164Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 1be7c460-24ef-4217-b5a1-2c0f18d3b5f1 · outbound
This paper cites Loop conditions.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Loop conditions
Reference 48
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.676968Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 972a1bca-8241-4328-b93e-3b5dba7b6264 · outbound
This paper cites Pseudo-loo p conditions.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Pseudo-loo p conditions
Reference 49
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.731469Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4970d6a9-ff85-4738-9270-f6735b952e9f · outbound
This paper cites A strong Mal’cev condition for varietie s omitting the unary type.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems A strong Mal’cev condition for varietie s omitting the unary type
Reference 50
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.649663Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9dce7835-6c00-48fb-a258-427e881ae0fe · outbound
This paper cites Existence theorems for wea kly symmetric operations.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Existence theorems for wea kly symmetric operations
Reference 51
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.600968Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0c8a9c06-3e4f-4c7b-b81d-39316b92ffc5 · outbound
This paper cites Optimal strong Mal’cev conditions for congruence meet-semidistributivi ty in locally finite varieties.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Optimal strong Mal’cev conditions for congruence meet-semidistributivi ty in locally finite varieties
Reference 52
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.604236Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0ced0083-d77b-4ba0-808b-ecc185fb9634 · outbound
This paper cites Canonical functions: a pro of via topo- logical dynamics.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Canonical functions: a pro of via topo- logical dynamics
Reference 53
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.597877Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 5216680d-5e22-4d57-bb0d-54be7c4230d7 · outbound
This paper cites On the unique games conjecture.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems On the unique games conjecture
Reference 54
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.607386Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 942acf92-ce4d-41fb-bf4c-b1246c106df4 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 55
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.543649Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 201998ae-f7e7-492c-9268-fb5614bd28ba · outbound
This paper cites Mi nimal Taylor algebras as a common framework for the three algebraic appro aches to the CSP.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Mi nimal Taylor algebras as a common framework for the three algebraic appro aches to the CSP
Reference 56
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.546708Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8842748d-89b7-4af8-b3e9-1a93a3eb3ea3 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 57
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.537877Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f454e082-f7fe-4ebb-9b12-c1433453ab97 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 58
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.540730Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0c9b3225-774a-48a5-af30-1bfc0f3e97c8 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 59
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.549778Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0c8cf585-3046-46f9-b058-54fb6f725310 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 60
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.528572Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 98b51a13-8a11-45b8-b569-df994378d380 · outbound
This paper cites By Case 2., there exists a pair (µ 2,µ ′.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems By Case 2., there exists a pair (µ 2,µ ′
Reference 61
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.531788Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e4144691-b763-4ba5-bd6d-d2fc6bf92557 · outbound
This paper cites Finally, labelling ← by the labels (V ′,V ) and (W ′,W ), we get a pair (µ 3,µ ′.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Finally, labelling ← by the labels (V ′,V ) and (W ′,W ), we get a pair (µ 3,µ ′
Reference 62
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.522402Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fde87ced-8ba9-420d-bd4a-57ec0c78167d · outbound
This paper cites Now, (µ 1 +µ 2 +µ 3,µ ′ 1 +µ ′ 2 +µ ′ 3) has the required properties.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Now, (µ 1 +µ 2 +µ 3,µ ′ 1 +µ ′ 2 +µ ′ 3) has the required properties
Reference 63
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.525386Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c9ee19f3-5f31-401c-9130-8824b4ff0e30 · outbound
This paper cites Proposition VI.6.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Proposition VI.6
Reference 64
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.534865Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 12f8d726-86e2-4212-a925-948b9dd4a760 · outbound
This paper cites Note that if H ={A1}, then H⊕ R =H +R.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Note that if H ={A1}, then H⊕ R =H +R
Reference 66
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:57:34.610554Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0b973ea1-0bfc-4b9d-9b58-26613e3d8077 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 67
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:57:34.614111Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6fc70117-c20f-4221-be6c-82ea5762a9a6 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 68
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.504400Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a08df84c-fa4e-4e21-b7d2-f2f62478aa4a · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 69
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.507415Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation cac82286-dc6d-4fcb-a831-6916f91ffa67 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 70
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.501320Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 7201fdab-546b-46c5-9681-acb89ea9b055 · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 71
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.495043Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 2974ffd0-3d63-4ca1-a25e-bf487b2db32b · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 72
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.498310Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 85931c9c-64d5-4936-a550-fd36c281623d · outbound
This paper cites Proposition VI.7.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Proposition VI.7
Reference 73
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.513069Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 339b372e-1eed-4ed6-871a-7e875408c7fe · outbound
This paper cites Thus, by pickinga∈ Oin for everya′∈ O′ out as above, we eventually pick a representative of every α -class in Oin.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Thus, by pickinga∈ Oin for everya′∈ O′ out as above, we eventually pick a representative of every α -class in Oin
Reference 74
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.518904Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 7d4bcdb2-5e60-452d-b14b-1f8cc0c0184c · outbound
This paper cites The following statement allows us to replicate the correspondi ng proofs from [ 25].
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems The following statement allows us to replicate the correspondi ng proofs from [ 25]
Reference 75
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-23T04:52:35.491969Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 7a152bc0-d13e-49e9-8668-6e950368da4f · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 76
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.485152Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 854f407c-ecc4-4a80-8de5-fed3f183233b · outbound
This paper cites an unresolved cited work.
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems Unresolved cited work
Reference 77
- Resolution
- unresolved
- raw_fallback, observed 2026-05-23T04:52:35.488312Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Pith citing papers
Observation bae75650-f10f-4c37-bdd7-f1addbf57380 · inbound
When Darwin met Ianus: dichotomies of expressivity cites this paper.
When Darwin met Ianus: dichotomies of expressivity The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
Reference 16
- Resolution
- verified exact
- local_arxiv, observed 2026-05-18T19:02:48.645235Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.