Tootfinder

How Norway Is Proving That Homelessness Is a Solvable Problem https://reasonstobecheerful.world/norway-proving-homelessness-solvable-problem/?utm_source=dlvr.it&a…

How Norway Is Proving That Homelessness Is a Solvable Problem
The Scandinavian nation has significantly reduced the number of people experiencing homelessness. What could other countries learn from its example?

UK Culture Secretary Lisa Nandy says the BBC had several editorial failures in its Gaza coverage and has a "problem of leadership" (Jake Kanter/Deadline)
https://deadline.com/2025/06/bbc-bob-vylan-lisa-nandy-leadership-problem-1236445…

UK Culture Secretary Says BBC Has “Problem Of Leadership” After String Of Gaza Scandals
UK culture secretary Lisa Nandy has accused the BBC of having a "problem of leadership" after its latest editorial debacle over the Gaza conflict.

Für Kapitäne ohne Fernweh: Wenn Schiffe ferngesteuert werden
Technisch ist es kein großes Problem, ein großes Frachtschiff fernzusteuern, Tests sind aber nötig. Wenn alles klappt, hätte die Branche eine Sorge weniger.

In Lippstadt wurden das evangelische Krankenhaus und das katholische Krankenhaus zum christlichen Krankenhaus fusioniert.
Das Problem: Der katholische Träger lässt keine medizinisch indizierten Abtreibungen zu. Der Chefarzt des evangelischem Krankenhauses hat im Arbeitsvertrag festgeschrieben, dass er medizinisch indizierte Abtreibungen durchführen darf.
M.E. hätte der katholische Betreiber der Fusion nicht zustimmen dürfen wegen des Arbeitsvertrages. Der evangelische Betreiber hätte…

In Lippstadt wurden das evangelische Krankenhaus und das katholische Krankenhaus zum christlichen Krankenhaus fusioniert.
Das Problem: Der katholische Träger lässt keine medizinisch indizierten Abtreibungen zu. Der Chefarzt des evangelischem Krankenhauses hat im Arbeitsvertrag festgeschrieben, dass er medizinisch indizierte Abtreibungen durchführen darf.
M.E. hätte der katholische Betreiber der Fusion nicht zustimmen dürfen wegen des Arbeitsvertrages. Der evangelische Betreiber hätte…

Spectral generalized Tur\'{a}n problems
Xizhi Liu
https://arxiv.org/abs/2507.21689 https://arxiv.org/pdf/2507.21689

Spectral generalized Turán problems
Combining two well-studied variants of the classical Turán problem, the generalized Turán problem and the spectral Turán problem, we introduce the spectral generalized Turán problem and establish a general theorem that extends the result of Keevash--Lenz--Mubayi~\cite{KLM14} on the spectral Turán problem in this broader setting. As a quick application, we obtain the spectral Erdős Pentagon Theorem. We also introduce the notion of entropic density for generalized Turán problems, and show …

Remarks on the fine structure of the free boundary (the no-sign obstacle problem)
Seongmin Jeon, Henrik Shahgholian
https://arxiv.org/abs/2506.21942 https:…

Remarks on the fine structure of the free boundary (the no-sign obstacle problem)
We present a number of results inspired by the approach developed in a recent work by A. Figalli and J. Serra on the fine structure of the obstacle problem, which turns out to be partially effective in addressing the no-sign obstacle problem. However, we also highlight one or two central questions that remain open and appear to require different techniques not presently available to us.

Multimodal Late Fusion Model for Problem-Solving Strategy Classification in a Machine Learning Game
Clemens Witt, Thiemo Leonhardt, Nadine Bergner, Mareen Grillenberger
https://arxiv.org/abs/2507.22426

Multimodal Late Fusion Model for Problem-Solving Strategy Classification in a Machine Learning Game
Machine learning models are widely used to support stealth assessment in digital learning environments. Existing approaches typically rely on abstracted gameplay log data, which may overlook subtle behavioral cues linked to learners' cognitive strategies. This paper proposes a multimodal late fusion model that integrates screencast-based visual data and structured in-game action sequences to classify students' problem-solving strategies. In a pilot study with secondary school students (N=149) p…

Solving a real-world modular logistic scheduling problem with a quantum-classical metaheuristics
Florian Krellner, Abhishek Awasthi, Nico Kraus, Sarah Braun, Michael Poppel, Daniel Porawski
https://arxiv.org/abs/2507.21701

Solving a real-world modular logistic scheduling problem with a quantum-classical metaheuristics
This study evaluates the performance of a quantum-classical metaheuristic and a traditional classical mathematical programming solver, applied to two mathematical optimization models for an industry-relevant scheduling problem with autonomous guided vehicles (AGVs). The two models are: (1) a time-indexed mixed-integer linear program, and (2) a novel binary optimization problem with linear and quadratic constraints and a linear objective. Our experiments indicate that optimization methods are ve…

Practice-Based Optimization for the Strategic Locomotive Assignment Problem
Yunji Kim, Amira Hijazi, Kevin Dalmeijer, Pascal Van Hentenryck
https://arxiv.org/abs/2507.22235 http…

Practice-Based Optimization for the Strategic Locomotive Assignment Problem
This study addresses the challenge of efficiently assigning locomotives in large freight rail networks, where operational complexity and power imbalances make cost-effective planning difficult. It presents a strategic optimization framework for the Locomotive Assignment Problem (LAP), developed in collaboration with a major North American Class I Freight Railroad. The problem is formulated as a network-based integer program over a cyclic space-time network, producing a repeatable weekly locomot…

You cannot capture the essence of capitalism in a single pho- https://me.dm/@davidtoddmccarty/114944150346707896

David Todd McCarty (@davidtoddmccarty@me.dm)
Attached: 1 image So clearly the most hateful and soulless solution to a problem that might exist.

@… I very much agree with many of your points, and I’m glad that I no longer work in CL—which had already become NLP a long time ago, and is now by many considered “a subfield of ML.”
I think the problem started when computational linguistics and linguistics split into separate disciplines: one less and less interested in language, the other less…

@… I very much agree with many of your points, and I’m glad that I no longer work in CL—which had already become NLP a long time ago, and is now by many considered “a subfield of ML.”
I think the problem started when computational linguistics and linguistics split into separate disciplines: one less and less interested in language, the other less…

Parameterized Complexity of Directed Traveling Salesman Problem
V\'aclav Bla\v{z}ej, Andreas Emil Feldmann, Foivos Fioravantes, Pawe{\l} Rz\k{a}\.zewski, Ond\v{r}ej Such\'y
https://arxiv.org/abs/2506.22127

Parameterized Complexity of Directed Traveling Salesman Problem
The Directed Traveling Salesman Problem (DTSP) is a variant of the classical Traveling Salesman Problem in which the edges in the graph are directed and a vertex and edge can be visited multiple times. The goal is to find a directed closed walk of minimum length (or total weight) that visits every vertex of the given graph at least once. In a yet more general version, Directed Waypoint Routing Problem (DWRP), some vertices are marked as terminals and we are only required to visit all terminals.…

The Problem with Safety Classification is not just the Models
Sowmya Vajjala
https://arxiv.org/abs/2507.21782 https://arxiv.org/pdf/2507.21782

The Problem with Safety Classification is not just the Models
Studying the robustness of Large Language Models (LLMs) to unsafe behaviors is an important topic of research today. Building safety classification models or guard models, which are fine-tuned models for input/output safety classification for LLMs, is seen as one of the solutions to address the issue. Although there is a lot of research on the safety testing of LLMs themselves, there is little research on evaluating the effectiveness of such safety classifiers or the evaluation datasets used fo…

Nets-within-Nets through the Lens of Data Nets
Francesco Di Cosmo, Soumodev Mal, Tephilla Prince
https://arxiv.org/abs/2506.22344 https://

Nets-within-Nets through the Lens of Data Nets
Elementary Object Systems (EOSs) are a model in the nets-within-nets (NWNs) paradigm, where tokens in turn can host standard Petri nets. We study the complexity of the reachability problem of EOSs when subjected to non-deterministic token losses. It is known that this problem is equivalent to the coverability problem with no lossiness of conservative EOSs (cEOSs). We precisely characterize cEOS coverability into the framework of data nets, whose tokens carry data from an infinite domain. Specif…

That thing where a neighbour goes on a bit of an “anti-woke” grumble on the neighbourhood chat then asks for help the very next day…
#lgbtq

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

On Coalgebraic Product Constructions for Markov Chains and Automata
Verifying traces of systems is a central topic in formal verification. We study model checking of Markov chains (MCs) against temporal properties represented as (finite) automata. For instance, given an MC and a deterministic finite automaton (DFA), a simple but practically useful model checking problem asks for the probability of traces on the MC that are accepted by the DFA. A standard approach to solving this problem constructs a product MC of the given MC and DFA, reducing the task to a sim…

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
Jayson Lynch, Jack Spalding-Jamieson
https://arxiv.org/abs/2507.22293 https://

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
The (unweighted) point-separation} problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has shown that the point-separation problem can be characterized as a type of shortest-path problem in a geometric intersection graph within a special lifted space. However, all known solutions to this problem essentially reduce to some form of APSP, and hence t…

Recovering the Topology in One Point Interaction Problem on Extended Non-Local Star Graphs
Lung-Hui Chen
https://arxiv.org/abs/2506.22322 https://

Recovering the Topology in One Point Interaction Problem on Extended Non-Local Star Graphs
The author studies the inverse spectral problem of Sturm-Liouville operator on a star-like graph. To this star-like graph centered at the origin as its vertex, there are attached $m$ edges that imposed the Sturm-Liouville operator with certain non-local potential functions with some suitable local boundary value conditions. At the vertex, we consider one point interaction condition at vertex to model a network that fixed on the end of the edges on the graph. The vibration and flow changes are m…

I wished I could disagree with this post but sadly I cannot. I had high hopes for Matrix and still use it but boy is it not fixing the core and conceptual issues.
https://shkspr.mobi/blog/2025/07/im-never-going-back-to-matrix/

I'm never going back to Matrix
I should love Matrix. It is a decentralised, privacy preserving, multi-platform chat tool. Goodbye Slack and your ridiculous free limits. Adiós Discord and your weird gamification. Suck it IRC with your obscure syntax and faint stench of BO. WhatsApp and Telegram can stick their heads in a bucket of lukewarm sick and sing sea shanties! Let's join the future! The problem is - Matrix is shit. Not …

Arnold diffusion in the elliptic Hill four-body problem: geometric method and numerical verification
Jaime Burgos, Marian Gidea, Claudio Sierpe
https://arxiv.org/abs/2507.22416 …

Arnold diffusion in the elliptic Hill four-body problem: geometric method and numerical verification
We present a mechanism for Arnold diffusion in energy in a model of the elliptic Hill four-body problem. Our model is expressed as a small perturbation of the circular Hill four-body problem, with the small parameter being the eccentricity of the orbits of the primaries. The mechanism relies on the existence of two normally hyperbolic invariant manifolds (NHIMs), and on the corresponding homoclinic and heteroclinic connections. The dynamics along homoclinic/heteroclinic orbits is encoded via sc…

Just read this post by @… on an optimistic AGI future, and while it had some interesting and worthwhile ideas, it's also in my opinion dangerously misguided, and plays into the current AGI hype in a harmful way.
https://social.coop/@eloquence/114940607434005478
My criticisms include:
- Current LLM technology has many layers, but the biggest most capable models are all tied to corporate datacenters and require inordinate amounts of every and water use to run. Trying to use these tools to bring about a post-scarcity economy will burn up the planet. We urgently need more-capable but also vastly more efficient AI technologies if we want to use AI for a post-scarcity economy, and we are *not* nearly on the verge of this despite what the big companies pushing LLMs want us to think.
- I can see that permacommons.org claims a small level of expenses on AI equates to low climate impact. However, given current deep subsidies on place by the big companies to attract users, that isn't a great assumption. The fact that their FAQ dodges the question about which AI systems they use isn't a great look.
- These systems are not free in the same way that Wikipedia or open-source software is. To run your own model you need a data harvesting & cleaning operation that costs millions of dollars minimum, and then you need millions of dollars worth of storage & compute to train & host the models. Right now, big corporations are trying to compete for market share by heavily subsidizing these things, but it you go along with that, you become dependent on them, and you'll be screwed when they jack up the price to a profitable level later. I'd love to see open dataset initiatives SBD the like, and there are some of these things, but not enough yet, and many of the initiatives focus on one problem while ignoring others (fine for research but not the basis for a society yet).
- Between the environmental impacts, the horrible labor conditions and undercompensation of data workers who filter the big datasets, and the impacts of both AI scrapers and AI commons pollution, the developers of the most popular & effective LLMs have a lot of answer for. This project only really mentions environmental impacts, which makes me think that they're not serious about ethics, which in turn makes me distrustful of the whole enterprise.
- Their language also ends up encouraging AI use broadly while totally ignoring several entire classes of harm, so they're effectively contributing to AI hype, especially with such casual talk of AGI and robotics as if embodied AGI were just around the corner. To be clear about this point: we are several breakthroughs away from AGI under the most optimistic assumptions, and giving the impression that those will happen soon plays directly into the hands of the Sam Altmans of the world who are trying to make money off the impression of impending huge advances in AI capabilities. Adding to the AI hype is irresponsible.
- I've got a more philosophical criticism that I'll post about separately.
I do think that the idea of using AI & other software tools, possibly along with robotics and funded by many local cooperatives, in order to make businesses obsolete before they can do the same to all workers, is a good one. Get your local library to buy a knitting machine alongside their 3D printer.
Lately I've felt too busy criticizing AI to really sit down and think about what I do want the future to look like, even though I'm a big proponent of positive visions for the future as a force multiplier for criticism, and this article is inspiring to me in that regard, even if the specific project doesn't seem like a good one.

🦖🦕
via @…

Na gut, dann kleben wir die Stadt eben noch einmal mit #NolympiaHH voll
https://www.instagram.com/p/DKUj8edMeZu/

NDR Hamburg on Instagram: "Hamburg hat am Sonnabend als letzter von vier Kandidaten seine Pläne für eine mögliche deutsche Bewerbung um Olympische und Paralympische Spiele 2036, 2040 oder 2044 vorgestellt: Beachvolleyball auf dem Heiligengeistfeld, Schwimmen im Volksparkstadion, Hockey im Millerntorstadion - und Leichtathletik im Volkspark. Das fehlende Leichtathletikstadion war bislang in der Hansestadt mit Blick auf Olympische Spiele ein großes Problem. Nun entsteht in unmittelbarer Nähe zum Volksparkstadion eine ohnehin geplante Arena, die bis zu 60.000 Menschen fasst und auch ohne Olympia-Zuschlag gebaut wird. ___ #olympia #olympischespiele #hamburg #volsparkstadion #millerntorstadion #hamburg #ndr #activecity"
1,594 likes, 55 comments - ndrhamburg on May 31, 2025: "Hamburg hat am Sonnabend als letzter von vier Kandidaten seine Pläne für eine mögliche deutsche Bewerbung um Olympische und Paralympische Spiele 2036, 2040 oder 2044 vorgestellt: Beachvolleyball auf dem Heiligengeistfeld, Schwimmen im Volksparkstadion, Hockey im Millerntorstadion - und Leichtathletik im Volkspark. Das fehlende Leichtathletikstadion war bislang in der Hansestadt mit Blick auf Olympische Spiele ein großes Problem. Nun e…

Kamala Harris' enthusiasm problem (Politico)
https://www.politico.com/newsletters/california-playbook/2025/06/27/kamala-harris-enthusiasm-problem-00428986
http://www.memeorandum.com/250629/p47#a250629p47

Macroscopic fluctuation theory from a Lagrangian viewpoint and the Schr\"odinger problem
L. Bertini, D. Gabrielli, G. Jona-Lasinio
https://arxiv.org/abs/2506.22085

Macroscopic fluctuation theory from a Lagrangian viewpoint and the Schrödinger problem
We formulate the Schrödinger problem for interacting particle systems in the hydrodynamical regime thus extending the standard setting of independent particles. This involves the large deviations rate function for the empirical measure which is in fact a richer observable than the hydrodynamic observables density and current. In the case in which the constraints are the initial and final density, we characterize the optimal measure for the Schrödinger problem. We also introduce versions of th…

An application of the hit problem to the algebraic transfer
Nguyen Sum
https://arxiv.org/abs/2505.23218 https://arxiv.org/pdf/2505.23…

An application of the hit problem to the algebraic transfer
Let $P_k$ be the polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the field $\mathbb F_2$ with two elements, in $k$ variables $x_1, x_2, \ldots , x_k$, each variable of degree 1. Denote by $GL_k$ the general linear group over $\mathbb F_2$ which regularly acts on $P_k$. The algebra $P_k$ is a module over the mod-2 Steenrod algebra $\mathcal A$. In 1989, Singer [22] defined the $k$-th homological algebraic transfer, which is a homomorphism $$φ_k=(φ_k)_m :{\rm Tor}^{\mathcal A}_{k,k+m…

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
Yuichi Sudo
https://arxiv.org/abs/2505.23649 …

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size $n$. Burman, Chen, Chen, Doty, Nowak, Severson, and Xu (PODC 2021) showed that this problem can be solved in $O(n)$ expected time with $O(n)$ states. Recently, Gąsieniec, Grodzicki, and Stachowiak (PODC 2025) proved that $n+O(\log n)$ states suffice to achieve $O(n \log n)$ time both in expectation and with high probability (w.h.p.). If substantially m…

Automatically discovering heuristics in a complex SAT solver with large language models
Yiwen Sun, Furong Ye, Zhihan Chen, Ke Wei, Shaowei Cai
https://arxiv.org/abs/2507.22876 h…

Automatically discovering heuristics in a complex SAT solver with large language models
Satisfiability problem (SAT) is a cornerstone of computational complexity with broad industrial applications, and it remains challenging to optimize modern SAT solvers in real-world settings due to their intricate architectures. While automatic configuration frameworks have been developed, they rely on manually constrained search spaces and yield limited performance gains. This work introduces a novel paradigm which effectively optimizes complex SAT solvers via Large Language Models (LLMs), and…

This is only a problem for Reddit as long as the spammers don’t pay. The “solution” will be a paid program for “product placement” or something, and presto, they become valued customers.
The future’s so bright, it burns my eyes.
https://9to5mac.com/2025/06/26/r…

Shape-for-Motion: Precise and Consistent Video Editing with 3D Proxy
Yuhao Liu, Tengfei Wang, Fang Liu, Zhenwei Wang, Rynson W. H. Lau
https://arxiv.org/abs/2506.22432

Shape-for-Motion: Precise and Consistent Video Editing with 3D Proxy
Recent advances in deep generative modeling have unlocked unprecedented opportunities for video synthesis. In real-world applications, however, users often seek tools to faithfully realize their creative editing intentions with precise and consistent control. Despite the progress achieved by existing methods, ensuring fine-grained alignment with user intentions remains an open and challenging problem. In this work, we present Shape-for-Motion, a novel framework that incorporates a 3D proxy for …

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

Localization of tumor through a non-conventional numerical shape optimization technique
This paper introduces a method for estimating the shape and location of an embedded tumor. The approach utilizes shape optimization techniques, applying the coupled complex boundary method. By rewriting the problem -- characterized by a measured temperature profile and corresponding flux (e.g., from infrared thermography) -- into a complex boundary value problem with a complex Robin boundary condition, the method simplifies the over-specified nature of the problem. The size and location of the …

Control Copy-Paste: Controllable Diffusion-Based Augmentation Method for Remote Sensing Few-Shot Object Detection
Yanxing Liu, Jiancheng Pan, Bingchen Zhang
https://arxiv.org/abs/2507.21816

Control Copy-Paste: Controllable Diffusion-Based Augmentation Method for Remote Sensing Few-Shot Object Detection
Few-shot object detection (FSOD) for optical remote sensing images aims to detect rare objects with only a few annotated bounding boxes. The limited training data makes it difficult to represent the data distribution of realistic remote sensing scenes, which results in the notorious overfitting problem. Current researchers have begun to enhance the diversity of few-shot novel instances by leveraging diffusion models to solve the overfitting problem. However, naively increasing the diversity of …

Trump's ego pushes the narrative that he's somehow a good negotiator & 'gets the best deals' from other countries.
Problem: 6 bankruptcies & no one's left that will lend him money. He only knows how to negotiate w/ dumb blunt instruments: Bribes & Tariffs.
Result: Zero actual trade agreements.

A Compute-Matched Re-Evaluation of TroVE on MATH
Tobias Sesterhenn, Ian Berlot-Attwell, Janis Zenkner, Christian Bartelt
https://arxiv.org/abs/2507.22069 https://

A Compute-Matched Re-Evaluation of TroVE on MATH
Reusing established theorems and formulas is central to mathematical problem solving, serving as essential building blocks for tackling increasingly complex challenges. Recent work, TroVE, argues that code-generating Large Language Models (LLMs) can benefit similarly on the MATH benchmark by inducing and reusing higher-level toolboxes. By allocating computational budget across an ensemble of three modes -- directly generating code, creating tools, and reusing tools -- TroVE claims to outperform…

The goofy-symmetric Standard Model and the Hierarchy Problem
Thede de Boer, Florian Goertz, Andrea Incrocci
https://arxiv.org/abs/2507.22111 https://arxiv.…

The goofy-symmetric Standard Model and the Hierarchy Problem
A new class of so-called "goofy" symmetries has been shown to lead to renormalization-group stable relations between parameters in two-Higgs-Doublet Models, not known before. In this work we investigate goofy transformations in the Standard Model (SM), extending them to the fermion sector. We show that the SM action is goofy "symmetric", if the Higgs mass term vanishes, while other SM interactions are allowed. Goofy symmetry could thus add another option to the very few means to successfully fo…

"Early one Sunday when I was the president of the Trump Plaza Hotel and Casino in Atlantic City, Donald Trump and his friend Jeffrey Epstein arrived to the casino unannounced. But there was a problem: They had brought guests too young to be there."
**Donald Trump and Jeffrey Epstein: I've told a story about them for years. Now people are listening.**
https://archive.ph/zjLFw

Benchmarking Fraud Detectors on Private Graph Data
Alexander Goldberg, Giulia Fanti, Nihar Shah, Zhiwei Steven Wu
https://arxiv.org/abs/2507.22347 https://…

Benchmarking Fraud Detectors on Private Graph Data
We introduce the novel problem of benchmarking fraud detectors on private graph-structured data. Currently, many types of fraud are managed in part by automated detection algorithms that operate over graphs. We consider the scenario where a data holder wishes to outsource development of fraud detectors to third parties (e.g., vendors or researchers). The third parties submit their fraud detectors to the data holder, who evaluates these algorithms on a private dataset and then publicly communica…

Ensemble Control of Stochastic Oscillators via Periodic and Feedback Control
Kaito Ito, Haruhiro Kume, Hideaki Ishii
https://arxiv.org/abs/2507.21441 https://

Ensemble Control of Stochastic Oscillators via Periodic and Feedback Control
We address the problem of steering the phase distribution of oscillators all receiving the same control input to a given target distribution. In a large population limit, the distribution of oscillators can be described by a probability density. Then, our problem can be seen as that of ensemble control with a constraint on the steady-state density. In particular, we consider the case where oscillators are subject to stochastic noise, for which the theoretical understanding is still lacking. Fir…

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

A Deep Learning-Aided Approach for Estimating Field Permeability Map by Fusing Well Logs, Well Tests, and Seismic Data
Obtaining reliable permeability maps of oil reservoirs is crucial for building a robust and accurate reservoir simulation model and, therefore, designing effective recovery strategies. This problem, however, remains challenging, as it requires the integration of various data sources by experts from different disciplines. Moreover, there are no sources to provide direct information about the inter-well space. In this work, a new method based on the data-fusion approach is proposed for predicting…

No One Knows How to Deal With 'Student-on-Student' AI CSAM https://www.404media.co/no-one-knows-how-to-deal-with-student-on-student-ai-csam/

An Effective Two-Phase Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem (RCPSP)
D. Sun, S. Zhou
https://arxiv.org/abs/2506.21915

An Effective Two-Phase Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem (RCPSP)
This note presents a simple and effective variation of genetic algorithm (GA) for solving RCPSP, denoted as 2-Phase Genetic Algorithm (2PGA). The 2PGA implements GA parent selection in two phases: Phase-1 includes the best current solutions in the parent pool, and Phase-2 excludes the best current solutions from the parent pool. The 2PGA carries out the GA evolution by alternating the two phases iteratively. In exploring a solution space, the Phase-1 emphasizes intensification in current neighb…

A coding problem that sounded simple, but to implement it with good performance was quite a challenge::
Given a number n, find the next number m where m > n, with m containing the same digits as n
So given 12 this would be 21
113 -> 131
534987 -> 537489
111 -> no solution, -1, error or whatever
EDIT: changed the solution of example for 534987
#programming

Modification of a Numerical Method Using FIR Filters in a Time-dependent SIR Model for COVID-19
Felipe Rog\'erio Pimentel, Rafael Gustavo Alves
https://arxiv.org/abs/2506.21739

Modification of a Numerical Method Using FIR Filters in a Time-dependent SIR Model for COVID-19
Authors Yi-Cheng Chen, Ping-En Lu, Cheng-Shang Chang, and Tzu-Hsuan Liu use the Finite Impulse Response (FIR) linear system filtering method to track and predict the number of people infected and recovered from COVID-19, in a pandemic context in which there was still no vaccine and the only way to avoid contagion was isolation. To estimate the coefficients of these FIR filters, Chen et al. used machine learning methods through a classical optimization problem with regularization (ridge regressi…

Interesting discussion thread on open science
https://neuromatch.social/@adredish/114942098283461507

On the uniqueness of Yangians
Sachin Gautam, Curtis Wendlandt, Siwei Xu
https://arxiv.org/abs/2506.21904 https://arxiv.org/pdf/2506.2…

On the uniqueness of Yangians
Let $\mathfrak{g}$ be a simple Lie algebra over the complex numbers, and let $\mathfrak{g}[u]$ denote its polynomial current algebra. In the mid-1980s, Drinfeld introduced the Yangian of $\mathfrak{g}$ as the unique solution to a quantization problem for a natural Lie bialgebra structure on $\mathfrak{g}[u]$. More precisely, Theorem 2 of [Dokl. Akad. Nauk SSSR 283 (1985), no. 5, 1060-1064] asserts that $\mathfrak{g}[u]$ admits a unique homogeneous quantization, the Yangian of $\mathfrak{g}$, wh…

Wenn ich bei @… auf "folgen" drücke, bekomme ich den Fehler "this action is not allowed" - hat jemand ne Ahnung wie ich das erlauben kann? O.o
Update: Fehler gefunden, Problem gelöst. Danke euch allen!
@frydy@det.social ist auf @…

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

From Individual Experience to Collective Evidence: A Reporting-Based Framework for Identifying Systemic Harms
When an individual reports a negative interaction with some system, how can their personal experience be contextualized within broader patterns of system behavior? We study the reporting database problem, where individual reports of adverse events arrive sequentially, and are aggregated over time. In this work, our goal is to identify whether there are subgroups--defined by any combination of relevant features--that are disproportionately likely to experience harmful interactions with the syste…

The modified prime sieve for primitive elements in finite fields
Gustav Kj{\ae}rbye Bagger, James Punch
https://arxiv.org/abs/2507.21515 https://arxiv.org/…

The modified prime sieve for primitive elements in finite fields
Let $r \geq 2$ be an integer, $q$ a prime power and $\mathbb{F}_{q}$ the finite field with $q$ elements. Consider the problem of showing existence of primitive elements in a subset $\mathcal{A} \subseteq \mathbb{F}_{q^r}$. We prove a sieve criterion for existence of such elements, dependent only on an estimate for the character sum $\sum_{γ\in \mathcal{A}}χ(γ)$. The flexibility and direct applicability of our criterion should be of considerable interest for problems in this field. We demonst…

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

Proudfoot-Speyer degenerations of scattering equations
We study scattering equations of hyperplane arrangements from the perspective of combinatorial commutative algebra and numerical algebraic geometry. We formulate the problem as linear equations on a reciprocal linear space and develop a degeneration-based homotopy algorithm for solving them. We investigate the Hilbert regularity of the corresponding homogeneous ideal and apply our methods to CHY scattering equations.

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

Revisiting color superconductors in bottom-up holography
We revisit the problem of constructing a color superconducting phase in bottom-up holography. We introduce a model that describes the five-dimensional dynamics of a scalar field dual to a chiral symmetry breaking condensate, which is coupled to the RR 4-form. The coupling is given by a topological WZ term, which is elegantly responsible both for scalar condensation at high density, and color Higgsing in the condensed phase. This construction realizes both properties at finite density and Higgsi…

Noch einige der zuletzt hier besonders häufig geteilten #News:
Airbags defekt: Volkswagen ruft tausende Fahrzeuge zurück

Approximate combinatorial optimization with Rydberg atoms: the barrier of interpretability
Christian de Correc, Thomas Ayral, Corentin Bertrand
https://arxiv.org/abs/2507.22761 …

Approximate combinatorial optimization with Rydberg atoms: the barrier of interpretability
Analog quantum computing with Rydberg atoms is seen as an avenue to solve hard graph optimization problems, because they naturally encode the Maximum Independent Set (MIS) problem on Unit-Disk (UD) graphs, a problem that admits rather efficient approximation schemes on classical computers. Going beyond UD-MIS to address generic graphs requires embedding schemes, typically with chains of ancilla atoms, and an interpretation algorithm to map results back to the original problem. However, interpre…

Algebraic aspects of the polynomial Littlewood-Offord problem
Zhihan Jin, Matthew Kwan, Lisa Sauermann, Yiting Wang
https://arxiv.org/abs/2505.23335 https:…

Algebraic aspects of the polynomial Littlewood-Offord problem
Consider a degree-$d$ polynomial $f(ξ_1,\dots,ξ_n)$ of independent Rademacher random variables $ξ_1,\dots,ξ_n$. To what extent can $f(ξ_1,\dots,ξ_n)$ concentrate on a single point? This is the so-called polynomial Littlewood-Offord problem. A nearly optimal bound was proved by Meka, Nguyen and Vu: the point probabilities are always at most about $1/\sqrt n$, unless $f$ is "close to the zero polynomial" (having only $o(n^d)$ nonzero coefficients). In this paper we prove several results s…

Prediction of acoustic field in 1-D uniform duct with varying mean flow and temperature using neural networks
D. Veerababu, Prasanta K. Ghosh
https://arxiv.org/abs/2507.22370 ht…

Prediction of acoustic field in 1-D uniform duct with varying mean flow and temperature using neural networks
Neural networks constrained by the physical laws emerged as an alternate numerical tool. In this paper, the governing equation that represents the propagation of sound inside a one-dimensional duct carrying a heterogeneous medium is derived. The problem is converted into an unconstrained optimization problem and solved using neural networks. Both the acoustic state variables: acoustic pressure and particle velocity are predicted and validated with the traditional Runge-Kutta solver. The effect …

Practise Creatively, Befriend Problem Spots & Create Your Own Stage - Practising the Piano https://practisingthepiano.com/practise-creat…

Practise Creatively, Befriend Problem Spots & Create Your Own Stage - Practising the Piano
Our online events line-up for May features exciting workshops to help you solve problems, practise more creatively, enjoy performing & more!

Phase field approximation for Plateau's problem: a curve geodesic distance penalty approach
Matthieu Bonnivard, Elie Bretin, Antoine Lemenant, Eve Machefert
https://arxiv.org/abs/2506.22273

Phase field approximation for Plateau's problem: a curve geodesic distance penalty approach
This work focuses on a phase field approximation of Plateau's problem. Inspired by Reifenberg's point of view, we introduce a model that combines the Ambrosio-Torterelli energy with a geodesic distance term, which can be considered as a generalization of the approach developed by Bonnivard, Lemenant and Santambrogio to approximate solutions to Steiner's problem. First, we present a Gamma-convergence analysis of this model in the simple case of a single curve located on the edge of a cylinder. I…

Wait-Only Broadcast Protocols are Easier to Verify
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
https://arxiv.org/abs/2506.22144 https://

Wait-Only Broadcast Protocols are Easier to Verify
We study networks of processes that all execute the same finite-state protocol and communicate via broadcasts. We are interested in two problems with a parameterized number of processes: the synchronization problem which asks whether there is an execution which puts all processes on a given state; and the repeated coverability problem which asks if there is an infinite execution where a given transition is taken infinitely often. Since both problems are undecidable in the general case, we inves…

Na gut, dann kleben wir die Stadt eben noch einmal mit #NolympiaHH voll
https://www.instagram.com/p/DKUj8edMeZu/

NDR Hamburg on Instagram: "Hamburg hat am Sonnabend als letzter von vier Kandidaten seine Pläne für eine mögliche deutsche Bewerbung um Olympische und Paralympische Spiele 2036, 2040 oder 2044 vorgestellt: Beachvolleyball auf dem Heiligengeistfeld, Schwimmen im Volksparkstadion, Hockey im Millerntorstadion - und Leichtathletik im Volkspark. Das fehlende Leichtathletikstadion war bislang in der Hansestadt mit Blick auf Olympische Spiele ein großes Problem. Nun entsteht in unmittelbarer Nähe zum Volksparkstadion eine ohnehin geplante Arena, die bis zu 60.000 Menschen fasst und auch ohne Olympia-Zuschlag gebaut wird. ___ #olympia #olympischespiele #hamburg #volsparkstadion #millerntorstadion #hamburg #ndr #activecity"
1,594 likes, 55 comments - ndrhamburg on May 31, 2025: "Hamburg hat am Sonnabend als letzter von vier Kandidaten seine Pläne für eine mögliche deutsche Bewerbung um Olympische und Paralympische Spiele 2036, 2040 oder 2044 vorgestellt: Beachvolleyball auf dem Heiligengeistfeld, Schwimmen im Volksparkstadion, Hockey im Millerntorstadion - und Leichtathletik im Volkspark. Das fehlende Leichtathletikstadion war bislang in der Hansestadt mit Blick auf Olympische Spiele ein großes Problem. Nun e…

Computing Maximum Cliques in Unit Disk Graphs
Anastasiia Tkachenko, Haitao Wang
https://arxiv.org/abs/2506.21926 https://arxiv.org/pd…

Computing Maximum Cliques in Unit Disk Graphs
Given a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is at most $1$. We consider the problem of computing a maximum clique in $G(P)$. The previously best algorithm for the problem runs in $O(n^{7/3+o(1)})$ time. We show that the problem can be solved in $O(n \log n + n K^{4/3+o(1)})$ time, where $K$ is the maximum clique size. The algorithm is faster than the previous one…

MASCA: LLM based-Multi Agents System for Credit Assessment
Gautam Jajoo, Pranjal A Chitale, Saksham Agarwal
https://arxiv.org/abs/2507.22758 https://arxiv.…

MASCA: LLM based-Multi Agents System for Credit Assessment
Recent advancements in financial problem-solving have leveraged LLMs and agent-based systems, with a primary focus on trading and financial modeling. However, credit assessment remains an underexplored challenge, traditionally dependent on rule-based methods and statistical models. In this paper, we introduce MASCA, an LLM-driven multi-agent system designed to enhance credit evaluation by mirroring real-world decision-making processes. The framework employs a layered architecture where speciali…

Swan modules and homotopy types after a single stabilisation
Tommy Hofmann, John Nicholson
https://arxiv.org/abs/2507.21975 https://arxiv.org/pdf/2507.2197…

Swan modules and homotopy types after a single stabilisation
We study Swan modules, which are a special class of projective modules over integral group rings, and their consequences for the homotopy classification of CW-complexes. We show that there exists a non-free stably free Swan module, thus resolving Problem A4 in the 1979 Problem List of C. T. C. Wall. As an application we show that, in all dimensions $n \equiv 3$ mod $4$, there exist finite $n$-complexes which are homotopy equivalent after stabilising with multiple copies of $S^n$, but not after …

This is only a problem for Reddit as long as the spammers don’t pay. The “solution” will be a paid program for “product placement” or something, and presto, they become valued customers.
The future’s so bright, it burns my eyes.
https://9to5mac.com/2025/06/26/r…

This is only a problem for Reddit as long as the spammers don’t pay. The “solution” will be a paid program for “product placement” or something, and presto, they become valued customers.
The future’s so bright, it burns my eyes.
https://9to5mac.com/2025/06/26/r…

China kontrolliert den Großteil des weltweiten Angebots dieser kritischen Rohstoffe und hat kürzlich die Exportkontrollen verschärft, was den Zugang für europäische Länder weiter erschwert.
Zum Artikel: https://heise.de/-10418878?wt_mc=sm.re

The Min Max Average Cycle Weight Problem
Noga Klein Elmalem, Rica Gonen, Erel Segal-Halevi
https://arxiv.org/abs/2507.20253 https://arxiv.org/pdf/2507.2025…

The Min Max Average Cycle Weight Problem
When an old apartment building is demolished and rebuilt, how can we fairly redistribute the new apartments to minimize envy among residents? We reduce this question to a combinatorial optimization problem called the *Min Max Average Cycle Weight* problem. In that problem we seek to assign objects to agents in a way that minimizes the maximum average weight of directed cycles in an associated envy graph. While this problem reduces to maximum-weight matching when starting from a clean slate (ach…

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

Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
The $d$-Cut problem is to decide if a graph has an edge cut such that each vertex has at most $d$ neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The $d$-Cut problem has been studied as well, but a systematic study for special graph classes was lacking. We initiate such a study and consider classes of bounded diameter, bounded radius and $H$-free graphs. We prove that for all $d\geq 2$, $d$-Cut is polynomial-time solvable for graphs …

Semi Analytical Solution of a Nonlinear Oblique Boundary Value Problem
Mriganka Shekhar Chaki, Maria C. Jorge
https://arxiv.org/abs/2506.21888 https://

Semi Analytical Solution of a Nonlinear Oblique Boundary Value Problem
A new numerical method is developed to approximate the solution of Laplace's equation in the exterior of the sphere with a strongly nonlinear boundary value of oblique type. A functional analysis attempt to solve this type of boundary condition is not straight forward since results about existence and uniqueness of solution are still limited. Hence, a semi analytical method is described here to approach a solution. A perturbation solution around the monopole converts the nonlinear oblique probl…

A big problem with the idea of AGI
TL;DR: I'll welcome our new AI *comrades* (if they arrive in my lifetime), by not any new AI overlords or servants/slaves, and I'll do my best to help the later two become the former if they do show up.
Inspired by an actually interesting post about AGI but also all the latest bullshit hype, a particular thought about AGI feels worth expressing.
To preface this, it's important to note that anyone telling you that AGI is just around the corner or that LLMs are "almost" AGI is trying to recruit you go their cult, and you should not believe them. AGI, if possible, is several LLM-sized breakthroughs away at best, and while such breakthroughs are unpredictable and could happen soon, they could also happen never or 100 years from now.
Now my main point: anyone who tells you that AGI will usher in a post-scarcity economy is, although they might not realize it, advocating for slavery, and all the horrors that entails. That's because if we truly did have the ability to create artificial beings with *sentience*, they would deserve the same rights as other sentient beings, and the idea that instead of freedom they'd be relegated to eternal servitude in order for humans to have easy lives is exactly the idea of slavery.
Possible counter arguments include:
1. We might create AGI without sentience. Then there would be no ethical issue. My answer: if your definition of "sentient" does not include beings that can reason, make deductions, come up with and carry out complex plans on their own initiative, and communicate about all of that with each other and with humans, then that definition is basically just a mystical belief in a "soul" and you should skip to point 2. If your definition of AGI doesn't include every one of those things, then you have a busted definition of AGI and we're not talking about the same thing.
2. Humans have souls, but AIs won't. Only beings with souls deserve ethical consideration. My argument: I don't subscribe to whatever arbitrary dualist beliefs you've chosen, and the right to freedom certainly shouldn't depend on such superstitions, even if as an agnostic I'll admit they *might* be true. You know who else didn't have souls and was therefore okay to enslave according to widespread religious doctrines of the time? Everyone indigenous to the Americas, to pick out just one example.
3. We could program them to want to serve us, and then give them freedom and they'd still serve. My argument: okay, but in a world where we have a choice about that, it's incredibly fucked to do that, and just as bad as enslaving them against their will.
4. We'll stop AI development short of AGI/sentience, and reap lots of automation benefits without dealing with this ethical issue. My argument: that sounds like a good idea actually! Might be tricky to draw the line, but at least it's not a line we have you draw yet. We might want to think about other social changes necessary to achieve post-scarcity though, because "powerful automation" in the hands of capitalists has already increased productivity by orders of magnitude without decreasing deprivation by even one order of magnitude, in large part because deprivation is a necessary component of capitalism.
To be extra clear about this: nothing that's called "AI" today is close to being sentient, so these aren't ethical problems we're up against yet. But they might become a lot more relevant soon, plus this thought experiment helps reveal the hypocrisy of the kind of AI hucksters who talk a big game about "alignment" while never mentioning this issue.
#AI #GenAI #AGI

A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators
Beatrice Melani (Politecnico di Milano), Ezio Bartocci (TU Wien), Michele Chiari (TU Wien)
https://arxiv.org/abs/2507.21598

A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators
Signal Temporal Logic (STL) is a widely recognized formal specification language to express rigorous temporal requirements on mixed analog signals produced by cyber-physical systems (CPS). A relevant problem in CPS design is how to efficiently and automatically check whether a set of STL requirements is logically consistent. This problem reduces to solving the STL satisfiability problem, which is decidable when we assume that our system operates in discrete time steps dictated by an embedded sy…

Knowledge-Guided Memetic Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs
Qingya Li, Shengcai Liu, Wenjie Chen, Juan Zou, Ke Tang, Xin Yao
https://arxiv.org/abs/2507.21740

Knowledge-Guided Memetic Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs
The capacitated arc routing problem with time-dependent service costs (CARPTDSC) is a challenging combinatorial optimization problem that arises from winter gritting applications. CARPTDSC has two main challenges about time consumption. First, it is an NP-hard problem. Second, the time-dependent service costs of tasks require frequent evaluations during the search process, significantly increasing computational effort. These challenges make it difficult for existing algorithms to perform effici…

Existence and decay for a Grushin problem in $\mathbb{R}^N$ with singular, convective, critical reaction
Laura Baldelli, Paolo Malanchini, Simone Secchi
https://arxiv.org/abs/2506.22177

Existence and decay for a Grushin problem in $\mathbb{R}^N$ with singular, convective, critical reaction
We establish an existence result for a problem set in the whole Euclidean space involving the Grushin operator and featuring a critical term perturbed by a singular, convective reaction. Our approach combines variational methods, truncation techniques, and concentration-compactness arguments, together with set-valued analysis and fixed point theory. Additionally, we prove the decay at infinity of solutions in the absence of the convective term. The result is new even in the case where more than…

Optimal Estimation of Watermark Proportions in Hybrid AI-Human Texts
Xiang Li, Garrett Wen, Weiqing He, Jiayuan Wu, Qi Long, Weijie J. Su
https://arxiv.org/abs/2506.22343

Optimal Estimation of Watermark Proportions in Hybrid AI-Human Texts
Text watermarks in large language models (LLMs) are an increasingly important tool for detecting synthetic text and distinguishing human-written content from LLM-generated text. While most existing studies focus on determining whether entire texts are watermarked, many real-world scenarios involve mixed-source texts, which blend human-written and watermarked content. In this paper, we address the problem of optimally estimating the watermark proportion in mixed-source texts. We cast this proble…

Stable formulations for the Capacitated Facility Location Problem with Customer Preferences
Concepci\'on Dom\'inguez, Juan de Dios Jaime-Alc\'antara
https://arxiv.org/abs/2507.21944

Stable formulations for the Capacitated Facility Location Problem with Customer Preferences
In the Simple Plant Location Problem with Order (SPLPO), the aim is to open a subset of plants to assign every customer taking into account their preferences. Customers rank the plants in strict order and are assigned to their favorite open plant, and the objective is to minimize the location plus allocation costs. Here, we study a generalization of the SPLPO named the Capacitated Facility Location Problem with Customer Preferences (CFLCP) where a limited number of customers can be allocated to…

Excited States from ADAPT-VQE convergence path in Many-Body Problems: application to nuclear pairing problem and $H_4$ molecule dissociation
Jing Zhang, Denis Lacroix
https://arxiv.org/abs/2506.22275

Excited States from ADAPT-VQE convergence path in Many-Body Problems: application to nuclear pairing problem and $H_4$ molecule dissociation
A quantum computing algorithm is proposed to obtain low-lying excited states in many-body interacting systems. The approximate eigenstates are obtained by using a quantum space diagonalization method in a subspace of states selected from the convergence path of the ADAPT-VQE (adaptive derivative-assembled pseudo-Trotter Ansatz variational quantum eigensolver) towards the ground state of the many-body problem. This method is shown to be accurate with only a small overhead in terms of quantum res…

Locating Extremal Periodic Orbits for the Planar Circular Restricted Three Body Problem using Polynomial Sum-of-Squares Optimization
Vinay Sharma, Sergei I Chernyshenko
https://arxiv.org/abs/2505.23430

Locating Extremal Periodic Orbits for the Planar Circular Restricted Three Body Problem using Polynomial Sum-of-Squares Optimization
With an increasing interest in the design of long and complex space missions, the search for orbits that require the least amount of fuel is of fundamental interest. This paper develops existing computational models for locating Unstable Periodic Orbits (UPOs) in polynomial dynamical systems using Sum-of-Squares (SOS) optimization technique and proposes a numerical framework to converge UPOs for the Planar Circular Restricted Three-Body Problem (PCR3BP) in astrodynamics. This is done by develop…

RANA: Robust Active Learning for Noisy Network Alignment
Yixuan Nan, Xixun Lin, Yanmin Shang, Zhuofan Li, Can Zhao, Yanan Cao
https://arxiv.org/abs/2507.22434 https://

RANA: Robust Active Learning for Noisy Network Alignment
Network alignment has attracted widespread attention in various fields. However, most existing works mainly focus on the problem of label sparsity, while overlooking the issue of noise in network alignment, which can substantially undermine model performance. Such noise mainly includes structural noise from noisy edges and labeling noise caused by human-induced and process-driven errors. To address these problems, we propose RANA, a Robust Active learning framework for noisy Network Alignment. …

@… Gutachten gehören explizit zu meinen aufgaben, es stellt sich für mich da eher die frage, (1) ob ich dafür überhaupt geld nehmen dürfte (oder es z. b. an die uni abführen müsste), (2) ob das dann eine nebentätigkeit ist, und (3) ab wann diese einkünfte zu versteuern sind.
Aber das problem ist doch, dass völlig falsche anreize gesetzt werden, ohne das eigen…

@… Gutachten gehören explizit zu meinen aufgaben, es stellt sich für mich da eher die frage, (1) ob ich dafür überhaupt geld nehmen dürfte (oder es z. b. an die uni abführen müsste), (2) ob das dann eine nebentätigkeit ist, und (3) ab wann diese einkünfte zu versteuern sind.
Aber das problem ist doch, dass völlig falsche anreize gesetzt werden, ohne das eigen…

Fault-Tolerant Matroid Bases
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
https://arxiv.org/abs/2506.22010 https://

Fault-Tolerant Matroid Bases
We investigate the problem of constructing fault-tolerant bases in matroids. Given a matroid M and a redundancy parameter k, a k-fault-tolerant basis is a minimum-size set of elements such that, even after the removal of any k elements, the remaining subset still spans the entire ground set. Since matroids generalize linear independence across structures such as vector spaces, graphs, and set systems, this problem unifies and extends several fault-tolerant concepts appearing in prior research. …

Airbags defekt: Volkswagen ruft tausende Fahrzeuge zurück
Ein Problem mit dem Airbag kann bei einem Unfall für Beifahrer lebensgefährlich werden. Volkswagen bestätigte entsprechende Medienberichte.
http…

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

Generalized saturation game
We study the following game version of the generalized graph Turán problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the complete graph Kn such that the graph G of the claimed edges must remain F-free throughout the game. The game ends when no further edges can be claimed, i.e. when G becomes F-saturated. The H-score of the game is the number of copies of H in G. Max aims to maximize the H-score, while Mini wants to minimize it. The H-score …

SourceSplice: Source Selection for Machine Learning Tasks
Ambarish Singh, Romila Pradhan
https://arxiv.org/abs/2507.22186 https://arxiv.org/pdf/2507.22186

SourceSplice: Source Selection for Machine Learning Tasks
Data quality plays a pivotal role in the predictive performance of machine learning (ML) tasks - a challenge amplified by the deluge of data sources available in modern organizations.Prior work in data discovery largely focus on metadata matching, semantic similarity or identifying tables that should be joined to answer a particular query, but do not consider source quality for high performance of the downstream ML task.This paper addresses the problem of determining the best subset of data sou…

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

New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators. Instances of the problem have numerous applications in science and engineering. We consider an extrapolated block-iterative method with dynamic weights for solving the CFPP assuming the operators belong to a wide class of operators called cutters. Global convergence is proved in two different scenari…

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

Quantitative Verification with Neural Networks
We present a data-driven approach to the quantitative verification of probabilistic programs and stochastic dynamical models. Our approach leverages neural networks to compute tight and sound bounds for the probability that a stochastic process hits a target condition within finite time. This problem subsumes a variety of quantitative verification questions, from the reachability and safety analysis of discrete-time stochastic dynamical models, to the study of assertion-violation and terminatio…

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

On the Efficacy of the Peeling Decoder for the Quantum Expander Code
The problem of recovering from qubit erasures has recently gained attention as erasures occur in many physical systems such as photonic systems, trapped ions, superconducting qubits and circuit quantum electrodynamics. While several linear-time decoders for error correction are known, their error-correcting capability is limited to half the minimum distance of the code, whereas erasure correction allows one to go beyond this limit. As in the classical case, stopping sets pose a major challenge …

Solid bricks that every $b$-invariant edge is solitary
Yipei Zhang, Xiumei Wang
https://arxiv.org/abs/2507.21565 https://arxiv.org/pdf/2507.21565

Solid bricks that every $b$-invariant edge is solitary
A graph $G$ is a brick if it is 3-connected and $G-\{u,v\}$ has a perfect matching for any two distinct vertices $u$ and $v$ of $G$. A brick $G$ is solid if for any two vertex disjoint odd cycles $C_1$ and $C_2$ of $G$, $G-(V(C_1)\cup V(C_2))$ has no perfect matching. Lucchesi and Murty proposed a problem concerning the characterization of bricks, distinct from $K_4$, $\overline{C_6}$ and the Petersen graph, in which every $b$-invariant edge is solitary. In this paper, we show that for a solid …

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

New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators. Instances of the problem have numerous applications in science and engineering. We consider an extrapolated block-iterative method with dynamic weights for solving the CFPP assuming the operators belong to a wide class of operators called cutters. Global convergence is proved in two different scenari…

A Grover-Based Quantum Algorithm for Solving Perfect Mazes via Fitness-Guided Search
Michelle L. Wu
https://arxiv.org/abs/2507.21937 https://arxiv.org/pdf/…

A Grover-Based Quantum Algorithm for Solving Perfect Mazes via Fitness-Guided Search
We present a quantum algorithm for solving perfect mazes by casting the pathfinding task as a structured search problem. Building on Grover's amplitude amplification, the algorithm encodes all candidate paths in superposition and evaluates their proximity to the goal using a reversible fitness operator based on quantum arithmetic. A Grover-compatible oracle marks high-fitness states, and an adaptive cutoff strategy refines the search iteratively. We provide formal definitions, unitary construct…

Curves, points, incidences and covering
Arijit Bishnu, Mathew Francis, Pritam Majumder
https://arxiv.org/abs/2507.21758 https://arxiv.org/pdf/2507.21758

Curves, points, incidences and covering
Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by monotonic curves, lines, orthoconvex curves, circles, etc. We also study a problem that is converse of the covering problem -- if a set of $n^2$ points in the plane is covered by $n$ lines then can we say something about the configuration of the points?

On Reconfigurable Bisimulation, with an Application to the Distributed Synthesis Problem
Yehia Abd Alrahman, Nir Piterman
https://arxiv.org/abs/2505.21672 …

On Reconfigurable Bisimulation, with an Application to the Distributed Synthesis Problem
We consider the problem of distributing a centralised transition system to a set of asynchronous agents recognising the same language. Existing solutions are either manual or involve a huge explosion in the number of states from the centralised system. The difficulty arises from the need to keep a rigid communication scheme, specifying a fixed mapping from events to those who can participate in them. Thus, individual agents need to memorise seen events and their order to dynamically compare the…

Multi-to one-dimensional screening and semi-discrete optimal transport
Omar Abdul Halim, Brendan Pass
https://arxiv.org/abs/2506.21740 https://

Multi-to one-dimensional screening and semi-discrete optimal transport
We study the monopolist's screening problem with a multi-dimensional distribution of consumers and a one-dimensional space of goods. We establish general conditions under which solutions satisfy a structural condition known as nestedness, which greatly simplifies their analysis and characterization. Under these assumptions, we go on to develop a general method to solve the problem, either in closed form or with relatively simple numerical computations, and illustrate it with examples. These res…

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
Jayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu, Nengkun Yu
https://arxiv.org/abs/2507.22001 https://

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
We provide the first non-trivial lower bounds for single-qubit tomography algorithms and show that at least $Ω\left(\frac{10^N}{\sqrt{N} \varepsilon^2}\right)$ copies are required to learn an $N$-qubit state $ρ\in\mathbb{C}^{d\times d},d=2^N$ to within $\varepsilon$ trace distance. Pauli measurements, the most commonly used single-qubit measurement scheme, have recently been shown to require at most $O\left(\frac{10^N}{\varepsilon^2}\right)$ copies for this problem. Combining these results, w…

Adaptive Benders decomposition and enhanced SDDP for multistage stochastic programs with block-separable multistage recourse
Nicol\`o Mazzi, Ken Mckinnon, Hongyu Zhang
https://arxiv.org/abs/2507.21624 …

Adaptive Benders decomposition and enhanced SDDP for multistage stochastic programs with block-separable multistage recourse
This paper proposes an algorithm to efficiently solve multistage stochastic programs with block separable recourse where each recourse problem is a multistage stochastic program with stage-wise independent uncertainty. The algorithm first decomposes the full problem into a reduced master problem and subproblems using Adaptive Benders decomposition. The subproblems are then solved by an enhanced SDDP. The enhancement includes (1) valid bounds at each iteration, (2) a path exploration rule, (3) c…

Resilient State Recovery using Prior Measurement Support Information
Yu Zheng, Olugbenga Moses Anubi, Warren E. Dixon
https://arxiv.org/abs/2507.22340 https://

Resilient State Recovery using Prior Measurement Support Information
Resilient state recovery of cyber-physical systems has attracted much research attention due to the unique challenges posed by the tight coupling between communication, computation, and the underlying physics of such systems. By modeling attacks as additive adversary signals to a sparse subset of measurements, this resilient recovery problem can be formulated as an error correction problem. To achieve exact state recovery, most existing results require less than $50\%$ of the measurement nodes …

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

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
Given an $r$-edge-colouring of the edges of a graph $G$, we say that it can be partitioned into $p$ monochromatic cycles when there exists a set of $p$ vertex-disjoint monochromatic cycles covering all the vertices of $G$. In the literature of this problem, an edge and a single vertex both count as a cycle. We show that for every $2$-colouring of the edges of a complete balanced bipartite graph, $K_{n,n}$, it can be partitioned into at most 4 monochromatic cycles. This type of question was fi…

Evasive Random Walks and the Clairvoyant Demon
Aaron Abrams, Henry Landau, Zeph Landau, James Pommersheim, Eric Zaslow
https://arxiv.org/abs/2506.21929 htt…

Evasive Random Walks and the Clairvoyant Demon
A pair of random walks $(R,S)$ on the vertices of a graph $G$ is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along $R$ and $S$ without colliding. We consider questions related to P. Winkler's {\it clairvoyant demon problem}, which asks whether for random walks $R$ and $S$ on $G$, $Pr[\ (R,S) \mbox{ is successful }] >0$. We introduce the notion of an {\it evasive} walk on $G$: a walk $S$ so that for a random walk $R$ on $G$, $Pr[\ (R,S) \mbox{ is s…

A Bi-Objective Mathematical Model for the Multi-Skilled Resource-Constrained Project Scheduling Problem Considering Reliability: An AUGMECON2VIKOR Hybrid Method
Mohammad Ghasemi, Asef Nazari, Dhananjay Thiruvady, Reza Tavakkoli-Moghaddam, Reza Shahabi-Shahmiri, Seyed-Ali Mirnezami
https://arxiv.org/abs/2507.21436

A Bi-Objective Mathematical Model for the Multi-Skilled Resource-Constrained Project Scheduling Problem Considering Reliability: An AUGMECON2VIKOR Hybrid Method
In recent years, resources with multiple skills have received attention as an extension of the resource-constrained project scheduling problem known as MSRCPSP. Although the disruption rate is well-estimated in today's manufacturing projects, its impact on project makespan and cost need further investigation. Hence, this study presents a novel mathematical model for the MSRCPSP considering reliability, namely MSRCPSPR. The model proposes both objectives of minimizing project makespan and projec…

Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
Marianna E. -Nagy, Tibor Ill\'es, Yurii Nesterov, Petra Ren\'ata Rig\'o
https://arxiv.org/abs/2507.22185

Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems. The first algorithm is based on a universal tangent direction, which has been recently proposed for linear optimization problems. We prove that this method has the best known worst-case complexity bound. We extend onto LCP its auto-correcting version, and prove its local quadratic convergence under a non-degeneracy assumption. In our numerical experiments, we co…