Tootfinder

Varanus: Runtime Verification for CSP
Matt Luckcuck, Angelo Ferrando, Fatma Faruq
https://arxiv.org/abs/2506.14426 https://arxiv.org/…

Varanus: Runtime Verification for CSP
Autonomous systems are often used in changeable and unknown environments, where traditional verification may not be suitable. Runtime Verification (RV) checks events performed by a system against a formal specification of its intended behaviour, making it highly suitable for ensuring that an autonomous system is obeying its specification at runtime. Communicating Sequential Processes (CSP) is a process algebra usually used in static verification, which captures behaviour as a trace of events, m…

Tight Bounds for Sparsifying Random CSPs
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman
https://arxiv.org/abs/2508.13345 https://arxiv.org/pdf/25…

Tight Bounds for Sparsifying Random CSPs
The problem of CSP sparsification asks: for a given CSP instance, what is the sparsest possible reweighting such that for every possible assignment to the instance, the number of satisfied constraints is preserved up to a factor of $1 \pm ε$? We initiate the study of the sparsification of random CSPs. In particular, we consider two natural random models: the $r$-partite model and the uniform model. In the $r$-partite model, CSPs are formed by partitioning the variables into $r$ parts, with con…

The Richness of CSP Non-redundancy
Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, Magnus Wahlstr\"om
https://arxiv.org/abs/2507.07942

The Richness of CSP Non-redundancy
In the field of constraint satisfaction problems (CSP), a clause is called redundant if its satisfaction is implied by satisfying all other clauses. An instance of CSP$(P)$ is called non-redundant if it does not contain any redundant clause. The non-redundancy (NRD) of a predicate $P$ is the maximum number of clauses in a non-redundant instance of CSP$(P)$, as a function of the number of variables $n$. Recent progress has shown that non-redundancy is crucially linked to many other important que…

The Constraint Satisfaction Problem Over Multisorted Cores
Dejan Delic, John Marcoux
https://arxiv.org/abs/2508.11540 https://arxiv.org/pdf/2508.11540

The Constraint Satisfaction Problem Over Multisorted Cores
Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain {0,1} is either in P or is NP-complete. More recently this was shown to hold for all CSPs over finite relational structures independently by Bulatov and Zhuk. Furthermore, they characterized the complexity based solely on the polymorphism algebra of the assoc…

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar
https://arxiv.org/abs/2507.10833 https:/…

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
We present a family of algorithms to solve random planted instances of any $k$-ary Boolean constraint satisfaction problem (CSP). A randomly planted instance of a Boolean CSP is generated by (1) choosing an arbitrary planted assignment $x^*$, and then (2) sampling constraints from a particular "planting distribution" designed so that $x^*$ will satisfy every constraint. Given an $n$ variable instance of a $k$-ary Boolean CSP with $m$ constraints, our algorithm runs in time $n^{O(\ell)}$ for a c…

Substitutions of variables are finitely axiomatizable over quantifications and permutations
Hajnal Andr\'eka, Zal\'an Gyenis, Istv\'an N\'emeti
https://arxiv.org/abs/2506.12458

Substitutions of variables are finitely axiomatizable over quantifications and permutations
This paper proves that the equational theory of the class $RA_α^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_α^{cp}$, for finite $α$. That is, substitutions of variables in finite variable first-order logic can be described by finitely many axioms over the Boolean operations, existential quantifiers and permutations of variables.

I'm up to 109,977 CSP points, 87,182 United Miles, 30,000 Hyatt Bonus Rewards, and 102,218 Venture X miles. (It's the power of the Welcome Bonus.) By the end of the year, I want to get Hyatt up to 60,000 and then I should be able to cover hotels on the CSP and Hyatt points and cover airfare on the other two for two weeks in Japan. I'm travel-hacking the shit out of my 2026 trip.
#Travel #TravelHacking #CreditCardPoints

Effective viscosity closures for dense suspensions in CSP systems via lubrication-enhanced DNS and numerical viscometry
Raphael M\"unster, Otto Mierka, Dmitri Kuzmin, Stefan Turek
https://arxiv.org/abs/2506.22873

Effective viscosity closures for dense suspensions in CSP systems via lubrication-enhanced DNS and numerical viscometry
Dense particle suspensions are promising candidates for next-generation Concentrated Solar Power (CSP) receivers, enabling operating temperatures above 800 degrees C. However, accurate modeling of the rheological behavior of granular flows is essential for reliable computational fluid dynamics (CFD) simulations. In this study, we develop and assess numerical methodologies for simulating dense suspensions pertinent to CSP applications. Our computational framework is based on Direct Numerical Sim…

Proof complexity of Mal'tsev CSP
Azza Gaysin
https://arxiv.org/abs/2508.00396 https://arxiv.org/pdf/2508.00396

Proof complexity of Mal'tsev CSP
Constraint Satisfaction Problems (CSPs) form a broad class of combinatorial problems, which can be formulated as homomorphism problems between relational structures. The CSP dichotomy theorem classifies all such problems over finite domains into two categories: NP-complete and polynomial-time, see Zhuk (2017), Bulatov (2017). Polynomial-time CSPs can be further subdivided into smaller subclasses. Mal'tsev CSPs are defined by the property that every relation in the problem is invariant under a M…

Toward Routine CSP of Pharmaceuticals: A Fully Automated Protocol Using Neural Network Potentials
Zachary L. Glick, Derek P. Metcalf, Scott F. Swarthout
https://arxiv.org/abs/2507.16218

Toward Routine CSP of Pharmaceuticals: A Fully Automated Protocol Using Neural Network Potentials
Crystal structure prediction (CSP) is a useful tool in pharmaceutical development for identifying and assessing risks associated with polymorphism, yet widespread adoption has been hindered by high computational costs and the need for both manual specification and expert knowledge to achieve useful results. Here, we introduce a fully automated, high-throughput CSP protocol designed to overcome these barriers. The protocol's efficiency is driven by Lavo-NN, a novel neural network potential (NNP)…

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan
https://arxiv.org/abs/2507.22265 https:…

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
A recent work (Korten, Pitassi, and Impagliazzo, FOCS 2025) established an insightful connection between static data structure lower bounds, range avoidance of $\text{NC}^0$ circuits, and the refutation of pseudorandom CSP instances, leading to improvements to some longstanding lower bounds in the cell-probe/bit-probe models. Here, we improve these lower bounds in certain cases via a more streamlined reduction to XOR refutation, coupled with handling the odd-arity case. Our result can be viewed…

This https://arxiv.org/abs/2210.07383 has been replaced.
link: https://scholar.google.com/scholar?q=a

Notes on CSPs and Polymorphisms
These are notes from a multi-year learning seminar on the algebraic approach to Constraint Satisfaction Problems (CSPs). The main topics covered are the theory of algebraic structures with few subpowers, the theory of absorbing subalgebras and its applications to studying CSP templates which can be solved by local consistency methods, and the dichotomy theorem for conservative CSP templates. Subsections and appendices cover supplementary material.

FastCSP: Accelerated Molecular Crystal Structure Prediction with Universal Model for Atoms
Vahe Gharakhanyan, Yi Yang, Luis Barroso-Luque, Muhammed Shuaibi, Daniel S. Levine, Kyle Michel, Viachaslau Bernat, Misko Dzamba, Xiang Fu, Meng Gao, Xingyu Liu, Keian Noori, Lafe J. Purvis, Tingling Rao, Brandon M. Wood, Ammar Rizvi, Matt Uyttendaele, Andrew J. Ouderkirk, Chiara Daraio, C. Lawrence Zitnick, Arman Boromand, Noa Marom, Zachary W. Ulissi, Anuroop Sriram

FastCSP: Accelerated Molecular Crystal Structure Prediction with Universal Model for Atoms
Crystal Structure Prediction (CSP) of molecular crystals plays a central role in applications, such as pharmaceuticals and organic electronics. CSP is challenging and computationally expensive due to the need to explore a large search space with sufficient accuracy to capture energy differences of a few kJ/mol between polymorphs. Dispersion-inclusive density functional theory (DFT) provides the required accuracy but its computational cost is impractical for a large number of putative structures…

Heliostat Optical Error Inspection with Polarimetric Imaging Drone
Mo Tian, Kolappan Chidambaranathan, Md Zubair Ebne Rafique, Neel Desai, Jing Bai, Randy Brost, Daniel Small, David Novick, Julius Yellowhair, Yu Yao
https://arxiv.org/abs/2506.02333

Heliostat Optical Error Inspection with Polarimetric Imaging Drone
On a Concentrated Solar Power (CSP) field, optical errors have significant impacts on the collection efficiency of heliostats. Fast, cost-effective, labor-efficient, and non-intrusive autonomous field inspection remains a challenge. Approaches using imaging drone, i.e., Unmanned Aerial Vehicle (UAV) system integrated with high resolution visible imaging sensors, have been developed to address these challenges; however, these approaches are often limited by insufficient imaging contrast. Here we…

This https://arxiv.org/abs/2505.07872 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNI_…

Revenue Optimization in Video Caching Networks with Privacy-Preserving Demand Predictions
Performance of video streaming, which accounts for most of the traffic in wireless communication, can be significantly improved by caching popular videos at the wireless edge. Determining the cache content that optimizes performance (defined via a revenue function) is thus an important task, and prediction of the future demands based on past history can make this process much more efficient. However, since practical video caching networks involve various parties (e.g., users, isp, and csp) that…

This https://arxiv.org/abs/2501.01643 has been replaced.
initial toot: https://mastoxiv.page/@arX…

A Polarimetry-based Field-deployable Non-interruptive Mirror Soiling Detection Method
The soiling level of heliostat mirrors in Concentrated Solar Power (CSP) fields is one of the key factors that significantly influences optical efficiency. State-of-the-art methods of monitoring heliostats soiling levels still face various challenges, including slow speed, labor-intensive operations, resolution and accuracy constraints or interruptions to solar field operations. We present a rapid, cost-effective, and non-intrusive method for mirror soiling detection based on polarimetric imagi…

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs
Venkatesan Guruswami, Xuandi Ren, Kewen Wu
https://arxiv.org/abs/2507.01192

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs
The Reconfiguration Inapproximability Hypothesis (RIH), recently established by Hirahara-Ohsaka (STOC'24) and Karthik-Manurangsi (ECCC'24), studies the hardness of reconfiguring one solution into another in constraint satisfaction problems (CSP) when restricted to approximate intermediate solutions. In this work, we make a tighter connection between RIH's soundness gap and that of probabilistically checkable proofs of proximity (PCPP). Consequently, we achieve an improved trade-off between soun…