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.

169,341 papers · 148 categories

Trend · papers per month

36912 · May 202619922001200920182026
48 results for conflict minerals

Study reveals scale-free global buyer-supplier networks and their implications for conflict minerals.

problem Global proliferation of conflict minerals through buyer-supplier linkages.
method Investigated scale-free topology and community structure of global inter-firm networks.
result A limited number of firms play a crucial role in conflict minerals proliferation.

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.

This paper tracks coin circulation in Bitcoin to identify miners and analyze mining pool structures.

problem Identifying and understanding Bitcoin miners and their profit distribution schemes.
method Constructs fresh coin circulation networks and uses a heuristic algorithm to compare networks from different mining pools.
result Infers common profit distribution schemes of Bitcoin mining pools and observes an increasing trend in miner numbers.

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.

Paper uses SSD to detect miners' activities in a mining environment.

problem Tracking miners' activities in a mining environment with little obstruction.
method Used SSD trained on COCO dataset to detect miners' activities. Implemented machine learning algorithms using Tensorflow and C++.
result Improved accuracy of detecting miners' activities through data fusion.

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.

This study examines financial spillovers in critical minerals investing, revealing ESG scores impact and role of energy and carbon markets.

problem Investment risks in critical minerals and their spillovers to energy and carbon markets.
method Time-varying parameter vector autoregression (TVP-VAR) model, split data into pre- and post-COVID-19 samples.
result ESG scores significantly impact spillovers, and specific ETFs act as net givers or receivers of volatility.

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.

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.

The study extends Tutte's conflict graph concept to nonplanar graphs.

problem Understanding the structure of nonplanar graphs through conflict graphs.
method Defining a signed conflict graph for maximally planar subgraphs and analyzing their balance.
result For graphs with a flat embedding, every maximal planar subgraph has unbalanced conflict graphs if and only if the graph is intrinsically linked.

Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions to measure evidence conflict and stability.

problem Modern data analysis lacks mechanisms to show the clarity, conflict, or stability of evidence behind predictions.
method Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions.
result SEF measures conflict and stability, and shows that conflict can improve loss prediction beyond confidence.

Russia-Ukraine conflict impacts global agricultural futures and spot markets' extreme risks.

problem Impact of Russia-Ukraine conflict on global agricultural futures and spot markets' extreme risks.
method Analytical framework for tail dependence, Copula-CoVaR method, ARMA-GARCH-skewed Student-t model.
result The outbreak of the conflict intensified risks in the wheat market the most and showed significant asymmetries in extreme risk spillovers.

The paper uses conformal prediction for forecasting conflict sequences in Markov processes.

problem Forecasting future conflict states for national policy decisions.
method Conformal prediction on Markov processes for temporally-dependent data.
result Conformal prediction provides valid uncertainty quantification and robustness to model misspecification.

CYCLADES speeds up machine learning with conflict-free asynchronous updates.

problem Improving parallel stochastic optimization in shared memory systems.
method Asynchronous parallelization without memory locking, introducing conflict-free updates.
result Consistently outperforms HOGWILD!-type algorithms, achieving up to 5x speedup gains.

Paper introduces a fast density estimator for efficient outlying aspects mining.

problem Efficiently searching for feature subsets that describe how a query stands out from a dataset.
method Proposes a simple and efficient density estimator that replaces the kernel density estimator in existing outlying aspects miners.
result The new density estimator enables systematic search of large datasets with thousands of dimensions.

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.

This paper tackles multilingual speech processing by optimizing conflicting objectives hierarchically.

problem Training models for multilingual, multi-task speech processing is hampered by conflicting objectives.
method Investigates three multi-objective MSP formulations and introduces a lightweight layer-selection mechanism.
result A bi-level recipe outperforms standard flat optimization in state-of-the-art MSP models.

Paper defines predictive multiplicity and measures its severity in classification problems.

problem Challenges in machine learning due to competing models with conflicting predictions.
method Formal measures and integer programming tools for linear classification problems.
result Real-world datasets may admit competing models with wildly conflicting predictions.

Study on recurrent neural networks' feature selection and memorization using F1B test.

problem Conflict between feature selection and memorization in sequence learning.
method Flagged-1-Bit (F1B) test, four recurrent network models studied analytically and experimentally.
result Conflict can be resolved by gating mechanism or increasing state dimension.

The paper studies medial and conflict sets under continuous deformations in Riemannian manifolds.

problem Understanding the behavior of medial and conflict sets under continuous deformations in Riemannian manifolds.
method A new approach using Kuratowski convergence to express the deformation process as a continuous process.
result Main `medial axis inner semi-continuity' result proved useful in computing tangent cones of the medial axis.

Enhances conformal prediction for better uncertainty estimates in armed conflict fatalities.

problem Lack of individual-level uncertainty estimates in existing forecasting models.
method Introduces bin-conditional conformal prediction (BCCP) to improve coverage rates across subsets of the outcome variable.
result Demonstrates improved local coverage and well-calibrated uncertainty estimates across various ranges of fatalities.

Hybrid model improves geopolitical conflict forecasting.

problem Forecasting geopolitical events from sparse, bursty data.
method Sparse Temporal Fusion Transformer (TFT) + Variational Nearest Neighbor Gaussian Process (VNNGP).
result Consistently outperforms standalone TFT in long-range horizons.