arXiv subjects

Qin Wang

Publications and source records attributed to Qin Wang.

At least 91 records · Page 5Linked to original sources

arXiv2025

Relative higher index theory on quotients of Roe algebras and positive scalar curvature at infinity

In this paper, we employ quotients of Roe algebras as index containers for elliptic differential operators to study the existence problem of Riemannian metrics with positive scalar curvature on non-compact complete Riemannian manifolds. The non-vanishing of such an index locates the precise direction at infinity of the obstructions to positive scalar curvature, and may be viewed as a refinement of the positive scalar curvature problem. To achieve this, we formulate the relative coarse Baum-Connes conjecture and the relative coarse Novikov conjecture, together with their maximal versions, for general metric spaces as a program to compute the $K$-theory of the quotients of the Roe algebras relative to specific ideals. We show that if the metric space admits a relative fibred coarse embedding into Hilbert space or an $\ell^p$-space, certain cases of these conjectures can be verified, which yield obstructions to the existence of uniformly positive scalar curvature metrics in specified directions at infinity. As an application, we prove that the maximal coarse Baum-Connes conjecture holds for finite products of certain expander graphs that fail to admit fibred coarse embeddings into Hilbert space.

math.KT↗

arXiv2025

A nonstanadard analysis approach to limit operators and Fredholmness in Roe-like algebras

Let $(X,d)$ be a uniformly locally finite metric space, and $T$ an operator in the uniform Roe algebra $C_u^*(X)$ (or uniform quasi-local algebra $C_{ql}^*(X)$). In this paper, we introduce the concept of limit operators of $T$ on galaxies in the nonstandard extension of $X$, and prove that $T$ is a generalized Fredholm operator with respect to the ghost ideal in $C_u^*(X)$ (or $C_{ql}^*(X)$) if and only if all limit operators on afar galaxies are invertible, and their inverses are uniformly bounded. In particular, if $X$ has Yu's Property A, then $T$ is a Fredholm operator if and only if all limit operators on afar galaxies are invertible. Using techniques in nonstandard analysis, our result strengthens a work of Špakula--Willett \cite{SpW} on the characterization of Fredholmness by using less limit operators.

math.FA↗

arXiv2025

Balanced Sharpness-Aware Minimization for Imbalanced Regression

Regression is fundamental in computer vision and is widely used in various tasks including age estimation, depth estimation, target localization, \etc However, real-world data often exhibits imbalanced distribution, making regression models perform poorly especially for target values with rare observations~(known as the imbalanced regression problem). In this paper, we reframe imbalanced regression as an imbalanced generalization problem. To tackle that, we look into the loss sharpness property for measuring the generalization ability of regression models in the observation space. Namely, given a certain perturbation on the model parameters, we check how model performance changes according to the loss values of different target observations. We propose a simple yet effective approach called Balanced Sharpness-Aware Minimization~(BSAM) to enforce the uniform generalization ability of regression models for the entire observation space. In particular, we start from the traditional sharpness-aware minimization and then introduce a novel targeted reweighting strategy to homogenize the generalization ability across the observation space, which guarantees a theoretical generalization bound. Extensive experiments on multiple vision regression tasks, including age and depth estimation, demonstrate that our BSAM method consistently outperforms existing approaches. The code is available \href{https://github.com/manmanjun/BSAM_for_Imbalanced_Regression}{here}.

cs.CV↗

arXiv2025

Understanding NFTs from EIP Standards

We argue that the technical foundations of non-fungible tokens (NFTs) remain inadequately understood. Prior research has focused on market dynamics, user behavior, and isolated security incidents, yet systematic analysis of the standards underpinning NFT functionality is largely absent. We present the first study of NFTs through the lens of Ethereum Improvement Proposals (EIPs). We conduct a large-scale empirical analysis of 191 NFT-related EIPs and 10K+ Ethereum Magicians discussions (as of July, 2025). We integrate multi-dimensional analyses including the automated parsing of Solidity interfaces, graph-based modeling of inheritance structures, contributor profiling, and mining of community discussion data. We distinguish foundational from emerging standards, expose poor cross-version interoperability, and show that growing functional complexity heightens security risks.

cs.CR↗

arXiv2025

Slow is Fast! Dissecting Ethereum's Slow Liquidity Drain Scams

We identify the slow liquidity drain (SLID) scam, an insidious and highly profitable threat to decentralized finance (DeFi), posing a large-scale, persistent, and growing risk to the ecosystem. Unlike traditional scams such as rug pulls or honeypots (USENIX Sec'19, USENIX Sec'23), SLID gradually siphons funds from liquidity pools over extended periods, making detection significantly more challenging. In this paper, we conducted the first large-scale empirical analysis of 319,166 liquidity pools across six major decentralized exchanges (DEXs) since 2018. We identified 3,117 SLID affected liquidity pools, resulting in cumulative losses of more than US$103 million. We propose a rule-based heuristic and an enhanced machine learning model for early detection. Our machine learning model achieves a detection speed 4.77 times faster than the heuristic while maintaining 95% accuracy. Our study establishes a foundation for protecting DeFi investors at an early stage and promoting transparency in the DeFi ecosystem.

cs.CR↗

arXiv2025

A Joint Planning Model for Fixed and Mobile Electric Vehicle Charging Stations Considering Flexible Capacity Strategy

The widespread adoption of electric vehicles (EVs) has significantly increased demand on both transportation and power systems, posing challenges to their stable operation. To support the growing need for EV charging, both fixed charging stations (FCSs) and mobile charging stations (MCSs) have been introduced, serving as key interfaces between the power grid and traffic network. Recognizing the importance of collaborative planning across these sectors, this paper presents a two-stage joint planning model for FCSs and MCSs, utilizing an improved alternating direction method of multipliers (ADMM) algorithm. The primary goal of the proposed model is to transform the potential negative impacts of large-scale EV integration into positive outcomes, thereby enhancing social welfare through collaboration among multiple stakeholders. In the first stage, we develop a framework for evaluating FCS locations, incorporating assessments of EV hosting capacity and voltage stability. The second stage introduces a joint planning model for FCSs and MCSs, aiming to minimize the overall social costs of the EV charging system while maintaining a reliable power supply. To solve the planning problem, we employ a combination of mixed-integer linear programming, queueing theory, and sequential quadratic programming. The improved ADMM algorithm couples the siting and sizing decisions consistently by introducing coupling constraints, and supports a distributed optimization framework that coordinates the interests of EV users, MCS operators, and distribution system operators. Additionally, a flexible capacity planning strategy that accounts for the multi-period development potential of EVCS is proposed to reduce both the complexity and the investment required for FCS construction. Finally, a case study with comparative experiments demonstrates the effectiveness of the proposed models and solution methods.

eess.SY↗

arXiv2025

Hilbert-Hadamard spaces and the equivariant coarse Novikov conjecture

The equivariant coarse Novikov conjectures stand among a handful profound $K$-theoretic conjectures in noncommutative geometry. Motivated by the quest to verify Novikov-type conjectures for groups of diffeomorphisms, we study in this paper the equivariant coarse Novikov conjectures for spaces that equivariantly and coarsely embed into admissible Hilbert-Hadamard spaces, which are a type of infinite-dimensional nonpositively curved spaces. The paper is split into two parts. We prove in the first part that for any metric space $X$ with bounded geometry and with a proper isometric action $α$ by a countable discrete group $Γ$, if $X$ admits an equivariant coarse embedding into an admissible Hilbert-Hadamard space and $Γ$ is torsion-free, then the equivariant coarse strong Novikov conjecture holds rationally for $(X, Γ, α)$. In the second part, we extend the result in the first part by dropping the torsion-free assumption on $Γ$. To this end, we introduce, for a proper $Γ$-space $X$ with equivariant bounded geometry, a new Novikov-type conjecture that we call the rational analytic equivariant coarse Novikov conjecture, which generalizes the rational analytic Novikov conjecture and asserts the rational injectivity of a certain assembly map associated with a coarse analog of the classifying space $EΓ$. We show that for a proper $Γ$-space $X$ with equivariant bounded geometry, if $X$ admits an equivariant coarse embedding into an admissible Hilbert-Hadamard space, then the rational analytic equivariant coarse Novikov conjecture holds for $(X,Γ,α)$, i.e., the assembly map is a rational injection.

math.KT↗

arXiv2025

SoK: Semantic Privacy in Large Language Models

As Large Language Models (LLMs) are increasingly deployed in sensitive domains, traditional data privacy measures prove inadequate for protecting information that is implicit, contextual, or inferable - what we define as semantic privacy. This Systematization of Knowledge (SoK) introduces a lifecycle-centric framework to analyze how semantic privacy risks emerge across input processing, pretraining, fine-tuning, and alignment stages of LLMs. We categorize key attack vectors and assess how current defenses, such as differential privacy, embedding encryption, edge computing, and unlearning, address these threats. Our analysis reveals critical gaps in semantic-level protection, especially against contextual inference and latent representation leakage. We conclude by outlining open challenges, including quantifying semantic leakage, protecting multimodal inputs, balancing de-identification with generation quality, and ensuring transparency in privacy enforcement. This work aims to inform future research on designing robust, semantically aware privacy-preserving techniques for LLMs.

cs.CR↗

arXiv2025

Are NFTs Ready to Keep Australian Artists Engaged?

Non-Fungible Tokens (NFTs) offer a promising mechanism to protect Australian and Indigenous artists' copyright. They represent and transfer the value of artwork in digital form. Before adopting NFTs to protect Australian artwork, we in this paper investigate them empericially. We focus on examining the details of NFT structure. We start from the underlying structure of NFTs to show how they represent copyright for both artists and production owners, as well as how they aim to safeguard or secure the value of digital artworks. We then involve data collection from various types of sources with different storage methods, including on-chain, centralized, and decentralized systems. Based on both metadata and artwork content, we present our analysis and discussion on the following key issues: copyright, security and artist identification. The final results of the evaluation, unfortnately, show that the NFT is NOT ready to protect Australian and Indigenous artists' copyright.

cs.CR↗

arXiv2025

Is Your AI Truly Yours? Leveraging Blockchain for Copyrights, Provenance, and Lineage

As Artificial Intelligence (AI) integrates into diverse areas, particularly in content generation, ensuring rightful ownership and ethical use becomes paramount, AI service providers are expected to prioritize responsibly sourcing training data and obtaining licenses from data owners. However, existing studies primarily center on safeguarding static copyrights, which simply treat metadata/datasets as non-fungible items with transferable/trading capabilities, neglecting the dynamic nature of training procedures that can shape an ongoing trajectory. In this paper, we present \textsc{IBis}, a blockchain-based framework tailored for AI model training workflows. Our design can dynamically manage copyright compliance and data provenance in decentralized AI model training processes, ensuring that intellectual property rights are respected throughout iterative model enhancements and licensing updates. Technically, \textsc{IBis} integrates on-chain registries for datasets, licenses and models, alongside off-chain signing services to facilitate collaboration among multiple participants. Further, \textsc{IBis} provides APIs designed for seamless integration with existing contract management software, minimizing disruptions to established model training processes. We implement \textsc{IBis} using Daml on the Canton blockchain. Evaluation results showcase the feasibility and scalability of \textsc{IBis} across varying numbers of users, datasets, models, and licenses.

cs.CR↗

arXiv2025

StructMG: A Fast and Scalable Structured Algebraic Multigrid

Parallel multigrid is widely used as preconditioners in solving large-scale sparse linear systems. However, the current multigrid library still needs more satisfactory performance for structured grid problems regarding speed and scalability. Based on the classical 'multigrid seesaw', we derive three necessary principles for an efficient structured multigrid, which instructs our design and implementation of StructMG, a fast and scalable algebraic multigrid that constructs hierarchical grids automatically. As a preconditioner, StructMG can achieve both low cost per iteration and good convergence when solving large-scale linear systems with iterative methods in parallel. A stencil-based triple-matrix product via symbolic derivation and code generation is proposed for multi-dimensional Galerkin coarsening to reduce grid complexity, operator complexity, and implementation effort. A unified parallel framework of sparse triangular solver is presented to achieve fast convergence and high parallel efficiency for smoothers, including dependence-preserving Gauss-Seidel and incomplete LU methods. Idealized and real-world problems from radiation hydrodynamics, petroleum reservoir simulation, numerical weather prediction, and solid mechanics, are evaluated on ARM and X86 platforms to show StructMG's effectiveness. In comparison to \textit{hypre}'s structured and general multigrid preconditioners, StructMG achieves the fastest time-to-solutions in all cases with average speedups of 15.5x, 5.5x, 6.7x, 7.3x over SMG, PFMG, SysPFMG, and BoomerAMG, respectively. StructMG also significantly improves strong and weak scaling efficiencies.

math.NA↗

arXiv2025

Asymptotic expansion for groupoids and Roe type algebras

In this paper, we introduce a notion of expansion for groupoids, which recovers the classical notion of expander graphs by a family of pair groupoids and expanding actions in measure by transformation groupoids. We also consider an asymptotic version for expansion and establish structural theorems, showing that asymptotic expansion can be approximated by domains of expansions. On the other hand, we introduce dynamical propagation and quasi-locality for operators on groupoids and the associated Roe type algebras. Our main results characterise when these algebras possess block-rank-one projections by means of asymptotic expansion, which generalises the crucial ingredients in previous works to provide counterexamples to the coarse Baum-Connes conjecture.

math.OA↗

arXiv2025

MiniMax-M1: Scaling Test-Time Compute Efficiently with Lightning Attention

We introduce MiniMax-M1, the world's first open-weight, large-scale hybrid-attention reasoning model. MiniMax-M1 is powered by a hybrid Mixture-of-Experts (MoE) architecture combined with a lightning attention mechanism. The model is developed based on our previous MiniMax-Text-01 model, which contains a total of 456 billion parameters with 45.9 billion parameters activated per token. The M1 model natively supports a context length of 1 million tokens, 8x the context size of DeepSeek R1. Furthermore, the lightning attention mechanism in MiniMax-M1 enables efficient scaling of test-time compute. These properties make M1 particularly suitable for complex tasks that require processing long inputs and thinking extensively. MiniMax-M1 is trained using large-scale reinforcement learning (RL) on diverse problems including sandbox-based, real-world software engineering environments. In addition to M1's inherent efficiency advantage for RL training, we propose CISPO, a novel RL algorithm to further enhance RL efficiency. CISPO clips importance sampling weights rather than token updates, outperforming other competitive RL variants. Combining hybrid-attention and CISPO enables MiniMax-M1's full RL training on 512 H800 GPUs to complete in only three weeks, with a rental cost of just $534,700. We release two versions of MiniMax-M1 models with 40K and 80K thinking budgets respectively, where the 40K model represents an intermediate phase of the 80K training. Experiments on standard benchmarks show that our models are comparable or superior to strong open-weight models such as the original DeepSeek-R1 and Qwen3-235B, with particular strengths in complex software engineering, tool utilization, and long-context tasks. We publicly release MiniMax-M1 at https://github.com/MiniMax-AI/MiniMax-M1.

cs.CL↗

arXiv2025

BRC20 Pinning Attack

BRC20 tokens are a type of non-fungible asset on the Bitcoin network. They allow users to embed customised content within Bitcoin's satoshis. The token frenzy reached a market size of US\$2.811\,b (2023Q3--2025Q1). However, this intuitive design has not undergone serious security scrutiny. We present the first analysis of BRC20's \emph{transfer} mechanism and identify a new attack vector. A typical BRC20 transfer involves two "bundled" on-chain transactions with different fee levels: the first (i.e., \textbf{Tx1}) with a lower fee inscribes the \textsf{transfer} request, while the second (i.e., \textbf{Tx2}) with a higher fee finalizes the actual transfer. An adversary can send a manipulated fee transaction (falling between the two fee levels), which causes \textbf{Tx1} to be processed while \textbf{Tx2} is pinned in the mempool. This locks BRC20 liquidity and disrupts normal withdrawal requests from users. We term this the \emph{BRC20 pinning attack}. We validated the attack in real-world settings in collaboration with Binance researchers. With their knowledge and permission, we conducted a controlled test against Binance's ORDI hot wallet, resulting in a temporary suspension of ORDI withdrawals for 3.5 hours. Recovery was performed shortly after. Further analysis confirms that the attack can be applied to over \textbf{90\%} of inscription-based tokens within the Bitcoin ecosystem.

cs.CR↗

arXiv2025

Germanium Atomic Compton Scattering Measurements and ${ab}$ ${initio}$ Many-Body Calculations: Implications for Electronic recoil Dark Matter Detection

Diverse searches for direct dark matter (DM) in effective electromagnetic and leptophilic interactions resulting from new physics, as well as Weakly Interacting Massive Particles (WIMPs) with unconventional electronic recoils, are intensively pursued. Low-energy backgrounds from radioactive $γ$ rays via Compton scattering and photon coherent scattering are unavoidable in terrestrial detectors. The interpretation of dark matter experimental data is dependent on a better knowledge of the background in the low-energy region. We provide a 2.3% measurement of atomic Compton scattering in the low momentum transfer range of 180 eV/c to 25 keV/c, using a 10-g germanium detector bombarded by a $^{137}\mathrm{Cs}$ source with a 7.2 m-Curie radioactivity and the scatter photon collected by a cylindrical NaI[Tl] detector. The ability to detect Compton scattering's doubly differential cross section (DDCS) gives a special test for clearly identifying the kinematic restraints in atomic many-body systems, notably the Livermore model. Additionally, a low-energy-background comparison is made between coherent photon scattering and Compton scattering replacing the scattering function of ${GEANT4}$@software, which uses a completely relativistic impulse approximation (RIA) together with Multi-Configuration Dirac-Fock (MCDF) wavefunctions. For the purpose of investigating sub-GeV mass and electronic-recoil dark matter theories, signatures including low energy backgrounds via high energy $γ$ rays in germanium targets are discussed.

astro-ph.IM↗

arXiv2025

Geometric Banach property (T) for metric spaces via Banach representations of Roe algebras

In this paper, we introduce a notion of geometric Banach property (T) for metric spaces, which jointly generalizes Banach property (T) for groups and geometric property (T) for metric spaces. Our framework is achieved by Banach representations of Roe algebras of metric spaces. We show that geometric Banach property (T) is a coarse geometric invariant, and it is equivalent to the existence of the Kazhdan projections in the Banach-Roe algebras. Further, we study the implications of this property for sequences of finite Cayley graphs, establishing two key results: 1. geometric Banach property (T) of such sequences implies Banach property (T) for their limit groups; 2. while the Banach coarse fixed point property implies geometric Banach property (T), the converse fails. Additionally, we provide a geometric characterization of V. Lafforgue's strong Banach property (T) for a residually finite group in terms of geometric Banach property (T) of its box spaces.

math.FA↗

arXiv2025

Talking Transactions: Decentralized Communication through Ethereum Input Data Messages (IDMs)

Can you imagine, blockchain transactions can talk! In this paper, we study how they talk and what they talk about. We focus on the input data field of Ethereum transactions, which is designed to allow external callers to interact with smart contracts. In practice, this field also enables users to embed natural language messages into transactions. Users can leverage these Input Data Messages (IDMs) for peer-to-peer communication. This means that, beyond Ethereum's well-known role as a financial infrastructure, it also serves as a decentralized communication medium. We present the first large-scale analysis of Ethereum IDMs from the genesis block to February 2024 (3134 days). We filter IDMs to extract 867,140 transactions with informative IDMs and use LLMs for language detection. We find that English (95.4%) and Chinese (4.4%) dominate the use of natural languages in IDMs. Interestingly, English IDMs center on security and scam warnings (24%) with predominantly negative emotions, while Chinese IDMs emphasize emotional expression and social connection (44%) with a more positive tone. We also observe that longer English IDMs often transfer high ETH values for protocol-level purposes, while longer Chinese IDMs tend to involve symbolic transfer amounts for emotional intent. Moreover, we find that the IDM participants tend to form small, loosely connected communities (59.99%). Our findings highlight culturally and functionally divergent use cases of the IDM channel across user communities. We further examine the security relevance of IDMs in on-chain attacks. Many victims use them to appeal to attackers for fund recovery. IDMs containing negotiations or reward offers are linked to higher reply rates. We also analyze IDMs' regulatory implications. Their misuse for abuse, threats, and sexual solicitation reveals the urgent need for content moderation and regulation in decentralized systems.

cs.CR↗

arXiv2025

Coarse Geometry of Free Products of Metric Spaces

Recently, a notion of the free product $X \ast Y$ of two metric spaces $X$ and $Y$ has been introduced by T. Fukaya and T. Matsuka. In this paper, we study coarse geometric permanence properties of the free product $X \ast Y$. We show that if $X$ and $Y$ satisfy any of the following conditions, then $X \ast Y$ also satisfies that condition: (1) they are coarsely embeddable into a Hilbert space or a uniformly convex Banach space; (2) they have Yu's Property A; (3) they are hyperbolic spaces. These generalize the corresponding results for discrete groups to the case of metric spaces.

math.FA↗