A unanimity-based transaction ordering rule that provably protects single-application and gated transactions from any attacker, with a matching impossibility result for everything else.
Communications of the ACM , volume =
9 Pith papers cite this work, alongside 738 external citations. Polarity classification is still indexing.
9
Pith papers citing it
738
external citations · external index
representative citing papers
Polynomial-time exact ASV computation for rooted trees via topological equivalence classes, plus sampling approximation for arbitrary causal DAGs.
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
Hypergraph modeling of SNNs improves neuron-to-core mapping on neuromorphic hardware by exploiting hyperedge overlap and locality for better partitioning and placement than graph-based methods.
An LLM-based pipeline systematically converts the CLM-ml-v2 Fortran land surface model to JAX, delivering full differentiability, 8x fewer optimization steps, and 24x wall-clock speedup at N=2048 while releasing the code as a reusable framework.
Holos is a five-layer LLM-based multi-agent system architecture using the Nuwa engine for agent generation, a market-driven Orchestrator for coordination, and an endogenous value cycle for incentive-compatible persistence in the Agentic Web.
GraphBench is a comprehensive multi-domain benchmark suite for graph learning with standardized evaluation protocols and baselines from message-passing and transformer models.
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
The authors perform and analyze three reformalizations of the Jordan Curve Theorem from Mizar to Lean, HOL Light to Lean, and HOL Light to Agda.
citing papers explorer
-
Ordering by Unanimity: Giving Applications Sequencing Rights Without Breaking Composability
A unanimity-based transaction ordering rule that provably protects single-application and gated transactions from any attacker, with a matching impossibility result for everything else.
-
Beyond Shapley: Efficient Computation of Asymmetric Shapley Values
Polynomial-time exact ASV computation for rooted trees via topological equivalence classes, plus sampling approximation for arbitrary causal DAGs.
-
A Coalgebraic Dijkstra Algorithm
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
-
A Case for Hypergraphs to Model and Map SNNs on Neuromorphic Hardware
Hypergraph modeling of SNNs improves neuron-to-core mapping on neuromorphic hardware by exploiting hyperedge overlap and locality for better partitioning and placement than graph-based methods.
-
Systematic LLM Translation of Legacy Scientific Code to Differentiable Frameworks: Application to a Land Surface Model
An LLM-based pipeline systematically converts the CLM-ml-v2 Fortran land surface model to JAX, delivering full differentiability, 8x fewer optimization steps, and 24x wall-clock speedup at N=2048 while releasing the code as a reusable framework.
-
Holos: A Web-Scale LLM-Based Multi-Agent System for the Agentic Web
Holos is a five-layer LLM-based multi-agent system architecture using the Nuwa engine for agent generation, a market-driven Orchestrator for coordination, and an endogenous value cycle for incentive-compatible persistence in the Agentic Web.
-
GraphBench: Next-generation graph learning benchmarking
GraphBench is a comprehensive multi-domain benchmark suite for graph learning with standardized evaluation protocols and baselines from message-passing and transformer models.
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
-
Reformalization of the Jordan Curve Theorem
The authors perform and analyze three reformalizations of the Jordan Curve Theorem from Mizar to Lean, HOL Light to Lean, and HOL Light to Agda.