k-REWB matching cannot be solved in O(n to the 2k minus epsilon) time under SETH, is W[2]-hard parameterized by expression length, and 2-use 2-REWBs require superlinear time unless triangle detection does; 1-use REWBs admit an O(n log squared n) algorithm.
hub Canonical reference
The Theory of Industrial Organization
Canonical reference. 100% of citing Pith papers cite this work as background.
34
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
Deciding DFA primality is NP-hard, established by reduction from propositional satisfiability using a characterization of primality for a relevant class of automata.
Introduces the binning semiring and causal graphical models to show that correlational evaluation of learnability in formal language tasks leads to incorrect conclusions from confounders.
CyberEvolver introduces a four-layer self-evolving agent architecture with trace-to-diagnosis and population beam search that raises seed agent success rates by 13.6% on CTF, exploitation, and penetration tasks across four LLMs.
Local attention in fixed-precision transformers introduces a second past operator in linear temporal logic, strictly increasing expressivity over global attention alone, with hybrids being most expressive.
TouchPort collapses the multi-stage process of discovering, consenting to, and syncing mixed reality encounters into one embodied handshake-and-pull gesture.
A compiler automatically derives pruning and inclusion conditions for tree traversals, enabling generated filters, reductions, and non-equijoins that match expert-written code.
Local retail concentration increased almost as much as national concentration from 1992 to 2012, mainly from multi-market firm expansion, and accounts for one-quarter to one-third of the rise in retail gross margins.
Introduces Λ-lr-QAOA and piecewise-ramp QAOA that promote penalty schedules to variational parameters and use a feasibility-driven loss on budget-constrained MWIS satellite planning instances.
Enforcing semilinearity via local stencil-scale normalization and training on polynomial profiles produces stable, generalizable neural advection schemes with a new flux limiter that improves shape preservation over OSTVD3.
Boundary mixed steady states in networked evolutionary games are characterized by boundary Nash equilibria in two-strategy cases and are generically unstable unless degenerate due to interaction structure among mixed players.
FLaG is a frequency-domain module using FFT, latent queries, and gating that improves token aggregation and shows gains on ESM2 AMP prediction and CIFAR-100 image classification while staying competitive on text tasks.
Agentic Redux claims provably correct LLM agent executions on suitable domains via typed lambda calculus with full decision logging, demonstrated on healthcare compliance and security disclosure with supporting code.
Variational free-energy descent under exponential-family posteriors and priors recovers predictive-coding dynamics up to the second posterior cumulant, with local learning rules and nonlinear heterogeneous activations.
TRACER combines a controller-regret layer using regret matching for speak/skip decisions with a generation-credit layer using GSPO rewards to enable learned collaboration in multi-LLM reasoning.
EnactToM is an evolving benchmark of embodied multi-agent tasks that tests functional Theory of Mind by requiring agents to act optimally on implicit beliefs in partially observable 3D environments.
The study proposes the Gradual Voluntary Participation (GVP) framework to reconceptualize participatory AI governance in journalism as a gradual and voluntary process using a bidimensional matrix.
SimpleTES scales test-time evaluation in LLMs to discover state-of-the-art solutions on 21 scientific problems across six domains, outperforming frontier models and optimization pipelines with examples like 2x faster LASSO and new Erdos constructions.
Transferring modern encoders to normalized (lowercased) vocabularies via geometric embedding initialization and activation calibration closes the performance gap in learned sparse retrieval, achieving 52.4 nDCG on BEIR.
Raven automates Scratch program assessment by having instructors specify task-level video generation rules and using LLMs to analyze resulting videos for behavioral compliance, outperforming prior tools on real student submissions.
The authors instantiate a generalized-Fano framework using squared Hellinger distance to derive explicit Bayesian CVaR lower bounds for interactive decision problems including Gaussian bandits.
Checksum Count Vectors enable robust similarity search to identify duplicate and variant legacy media recordings with high accuracy despite substantial data damage.
Hierarchy-informed curricular optimization of heterogeneous whole-brain models enables generalization to new subjects and prediction of behavioral abilities from parameters.
A conceptual model proposes representing LLM workflow definitions, instances, and inference records as persistent typed objects in a shared knowledge substrate, distinguishing deterministic derive from LLM-mediated infer.
citing papers explorer
-
On the Complexity of the Matching Problem of Regular Expressions with Backreferences
k-REWB matching cannot be solved in O(n to the 2k minus epsilon) time under SETH, is W[2]-hard parameterized by expression length, and 2-use 2-REWBs require superlinear time unless triangle detection does; 1-use REWBs admit an O(n log squared n) algorithm.
-
Deciding DFA-Primality is NP-Hard
Deciding DFA primality is NP-hard, established by reduction from propositional satisfiability using a characterization of primality for a relevant class of automata.
-
Causally Evaluating the Learnability of Formal Language Tasks
Introduces the binning semiring and causal graphical models to show that correlational evaluation of learnability in formal language tasks leads to incorrect conclusions from confounders.
-
CyberEvolver: Structured Self-Evolution for Cybersecurity Agents On the Fly
CyberEvolver introduces a four-layer self-evolving agent architecture with trace-to-diagnosis and population beam search that raises seed agent success rates by 13.6% on CTF, exploitation, and penetration tasks across four LLMs.
-
Characterizing the Expressivity of Local Attention in Transformers
Local attention in fixed-precision transformers introduces a second past operator in linear temporal logic, strictly increasing expressivity over global attention alone, with hybrids being most expressive.
-
Allow Me Into Your Dream: A Handshake-and-Pull Protocol for Sharing Mixed Realities in Spontaneous Encounters
TouchPort collapses the multi-stage process of discovering, consenting to, and syncing mixed reality encounters into one embodied handshake-and-pull gesture.
-
Bonsai: Compiling Queries to Pruned Tree Traversals
A compiler automatically derives pruning and inclusion conditions for tree traversals, enabling generated filters, reductions, and non-equijoins that match expert-written code.
-
The Evolution of U.S. Retail Concentration
Local retail concentration increased almost as much as national concentration from 1992 to 2012, mainly from multi-market firm expansion, and accounts for one-quarter to one-third of the rise in retail gross margins.
-
Feasibility-driven QAOA with penalty scheduling
Introduces Λ-lr-QAOA and piecewise-ramp QAOA that promote penalty schedules to variational parameters and use a feasibility-driven loss on budget-constrained MWIS satellite planning instances.
-
Design principles for stable and generalizable data-driven discretizations for solving linear hyperbolic conservation laws
Enforcing semilinearity via local stencil-scale normalization and training on polynomial profiles produces stable, generalizable neural advection schemes with a new flux limiter that improves shape preservation over OSTVD3.
-
On the Structure and Stability of Boundary Mixed Steady States in Evolutionary Games on Networks
Boundary mixed steady states in networked evolutionary games are characterized by boundary Nash equilibria in two-strategy cases and are generically unstable unless degenerate due to interaction structure among mixed players.
-
Frequency-Domain Latent Attention Gating for Cross-Domain Token Aggregation
FLaG is a frequency-domain module using FFT, latent queries, and gating that improves token aggregation and shows gains on ESM2 AMP prediction and CIFAR-100 image classification while staying competitive on text tasks.
-
Provably Auditable and Safe LLM Agents from Human-Authored Ontologies
Agentic Redux claims provably correct LLM agent executions on suitable domains via typed lambda calculus with full decision logging, demonstrated on healthcare compliance and security disclosure with supporting code.
-
Extended predictive coding framework as variational free-energy minimisation under exponential-family assumption
Variational free-energy descent under exponential-family posteriors and priors recovers predictive-coding dynamics up to the second posterior cumulant, with local learning rules and nonlinear heterogeneous activations.
-
TRACER: Turn-level Regret Matching with Inner Reinforcement Credit for Cooperative Multi-LLM Reasoning
TRACER combines a controller-regret layer using regret matching for speak/skip decisions with a generation-credit layer using GSPO rewards to enable learned collaboration in multi-LLM reasoning.
-
EnactToM: An Evolving Benchmark for Functional Theory of Mind in Embodied Agents
EnactToM is an evolving benchmark of embodied multi-agent tasks that tests functional Theory of Mind by requiring agents to act optimally on implicit beliefs in partially observable 3D environments.
-
Gradual Voluntary Participation: A Framework for Participatory AI Governance in Journalism
The study proposes the Gradual Voluntary Participation (GVP) framework to reconceptualize participatory AI governance in journalism as a gradual and voluntary process using a bidimensional matrix.
-
Evaluation-driven Scaling for Scientific Discovery
SimpleTES scales test-time evaluation in LLMs to discover state-of-the-art solutions on 21 scientific problems across six domains, outperforming frontier models and optimization pipelines with examples like 2x faster LASSO and new Erdos constructions.
-
Why Advanced Encoders Lag on Sparse Retrieval? The Answer and an Approach to Bridging Vocabulary Gaps
Transferring modern encoders to normalized (lowercased) vocabularies via geometric embedding initialization and activation calibration closes the performance gap in learned sparse retrieval, achieving 52.4 nDCG on BEIR.
-
Raven: Rethinking Automated Assessment for Scratch Programs via Video-Grounded Evaluation
Raven automates Scratch program assessment by having instructors specify task-level video generation rules and using LLMs to analyze resulting videos for behavioral compliance, outperforming prior tools on real student submissions.
-
Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems
The authors instantiate a generalized-Fano framework using squared Hellinger distance to derive explicit Bayesian CVaR lower bounds for interactive decision problems including Gaussian bandits.
-
Prints in the Magnetic Dust: Robust Similarity Search in Legacy Media Images Using Checksum Count Vectors
Checksum Count Vectors enable robust similarity search to identify duplicate and variant legacy media recordings with high accuracy despite substantial data damage.
-
Evolution With Purpose: Hierarchy-Informed Optimization of Whole-Brain Models
Hierarchy-informed curricular optimization of heterogeneous whole-brain models enables generalization to new subjects and prediction of behavioral abilities from parameters.
-
Workflow as Knowledge: Semantic Persistence for LLM-Mediated Workflows
A conceptual model proposes representing LLM workflow definitions, instances, and inference records as persistent typed objects in a shared knowledge substrate, distinguishing deterministic derive from LLM-mediated infer.
-
Bayesian Joint Estimation of the Hurst Parameter and Volatility with Applications to Fractional Option Pricing
Bayesian joint estimation of Hurst parameter and volatility in fractional SDE models is developed to propagate parameter uncertainty into fractional Black-Scholes option prices.
-
Grounding Text Embeddings in Stakeholder Associations
The Stakeholder Grounding Exercise shows neural text embeddings are 19-26pp less reliable than human experts at capturing semantic distinctions, with misalignment strongly correlated to poorer clustering performance (ρ=0.9), replicated across Danish policy and US AI domains.
-
Toward Natural and Companionable Virtual Agents via Cross-Temporal Emotional Modeling
CTEM framework links behavioral history to evolving emotional states with user feedback updates, instantiated as Auri agent and tested in a 21-day study showing gains in naturalness, coherence, and emotional harmony.
-
Developing an AI Concept Envisioning Toolkit to Support Reflective Juxtaposition of Values and Harms
A new toolkit with cards and maps enables AI designers to juxtapose values and harms in early concept stages, shown valuable in designer surveys and interviews.
-
Increasing Resilience of Continuum Robots via Motion Planning Algorithms
Genetic algorithm with AHP produces more diverse paths than A* whose runtime is independent of environment size, claimed to increase continuum robot resilience in two simulated settings.
-
Practitioners At The Limit: Bereavement, Mockery and Ideology in Response to Crisis
Software practitioners are unaligning from technocapitalism through mockery, Luddism, labor organizing, and interest in anarchism and communism.
-
Towards Robust Arabic Speech Emotion Recognition with Deep Learning
CNN-Transformer hybrid reaches 98.1% accuracy on Arabic SER using EYASE and BAVED datasets, outperforming CNN-LSTM and fine-tuned wav2vec 2.0.
-
Exploring the non-convexity in machine learning using quantum-inspired optimization
A quantum-inspired global search method called QIEO outperforms traditional solvers in recovering sparse structures and robust fitting by maintaining a broad view of possible solutions.
- The World's Fastest Matching Engine Algorithm
- The EDGE Language: Extended General Einsums for Graph Algorithms