Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.24706

Enabling the 1 1 Promise AI Enabled Fairness for Indonesia Retail IPO Allocation

Anchal Gupta·Gleb Papyshev·James T Kwok
View original source ↗Read source document ↗Export metadata ↓

Abstract

Indonesia OJK Circular, effective November 2025, requires that half of every IPO pooled allocation go to retail investors. Uniquely amongst major capital markets, the regulation places all non-institutional participants, regardless of wealth, into a single competing pool rather than separating them by monetary thresholds. The rule is structurally sound; however, enforcement and measurement of effectiveness require methods beyond rule-based detection alone. Well-resourced participants operating within the retail pool can distribute bids across networks of synthetic retail accounts, each individually compliant, allowing them to capture the retail quota without triggering standard concentration heuristics. Without a mechanism to detect such networks before allotment closes, the statutory guarantee of equal access becomes procedurally hollow: the quota is formally reserved for retail households while the economic benefit flows elsewhere. We present a framework for identifying such nominee networks using eleven statutory fields already collected by Indonesia e-IPO infrastructure, requiring no new surveillance powers or personal data. The paper shows that when a Global South regulator prioritizes genuine inclusion over administrative convenience, algorithmic enforcement becomes both feasible and necessary.

Explore related subjects

cs.CE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anchal Gupta, Gleb Papyshev, James T Kwok. 2026-10-17. Enabling the 1 1 Promise AI Enabled Fairness for Indonesia Retail IPO Allocation. https://doi.org/10.1609/aies.v9i2.43214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Mode-Weighted Transport Certificates for State-Dependent Reflected Switching Diffusions

State-dependent switching diffusions can contract in law even when individual modes are expansive. We establish a computable, constant-one contraction certificate on $\mathbb{R}^n$ and compact convex domains with normal reflection. The mode-weighted transport cost combines spatial separation with a discrete graph penalty and retains spatial dependence when the modes differ. A synchronous Brownian coupling and a maximal coupling of jump clocks in equal modes lead to separate equal- and unequal-mode generator inequalities. We give a complete regularization argument for the nonsmooth cost, including the drift and jump errors, the sign of reflection, and the limiting Itô-Dynkin calculation. A resolvent proof transfers contraction to probability-valued weak solutions of the no-flux Fokker-Planck-Kolmogorov system, while an explicit Foster-Lyapunov condition ensures existence and uniqueness of an invariant law on the whole space. For fixed weight ordering and decay rate, certificate synthesis is a semi-infinite linear feasibility problem; on compact domains, a Lipschitz-buffered finite mesh provides a rigorous test. One-dimensional and planar examples illustrate the certificate and its numerical verification.

cs.CE↗
arXiv2026

VeriFin: A Neurosymbolic Framework for Verifying LLM-Generated Financial Claims

Large language models often produce plausible numerical claims from financial filings while using the wrong reporting period, unit, line item, or formula. Verifying such claims requires more than rechecking arithmetic: a verifier must ground the relevant facts, establish the authorized calculation, and determine whether the candidate value follows from both. We propose VeriFin, a neurosymbolic verification framework for numerical financial question answering that grounds operands in filed XBRL facts, derives calculations from the question, filing linkbases, or documented metric definitions, and checks claims using Z3. When a claim is inconsistent, solver-derived unsatisfiable cores identify the conflicting facts, formula, and candidate value, enabling targeted repair. We evaluate VeriFin on XBRLFiling, a new 600-question benchmark constructed from 10-K filings of 28 U.S. companies, and on FinanceBench. On fixed candidate pools shared by all verification methods, VeriFin accepts none of the incorrect claims, whereas the baselines accept 6 to 92 incorrect claims on XBRLFiling's 600 claims and 4 to 21 incorrect claims on FinanceBench's 67 claims. The zero false-accept result persists across multiple answer-generator models. Solver-derived feedback further improves repair, achieving up to 69.9% recovery among true catches. These results show that source-grounded symbolic verification can provide a reliable and auditable acceptance control for LLM-generated financial claims.

cs.CE↗
arXiv2026

A decomposition-integration framework coupling singular spectrum analysis with a volatility-adaptive LSTM for stock price forecasting

Financial time series exhibit multi-scale, high-noise, and non-stationary volatility dynamics. Decomposition--integration frameworks built on complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN) have advanced this field, yet existing CEEMDAN hybrids remain unstable: high-frequency mode mixing contaminates downstream predictors, and the heterogeneous volatility of decomposed components is not matched by any volatility-adaptive mechanism. To address these gaps, this paper proposes CEEMDAN-SE-SSA-VMGL. CEEMDAN adaptively decomposes the original series, and sample-entropy-driven K-means clustering groups the intrinsic mode functions into high-, mid-, and low-frequency and residual components. Singular spectrum analysis (SSA) is then applied to the high-frequency group, whose singular-value decomposition of the trajectory matrix and principal-component reconstruction decouple intertwined pseudo-oscillatory modes and alleviate mode mixing. We further design a plug-and-play robust LSTM variant, the volatility-modulated GARCH-LSTM (VMGL), which embeds a differentiable GARCH(1,1) layer inside the LSTM cell as a risk gate; the estimated conditional volatility multiplicatively scales the forget-gate activation, letting memory decay adapt to the instantaneous volatility while remaining fully end-to-end trainable. Component predictions are linearly combined. On five US and Chinese financial series (CSI 300, CSI 500, AAPL, GOOGL, S&P 500), the proposed model is compared with eleven benchmark architectures, lowering the forecasting error by 9% to 24% relative to the best benchmark and by 60% to 70% relative to a standard LSTM. Diebold--Mariano and model-confidence-set (MCS) tests confirm the statistical significance and stability of the gains, spectral analyses verify the SSA denoising efficacy, and backtesting demonstrates the framework's economic utility.

cs.CE↗