archive
Every paper Pith has read. Search by title, abstract, or pith.
83 papers in cs.SC · page 1
-
JOIN and UNION operators make IPC simulation extensible at competitive speed
YASPS: A Symbolic Framework for Extensible, High-Performance IPC Simulation
-
Algorithm reduces composable polynomials to polynomial-time solving
A Symbolic Homotopy Algorithm for Solving Composable Polynomial Systems
-
Compiler turns programs into exact neural modules
The Neural Compiler: Program-to-Network Translation for Hybrid Scientific Machine Learning
-
Data-driven method yields soil flow functions that beat classic model on 249 samples
Graph-based automated discovery of concise soil hydraulic functions from data: beyond the Mualem - van Genuchten model
-
Algorithm produces certificates for univariate quadratic modules
Computing Certificates in Archimedean Univariate Saturated Quadratic Modules
-
Readable programs match deep RL on job scheduling benchmarks
Scheduling That Speaks: An Interpretable Programmatic Reinforcement Learning Framework
-
Sample points found in all components of one-inequality sets
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
-
Probabilistic algorithm samples semi-algebraic components at cubic Bézout cost
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
-
Toom-4 outperforms Karatsuba in specific incomplete-NTT ranges
Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography
-
Neural pre-extraction recovers 36 of 75 complex symbolic equations
FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
-
Framework generates conjectures on QAOA parameters from graph invariants
SCALAR: A Neurosymbolic Framework for Automated Conjecture and Reasoning in Quantum Circuit Analysis
-
AutoSINDy recovers true dynamics in 92.8 percent of noisy trials
Discovery of Nonlinear Dynamics with Automated Basis Function Generation
-
Polynomial matrix equals Smith form when minors generate unit ideal
Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices
-
Algorithm computes Hermite form of relation lattices at matrix mult cost
Computing bases in Hermite normal form of lattices of integer relations
-
LLM multi-agent system recovers ODEs more accurately
Discovering Ordinary Differential Equations with LLM-Based Qualitative and Quantitative Evaluation
-
Right-hand side regularity fixes ODE solving difficulty
Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
-
Logarithms triple the fraction of integrable expressions
Exhaustive Symbolic Integration: Integration by Differentiation and the Landscape of Symbolic Integrability
-
Pretrained model induces rules zero-shot for new domains
A Foundation Model for Zero-Shot Logical Rule Induction
-
Minimum adapted CAD exists for class of sets in R^3
On Minimum CADs for Algebraic Sets in Dimension Three
-
Model finds human-like programs for jazz chords
Library learning with e-graphs on jazz harmony
-
Deep Transformers match explicit reasoning without steps
The Scaling Properties of Implicit Deductive Reasoning in Transformers
-
Zorya detects seven bugs in gc Go binaries
From TinyGo to gc Compiler: Extending Zorya's Concolic Framework to Real-World Go Binaries
-
Zorya detects seven bugs in real-world Go binaries
From TinyGo to gc Compiler: Extending Zorya's Concolic Framework to Real-World Go Binaries
-
LCM-lattice density in random monomial ideals jumps at sharp thresholds
Asymptotic properties of random monomial ideals
-
Order-3 Möbius map splits cube-root integrals into elementary and elliptic pieces
A Generalisation of Goursat's Algorithm for Integration in Finite Terms
-
Orthogonal polynomial series recurrences are operator fractions
Fractions of Recurrence Operators for Generalized Fourier Series in Classical Orthogonal Polynomials
-
Neuro-symbolic agents synthesize rules for novel task combinations
AGEL-Comp: A Neuro-Symbolic Framework for Compositional Generalization in Interactive Agents
-
Complex quantifier elimination reduces to real QE plus heuristic reinterpretation
Pseudo-Complex Quantifier Elimination
-
Haskell package manipulates tree and graph algebras symbolically
Arboretum.hs: Symbolic manipulation for algebras of graphs
-
Hybrid method gives complete check for quantum circuit equivalence
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
-
Super-DeepG refines linear relaxation and Lipschitz techniques to certify neural network…
Certified geometric robustness -- Super-DeepG
-
Context filters on facts lift medical QA accuracy by 1.4 points
Quantum Knowledge Graph: Modeling Context-Dependent Triplet Validity
-
EML operator carries abelian group and inverse structure
Algebraic structure behind Odrzywo{\l}ek's EML operator
-
Multiple equations let CAD quantifier elimination partition parameters finely
Enhanced CAD-Based Quantifier Elimination With Multiple Equational Constraints
-
Tree architecture decides which formulas gradient descent recovers
Architecture-Induced Recoverability Bias in Differentiable Symbolic Regression
-
Binary analysis infers test equivalence classes from legacy firmware
Inferring Equivalence Classes from Legacy Undocumented Embedded Binaries for ISO 26262-Compliant Testing
-
Probabilistic model recognizes goals via hierarchical task networks
A Probabilistic Framework for Hierarchical Goal Recognition
-
One MaxSAT solver handles 11 optimization problem types
A general optimization solver based on OP-to-MaxSAT reduction
-
New package computes path signature tensors in Julia
SignatureTensors.jl: A Package for Signature Tensors in Julia
-
Cutoff theorem bounds verification search for DSLTrans properties
Tractable Verification of Model Transformations: A Cutoff-Theorem Approach for DSLTrans
-
Hybrid method yields tightening lower bounds on stochastic satisfaction
Solving Stochastic Constraints by Oracle-based Gradient Descent and Interval Arithmetic
-
The paper introduces Latent Grammar Flow
Neuro-Symbolic ODE Discovery with Latent Grammar Flow
-
Graded checks find protocol failures missed by binary verification
Graded Symbolic Verification with a Fuzzy Dolev-Yao Attacker Model
-
Constraint solver matches patients to 32-72% more trials
SatIR: Scalable High-Recall Constraint-Satisfaction-Based Information Retrieval for Clinical Trials Matching
-
Benchmarks guide MATLAB backend choice for multivariate polynomials
Polylab: A MATLAB Toolbox for Multivariate Polynomial Modeling
-
Fraction is a category of concepts
On Ambiguity: The case of fraction, its meanings and roles
-
One operator generates all elementary functions from 1
All elementary functions from a single binary operator
-
Self-supervised model reaches 100% simplification on 5-point gluon amplitudes
Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories
-
Parallel multimodular algebra skips big integers in circuit verification
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits
-
ABD is a benchmark that challenges models to output sparse first-order formulas defining…
ABD: Default Exception Abduction in Finite First Order Worlds