Portfolio Management
Cities of Signals: Compression, Separation, and the Geometry of Novelty
Marc da Costa Nunes
A cross-sectional signal is a forecast vector over $d$ assets at each date; demeaned and normalized, it is a point on a sphere. Its city is the direction of its time-averaged vector in a common target-aligned frame, a compressed summary. When is the angle between two cities a conservative estimate of the angle between the histories? For independent uniform histories, the probability that the history angle is at least the city angle tends to one when the city angle is at most 90 degrees, with an $O(T^{-1/2})$ error bound uniform in dimension. Selecting for positive average information coefficient (IC) changes the unconditional limit to $\gamma_q>1/2$, about 56% for 20 assets. The bound extends to independent, rotationally symmetric histories with temporal dependence; summable products of lag correlations preserve the conditional limit. A stationary ergodic
theorem allows shared signal movement and identifies the population margin determining the limiting ordering. Among 266,815 positive-IC pairs in AlphaNova's Competition May 2026, the history angle is at least the city angle for 58.9% overall, 74.1% at city angles up to 90 degrees, and 1.5% beyond. These frequencies describe the observed library and do not validate the uniform null: residual agreement is mostly positive, and an empirical second-moment diagnostic cannot be matched within that null by adjusting temporal dependence alone. On the full 776-signal sample, a city angle of at least 60 degrees selects pairs with a 94.3% success rate at the same history-angle threshold, against an 85.0% base rate, and retains 72.5% of pairs. Explicit constructions show the limits of direction-only summaries, retained lengths give sharp bounds, and shared time blocks recover missing information, here only at fine resolution. Persistent positive IC confines cities and bounds their motion; convergence also requires a stable mean direction.
Read the full abstract ▾
Trading and Market Microstructure · Cross-listed from cs.AI
Agent Policy-Value Audit: Separating Transition Composition from Event Selection in Financial LLM Agents
Mingyang Chen, Yida Xu, Huiwen Chen et al. (+2 more)
Financial LLM
agents are often evaluated by comparing their end-to-end returns with those of a baseline and testing the paired difference against zero. This measures whether deploying the
agent changes realized performance, but it does not isolate event-selection skill. An
agent that frequently changes positions from flat to long can earn a positive paired return from an upward-drifting event pool even when it selects events at random. We propose the
Agent Policy-Value Audit, which holds fixed the observed count of each ordered action-change type and randomly reassigns them across eligible events. The average payoff from these reassignments is the composition
benchmark; the difference between observed deployment value and this
benchmark is selection value. In semi-synthetic
benchmarks based on real earnings-event returns, a zero-centered paired test falsely attributes passive exposure to selection skill in $11.6\%$ of no-skill replications, while the transition-matched audit reduces this rate to $5.3\%$. Applied retrospectively to 723 earnings events at 44 U.S. consumer-facing firms, the audit decomposes the
agent's gross deployment value of $+15.2$ bps/event into a $+25.8$ composition
benchmark and a $-10.6$ selection value. The
agent does not detectably outperform matched random assignments. Financial-
agent evaluations should report deployment value separately from event-selection value.
Read the full abstract ▾
All authors Mingyang Chen, Yida Xu, Huiwen Chen, Yiming Lu, Wei Jin
General Economics
Labour reallocation and production-network recomposition in the green transition
Marco Dueñas and Antoine Mandel
A growing number of countries are adopting policies to reduce greenhouse-gas emissions, a process expected to reshape production systems and labour
markets by altering relative prices and changing production and demand patterns across sectors. We develop an
agent-based monetary input–output network model to analyse the medium-term effects of
climate policies on production networks and sectoral labour allocation. The model features heterogeneous industries and households, incorporates greenhouse-gas emissions accounting, and is calibrated to a multi-regional input–output database covering the world economy. We simulate two alternative
climate-policy scenarios over 2026–2035: one based on countries' nationally determined contributions and another targeting larger reductions in global emissions. The results reveal significant economy-wide reallocation: fossil-energy sectors contract, low-carbon energy sectors expand, and their positions within production networks change asymmetrically. Fossil energy loses relevance as a direct supplier and exerts less forward influence, while its remaining production becomes more dependent on intermediate inputs and upstream suppliers; low-carbon energy primarily strengthens its role as a supplier. Carbon pricing also generates sectoral labour gaps that, under mobility frictions, imply greater potential transitional unemployment. Because the model allows only limited technological change and adjustment within existing production links, the simulations provide a counterfactual assessment of how existing production structures respond to a relatively rapid
climate transition, revealing the adjustment pressures that emerge when policy ambitions advance faster than the productive system's capacity to adapt.
Read the full abstract ▾
Trading and Market Microstructure · Cross-listed from cs.CE
Priority Gas Auction Cadence and Searcher Competition: Evidence from Flashblocks on Base
Pranay Anchuri, Edward W. Felten and Akaki Mamageishvili
Flashblocks divide a block's priority gas auction into shorter sequential auctions that commit transaction order before the block is complete. We ask how this auction cadence affects bidding and competition among automated arbitrageurs, or searchers. In July 2025 Base replaced a single 2 s auction with ten 200 ms auctions. We use this change to estimate the searcher response from on-chain data alone. On an address-day panel of 3,032 searchers and 8,053 activity-matched controls, a difference-in-differences design estimates a 0.187 gwei fall in the effective priority fee (59% of the searcher pre-period mean). The share of searcher priority-fee value paid in the first tenth of block gas falls from 0.98 to 0.28. This fee compression is the identified effect. The revert-rate response is not (causally) identified and is reported descriptively. At the level of a single opportunity, the winning fee splits into an approximately invariant floor and a competitive premium. The premium scales about linearly with auction duration at high contention and less steeply at low contention. A first-price auction model with uncertain arrival and partial payments by losing searchers accounts for this pattern. We match attempts to the pool they contest. A higher-fee transaction reverts behind a lower-fee winner that landed earlier in 1.9 to 2.7% of contested opportunities by value, an upper bound. Latency therefore decides part of the ordering. A micro-auction model projects diminishing returns from shortening the window below 200 ms, as bids approach a nonzero floor. Rollups such as Arbitrum One now make auction cadence a governance tunable parameter, so these estimates inform how it is set.
Read the full abstract ▾
General Economics
Beneath the VIX: Probability, Severity, and Uncertainty Shocks
Todd B. Walker
Implied stock-
market volatility is widely used to identify uncertainty shocks and discipline models of their macroeconomic effects. This paper gives distributional content to the option-price variation underlying these exercises. A normalized at-the-money forward put price, the Downside Protection Premium (DPP), closely tracks the VIX and preserves the principal macroeconomic responses in the specifications examined. Its price and local strike slope separate risk-neutral shortfall probability from conditional severity. Severity accounts for almost all monthly premium comovement and 91.5 percent of the recession log premium. Conditional gains also rise substantially, while conditional losses remain larger in phase averages. Despite this severity dominance, quotations across strikes frequently exclude a common-scale explanation, conditional on the maintained forward and premium construction. Realized-
volatility and future-
volatility-news innovations both raise protection costs primarily through severity, yet produce different estimated employment responses in common impact-severity units; simultaneous significance depends on the inference formulation. Together, these findings supply joint empirical restrictions on the connection between uncertainty, option prices, and economic activity.
Read the full abstract ▾
Trading and Market Microstructure
When a Correct Reward Is Not Enough: Diagnosing and Guiding PPO in an Analytically Solved Broker-Trader Game
Siu Tung Wong and Carlo Campajola
Reinforcement learning (RL) is increasingly used for financial optimal-control problems when complex dynamics make analytical strategies difficult to obtain. There are financial mathematics literactures which provides many solved models whose equations and controls could evaluate and guide learning; we ask whether RL can exploit these results. We place a proximal policy optimisation (PPO)
agent in an analytically solved continuous-time broker–trader game. PPO replaces the broker and chooses its trading speed while interacting with an informed trader and
stochastic uninformed order flow. We derive a finite-step reward from the broker's continuous-time payoff and verify its discrete implementation through grid refinement and an exact one-step identity. With zero uninformed flow, a validation-selected PPO–FFNN approaches the reference action. With
stochastic uninformed flow, the tested PPO–FFNN and PPO–LSTM remain inaccurate, although supervised learning confirms that their actors can represent the action. Monte Carlo diagnostics show that their critics do not reliably rank nearby actions; potential-based reward shaping also gives no reliable improvement. Under partial information, a causal certainty-equivalent controller based on the broker's observable history remains close to the reference, while PPO has larger errors and lower payoffs. Finally, we freeze the analytical policy and train PPO to adjust it after the execution cost changes. Halving the cost yields a repeatable improvement that closes \(2.22\%\) of the gap to the changed-cost reference. The analytical solution therefore provides both a
benchmark for diagnosing RL and a useful starting policy for adaptation.
Read the full abstract ▾
Mathematical Finance
PreFER: Interactive Robo-Advisor with Scoring Mechanism
Yuwei Wang and Hoi Ying Wong
We propose an interactive robo-advising framework that learns personalized risk preferences from scores provided by clients. The resulting preference-learning problem is closely related to inverse reinforcement learning (IRL), as the robo-advisor infers the client's latent reward specification from feedback. The robo-advisor interacts with clients iteratively as follows. At each interaction time, the advisor generates investment advice based on the optimal policy distribution derived from an inferred personalized risk preference. The client scores the advice. The advisor updates its assessment of the client's risk preference based on the feedback. This learning procedure motivates us to investigate discrete-time Predictable Forward Exploratory Reward (PreFER) processes and derive an exploratory investment strategy. By interpreting the score as the acceptance probability of a piece of advice, our inverse learning procedure learns the client's exploratory investment distribution using the acceptance-rejection method pioneered by von Neumann. Under CARA preferences, we show that, even though the scores contain noise, the robo-advisor can identify the client's current risk aversion after a sufficiently large number of interactions. The PreFER process then carries the learned preference forward and generates future recommendations under updated
market conditions.
Read the full abstract ▾
Trading and Market Microstructure
Mixture-of-Experts for Cryptocurrency Order Execution: Training Stability, Tail Risk, and Failure Modes
Alexander Ardaiz, Varun Budati and Ali Habibnia
Deep reinforcement-learning policies for order execution can vary substantially across training seeds, so apparent architectural gains may reflect favourable training realisations rather than reproducible properties of the architecture. We evaluate vanilla Double Deep Q-Learning (DDQL), K-means-partitioned mixtures of DDQL experts at $K \in \{2, 4, 8\}$, and dense networks parameter-matched to the $K{=}4$ and $K{=}8$ expert budgets on 5-minute mean-aggregated BTC/USDT limit order book data from Binance. No learned configuration significantly improves mean implementation shortfall over DDQL. Under the reported specification, all have higher mean shortfall than TWAP (0.39 bps) and immediate liquidation (0.21 bps) in an environment whose frictionless replay and terminal-urgency penalty make early liquidation nearly costless; 11/100 vanilla-DDQL runs, versus none in either MoE $K{\geq}4$ arm, converge to a policy that waits until forced liquidation. We then decompose this specification on a device-matched baseline. Annealed exploration alone eliminates observed collapses (12/100 to 0/100; exact McNemar $p{=}4.9{\times}10^{-4}$), matching the elimination under expert partitioning. Combining annealed exploration with the aligned reward restores collapse in 19/30 runs; with all three specification changes, it rises to 48/100. In this environment, expert partitioning is unnecessary to suppress collapse and appears to mask a training-specification failure rather than confer an intrinsic performance benefit. No MoE $K{=}8$ run collapses under any of the six specifications tested. Across-seed dispersion is lowest at $K{=}8$ but non-monotone and not robust to family-wise adjustment, while within-policy tail risk worsens monotonically with $K$. The apparent attribution of the failure mode reverses between 30 and 100 seeds, illustrating the importance of repeated-seed evaluation.
Read the full abstract ▾
General Economics
No Women No Innovation? The Effect of Women on Boards on Hard and Soft Innovation in SMEs
Francesca Pascale, Saverio Barabuffi and Giulio Ferrigno
The role of women on corporate boards and its impact on innovation remains heavily debated. While existing literature offers conflicting perspectives on whether female board representation spurs or hinders innovaiton, most research has focused exlusively on large firms. This studt adresses this gap by investigating the causal impact of women on boards on both "hard" (technological) and "soft" (non-technological) innovation within SMEs. Using a longitudinal
dataset f 2762 Italian innovative SMEs from 2015 to 2024 and a 2SLS identification strategy, we find highly nuanced patterns. For hard innovation, the instrumented model reveals a robust positive causal impacr, reversing a negative baseline coefficient and exposing a severe negative selection bias. For soft innovation, a stable positive impact is confirmed. Our findings provide crucial causal evidence for SMEs' governance, while offering tailored insights for policymakers and practitioners to incentivize women' management roles in SMES.
Read the full abstract ▾
Computational Finance · Cross-listed from cs.MA
FinNextAssist: Towards Professional Financial Deep Research Assistant
Xiangyu Li, Fengbin Zhu, Xuan Yao et al. (+9 more)
Deep Research (DR)
agents have demonstrated strong capabilities in complex, research-oriented tasks through autonomous planning, iterative
retrieval, multi-step
reasoning, and structured reporting. However, adapting DR
agents to finance introduces unique challenges: financial analysis demands the joint completion of heterogeneous sub-tasks spanning diverse data types, tools, and analytical workflows. We identify three key requirements for a professional financial DR
agent: integration of authoritative, heterogeneous financial data sources; specialized analytical tools and skills; and dedicated sub-
agents for domain-specific sub-tasks. Building on these principles, we propose FinNextAssist, an end-to-end deep research framework designed for professional financial analysis. FinNextAssist decomposes the research process into four stages: Task Planner, Evidence Compiler,
Reasoning Engine, and Report Assembler, and introduces two novel lightweight sub-
agents: TabAgent, for cross-
market financial table understanding, and HeteroAgent, for cross-modality heterogeneous financial data interpretation. Extensive experiments on FinDeepResearch, the Finance
Agent Benchmark, and FinTMMBench-Web show that FinNextAssist substantially outperforms both strong proprietary and open-source DR
agents, with ablation studies confirming the contribution of each component across diverse
markets and
languages.
Read the full abstract ▾
All authors Xiangyu Li, Fengbin Zhu, Xuan Yao, Siyu Liu, Xiaoluan Liu, Chao Wang, Huanbo Luan, Xiaofen Xing, Xiangmin Xu, Ke-Wei Huang, Richang Hong, Tat-Seng Chua
Risk Management · Cross-listed from quant-ph
Landscape-Dependent Performance of Photonic Quantum Solvers in QUBO Feature Selection for Financial Risk Detection
Nirvik Sahoo and Paul Robert Griffin
Feature selection for imbalanced classification tasks such as credit card fraud and consumer default detection requires balancing predictive relevance, inter-feature redundancy, and computational feasibility. We
benchmark three computing paradigms, classical branch-and-bound optimization (Gurobi), photonic
entropy computing (QCI Dirac-3), and simulated photonic
boson sampling (Piquasso), across thirteen feature-selection methods on two
datasets: ULB Credit Card Fraud (30 features) and AmEx consumer default (159 features). Each method is routed to the solver matched to its mathematical structure. On ULB, Dirac-3 MI-Spearman matches the all-features model using 13 of 30 features (mean F1 0.873 +/- 0.023 over five runs, best run 0.896), and Piquasso is the best method at k=5. On AmEx, performance rises steadily with the feature budget and every paradigm approaches F1 = 0.80 only near the full feature set. Most differences between Gurobi and Dirac-3 on identical methods fall within run-to-run variation; the large gaps occur where the certified optimum generalizes poorly, most sharply for distance correlation on AmEx at k=25 (Gurobi F1 = 0.422 vs. a Dirac-3 mean of 0.746). At matched budgets, F1 varies about ten times more across methods on ULB than on AmEx, which we trace to how concentrated the predictive signal is in each feature space.
Read the full abstract ▾
Trading and Market Microstructure · Cross-listed from cs.SE
MintEval: Do LLMs Implement the Trading Strategy You Asked For? A Behavioural-Equivalence Benchmark for Natural-Language-to-Strategy Code
Siyu Wang, Yifan Wang and Yuecheng He
Large
language models are moving from producing trading signals to writing the code that executes them. The failure mode of the second role is silent: generated code runs, a backtest plots, yet the risk logic that the trader described is not the logic being executed. Existing code
benchmarks test functional correctness on unit tests and finance
benchmarks test forecasting; neither measures whether an implementation behaves like the strategy that was asked for. We introduce MintEval, a
benchmark in which reference strategies are generated programmatically from a library of composable building blocks, back-translated into colloquial trader instructions, and re-implemented by the model under test. Generated and reference programs are executed bar by bar on identical
market data and frictions, and compared on their actions rather than on code similarity or profit: alpha is differenced away. MintEval v0 contains 800 tasks on BTCUSDT 15-minute data, stratified by an execution-measured state-span complexity tau that is decoupled from description length. Low-cost models reach a mean ActionMatch of at most 0.544 and reproduce at most 0.087 of tasks exactly; on a stratified subset of 200 tasks a frontier model (Claude Opus 5.5) reaches 0.889 and reproduces 0.575 exactly, yet still fails silently on 0.275 of tasks. Given a menu of building blocks, models identify the strategy almost perfectly, yet 79.2% of the implementations whose specification was read correctly diverge on more than 10% of active bars. The LLM judge of a recent strategy-generation
benchmark, applied verbatim, accepts every one of these silent failures.
Read the full abstract ▾
Computational Finance
Shapley-based Structural Analysis of Neural Calibration for Stochastic Volatility Models
Shaïn Afzali, Serena Della Corte and Antonis Papapantoleon
Neural network-based approaches have emerged as efficient alternatives to traditional optimization-based procedures for the calibration of
stochastic volatility models. However, existing work has focused primarily on predictive accuracy, with comparatively little
attention devoted to understanding the structure of the learned inverse calibration mappings. In this work, we analyze neural calibration mappings for the Heston and rough Heston models across multilayer perceptron, highway, and softmax-parametrized highway architectures, using complementary Shapley-based methods from explainable AI. Specifically, we consider SHAP and $\nu$SHAP explanations, which capture distinct, complementary notions of feature relevance, corresponding to sensitivity and sufficiency of feature subsets, respectively. Short maturities and smile wings consistently dominate parameter inference, and the dominant attribution structure remains qualitatively stable across architectures despite differences in predictive accuracy and parameter count. Parameter-specific differences between SHAP and $\nu$SHAP further reveal how distinct regions of the implied
volatility surface contribute to parameter recovery and expose substantial redundancy in the calibration input. Building on this redundancy, we show that $\nu$SHAP explanations can guide a significant reduction in input dimensionality for the rough Heston model while matching calibration accuracy relative to the full implied
volatility surface. These findings demonstrate that complementary Shapley-based methods provide structural insight into learned inverse calibration mappings beyond predictive error metrics, and offer a practical route to feature selection in neural calibration problems.
Read the full abstract ▾
Computational Finance
Event History Over Scale: Compact Transformers for Low-Latency Limit Order Book Forecasting
David Schaurecker, Lasse B. Strand, Kevin O'Sullivan et al. (+1 more)
Short-horizon price-trend prediction from limit order books in equity and intraday electricity
markets requires models that combine predictive quality with low single-sample latency and a small serialized model size to keep pace with rapid and continuous
market updates. We introduce MBOFormer, a 7,203-parameter causal
transformer, and MBOFusion, a 14,371-parameter extension with a slow temporal-context branch. Both models process
market-by-order (level-3) histories of individual order submissions, cancellations, and executions. We compare them with level-2-based baselines that process sampled order-book snapshots and simple statistics instead of their underlying messages. Across three
markets and four prediction horizons, our models achieve the highest mean macro-F1 in eleven of the twelve settings in a comparison against other
benchmark models of varying sizes. Both our models achieve sub-millisecond median inference on a single Apple M2 CPU thread and have serialized state dictionaries below 70 kB. MBOFormer is 5.1x-8.1x faster than the million-parameter baselines at comparable predictive quality. Our results show that fine-grained
market event history can reduce the need for model size under tight deployment constraints for short-term equity and electricity price forecasting tasks.
Read the full abstract ▾
All authors David Schaurecker, Lasse B. Strand, Kevin O'Sullivan, Robert Jakob
General Finance
Multi-Agent AI as a Nested Principal-Agent Problem in Private Wealth Management: Mandate Representation and Evidence Control in Switzerland, Germany and Austria
Walter Kurz, Reinhard Magg, Florian Kollberg et al. (+4 more)
In private wealth management, a manager delegating to artificial intelligence (AI) acts as the client's
agent and the system's principal. We introduce a model-independent formulation that combines nested principal–
agent delegation with constrained joint maximisation as the task assigned to the AI system. The objective represents client and manager outcomes separately over portfolio–workflow pairs. Legal duties, mandate requirements and evidence sufficiency determine admissibility, with Switzerland, Germany and Austria supplying the legal context. Weights and reference-service floors make the trade-off explicit; concession accounting separates their effects on the client. Analytical constructions and a simulation using public-
market observations illustrate the approach. Across eight decision states from four constructed mandates, omitted client liabilities caused two liquidity violations, omitted manager terms caused two capacity violations, and mistranslated weights changed four otherwise admissible choices under faithful optimisation. At the declared weights, six states selected a higher service tier than the client-best alternative, with client concessions of EUR 1,178 to EUR 2,264 and manager gains of EUR 3,062 to EUR 10,381. Three instruction forms each reached all 32 specified decisions under shared numerical, evidence and simulated approval controls; professional instructions matched explicit nested delegation on accuracy and clarification count. Subsequent 2022 exchange-rate and yield paths, combined with constructed growth scenarios, produced lower client outcomes than the reference service although the selected services met the decision-time forecast
benchmarks. These examples suggest that the approach could help make mandate choices and their consequences easier to examine. Professional and field studies could assess whether this improves oversight and client outcomes.
Read the full abstract ▾
All authors Walter Kurz, Reinhard Magg, Florian Kollberg, Wojtek Stricker, Stefan Marx, Frank Reinhardt, Velimir Dedić
Trading and Market Microstructure
Axient: Manifest-Bound Evidence for On-Chain Financial Protocols: Seven-Layer Derivation, Correlation, Tamper Rejection, and Reproducible Claim Promotion
Maksym Nechepurenko
Hybrid on-chain financial protocols are frequently evaluated with evidence that is individually useful but collectively insufficient: a unit test, transaction receipt, screenshot, service response, or several matching hashes may be presented as proof of a complete workflow even when the layers share one generated source or omit the financial authority that matters. This paper develops a manifest-bound evidence architecture for such systems. A sealed execution manifest binds declared system identities, roles, schemas, and release identity. Seven evidence layers are retained with registered derivations and linked by a common correlation identity. A conjunctive claim-promotion rule requires provenance, predicate-specific root conditions, negative controls, reproducible packaging, historical replay, and independent review in addition to hash equality. We formalize the evidence graph, prove that copied hashes cannot establish independent derivation, show how collision-resistant commitments make specified tampering detectable, define exactly-once financial-effect evidence, and distinguish original historical identities from later reproducibility attestations. The registered local case study records twelve parent Financial Interaction Assertions in one accepted cohort: 84 retained ACTUAL_EVIDENCE positions, two clean materializations with one byte-identical file index, a deterministic strict archive accepted by a separate verifier, and a selected ordered replay bound to that archive. FIA-011 is conjunctive and retains both stale-before-admission and book-epoch-change-mid-position subcases. The result demonstrates a reviewable chain of custody from financial assertion to replay-bound package while preserving the difference between observed evidence, interpretation, and future hypotheses.
Read the full abstract ▾
Trading and Market Microstructure
Axient: Canonical Protocol-Graph Composition for Leveraged Event Markets: Single State Authority, Atomic Composition, Durable Sagas, and Exactly-Once Recovery
Maksym Nechepurenko
A modular leveraged event-
market protocol can contain individually correct contracts for risk approval, positions, debt, settlement evidence, credit pools, junior backstops, reserves, liquidation, and governance while still lacking one authoritative financial execution path. This paper develops a canonical protocol graph in which every financial domain has one storage authority and composition components coordinate transitions without recreating balances, debt, positions, evidence receipts, queues, reserves, pause state, or terminal scenario state. The architecture formalizes atomic position origination, a settlement-confirmed debt saga, trader residual release, an ordered reserve-backstop-Senior loss waterfall, loss-participating withdrawal queues, capability-conditioned execution, protocol-wide pause and timelocked recovery, deterministic deployment manifests, canonical state projection, and exactly-once reconstruction after a chain-confirmed checkpoint. We prove composition-level authority uniqueness, atomic closure, loss conservation and priority, receipt-idempotent settlement, legal no-go safety, capability-transition safety, and no-financial-reexecution recovery under explicit assumptions. The implementation is evaluated through twelve parent Financial Interaction Assertions (FIA-001-FIA-012), including mandatory FIA-011A/B capability subcases. The registered local cohort contains twelve uniquely correlated scenario records and 84 retained ACTUAL_EVIDENCE layer positions, two clean materializations with one byte-identical file index, a deterministic strict archive accepted by a separate verifier, and a selected ordered replay bound to that archive. The result connects the formal protocol graph to a reproducible evidence chain while preserving explicit boundaries between the observed engineering result and future external-operation hypotheses.
Read the full abstract ▾