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
Dennett.The Intentional Stance
Canonical reference. 100% of citing Pith papers cite this work as background.
17
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.
Local attention strictly enlarges the class of regular languages recognizable by fixed-precision transformers by introducing a second temporal operator in LTL, with global and local attention being expressively complementary.
TouchPort collapses the multi-stage process of discovering, consenting to, and syncing mixed reality encounters into one embodied handshake-and-pull gesture.
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.
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.
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.
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.
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.
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.
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.
-
Characterizing the Expressivity of Local Attention in Transformers
Local attention strictly enlarges the class of regular languages recognizable by fixed-precision transformers by introducing a second temporal operator in LTL, with global and local attention being expressively complementary.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
- Bonsai: Compiling Queries to Pruned Tree Traversals
- The EDGE Language: Extended General Einsums for Graph Algorithms