Reference health
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability
11/11 checkable references clean · checked 2026-07-23
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
38 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 11 checked references that resolve
resolves10.1103/PhysRevLett.88.188701
Hiding Solutions in Random Satisfiability Problems: A Statistical Mechanics Approach
resolves10.1038/s41598-020-76666-2
Efficient solution of Boolean satisfiability problems with digital memcomputing
resolves10.1109/TCYB.2014.2343242
Clause States Based Configuration Checking in Local Search for Satisfiability
resolves10.1016/j.artint.2013.09.001
Local search for Boolean Satisfiability with configuration checking and subscore
resolves10.1007/s10462-018-9628-0
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
resolves10.1016/j.biosystems.2019.02.013
Fault detection and therapeutic intervention in gene regulatory networks using SAT solvers
resolves10.1126/science.264.5163.1297
Critical Behavior in the Satisfiability of Random Boolean Expressions
resolves10.1016/j.ins.2018.08.052
Towards faster local search for minimum weight vertex cover on massive graphs
resolves10.1109/TCYB.2016.2556742
Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems
resolves10.1016/j.entcs.2007.08.008
Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver
The 38 references without a DOI — listed, not checked
no DOI — not checkedRandom satisfiability
no DOI — not checked10.1016/j.ins.2021.03.009_b0010
no DOI — not checkedAlgorithms for the satisfiability (SAT) problem: a survey
no DOI — not checkedImproving stochastic local search for sat with a new probability distribution
no DOI — not checkedChoosing probability distributions for stochastic local search and the role of make versus break
no DOI — not checkedProbSAT
no DOI — not checkedSparrowToRiss
no DOI — not checkedStochastic local search for Partial Max-SAT: an experimental evaluation
no DOI — not checkedUsing algorithm configuration tools to generate hard SAT benchmarks
no DOI — not checkedCadical, lingeling, plingeling, treengeling and yalsat entering the sat competition 2017
no DOI — not checkedCCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
no DOI — not checkedScore2SAT: Solver description
no DOI — not checkedWeight-enhanced diversification in stochastic local search for satisfiability
no DOI — not checked10.1016/j.ins.2021.03.009_b0105
no DOI — not checkedDimetheus
no DOI — not checkedAn adaptive noise mechanism for WalkSAT
no DOI — not checkedMore efficient stochastic local search for satisfiability
no DOI — not checkedScaling and probabilistic smoothing: efficient dynamic local search for SAT
no DOI — not checkedCADICAL at the SAT Race 2019
no DOI — not checkedCoReS: a tool for computing core graphs via SAT/SMT solvers
no DOI — not checkedAn empirical study of optimal noise and runtime distributions in local search
no DOI — not checkedSatisfying versus falsifying in local search for satisfiability - (poster presentation)
no DOI — not checkedDiversification and determinism in local search for satisfiability
no DOI — not checkedLearning rate based branching heuristic for sat solvers
no DOI — not checkedAn empirical study of branching heuristics through the lens of global learning rate
no DOI — not checkedDouble configuration checking in stochastic local search for satisfiability
no DOI — not checkedCSCCSat2014
no DOI — not checkedDCCAlm
no DOI — not checkedCCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Extended Abstract)
no DOI — not checkedApril). FourierSAT: A fourier expansion-based algebraic framework for solving hybrid boolean constraints
no DOI — not checkedCoprocessor 2.0: a flexible cnf simplifier
no DOI — not checkedHard and easy distributions of SAT problems
no DOI — not checkedGluHack
no DOI — not checkedMapleLCMDistChronoBT
no DOI — not checkedNoise strategies for improving local search
no DOI — not checkedStochastic search and phase transitions: AI meets physics
no DOI — not checkedClause weighting local search for SAT
no DOI — not checkedAn efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-23 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1016/j.ins.2021.03.009"><img src="https://citestamp.com/citestamped/10.1016/j.ins.2021.03.009/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1016/j.ins.2021.03.009)