On the public citation graph

Symmetry in Gardens of Eden

https://doi.org/10.37236/2611
0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/3-540-36126-x_12openalex-snapshot
Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
inferredcites →https://doi.org/10.1007/3-540-46135-3_27openalex-snapshot
A Dual Graph Translation of a Problem in ‘Life’
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-540-76928-6_63openalex-snapshot
Time-Reversal in Conway’s Life as SAT
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_10openalex-snapshot
Blocked Clause Elimination
inferredcites →https://doi.org/10.1007/978-3-642-13754-9_4openalex-snapshot
The Localization Reduction and Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_7openalex-snapshot
SAT-Based Model Checking without Unrolling
inferredcites →https://doi.org/10.1007/978-3-642-21434-9_10openalex-snapshot
Control-Based Clause Sharing in Parallel SAT Solving
inferredcites →https://doi.org/10.1007/978-3-642-21581-0_19openalex-snapshot
Abstraction-Based Algorithm for 2QBF
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_10openalex-snapshot
Blocked Clause Elimination for QBF
inferredcites →https://doi.org/10.1016/s1571-0661(05)82542-3openalex-snapshot
Temporal Induction by Incremental SAT Solving
inferredcites →https://doi.org/10.1023/b:anor.0000032569.86938.2fopenalex-snapshot
Constraint Programming and Hybrid Formulations for Three Life Designs
inferredcites →https://doi.org/10.1051/ita/197408r300631openalex-snapshot
Paradis terrestre dans l'automate cellulaire de Conway
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-131openalex-snapshot
Conflict-Driven Clause Learning SAT Solvers
inferredcites →https://doi.org/10.3233/sat190077openalex-snapshot
DepQBF: A Dependency-Aware QBF Solver
inferredcites →https://doi.org/10.48550/arxiv.1004.2624openalex-snapshot
Symmetry within Solutions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.21801063zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1007/s10801-021-01037-7openalex-snapshot
Distance-integral Cayley graphs over abelian groups and dicyclic groups
inferred← citeshttps://doi.org/10.1016/j.artint.2015.03.004openalex-snapshot
Computer-aided proof of Erdős discrepancy properties
inferred← citeshttps://doi.org/10.1080/10511970.2021.1877515openalex-snapshot
Biological Models for Finite Mathematics
inferred← citeshttps://doi.org/10.1162/artl_a_00307openalex-snapshot
An Investigation into the Origin of Autopoiesis
inferred← citeshttps://doi.org/10.23919/mipro.2017.7973600openalex-snapshot
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10
inferred← citeshttps://doi.org/10.3906/mat-1503-18openalex-snapshot
The reversibility problem for a family of two-dimensional cellular automata
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.