On the public citation graph

Backbone Fragility and the Local Search Cost Peak

0 signed · 82 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.1002/(sici)1098-2418(199910/12)15:3/4<414::aid-rsa10>3.0.co;2-gopenalex-snapshot
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition
inferredcites →https://doi.org/10.1007/3-540-61551-2_65openalex-snapshot
Using CSP look-back techniques to solve exceptionally hard SAT instances
inferredcites →https://doi.org/10.1007/3-540-61551-2_70openalex-snapshot
Local search and the number of solutions
inferredcites →https://doi.org/10.1007/bfb0017451openalex-snapshot
Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs
inferredcites →https://doi.org/10.1016/0004-3702(94)90088-4openalex-snapshot
The hardest constraint problems: A double phase transition
inferredcites →https://doi.org/10.1016/0004-3702(95)00046-1openalex-snapshot
Experimental results on the crossover point in random 3-SAT
inferredcites →https://doi.org/10.1016/0004-3702(95)00047-xopenalex-snapshot
The satisfiability constraint gap
inferredcites →https://doi.org/10.1016/0004-3702(95)00053-4openalex-snapshot
Implicates and prime implicates in Random 3-SAT
inferredcites →https://doi.org/10.1016/0020-0190(92)90029-uopenalex-snapshot
On the greedy algorithm for satisfiability
inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1038/22055openalex-snapshot
Determining computational complexity from characteristic ‘phase transitions’
inferredcites →https://doi.org/10.1090/dimacs/026/18openalex-snapshot
Random generation of test instances with controlled attributes
inferredcites →https://doi.org/10.1090/dimacs/035/01openalex-snapshot
Finding hard instances of the satisfiability problem: A survey
inferredcites →https://doi.org/10.1109/sfcs.1991.185365openalex-snapshot
On selecting a satisfying truth assignment
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1613/jair.445openalex-snapshot
When Gravity Fails: Local Search Topology
inferredcites →https://doi.org/10.1613/jair.7openalex-snapshot
An Empirical Analysis of Search in GSAT
inferredcites →https://doi.org/10.5860/choice.33-5144openalex-snapshot
Empirical methods for artificial intelligence

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119711148.ch5openalex-snapshot
Future of Artificial Intelligence: Will People be at More of an Advantage Than They Are Today?
inferred← citeshttps://doi.org/10.1007/0-387-27744-7_12openalex-snapshot
A Dynamic Model of Tabu Search for the Job-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1007/1-84628-271-3_9openalex-snapshot
Agents in a Wild World
inferred← citeshttps://doi.org/10.1007/11499107_19openalex-snapshot
DPvis – A Tool to Visualize the Structure of SAT Instances
inferred← citeshttps://doi.org/10.1007/11740698_14openalex-snapshot
A Backbone-Based Co-evolutionary Heuristic for Partial MAX-SAT
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_11openalex-snapshot
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
inferred← citeshttps://doi.org/10.1007/3-540-46033-0_10openalex-snapshot
The Effects of Partial Restarts in Evolutionary Search
inferred← citeshttps://doi.org/10.1007/3-540-46033-0_16openalex-snapshot
SAT, Local Search Dynamics and Density of States
inferred← citeshttps://doi.org/10.1007/978-0-387-09624-7openalex-snapshot
Reactive Search and Intelligent Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_20openalex-snapshot
An Introduction to Fitness Landscape Analysis and Cost Models for Local Search
inferred← citeshttps://doi.org/10.1007/978-1-4615-0429-0_12openalex-snapshot
Condensing Uncertainty via Incremental Treatment Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-12413-6_42openalex-snapshot
Clinical Decision Support System Braced with Artificial Intelligence: A Review
inferred← citeshttps://doi.org/10.1007/978-3-319-05170-3_34openalex-snapshot
Characterization of the Optimization Process
inferred← citeshttps://doi.org/10.1007/978-3-540-30217-9_11openalex-snapshot
Estimating the Number of Solutions for SAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_52openalex-snapshot
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_29openalex-snapshot
Blocked Clause Decomposition
inferred← citeshttps://doi.org/10.1007/s00500-010-0564-4openalex-snapshot
Solving multiple instances at once: the role of search and adaptation
inferred← citeshttps://doi.org/10.1007/s10462-007-9055-0openalex-snapshot
Just enough learning (of association rules): the TAR2 “Treatment” learner
inferred← citeshttps://doi.org/10.1007/s10817-006-9025-2openalex-snapshot
An Efficient Approach to Solving Random k-sat Problems
inferred← citeshttps://doi.org/10.1007/s10817-007-9074-1openalex-snapshot
Visualizing SAT Instances and Runs of the DPLL Algorithm
inferred← citeshttps://doi.org/10.1007/s10951-009-0113-0openalex-snapshot
Understanding the behavior of Solution-Guided Search for job-shop scheduling
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104346openalex-snapshot
Disjoint projected enumeration for SAT and SMT without blocking clauses
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.02.002openalex-snapshot
Computational complexity of auditing finite attributes in statistical databases
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.006openalex-snapshot
Recognizing frozen variables in constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00363-6openalex-snapshot
Problem difficulty for tabu search in job-shop scheduling
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00386-7openalex-snapshot
On market-inspired approaches to propositional satisfiability
inferred← citeshttps://doi.org/10.1016/s0065-2458(05)65004-8openalex-snapshot
Verification and Validation and Artificial Intelligence
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00406-7openalex-snapshot
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00410-9openalex-snapshot
SAT problems with chains of dependent variables
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00314-2openalex-snapshot
Exploiting the real power of unit propagation lookahead
inferred← citeshttps://doi.org/10.1088/1757-899x/1022/1/012019openalex-snapshot
Approaches of Artificial Intelligence and Machine Learning in Smart Cities: Critical Review
inferred← citeshttps://doi.org/10.1109/ase.2001.989836openalex-snapshot
Better reasoning about software engineering activities
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400085openalex-snapshot
Survey on computational complexity with phase transitions and extremal optimization
inferred← citeshttps://doi.org/10.1109/cec.2010.5586506openalex-snapshot
Adversarial Evolution: Phase transition in non-uniform hard satisfiability problems
inferred← citeshttps://doi.org/10.1109/icacite60783.2024.10617114openalex-snapshot
Advanced Technological Improvements in Making of Smart Production Using AI and ML
inferred← citeshttps://doi.org/10.1109/iccis.2004.1460737openalex-snapshot
Interior coordination using case-based reasoning and constraint satisfaction paradigm
inferred← citeshttps://doi.org/10.1109/ictai.2017.00161openalex-snapshot
On Computing Generalized Backbones
inferred← citeshttps://doi.org/10.1109/intech64186.2025.11198335openalex-snapshot
Maximizing Employability Through AI and Media Technology: Enhancing English Language Communication Skills in Today's Technological Landscape
inferred← citeshttps://doi.org/10.1109/issre.2002.1173208openalex-snapshot
Saturation effects in testing of formal models
inferred← citeshttps://doi.org/10.1109/sew.2006.27openalex-snapshot
Qualitative Modeling for Requirements Engineering
inferred← citeshttps://doi.org/10.1109/tai.2000.889895openalex-snapshot
Local minimum structures of graph-coloring problems for stochastic constraint satisfaction algorithms
inferred← citeshttps://doi.org/10.1142/s1469026808002193openalex-snapshot
SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
inferred← citeshttps://doi.org/10.1145/1569901.1569952openalex-snapshot
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
inferred← citeshttps://doi.org/10.1145/3167132.3167230openalex-snapshot
A preference-based approach to backbone computation with application to argumentation
inferred← citeshttps://doi.org/10.1162/106365602317301763openalex-snapshot
Evolutionary Algorithms for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1162/evco.2006.14.4.433openalex-snapshot
Evolving Combinatorial Problem Instances That Are Difficult to Solve
inferred← citeshttps://doi.org/10.1201/b19572-13openalex-snapshot
References
inferred← citeshttps://doi.org/10.12944/carj.11.1.25openalex-snapshot
Impact of Artificial Intelligence in Agriculture with Special Reference to Agriculture Information Research
inferred← citeshttps://doi.org/10.14288/1.0051395openalex-snapshot
Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28652openalex-snapshot
Disjoint Partial Enumeration without Blocking Clauses
inferred← citeshttps://doi.org/10.1613/jair.1576openalex-snapshot
Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search
inferred← citeshttps://doi.org/10.1613/jair.2038openalex-snapshot
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
inferred← citeshttps://doi.org/10.18034/apjee.v6i2.542openalex-snapshot
How Artificial Intelligence Improves Agricultural Productivity and Sustainability: A Global Thematic Analysis
inferred← citeshttps://doi.org/10.18510/hssr.2019.75146openalex-snapshot
SCARY DARK SIDE OF ARTIFICIAL INTELLIGENCE: A PERILOUS CONTRIVANCE TO MANKIND
inferred← citeshttps://doi.org/10.21236/ada417171openalex-snapshot
Interactive Anticipatory Scheduling for Two Military Applications
inferred← citeshttps://doi.org/10.23880/art-16000116openalex-snapshot
Unveiling the Technological Tapestry: Exploring the Transformative Influence of AI and ML across Diverse Domains
inferred← citeshttps://doi.org/10.31166/voprosyistorii202602statyi05openalex-snapshot
ACTIVATING THE ROLE OF THE UNIVERSITIES OF SAUDI ARABIA IN THE RENAISSANCE AND THE DEVELOPMENT OF INTERDISCIPLINARY SCIENTIFIC RESEARCH BETWEEN VARIOUS HEALTH SCIENCES AND OTHERS USING ARTIFICIAL INTELLIGENCE: HISTORICAL AND PRACTICAL ASPECTS OF THE PROBLEM
inferred← citeshttps://doi.org/10.3233/kes-2005-9303openalex-snapshot
Stochastic local search for incremental SAT
inferred← citeshttps://doi.org/10.3390/e22050569openalex-snapshot
Uniquely Satisfiable d-Regular (k,s)-SAT Instances
inferred← citeshttps://doi.org/10.3390/su12020492openalex-snapshot
Artificial Intelligence and Machine Learning Applications in Smart Production: Progress, Trends, and Directions
inferred← citeshttps://doi.org/10.4018/978-1-6684-2443-8.ch004openalex-snapshot
Artificial Intelligence Technology and Applications in the Current Scenario
inferred← citeshttps://doi.org/10.46298/dmtcs.345openalex-snapshot
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
inferred← citeshttps://doi.org/10.5555/777092.777194openalex-snapshot
A mixture-model for the behaviour of SLS algorithms for SAT
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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.