A specific class of subsets of R^3 containing all algebraic sets admits minimum adapted CADs, giving the first positive existence theorem for such decompositions in dimension three.
hub Canonical reference
Thegreatestcommondivisor:acasestudy for program extraction from classical proofs
Canonical reference. 100% of citing Pith papers cite this work as background.
30
Pith papers citing it
Background
100% of classified citations
hub tools
citation-role summary
background 8
citation-polarity summary
roles
background 8polarities
background 8representative citing papers
2G2T enables constant-size, statistically sound outsourcing of MSM with verification up to 300x faster than local computation and error probability at most 1/q.
A simple deterministic algorithm sorts n items with m given comparisons in O(m + log T) time using O(log T) comparisons by combining topological sort, heapsort, and binary search.
Introduces the quantum instrument monad I_A as a strong monad for quantum effects, with finitary and measure-theoretic constructions based on a new integral notion.
Introduces the first intersection type system for a lambda calculus with algebraic effects and handlers that characterizes termination via subject reduction and expansion while inducing a sound simple type system with decidable HOMC.
A unified frequency framework and resonance-parity initialization scheme maps averaged equilibria to symmetric periodic orbits in the HR3BP and CR3BP, producing bifurcation diagrams that trace orbit families.
Authors constructed a bare-metal CPS VM called Encore! that runs Rocq-extracted Scheme on microcontrollers and demonstrated structuring firmware as a pure state-transition function whose core is fully provable in Rocq.
Introduces bPk# as a delegatable pseudonym system with a formal framework, generic construction with security proofs, concrete instantiation, and reference implementation for eID applications.
Small 7B reasoning models were fine-tuned on synthetic and curated QFT problems using RL and SFT, yielding performance gains, error analysis, and public release of data and traces.
Empirical integral operators with discontinuous non-negative symmetric kernels converge spectrally to their population versions with explicit rates as sample size grows to infinity.
New algorithm computes holonomic submodule of partial Weyl closure via non-commutative Rabinowitsch trick, implemented in Julia with reported speedups over Singular and Macaulay2.
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.
Proves equivalence of big-step and small-step Horn clause derivations and supplies a transformation to convert any clause set into one inheriting a chosen derivation behavior.
LLM-driven program mutation converges to restricted structural attractors, with 87% of chains showing over 93% structural revisits and most variation limited to terminal substitutions, unlike classical GP.
Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.
A prox-based semi-smooth Newton method for TV-minimization that is globally well-posed and locally superlinearly convergent under finite element discretization, extending to broader convex problems.
None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.
New isotopic data from presolar SiC grains are best reproduced by hydrodynamic models of CO novae, establishing them as the primary source for 1-2% of such grains.
k-contact geometry supplies explicit Hamiltonian descriptions for multiple dissipative PDEs including damped Klein-Gordon, Allen-Cahn, Fisher-KPP, and complex Ginzburg-Landau equations.
Bulk-edge correspondence for fractional quantum Hall systems is realized as relative higher gauge theory from the complex Hopf fibration, geometrically engineered via M2/M5-branes and TED Cohomotopy flux quantization.
WARM-VR provides a new public dataset of wristband and ECG signals from 31 people in VR stress-relaxation experiences with olfactory cues, plus baseline ML classification results for valence and arousal.
RLVR training raises verified Dafny pass rates from 9.7% to 31.1% on a filtered benchmark while a Lean proof scaffold lifts success from 46.2% to 69.2% on a pilot set and solves 7 of 42 prior unsolved tasks.
A template-based lemma generation method integrated into bounded rewriting induction for higher-order LCSTRSs enables proving program equivalences previously out of reach.
Fractional Verkle Trees decompose global state into N sub-accumulators with a coordinating Merkle tree, yielding faster root recomputation, lower memory use, and parallel insertion in blockchain state accumulators.
citing papers explorer
-
On Minimum CADs for Algebraic Sets in Dimension Three
A specific class of subsets of R^3 containing all algebraic sets admits minimum adapted CADs, giving the first positive existence theorem for such decompositions in dimension three.
-
2G2T: Constant-Size, Statistically Sound MSM Outsourcing
2G2T enables constant-size, statistically sound outsourcing of MSM with verification up to 300x faster than local computation and error probability at most 1/q.
-
Fast and Simple Sorting Using Partial Information
A simple deterministic algorithm sorts n items with m given comparisons in O(m + log T) time using O(log T) comparisons by combining topological sort, heapsort, and binary search.
-
The quantum instrument monad
Introduces the quantum instrument monad I_A as a strong monad for quantum effects, with finitary and measure-theoretic constructions based on a new integral notion.
-
When Types Intersect and Effects Get Handled
Introduces the first intersection type system for a lambda calculus with algebraic effects and handlers that characterizes termination via subject reduction and expansion while inducing a sound simple type system with decidable HOMC.
-
Linking Averaged and Unaveraged Three-Body Dynamics Near Smaller Primaries: Symmetric Periodic Orbits
A unified frequency framework and resonance-parity initialization scheme maps averaged equilibria to symmetric periodic orbits in the HR3BP and CR3BP, producing bifurcation diagrams that trace orbit families.
-
From Rocq to Metal: A Pipeline for Formally Verified Microcontroller Firmware
Authors constructed a bare-metal CPS VM called Encore! that runs Rocq-extracted Scheme on microcontrollers and demonstrated structuring firmware as a pure state-transition function whose core is fully provable in Rocq.
-
bpK#: Delegatable Pseudonyms And Their Applications to National eID Systems
Introduces bPk# as a delegatable pseudonym system with a formal framework, generic construction with security proofs, concrete instantiation, and reference implementation for eID applications.
-
Fine-Tuning Small Reasoning Models for Quantum Field Theory
Small 7B reasoning models were fine-tuned on synthetic and curated QFT problems using RL and SFT, yielding performance gains, error analysis, and public release of data and traces.
-
Spectral convergence of empirical integral operators with discontinuous kernels
Empirical integral operators with discontinuous non-negative symmetric kernels converge spectrally to their population versions with explicit rates as sample size grows to infinity.
-
Computing a holonomic submodule of the partial Weyl closure
New algorithm computes holonomic submodule of partial Weyl closure via non-commutative Rabinowitsch trick, implemented in Julia with reported speedups over Singular and Macaulay2.
-
Waiting Nets: State Classes and Taxonomy
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.
-
Big-step and small-step Horn clause derivations applied to operational semantics
Proves equivalence of big-step and small-step Horn clause derivations and supplies a transformation to convert any clause set into one inheriting a chosen derivation behavior.
-
Mutation Without Variation: Convergence Dynamics in LLM-Driven Program Evolution
LLM-driven program mutation converges to restricted structural attractors, with 87% of chains showing over 93% structural revisits and most variation limited to terminal substitutions, unlike classical GP.
-
Automating Formal Verification with Agent-Guided Tree Search
Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.
-
A $\operatorname{prox}$-Based Semi-Smooth Newton Method for TV-Minimization
A prox-based semi-smooth Newton method for TV-minimization that is globally well-posed and locally superlinearly convergent under finite element discretization, extending to broader convex problems.
-
On the Limits of Recursive Characterizations in the Refined $A$-Translation
None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.
-
New NanoSIMS Multielement Isotope Data Reveal CO Novae As Key Sources Of 13C-rich Presolar Silicon Carbide Grains
New isotopic data from presolar SiC grains are best reproduced by hydrodynamic models of CO novae, establishing them as the primary source for 1-2% of such grains.
-
A Guide to Applications of $k$-Contact Geometry in Dissipative Field Equations
k-contact geometry supplies explicit Hamiltonian descriptions for multiple dissipative PDEs including damped Klein-Gordon, Allen-Cahn, Fisher-KPP, and complex Ginzburg-Landau equations.
-
Bulk-Edge Correspondence via Higher Gauge Theory
Bulk-edge correspondence for fractional quantum Hall systems is realized as relative higher gauge theory from the complex Hopf fibration, geometrically engineered via M2/M5-branes and TED Cohomotopy flux quantization.
-
Introducing WARM-VR: Benchmark Dataset for Multimodal Wearable Affect Recognition in Virtual Reality
WARM-VR provides a new public dataset of wristband and ECG signals from 31 people in VR stress-relaxation experiences with olfactory cues, plus baseline ML classification results for valence and arousal.
-
Automating Formal Verification with Reinforcement Learning and Recursive Inference
RLVR training raises verified Dafny pass rates from 9.7% to 31.1% on a filtered benchmark while a Lean proof scaffold lifts success from 46.2% to 69.2% on a pilot set and solves 7 of 42 prior unsolved tasks.
-
Templates in Rewriting Induction
A template-based lemma generation method integrated into bounded rewriting induction for higher-order LCSTRSs enables proving program equivalences previously out of reach.
-
Fractional Verkle Trees: A Hypertree Decomposition and Verified Proof Serialization Architecture for High-Performance Blockchain State Accumulators
Fractional Verkle Trees decompose global state into N sub-accumulators with a coordinating Merkle tree, yielding faster root recomputation, lower memory use, and parallel insertion in blockchain state accumulators.
-
On the Counting Sequence of Z-convex Polyominoes
Presents formulas and a C++ implementation to extend the enumeration sequence of Z-convex polyominoes by area beyond prior records.
-
Choosing the Right Regularizer for Applied ML: Simulation Benchmarks of Popular Scikit-learn Regularization Frameworks
Simulations show Ridge, Lasso, and ElasticNet perform similarly for prediction at high sample-to-feature ratios, but Lasso feature selection recall drops to 0.18 under high multicollinearity and low SNR while ElasticNet holds at 0.93.
-
Is Lindblad for me?
A review that contrasts common assumptions about the Lindblad equation with refined expectations drawn from examples, culminating in a checklist for assessing its breakdown.
-
Quantum Thermodynamics
Lecture notes on quantum thermodynamics showing emergence of thermodynamic laws from quantum theory via Markovian master equations for small systems.
-
String Covering: A Survey
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
- Soft-to-Hard Routing in Sparse Mixture-of-Experts Models