Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

295988117 · Jun 202019922001200920172026
48 results for miner clusters

Fragmented exchanges arise due to speed advantages in high-activity regions.

problem Fragmentation of distributed securities exchanges due to speed advantages in high-activity regions.
method Economic model and Monte Carlo simulations of a decentralized exchange with two miner clusters.
result Speed advantage increases with infrastructure asymmetry between regions.

Model infers mineral locations from geospatial data, improving predictions with auxiliary data.

problem Challenges in characterizing hidden mineral deposits underground.
method Generative modeling approach using masked and infilled geospatial maps.
result Models achieve Dice coefficients of 0.31 and recalls of 0.22 at 1×1 mi² resolution.

A new sequencing rule prevents miners from front-running transactions in decentralized exchanges.

problem Miners exploit their privileged position to front-run transactions, leading to unfair profits.
method Introduce verifiable sequencing rules that constrain transaction execution order and are verifiable.
result A verifiable sequencing rule ensures users receive at least fair execution prices, preventing front-running.

Extends PoS proof-of-stake transaction fee mechanism with miner utility model.

problem Designing a transaction fee mechanism for PoS protocol that incorporates miner utility.
method Introduced a new mechanism (BSP(θ)) incorporating a parameter θ to ensure user and miner incentives.
result The new mechanism (BSP(θ)) satisfies user and miner incentives and contract proofness.

The paper analyzes how mutable blockchain protocols affect miner behavior and strategic stability.

problem The mutability of blockchain protocols undermines long-term planning and cooperative equilibria.
method Integrates Austrian capital theory with repeated game theory to examine miner behavior under different institutional conditions.
result Effective time preference increases when protocol rules are mutable, leading to political rent-seeking and undermining strategic coherence.

Study analyzes market co-movements in critical mineral investments using change point detection and cross-sectional analysis.

problem Market dynamics in critical mineral investments during significant global events.
method Combines change-point detection (PELT algorithm) with cross-sectional analysis on ESG-ranked ETFs.
result Investors herded during market downturns and shifted to anti-herding after positive news and geopolitical shocks.

Visual Human Activity Recognition (HAR) and data fusion with other sensors can help us at tracking the behavior and activity of underground miners with little obstruction. Existing models, such as Single Shot Detector (SSD), trained on the Common Objects in Context (COCO) dataset is used in this paper to detect the cur…

2019-05-02abs ↗pdf ↗

Defines cost of MEV and shows its relevance in various settings.

problem Excess value miners can realize by manipulating transaction order.
method Introduces a simple theoretical definition of cost of MEV, proves properties, and provides examples.
result Reveals the cost of MEV is related to the 'smoothness' of a function over the symmetric group.

CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.

problem Mining frequent closed itemsets from data streams is resource-intensive.
method CICLAD is an intersection-based sliding-window FCI miner that optimizes memory usage while maintaining performance.
result CICLAD achieves significantly lower memory footprint compared to existing methods.

Style Miner generates stable and significant style factors for time series analysis.

problem Finding significant and stable explanatory factors in high-dimensional time series data.
method Proposes a reinforcement learning method to balance explanatory power and stability constraints.
result Outperforms existing methods by a large margin and achieves a 10% gain in R-squared explanatory power.

Ethereum tackles bribery in blockchain transactions with new fee mechanism.

problem Bribing miners in Ethereum blockchain to manipulate transaction fees.
method Filtered transactions, constructed proxies for bribery level, analyzed effects on blockchain and financial markets.
result Bribing affects Ethereum and other blockchains, influencing cryptocurrency, transaction stats, and network adoption.

A new algorithm discovers causal factors between T2DM and bone mineral density.

problem Discovering causal factors between T2DM and bone mineral density from clinical data.
method Prior-Knowledge-driven local Causal structure Learning (PKCL) algorithm.
result PKCL achieves more reliable results without long-standing medical experiments.

DisCoveR efficiently discovers declarative process models from event logs.

problem Mining declarative process models from event logs efficiently and accurately.
method DisCoveR precisely formalizes an algorithm, uses a bit vector implementation, and rigorously evaluates performance.
result DisCoveR outperforms other declarative miners in accuracy and runtime.

oPoW proposes a new PoW algorithm to reduce mining costs and environmental impact.

problem Scalability issues, environmental concerns, and systemic risks in Bitcoin PoW.
method oPoW is a novel PoW algorithm that shifts mining costs from electricity to hardware (CAPEX).
result oPoW reduces mining costs and improves network scalability, decentralization, and issuance.

This paper analyzes the profitability of selfish mining on blockchain, considering the risk of ruin.

problem The profitability of selfish mining on blockchain, considering the risk of ruin.
method Formulated a stochastic model and used tools from applied probability and analysis to determine expected profit.
result Explicit expressions for expected profit under different scenarios were derived, identifying conditions for selfish mining as a strategic advantage.

TabSODA improves imputation of surveys with skips and ordinal data.

problem Handling structural skips and ordinal responses in survey data.
method TabSODA uses an Elucidated Diffusion Model with skip pattern detection and ordinal awareness.
result TabSODA reduces ordinal missing-at-random (MACE) by up to 23.7% and improves categorical accuracy by up to 9%.

FedAMD framework improves federated learning with partial client participation.

problem Data heterogeneity and inactive client updates in partial client participation.
method Anchor sampling divides clients into anchor and miner groups, using large and small batches respectively.
result FedAMD achieves faster convergence and improved model performance compared to state-of-the-art methods.

Paper forecasts extreme Bitcoin volatility spikes using whale transactions and CryptoQuant data.

problem Forecasting extreme volatility spikes in Bitcoin market.
method Proposes Synthesizer Transformer model for forecasting.
result Model outperforms state-of-the-art models in forecasting extreme volatility spikes.

Centralized exchanges influence staking behavior and decentralization in Proof of Stake blockchain ecosystems.

problem How do centralized exchanges affect staking behavior and decentralization in Proof of Stake blockchain ecosystems?
method Formulate a continuous-time mean field model of miners as validators and traders in a centralized market.
result Centralized trading activities enhance staking participation and promote decentralization through market incentives.

Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.

problem Default contagion in a network of smart contracts cleared through blockchain.
method Constructs a decentralized clearing mechanism using blockchain and optimal bidding strategies.
result Proves existence and uniqueness of equilibrium clearing condition for terminal net worths.

The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk are cryptocurrencies, a market currently worth over 150 billion USD. We investigate the risk of Bitcoin, …

2017-10-28abs ↗pdf ↗

Ethereum transition to PoS reduces energy consumption and decentralizes the network.

problem Transitioning from proof-of-work to proof-of-stake to reduce energy consumption and decentralize the network.
method Analyzed the impact of the Ethereum transition to proof-of-stake on network performance, competing platforms, and transaction fees.
result The transition to PoS has reduced energy consumption by 99.98% and decreased network concentration.

This work introduces uncertainty principles to mitigate Maximal Extractable Value in blockchain systems.

problem Maximal Extractable Value (MEV) in decentralized systems due to transaction submission privacy and monopolist power.
method Unified approaches via uncertainty principles, akin to harmonic analysis and physics, to quantify trade-offs between transaction flexibility and user economic payoff.
result Demonstrates a quantitative trade-off between transaction flexibility and user economic payoff, analogous to the Nyquist-Shannon sampling theorem.

Paper predicts stock market values using machine learning.

problem Predicting stock market values for Tehran stock exchange groups.
method Used machine learning algorithms including Decision Tree, Bagging, Random Forest, Adaptive Boosting, Gradient Boosting, XGBoost, Artificial neural network, Recurrent Neural Network, and Long short-term memory (LSTM).
result LSTM shows highest accuracy among all algorithms tested.

A new framework for mining high utility patterns in interval-based sequences.

problem Mining patterns in events that persist over varying time intervals and considering event utility.
method Integrates utility into interval-based sequences and proposes HUIPMiner algorithm with pruning strategy.
result HUIPMiner efficiently finds high utility patterns in real datasets.

Proposes a method to predict cluster number and cluster representatives using cluster stability analysis.

problem Determining the number of clusters in a dataset.
method Analyzes cluster stability using Monte-Carlo simulation to predict cluster number and find cluster representatives.
result Significant improvement in predicting cluster numbers and cluster composition in large datasets.