Tootfinder

This https://arxiv.org/abs/2412.03824 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

Towards Data Governance of Frontier AI Models
Data is essential to train and fine-tune today's frontier artificial intelligence (AI) models and to develop future ones. To date, academic, legal, and regulatory work has primarily addressed how data can directly harm consumers and creators, such as through privacy breaches, copyright infringements, and bias and discrimination. Our work, instead, focuses on the comparatively neglected question of how data can enable new governance capacities for frontier AI models. This approach for "frontier …

Super-additivity of quantum capacity in simple channels
Zhen Wu, Qi Zhao, Zhihao Ma
https://arxiv.org/abs/2505.24661 https://arxiv.or…

Super-additivity of quantum capacity in simple channels
The super-additivity of quantum channel capacity is an important feature of quantum information theory different from classical theory, which has been attracting attention. Recently a special channel called ``platypus channel'' exhibits super-additive quantum capacity when combined with qudit erasure channels. Here we consider the ``generalized platypus channel'', prove that it has computable channel capacities, such as both private and classical capacity equal to $1$, and in particular, the ge…

Minimal Construction of Graphs with Maximum Robustness
Haejoon Lee, Dimitra Panagou
https://arxiv.org/abs/2507.00415 https://arxiv.or…

Minimal Construction of Graphs with Maximum Robustness
The notions of network $r$-robustness and $(r,s)$-robustness have been earlier introduced in the literature to achieve resilient control in the presence of misbehaving agents. However, while higher robustness levels provide networks with higher tolerances against the misbehaving agents, they also require dense communication structures, which are not always desirable for systems with limited capabilities and energy capacities. Therefore, this paper studies the fundamental structures behind $r$-r…

Critical demand in a stochastic model of flows in supply networks
Yannick Feld, Marc Barthelemy
https://arxiv.org/abs/2505.24813 https://

Critical demand in a stochastic model of flows in supply networks
Supply networks are essential for modern production, yet their critical properties remain understudied. We present a stochastic model with random production capacities to analyze material flow to a root node, focusing on topology and buffer stocks. The critical demand, where unsatisfied demand diverges, is examined mostly through numerical simulations. Without stocks, minimal production dictates behavior, making topology irrelevant. With stocks, memory effects arise, making topology crucial. In…

The fractional Lipschitz caloric capacity of Cantor sets
Joan Hern\'andez
https://arxiv.org/abs/2506.00712 https://arxiv.org/pdf/…

The fractional Lipschitz caloric capacity of Cantor sets
We characterize the s-parabolic Lipschitz caloric capacity of corner-like $s$-parabolic Cantor sets in $\mathbb{R}^{n+1}$ for $1/2

This https://arxiv.org/abs/2505.17115 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csMA_…

Swarm Intelligence Enhanced Reasoning: A Density-Driven Framework for LLM-Based Multi-Agent Optimization
Recently, many approaches, such as Chain-of-Thought (CoT) prompting and Multi-Agent Debate (MAD), have been proposed to further enrich Large Language Models' (LLMs) complex problem-solving capacities in reasoning scenarios. However, these methods may fail to solve complex problems due to the lack of ability to find optimal solutions. Swarm Intelligence has been serving as a powerful tool for finding optima in the field of traditional optimization problems. To this end, we propose integrating sw…

Geometric Representation of Generalized Coherent States and their Symplectic Capacities: A Synthetic Approach
Maurice de Gosson
https://arxiv.org/abs/2507.19606 https://

Geometric Representation of Generalized Coherent States and their Symplectic Capacities: A Synthetic Approach
In this work we review, complete, and synthesize results linking generalized coherent stages (nondegradable Gaussian wavefunctions) to the notions of Fermi ellipsoids, quantum blobs, and microlocal pairs introduced in previous work. These geometric objects are Fermi ellipsoids, quantum blobs, and microlocal pairs. In addition we study various symplectic capacities associated with these objects.

Capacity Planning in Stable Matching with Truthful or Strategic Preference Uncertainty
Maria Bazotte, Margarida Carvalho, Thibaut Vidal
https://arxiv.org/abs/2506.22560

Capacity Planning in Stable Matching with Truthful or Strategic Preference Uncertainty
Recent studies on many-to-one matching markets have explored agents with flexible capacity and truthful preference reporting, focusing on mechanisms that jointly design capacities and select a matching. However, in real-world applications such as school choice and residency matching, preferences are revealed after capacity decisions are made, with matching occurring afterward; uncertainty about agents' preferences must be considered during capacity planning. Moreover, even under strategy-proof …

Curvy points, the perimeter, and the complexity of convex toric domains
Dan Cristofaro-Gardiner, Nicki Magill, Dusa McDuff
https://arxiv.org/abs/2506.23498

Curvy points, the perimeter, and the complexity of convex toric domains
We study the related notions of curvature and perimeter for toric boundaries and their implications for symplectic packing problems; a natural setting for this is a generalized version of convex toric domain which we also study, where there are no conditions on the moment polytope at all aside from convexity. We show that the subleading asymptotics of the ECH and elementary ECH capacities recover the perimeter of such domains in their liminf, without any genericity required, and hence the per…

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
Vikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk
https://arxiv.org/abs/2506.21418

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
Motivated by the problem of estimating bottleneck capacities on the Internet, we formulate and study the problem of vantage point selection. We are given a graph $G=(V, E)$ whose edges $E$ have unknown capacity values that are to be discovered. Probes from a vantage point, i.e, a vertex $v \in V$, along shortest paths from $v$ to all other vertices, reveal bottleneck edge capacities along each path. Our goal is to select $k$ vantage points from $V$ that reveal the maximum number of bottleneck e…

Revealing Nanoscale Ni-Oxidation State Variations in Single-Crystal NMC811 via 2D and 3D Spectro-Ptychography
Ralf F. Ziesche, Michael J. Johnson, Ingo Manke, Joshua H. Cruddos, Alice V. Llewellyn, Chun Tan, Rhodri Jervis, Paul R. Shearing, Christoph Rau, Alexander J. E. Rettie, Silvia Cipiccia, Darren Batey
https://arxiv.org/abs/2507.2283…

Revealing Nanoscale Ni-Oxidation State Variations in Single-Crystal NMC811 via 2D and 3D Spectro-Ptychography
Enabling lithium (Li)-ion batteries with higher energy densities, longer cycle life, and lower costs will underpin the widespread electrification of the transportation and large-scale energy storage industries. Nickel (Ni)-rich layered oxide cathodes, such as LiNi$_{x}$Mn$_{y}$Co$_{z}$O$_{2}$ (NMC, x > 0.8), have gained popularity due to their high specific capacities and lower cobalt content. However, the standard polycrystalline morphology suffers from accelerated degradation at voltages abov…

Vision loss and neural plasticity: Enhanced multisensory integration and somatosensory processing https://physoc.onlinelibrary.wiley.com/doi/10.1113/JP288503 "The multisensory processing capacities of VI individuals are superior to those of sighted individual…

Variable Min-Cut Max-Flow Bounds and Algorithms in Finite Regime
Rivka Gitik, Alejandro Cohen
https://arxiv.org/abs/2507.14852 https://

Variable Min-Cut Max-Flow Bounds and Algorithms in Finite Regime
The maximum achievable capacity from source to destination in a network is limited by the min-cut max-flow bound; this serves as a converse limit. In practice, link capacities often fluctuate due to dynamic network conditions. In this work, we introduce a novel analytical framework that leverages tools from computational geometry to analyze throughput in heterogeneous networks with variable link capacities in a finite regime. Within this model, we derive new performance bounds and demonstrate t…

I doubt these are the last 3 Tandon Data PACs in captivity but they may be.
I'm considering dismantling them and driving a spike through the drives.
For anyone wondering, they were removable drives that had 30Mb and 40Mb capacities. There was no controller electronics that was a separate board on the PC. And we had dual bay small tower PCs as well.
The original customer was Xerox.
Essentially they ate up remanufactured drives which otherwise had become difficult…

Thermophysical Properties and Phase Behavior of CO2 with Impurities: Insight from Molecular Simulations
Darshan Raju, Mahinder Ramdin, Thijs J. H. Vlugt
https://arxiv.org/abs/2505.22268

Thermophysical Properties and Phase Behavior of CO2 with Impurities: Insight from Molecular Simulations
Experimentally determining thermophysical properties for various compositions commonly found in CO2 transportation systems is extremely challenging. To overcome this challenge, we performed Monte Carlo (MC) and molecular dynamics (MD) simulations of CO2 rich mixtures to compute thermophysical properties such as densities, thermal expansion coefficients, isothermal compressibilities, heat capacities, Joule-Thomson coefficients, speed of sound, and viscosities at temperatures (235-313) K and pres…

Germany won't supply Ukraine with Taurus missiles, urges weapons makers to step up, defense minister says: https://benborges.xyz/2025/07/14/germany-wont-supply-ukraine-with.html

Multi-type logistic branching processes with selection: frequency process and genealogy for large carrying capacities
Marta Dai Pra, Julian Kern
https://arxiv.org/abs/2507.12601

Multi-type logistic branching processes with selection: frequency process and genealogy for large carrying capacities
We present a model for growth in a multi-species population. We consider two types evolving as a logistic branching process with mutation, where one of the types has a selective advantage, and are interested in the regime in which the carrying capacity of the system goes to $\infty$. We first study the genealogy of the population up until it almost reaches carrying capacity through a coupling with an independent branching process. We then focus on the phase in which the population has reached c…

On computation of capacities
Mohamed M S Nasser, Matti Vuorinen
https://arxiv.org/abs/2507.11648 https://arxiv.org/pdf/2507.11648

On computation of capacities
We give a survey of computation of the conformal capacity of planar condensers, generalized capacity, and logarithmic capacity with emphasis on our recent work 2020-2025. We also discuss some applications of our method based on the boundary integral equation with the generalized Neumann kernel to the computation of several other conformal invariants: harmonic measure, modulus of a quadrilateral, reduced modulus, hyperbolic capacity, and elliptic capacity. Here the solution of mixed Dirichlet-Ne…

The Emotional Alignment Design Policy
Eric Schwitzgebel, Jeff Sebo
https://arxiv.org/abs/2507.06263 https://arxiv.org/pdf/2507.06263

The Emotional Alignment Design Policy
According to what we call the Emotional Alignment Design Policy, artificial entities should be designed to elicit emotional reactions from users that appropriately reflect the entities' capacities and moral status, or lack thereof. This principle can be violated in two ways: by designing an artificial system that elicits stronger or weaker emotional reactions than its capacities and moral status warrant (overshooting or undershooting), or by designing a system that elicits the wrong type of emo…

AIn't Nothing But a Survey? Using Large Language Models for Coding German Open-Ended Survey Responses on Survey Motivation
Leah von der Heyde, Anna-Carolina Haensch, Bernd Wei{\ss}, Jessika Daikeler
https://arxiv.org/abs/2506.14634

AIn't Nothing But a Survey? Using Large Language Models for Coding German Open-Ended Survey Responses on Survey Motivation
The recent development and wider accessibility of LLMs have spurred discussions about how they can be used in survey research, including classifying open-ended survey responses. Due to their linguistic capacities, it is possible that LLMs are an efficient alternative to time-consuming manual coding and the pre-training of supervised machine learning models. As most existing research on this topic has focused on English-language responses relating to non-complex topics or on single LLMs, it is u…

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
Mordecai J. Golin, Sai Sandeep

This https://arxiv.org/abs/2504.15207 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Parametric Gromov width of Liouville domains
The classical Gromov width measures the largest symplectic ball embeddable into a symplectic manifold; inspired by the symplectic camel problem, we generalize this to ask how large a symplectic ball can be embedded as a family over a parameter space $N$. Given a smooth map $f: N \to Ω$, where $Ω$ is a symplectic manifold, we define the \emph{parametric Gromov width} $\mathrm{Gr}(f,Ω)$ as the supremum of capacities $a>0$ for which there exists a family of balls, parametrized by $N$, of capaci…

Statistical Description of Fermi System over a Surface in a Uniform External Field
Yu. M. Poluektov, A. A. Soroka
https://arxiv.org/abs/2506.12608 https://…

Statistical Description of Fermi System over a Surface in a Uniform External Field
A statistical approach to the description of the thermodynamic properties of the Fermi particle system occupying a half-space over a plane of finite size in a uniform external field is proposed. The number of particles per unit area is assumed to be arbitrary, in particular, small. General formulas are obtained for entropy, energy, thermodynamic potential, heat capacities under various conditions and the distribution of the particle number density over the surface. In the continuum limit of a l…

Conversational Search: From Fundamentals to Frontiers in the LLM Era
Fengran Mo, Chuan Meng, Mohammad Aliannejadi, Jian-Yun Nie
https://arxiv.org/abs/2506.10635

Conversational Search: From Fundamentals to Frontiers in the LLM Era
Conversational search enables multi-turn interactions between users and systems to fulfill users' complex information needs. During this interaction, the system should understand the users' search intent within the conversational context and then return the relevant information through a flexible, dialogue-based interface. The recent powerful large language models (LLMs) with capacities of instruction following, content generation, and reasoning, attract significant attention and advancements, …

This https://arxiv.org/abs/2401.04003 has been replaced.
link: https://scholar.google.com/scholar?q=a

Simultaneous Task Allocation and Planning for Multi-Robots under Hierarchical Temporal Logic Specifications
Research in robotic planning with temporal logic specifications, such as Linear Temporal Logic (LTL), has relied on single formulas. However, as task complexity increases, LTL formulas become lengthy, making them difficult to interpret and generate, and straining the computational capacities of planners. To address this, we introduce a hierarchical structure for a widely used specification type -- LTL on finite traces (LTL$_f$). The resulting language, termed H-LTL$_f$, is defined with both its…

Some computational aspects of spectral sequences in \v{C}ech cohomology
Matthias Zach
https://arxiv.org/abs/2506.02636 https://arxiv.…

Some computational aspects of spectral sequences in Čech cohomology
Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily challenges the capacities of modern computers. We describe an algorithm and its implementation to compute a spectral sequence converging to the higher direct images of a bounded complex of sheaves on a product of projective spaces $\mathbb P = \mathbb P^{r_1}\times…

Memory-Efficient Split Federated Learning for LLM Fine-Tuning on Heterogeneous Mobile Devices
Xiaopei Chen, Liang Li, Fei Ji, Wen Wu
https://arxiv.org/abs/2506.02940

Memory-Efficient Split Federated Learning for LLM Fine-Tuning on Heterogeneous Mobile Devices
In this paper, we propose an edge-assisted split federated learning framework to facilitate large language model (LLM) fine-tuning on heterogeneous mobile devices while alleviating memory pressures on both mobile devices and the edge server. Specifically, mobile devices perform low-rank adaptation (LoRA) fine-tuning on only a subset of lower layers of the pre-trained LLM, tailored to their individual capacities. On the server, a full LLM is maintained, and the corresponding LoRA modules are sel…

Coordinated Fast Frequency Regulation in Dynamic Virtual Power Plants via Disturbance Estimation
Saif Ahmad, Seifeddine Ben Elghali, Hafiz Ahmed
https://arxiv.org/abs/2507.06713

Coordinated Fast Frequency Regulation in Dynamic Virtual Power Plants via Disturbance Estimation
In the context of dynamic virtual power plants (DVPPs), the integration of frequency containment reserve (FCR) and fast frequency control (FFC) enabled via local compensation of power imbalance represents a significant advancement in decentralized frequency regulation. However, they still have to cope with the limited power and energy capacities associated with commonly available storage solutions. This work combines a disturbance estimation based decentralized local control with distributed im…

This https://arxiv.org/abs/2506.00712 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The fractional Lipschitz caloric capacity of Cantor sets
We characterize the s-parabolic Lipschitz caloric capacity of corner-like $s$-parabolic Cantor sets in $\mathbb{R}^{n+1}$ for $1/2

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
Jakub {\L}\k{a}cki, Slobodan Mitrovi\'c, Srikkanth Ramachandran, Wen-Horng Sheu
https://arxiv.org/abs/2506.04524

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of $b$-matching, in which the input is a bipartite graph with capacities greater than $1$ in only one part of the bipartition. We give a $(1+ε)$ approximate algorithm for the problem, which runs in $\tilde{O}(\sqrt{\log λ})$ MPC rounds, using sublinear space per machine and $\tilde{O}(λn)$ total space, where $λ$ is the arboricity of the input graph. Our result is obtained by pro…

Systolic inequalities on the sphere from symplectic embeddings
Brayan Ferreira
https://arxiv.org/abs/2506.07674 https://arxiv.org/pdf…

Systolic inequalities on the sphere from symplectic embeddings
We use properties of symplectic capacities that were recently defined by Hutchings to obtain upper bounds on the minimal action of Reeb orbits on fiberwise star-shaped hypersurfaces $Σ\subset T^*S^2$. In addition, we introduce the notion of a fiberwise $β$-balanced hypersurface $Σ\subset T^*S^2$ and establish upper bounds for the systole in terms of $β$ and geometric data, in the case of Riemannian metrics on $S^2$ satisfying this property. Finally, under the assumption of antipodal symmetr…