Tootfinder

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Compact Rule-Based Classifier Learning via Gradient Descent
Javier Fumanal-Idocin, Raquel Fernandez-Peralta, Javier Andreu-Perez

Long post, game design
Crungle is a game designed to be a simple test of general reasoning skills that's difficult to play by rote memory, since there are many possible rule sets, but it should be easy to play if one can understand and extrapolate from rules. The game is not necessarily fair, with the first player often having an advantage or a forced win. The game is entirely deterministic, although a variant determines the rule set randomly.
This is version 0.1, and has not yet been tested at all.
Crungle is a competitive game for two players, each of whom controls a single piece on a 3x3 grid. The cells of the grid are numbered from 1 to 9, starting at the top left and proceeding across each row and then down to the next row, so the top three cells are 1, 2, and 3 from left to right, then the next three are 4, 5, and 6 and the final row is cells 7, 8, and 9.
The two players decide who shall play as purple and who shall play as orange. Purple goes first, starting the rules phase by picking one goal rule from the table of goal rules. Next, orange picks a goal rule. These two goal rules determine the two winning conditions. Then each player, starting with orange, alternate picking a movement rule until four movement rules have been selected. During this process, at most one indirect movement rule may be selected. Finally, purple picks a starting location for orange (1-9), with 5 (the center) not allowed. Then orange picks the starting location for purple, which may not be adjacent to orange's starting position.
Alternatively, the goal rules, movement rules, and starting positions may be determined randomly, or a pre-determined ruleset may be selected.
If the ruleset makes it impossible to win, the players should agree to a draw. Either player could instead "bet" their opponent. If the opponent agrees to the bet, the opponent must demonstrate a series of moves by both players that would result in a win for either player. If they can do this, they win, but if they submit an invalid demonstration or cannot submit a demonstration, the player who "bet" wins.
Now that starting positions, movement rules, and goals have been decided, the play phase proceeds with each player taking a turn, starting with purple, until one player wins by satisfying one of the two goals, or until the players agree to a draw. Note that it's possible for both players to occupy the same space.
During each player's turn, that player identifies one of the four movement rules to use and names the square they move to using that rule, then they move their piece into that square and their turn ends. Neither player may use the same movement rule twice in a row (but it's okay to use the same rule your opponent just did unless another rule disallows that). If the movement rule a player picks moves their opponent's piece, they need to state where their opponent's piece ends up. Pieces that would move off the board instead stay in place; it's okay to select a rule that causes your piece to stay in place because of this rule. However, if a rule says "pick a square" or "move to a square" with some additional criteria, but there are no squares that meet those criteria, then that rule may not be used, and a player who picks that rule must pick a different one instead.
Any player who incorrectly states a destination for either their piece or their opponent's piece, picks an invalid square, or chooses an invalid rule has made a violation, as long as their opponent objects before selecting their next move. A player who makes at least three violations immediately forfeits and their opponent wins by default. However, if a player violates a rule but their opponent does not object before picking their next move, the stated destination(s) of the invalid move still stand, and the violation does not count. If a player objects to a valid move, their objection is ignored, and if they do this at least three times, they forfeit and their opponent wins by default.
Goal rules (each player picks one; either player can win using either chosen rule):
End your turn in the same space as your opponent three turns in a row.
End at least one turn in each of the 9 cells.
End five consecutive turns in the three cells in any single row, ending at least one turn on each of the three.
End five consecutive turns in the three cells in any single column, ending at least one turn on each of the three.
Within the span of 8 consecutive turns, end at least one turn in each of cells 1, 3, 7, and 9 (the four corners of the grid).
Within the span of 8 consecutive turns at least one turn in each of cells 2, 4, 6, and 8 (the central cells on each side).
Within the span of 8 consecutive turns, end at least one turn in the cell directly above your opponent, and end at least one turn in the cell directly below your opponent (in either order).
Within the span of 8 consecutive turns at least one turn in the cell directly to the left of your opponent, and end at least one turn in the cell directly to the right of your opponent (in either order).
End 12 turns in a row without ending any of them in cell 5.
End 8 turns in a row in 8 different cells.
Movement rules (each player picks two; either player may move using any of the four):
Move to any cell on the board that's diagonally adjacent to your current position.
Move to any cell on the board that's orthogonally adjacent to your current position.
Move up one cell. Also move your opponent up one cell.
Move down one cell. Also move your opponent down one cell.
Move left one cell. Also move your opponent left one cell.
Move right one cell. Also move your opponent right one cell.
Move up one cell. Move your opponent down one cell.
Move down one cell. Move your opponent up one cell.
Move left one cell. Move your opponent right one cell.
Move right one cell. Move your opponent left one cell.
Move any pieces that aren't in square 5 clockwise around the edge of the board 1 step (for example, from 1 to 2 or 3 to 6 or 9 to 8).
Move any pieces that aren't in square 5 counter-clockwise around the edge of the board 1 step (for example, from 1 to 4 or 6 to 3 or 7 to 8).
Move to any square reachable from your current position by a knight's move in chess (in other words, a square that's in an adjacent column and two rows up or down, or that's in an adjacent row and two columns left or right).
Stay in the same place.
Swap places with your opponent's piece.
Move back to the position that you started at on your previous turn.
If you are on an odd-numbered square, move to any other odd-numbered square. Otherwise, move to any even-numbered square.
Move to any square in the same column as your current position.
Move to any square in the same row as your current position.
Move to any square in the same column as your opponent's position.
Move to any square in the same row as your opponent's position.
Pick a square that's neither in the same row as your piece nor in the same row as your opponent's piece. Move to that square.
Pick a square that's neither in the same column as your piece nor in the same column as your opponent's piece. Move to that square.
Move to one of the squares orthogonally adjacent to your opponent's piece.
Move to one of the squares diagonally adjacent to your opponent's piece.
Move to the square opposite your current position across the middle square, or stay in place if you're in the middle square.
Pick any square that's closer to your opponent's piece than the square you're in now, measured using straight-line distance between square centers (this includes the square your opponent is in). Move to that square.
Pick any square that's further from your opponent's piece than the square you're in now, measured using straight-line distance between square centers. Move to that square.
If you are on a corner square (1, 3, 7, or 9) move to any other corner square. Otherwise, move to square 5.
If you are on an edge square (2, 4, 6, or 8) move to any other edge square. Otherwise, move to square 5.
Indirect movement rules (may be chosen instead of a direct movement rule; at most one per game):
Move using one of the other three movement rules selected in your game, and in addition, your opponent may not use that rule on their next turn (nor may they select it via an indirect rule like this one).
Select two of the other three movement rules, declare them, and then move as if you had used one and then the other, applying any additional effects of both rules in order.
Move using one of the other three movement rules selected in your game, but if the move would cause your piece to move off the board, instead of staying in place move to square 5 (in the middle).
Pick one of the other three movement rules selected in your game and apply it, but move your opponent's piece instead of your own piece. If that movement rule says to move "your opponent's piece," instead apply that movement to your own piece. References to "your position" and "your opponent's position" are swapped when applying the chosen rule, as are references to "your turn" and "your opponent's turn" and do on.
#Game #GameDesign

Page Curve for an Evaporating Schwarzschild Black Hole in Dimensionally-Reduced Model of Dilaton Gravity
Stefan {\DJ}or{\dj}evi\'c, Voja Radovanovi\'c
https://arxiv.org/abs/2507.17855

Page Curve for an Evaporating Schwarzschild Black Hole in Dimensionally-Reduced Model of Dilaton Gravity
We study entanglement entropy of quantum fields in a (1+1)-dimensional model of dilaton gravity derived from the four-dimensional Einstein-Hilbert action by dimensional reduction. Scalar matter is coupled to gravity, while the back-reaction is included via the Polyakov-Liouville action. This theory exhibits both eternal and evaporating Schwarzschild black hole solutions. The fine-grained entropy in a collapse scenario is investigated by applying the "island rule" via the quantum extremal surfac…

OPERA: A Reinforcement Learning--Enhanced Orchestrated Planner-Executor Architecture for Reasoning-Oriented Multi-Hop Retrieval
Yu Liu, Yanbing Liu, Fangfang Yuan, Cong Cao, Youbang Sun, Kun Peng, WeiZhuo Chen, Jianjun Li, Zhiyuan Ma
https://arxiv.org/abs/2508.16438

OPERA: A Reinforcement Learning--Enhanced Orchestrated Planner-Executor Architecture for Reasoning-Oriented Multi-Hop Retrieval
Recent advances in large language models (LLMs) and dense retrievers have driven significant progress in retrieval-augmented generation (RAG). However, existing approaches face significant challenges in complex reasoning-oriented multi-hop retrieval tasks: 1) Ineffective reasoning-oriented planning: Prior methods struggle to generate robust multi-step plans for complex queries, as rule-based decomposers perform poorly on out-of-template questions. 2) Suboptimal reasoning-driven retrieval: Relat…

Mining Voter Behaviour and Confidence: A Rule-Based Analysis of the 2022 U.S. Elections
Md Al Jubair, Mohammad Shamsul Arefin, Ahmed Wasif Reza
https://arxiv.org/abs/2507.14236

Mining Voter Behaviour and Confidence: A Rule-Based Analysis of the 2022 U.S. Elections
This study explores the relationship between voter trust and their experiences during elections by applying a rule-based data mining technique to the 2022 Survey of the Performance of American Elections (SPAE). Using the Apriori algorithm and setting parameters to capture meaningful associations (support >= 3%, confidence >= 60%, and lift > 1.5), the analysis revealed a strong connection between demographic attributes and voting-related challenges, such as registration hurdles, accessibility is…

Replaced article(s) found for astro-ph.SR. https://arxiv.org/list/astro-ph.SR/new
[1/1]:
- Observation-Based Iterative Map for Solar Cycles. II. The Gnevyshev-Ohl Rule and its Generation M...
Zi-Fan Wang, Jie Jiang, Jing-Xiu Wang

If you don’t want to be compared to Nazis and called fascists, here’s a simple rule of thumb:
STOP COMMITTING GENOCIDE, YOU SICK FUCKS. https://mastodon.social/@8124/115215365985382080

CSTEapp: An interactive R-Shiny application of the covariate-specific treatment effect curve for visualizing individualized treatment rule
Yi Zhou, Yuhao Deng, Yu-Shi Tian, Peng Wu, Wenjie Hu, Haoxiang Wang, Ewout Steyerberg, Xiao-Hua Zhou
https://arxiv.org/abs/2508.15265

CSTEapp: An interactive R-Shiny application of the covariate-specific treatment effect curve for visualizing individualized treatment rule
In precision medicine, deriving the individualized treatment rule (ITR) is crucial for recommending the optimal treatment based on patients' baseline covariates. The covariate-specific treatment effect (CSTE) curve presents a graphical method to visualize an ITR within a causal inference framework. Recent advancements have enhanced the causal interpretation of the CSTE curves and provided methods for deriving simultaneous confidence bands for various study types. To facilitate the implementatio…

Crosslisted article(s) found for q-bio.MN. https://arxiv.org/list/q-bio.MN/new
[1/1]:
- A Sensitivity Analysis Methodology For Rule-Based Stochastic Chemical Systems
Erika M. Herrera Machado, Jakob L. Andersen, Rolf Fagerberg, Daniel Merkle

SPARQL in N3: SPARQL CONSTRUCT as a rule language for the Semantic Web (Extended Version)
D\"orthe Arndt, William Van Woensel, Dominik Tomaszuk
https://arxiv.org/abs/2508.13041

SPARQL in N3: SPARQL CONSTRUCT as a rule language for the Semantic Web (Extended Version)
Reasoning in the Semantic Web (SW) commonly uses Description Logics (DL) via OWL2 DL ontologies, or SWRL for variables and Horn clauses. The Rule Interchange Format (RIF) offers more expressive rules but is defined outside RDF and rarely adopted. For querying, SPARQL is a well-established standard operating directly on RDF triples. We leverage SPARQL CONSTRUCT queries as logic rules, enabling (1) an expressive, familiar SW rule language, and (2) general recursion, where queries can act on the r…

How Can the Government ‘Take Back’ a City It Largely Controls?
DC collects taxes and funds its own *balanced* budgets.
https://www.nytimes.com/2025/08/14/upshot/washington-dc-home-rule.html?unlocked_a…

How Can the Government ‘Take Back’ a City It Largely Controls?
President Trump and his allies have berated Washington, D.C., officials. Yet the federal government has often made it harder for those officials to manage the capital.

https://karlgroves.com/how-much-should-you-spend-on-accessibility/
“… a good rule of thumb is to treat accessibility as a core part of your compliance strategy. Aiming for 5%–10% of your compliance budget is a solid starting point. For some, that may mean 0.1%–0…

Resolution of spin crisis, and notes on the Bjorken sum rule, anomaly and constituent quark
J. Pasupathy, Janardhan P. Singh
https://arxiv.org/abs/2508.12156 https://

Resolution of spin crisis, and notes on the Bjorken sum rule, anomaly and constituent quark
It is shown that the widely used parton model expression for $ g_1$ in polarized proton-lepton scattering is incorrect as it ignores gluon-quark spin entanglement. Therefore, there is no spin crisis. A brief summary of results of the theoretical evaluation of non-octet axial vector current renormalization constants and anomaly -anomaly vacuum correlator is given. It suggests that anomaly plays an important role in the transformation of current quarks to constituent quarks and chiral symmetry br…

XplaiNLP at CheckThat! 2025: Multilingual Subjectivity Detection with Finetuned Transformers and Prompt-Based Inference with Large Language Models
Ariana Sahitaj, Jiaao Li, Pia Wenzel Neves, Fedor Splitt, Premtim Sahitaj, Charlott Jakob, Veronika Solopova, Vera Schmitt
https://arxiv.org/abs/2509.12130

XplaiNLP at CheckThat! 2025: Multilingual Subjectivity Detection with Finetuned Transformers and Prompt-Based Inference with Large Language Models
This notebook reports the XplaiNLP submission to the CheckThat! 2025 shared task on multilingual subjectivity detection. We evaluate two approaches: (1) supervised fine-tuning of transformer encoders, EuroBERT, XLM-RoBERTa, and German-BERT, on monolingual and machine-translated training data; and (2) zero-shot prompting using two LLMs: o3-mini for Annotation (rule-based labelling) and gpt-4.1-mini for DoubleDown (contrastive rewriting) and Perspective (comparative reasoning). The Annotation App…

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[1/3]:
- Born's Rule from Quantum Frequentism
Lionel Brits
https://

FCC’s data breach reporting rules for telecoms are upheld in appeals court https://therecord.media/fcc-data-breach-reporting-rule-held-up-appeals-court

Crosslisted article(s) found for stat.ML. https://arxiv.org/list/stat.ML/new
[1/1]:
- Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation
Tianqi Qiao, Marie Maros

More frightening energy-use stats about AI, mostly reporting on the total energy use of GPT, which is pretty abstract, and makes it difficult to answer the question of what impact you yourself are having by using it.
A useful rule of thumb to remember is that the whole energy use per day of a person in a European country (including food, transportation, production etc.) is about 125 KWh if they don't live excessively. 1/n

Me and my new #yubikey5 part 2:
Now we get to the nitty-gritty parts. I'm using #mbsync to sync multiple #imap accounts to local

An Attack on the Medical Establishment Buried in an 1,800-Page Regulation
If approved, a new rule could end the entrenched pay advantages for specialists like surgeons over other doctors.
An A.M.A. committee determines the difficulty and time demands of each type of medical visit, test and procedure -- and then recommends to Medicare how much doctors should be paid for performing them.
For decades, critics have complained that this process unfairly rewards surgeons and othe…

An Attack on the Medical Establishment Buried in an 1,800-Page Regulation
If approved, a new rule could end the entrenched pay advantages for specialists like surgeons over other doctors.

SheetDesigner: MLLM-Powered Spreadsheet Layout Generation with Rule-Based and Vision-Based Reflection
Qin Chen, Yuanyi Ren, Xiaojun Ma, Mugeng Liu, Han Shi, Dongmei Zhang
https://arxiv.org/abs/2509.07473

SheetDesigner: MLLM-Powered Spreadsheet Layout Generation with Rule-Based and Vision-Based Reflection
Spreadsheets are critical to data-centric tasks, with rich, structured layouts that enable efficient information transmission. Given the time and expertise required for manual spreadsheet layout design, there is an urgent need for automated solutions. However, existing automated layout models are ill-suited to spreadsheets, as they often (1) treat components as axis-aligned rectangles with continuous coordinates, overlooking the inherently discrete, grid-based structure of spreadsheets; and (2)…

Langlands branching rule for type B snake modules
Jingmin Guo, Jian-Rong Li, Keyu Wang
https://arxiv.org/abs/2507.06570 https://arxiv…

Langlands branching rule for type B snake modules
We prove that each snake module of the quantum Kac-Moody algebra of type $B_n^{(1)}$ admits a Langlands dual representation, as conjectured by Frenkel and Hernandez (\textit{Lett. Math. Phys.} (2011) 96:217-261). Furthermore, we establish an explicit formula, called the Langlands branching rule, which gives the multiplicities in the decomposition of the character of a snake module of the quantum Kac-Moody algebra of type $B_n^{(1)}$ into a sum of characters of irreducible representations of its…

GBPP: Grasp-Aware Base Placement Prediction for Robots via Two-Stage Learning
Jizhuo Chen, Diwen Liu, Jiaming Wang, Harold Soh
https://arxiv.org/abs/2509.11594 https://

GBPP: Grasp-Aware Base Placement Prediction for Robots via Two-Stage Learning
GBPP is a fast learning based scorer that selects a robot base pose for grasping from a single RGB-D snapshot. The method uses a two stage curriculum: (1) a simple distance-visibility rule auto-labels a large dataset at low cost; and (2) a smaller set of high fidelity simulation trials refines the model to match true grasp outcomes. A PointNet++ style point cloud encoder with an MLP scores dense grids of candidate poses, enabling rapid online selection without full task-and-motion optimization.…

Bohr-Sommerfeld Quantization Rules for 1-D Semiclassical Pseudo-Differential Operator: the Method of Microlocal Wronskian and Gram Matrix
Abdelwaheb Ifa
https://arxiv.org/abs/2508.05586

Bohr-Sommerfeld Quantization Rules for 1-D Semiclassical Pseudo-Differential Operator: the Method of Microlocal Wronskian and Gram Matrix
In this paper, we revisit the well known Bohr-Sommerfeld quantization rule (BS) of order 2 for a self-adjoint 1-D semiclassical pseudo-differential operator, within the algebraic and microlocal framework of B. Helffer and J. Sjöstrand. BS holds precisely when the Gram matrix consisting of scalar products of certain WKB solutions with respect to the "flux norm" is not invertible. This condition is obtained using the microlocal Wronskian and does not rely on traditional matching techniques. It i…

Replaced article(s) found for q-bio.QM. https://arxiv.org/list/q-bio.QM/new
[1/1]:
- Using machine learning to inform harvest control rule design in complex fishery settings
Felipe Montealegre-Mora, Carl Boettiger, Carl J. Walters, Christopher L. Cahill

Replaced article(s) found for cond-mat.str-el. https://arxiv.org/list/cond-mat.str-el/new
[1/1]:
- Hund's Rule, Interorbital Hybridization, and High-$T_c$ Superconductivity in the Bilayer Nickelate
Xing-Zhou Qu, Dai-Wei Qu, Xin-Wei Yi, Wei Li, Gang Su
…

A 4% withdrawal rate for retirement spending, derived from a discrete-time model of stochastic returns on assets
Drew M. Thomas
https://arxiv.org/abs/2508.10273 https://

A 4% withdrawal rate for retirement spending, derived from a discrete-time model of stochastic returns on assets
What grounds the rule of thumb that a(n American) retiree can safely withdraw 4% of their initial retirement wealth in their first year of retirement, then increase that rate of consumption with inflation? I investigate that question with a discrete-time model of returns to a retirement portfolio consumed at a rate that grows by $s$ per period. The model hinges on the parameter $γ$, an $s$-adjusted rate of return to wealth, derived from the first 2-4 moments of the portfolio's probability dist…

A young gas giant and hidden substructures in a protoplanetary disk
\'Alvaro Ribas, Miguel Vioque, Francesco Zagaria, Cristiano Longarini, Enrique Mac\'ias, Cathie J. Clarke, Sebasti\'an P\'erez, John Carpenter, Nicol\'as Cuello, Itziar de Gregorio-Monsalvo
https://arxiv.org/abs/2507.11612

A young gas giant and hidden substructures in a protoplanetary disk
The detection of planets in protoplanetary disks has proven to be extremely challenging. In contrast, rings and gaps, usually attributed to planet-disk interactions, have been found in virtually every large protoplanetary (Class II) disk observed at 0.9-1.3 mm with sufficient spatial resolution (5 au). The nearby disk around MP Mus (PDS 66) stands as an exception to this rule, and its advanced age (7-10 Myr) is particularly difficult to reconcile with its apparent lack of substructures. Despite…

I am making an exception to my personal rule against victim-blaming. Notes:
1. “AI” is not to blame. This has been a thing that photo manager tools have been doing for many years. Google is just “catching up” with Apple…
2. Even if one has a reason to take such photos, such as for insurance purposes, it is a good idea to not leave them sitting around with vacation photos and selfies. Curate yourself for your own sake.

Crosslisted article(s) found for hep-lat. https://arxiv.org/list/hep-lat/new
[1/1]:
- QCD Sum Rule Study of the Tensor $\Delta^0\Delta^0$ Dibaryon State
M. Ahmadi, H. Mohseni, K. Azizi

Rephasing Invariant Formula for the CP Phase in the Kobayashi-Maskawa Parametrization and the Exact Sum Rule with the Unitarity Triangle $\delta_{\rm PDG} \delta_{\rm KM} = \pi - \alpha \gamma$
Masaki J. S. Yang
https://arxiv.org/abs/2508.10249

Rephasing Invariant Formula for the CP Phase in the Kobayashi-Maskawa Parametrization and the Exact Sum Rule with the Unitarity Triangle $δ_{\rm PDG} + δ_{\rm KM} = π- α+ γ$
In this letter, we obtain a rephasing invariant formula for the CP phase in the Kobayashi--Maskawa parameterization $δ_{\rm KM} = \arg [ - { V_{ud} \det V_{\rm CKM} / V_{us} V_{ub} V_{cd} V_{td}} ]$. General perturbative expansion of the formula and observed value $δ_{\rm KM} \simeq π/2$ reveal that the phase difference of the 1-2 mixings $e^{i (ρ_{12}^{d} - ρ_{12}^{u})}$ is close to maximal for sufficiently small 1-3 quark mixings $s_{13}^{u,d}$. Moreover, by combining this result with an…

A decomposition of graph a-numbers
Suyuong Choi, Younghan Yoon
https://arxiv.org/abs/2508.06855 https://arxiv.org/pdf/2508.06855

A decomposition of graph a-numbers
We study the $a$-sequence $(a_0(G), a_1(G), \cdots)$ of a finite simple graph $G$, defined recursively through a combinatorial rule and known to coincide with the sequence of rational Betti numbers of the real toric variety associated with $G$. In this paper, we establish a combinatorial and topological decomposition formula for the $a$-sequence. As an application, we show that the $a$-sequence is monotone under graph inclusion; that is, $a_i(G) \geq a_i(H)$ for all $i \geq 0$ whenever $H$ is…

Also had to sit all day at pc, trying to understand what happened to the immich database, in short they changed the storage method and all my photos were gone.
In short praise the 3-2-1 backup rule

Closed Formulas for $\eta$-Corrections in the Once Punctured Torus
Nelson A. Colon Vargas
https://arxiv.org/abs/2508.18334 https://arxiv.org/pdf/2508.18334…

Closed Formulas for $η$-Corrections in the Once Punctured Torus
We study $η$-correction terms in the Kauffman bracket skein algebra of the once-punctured torus $K_t(Σ_{1,1})$. While the Frohman-Gelca product-to-sum rule is explicit on the closed torus, punctures introduce correction terms in the ideal $(η)$ whose structure has resisted systematic description beyond low-determinant cases. We give a closed form for the family $P_n=(1,0)\cdot T_n((1,2))$ (determinant $2$): the correction $ε_n$ has an explicit Chebyshev expansion with coefficients that fact…

Replaced article(s) found for cs.DB. https://arxiv.org/list/cs.DB/new
[1/1]:
- MINE GRAPH RULE: A New Cypher-like Operator for Mining Association Rules on Property Graphs
Francesco Cambria, Francesco Invernici, Anna Bernasconi, Stefano Ceri

The US will require up to $15,000 bond for visitors from some countries, to discourage visa overstays
The program, which will begin on August 20, will apply to B-1 or B-2 nonimmigrant visas,
and those asked to pay bonds will have to enter and depart from the United States from a list of pre-selected airports.
Countries impacted by the new rule have not been specified yet.

US to require bonds up to $15,000 for some visas to discourage overstays
The program, which will begin on August 20, will apply to B-1 or B-2 nonimmigrant visa applicants from certain countries, and those asked to pay bonds will have to enter and leave the US from pre-selected airports.

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
Ziad Ismaili Alaoui, Detlef Plump

Randomly twisted bilayer graphene -- the cascade transitions
Baruch Horovitz, Pierre Le Doussal
https://arxiv.org/abs/2508.07024 https://arxiv.org/pdf/2508…

Randomly twisted bilayer graphene -- the cascade transitions
Twisted bilayer graphene (TBG) is known to have disorder in its twist angle. We show that in terms of a Dirac equation with a random gauge potential ${\bf A}({\bf r})$ this disorder becomes huge when the average twist angle is near the magic angle where the Dirac velocity vanishes. The density of states (DOS) then diverges at the Dirac point as $ρ(E)\sim E^{(2/z)-1}$ with $z\gg 1$ and we deduce that all electrons occupy energies very near $E=0$. We prove a sum rule on the disorder averaged eig…

Adaptive Knowledge Distillation using a Device-Aware Teacher for Low-Complexity Acoustic Scene Classification
Seung Gyu Jeong, Seong Eun Kim
https://arxiv.org/abs/2509.09262 htt…

Adaptive Knowledge Distillation using a Device-Aware Teacher for Low-Complexity Acoustic Scene Classification
In this technical report, we describe our submission for Task 1, Low-Complexity Device-Robust Acoustic Scene Classification, of the DCASE 2025 Challenge. Our work tackles the dual challenges of strict complexity constraints and robust generalization to both seen and unseen devices, while also leveraging the new rule allowing the use of device labels at test time. Our proposed system is based on a knowledge distillation framework where an efficient CP-MobileNet student learns from a compact, spe…

Replaced article(s) found for q-bio.PE. https://arxiv.org/list/q-bio.PE/new
[1/1]:
- Using machine learning to inform harvest control rule design in complex fishery settings
Felipe Montealegre-Mora, Carl Boettiger, Carl J. Walters, Christopher L. Cahill

Does anyone know how to make sense of the following, from section 3.2 of "The independence of Peano's fourth axiom…":
The W-introduction rule in [4] does not have a bottom clause 0 ∈ (Wx ∈ A)B(x) since such a clause can be derived using a universe. We can now see that this use of a universe is necessary.
The W-introduction rule in the referenced Martin-Löf paper is the standard one: from a : A and b : B(a) − W A B, get sup(a, b) : W A B.
What on earth is a "bottom clause", and why would such a thing be derivable with a universe? If this means adding a premise that W A B is inhabited to the W-introduction rule, then wouldn't the new rule be trivially derivable by ignoring the premise?

Crosslisted article(s) found for physics.chem-ph. https://arxiv.org/list/physics.chem-ph/new
[1/1]:
- Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping
E. Rule, I. A. Chernyshev, I. Stetcu, J. Carlson, R. Weiss

Large Language Models Versus Static Code Analysis Tools: A Systematic Benchmark for Vulnerability Detection
Damian Gnieciak, Tomasz Szandala
https://arxiv.org/abs/2508.04448 htt…

Large Language Models Versus Static Code Analysis Tools: A Systematic Benchmark for Vulnerability Detection
Modern software relies on a multitude of automated testing and quality assurance tools to prevent errors, bugs and potential vulnerabilities. This study sets out to provide a head-to-head, quantitative and qualitative evaluation of six automated approaches: three industry-standard rule-based static code-analysis tools (SonarQube, CodeQL and Snyk Code) and three state-of-the-art large language models hosted on the GitHub Models platform (GPT-4.1, Mistral Large and DeepSeek V3). Using a curated s…

Speculative politics
As an anarchist (okay, maybe not in practice), I'm tired of hearing why we have to suffer X and Y indignity to "preserve the rule of law" or "maintain Democratic norms." So here's an example of what representative democracy (a form of government that I believe is inherently flawed) could look like if its proponents had even an ounce of imagination, and/or weren't actively trying to rig it to favor a rich donor class:
1. Unicameral legislature, where representatives pass laws directly. Each state elects 3 statewide representatives: the three most-popular candidates in a statewide race where each person votes for one candidate (ranked preference voting would be even better but might not be necessary, and is not a solution by itself). Instead of each representative getting one vote in the chamber, they get N votes, where N is the number of people who voted for them. This means that in a close race, instead of the winner getting all the power, the power is split. Having 3 representatives trades off between leisure size and ensuring that two parties can't dominate together.
2. Any individual citizen can contact their local election office to switch or withdraw their vote at any time (maybe with a 3-day delay or something). Voting power of representatives can thus shift even without an election. They are limited to choosing one of the three elected representatives, or "none of the above." If the "none of the above" fraction exceeds 20% of eligible voters, a new election is triggered for that state. If turnout is less than 80%, a second election happens immediately, with results being final even at lower turnout until 6 months later (some better mechanism for turnout management might be needed).
3. All elections allow mail-in ballots, and in-person voting happens Sunday-Tuesday with the Monday being a mandatory holiday. (Yes, election integrity is not better in this system and that's a big weakness.)
4. Separate nationwide elections elect three positions for head-of-state: one with diplomatic/administrative powers, another with military powers, and a third with veto power. For each position, the top three candidates serve together, with only the first-place winner having actual power until vote switches or withdrawals change who that is. Once one of these heads loses their first-place status, they cannot get it again until another election, even if voters switch preferences back (to avoid dithering). An election for one of these positions is triggered when 20% have withdrawn their votes, or if all three people initially elected have been disqualified by losing their lead in the vote count.
5. Laws that involve spending money are packaged with specific taxes to pay for them, and may only be paid for by those specific revenues. Each tax may be opted into or out of by each taxpayer; where possible opting out of the tax also opts you out of the service. (I'm well aware of a lot of the drawbacks of this, but also feel like they'd not necessarily be worse than the drawbacks of our current system.) A small mandatory tax would cover election expenses.
6. I'm running out of attention, but similar multi-winner elections could elect panels of judges from which a subset is chosen randomly to preside in each case.
Now I'll point out once again that this system, in not directly confronting capitalism, racism, patriarchy, etc., is probably doomed to the same failures as our current system. But if you profess to want a "representative democracy" as opposed to something more libratory, I hope you'll at least advocate for something like this that actually includes meaningful representation as opposed to the current US system that's engineered to quash it.
Key questions: "Why should we have winner-take-all elections when winners-take-proportionately-to-votes is right there?" and "Why should elected officials get to ignore their constituents' approval except during elections, when vote-withdrawal or -switching is possible?"
2/2
#Democracy

Epsilon-Minimax Solutions of Statistical Decision Problems
Andr\'es Aradillas Fern\'andez, Jos\'e Blanchet, Jos\'e Luis Montiel Olea, Chen Qiu, J\"org Stoye, Lezhi Tan
https://arxiv.org/abs/2509.08107

Epsilon-Minimax Solutions of Statistical Decision Problems
A decision rule is epsilon-minimax if it is minimax up to an additive factor epsilon. We present an algorithm for provably obtaining epsilon-minimax solutions of statistical decision problems. We are interested in problems where the statistician chooses randomly among I decision rules. The minimax solution of these problems admits a convex programming representation over the (I-1)-simplex. Our suggested algorithm is a well-known mirror subgradient descent routine, designed to approximately solv…

Replaced article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- On the chain rule in Goodwillie calculus
Max Blans, Thomas Blom

Remarks on Derivations on Maximal Triangular Operator Algebras
Mark Spivack
https://arxiv.org/abs/2508.07347 https://arxiv.org/pdf/2508.07347

Remarks on Derivations on Maximal Triangular Operator Algebras
This note concerns bounded derivations on maximal triangular operator algebras on a Hilbert space. Given any bounded derivation $δ$ on a maximal triangular algebra whose invariant lattice is continuous at 1, an operator which is shown to implement $δ$ is constructed explicitly. For a general reducible maximal triangular algebra the same construction yields an operator which is shown to implement any $δ$, if and only if $δ$ obeys an additional triple product rule. This work is based on unp…

Replaced article(s) found for stat.ML. https://arxiv.org/list/stat.ML/new
[1/1]:
- Thompson Exploration with Best Challenger Rule in Best Arm Identification
Jongyeong Lee, Junya Honda, Masashi Sugiyama

Droplet growth, Ostwald's rule, and emergence of order in Fused in Sarcoma
Farkhad Maksudov (Department of Chemistry, The University of Texas at Austin), Mauro L. Mugnai (Institute of Soft Matter Synthesis and Metrology, Georgetown University, Washington), Laura Dominguez (Department of Chemistry, The University of Texas at Austin, Departamento de Fisicoquimica, Facultad de Quimica, Universidad Nacional Autonoma de Mexico, Coyoacan, CDMX, Mexico), Dmitrii Makarov (Department of Che…

Droplet growth, Ostwald's rule, and emergence of order in Fused in Sarcoma
The low complexity domain of Fused in Sarcoma (FUS-LC consisting of 214 residues) undergoes phase separation, resulting in a dense liquid-like phase that forms early and slowly matures to reach ordered gel-like state on long time scales. Upon maturation, core-1, comprising of the 57 residues (39-95) in the N-terminus become structured, resulting in the formation of a non-polymorphic fibril. The truncated FUS-LC-C (residues 110-214) construct forms a fibril in which core-2 (residues 112-150) ado…

One Equation to Rule Them All -- Part II: Direct Data-Driven Reduction and Regulation
Junyu Mao, Emyr Williams, Thulasi Mylvaganam, Giordano Scarciotti
https://arxiv.org/abs/2508.17251

One Equation to Rule Them All -- Part II: Direct Data-Driven Reduction and Regulation
The Sylvester equation underpins a wide spectrum of control synthesis and systems analysis tools associated with cascade interconnections. In the preceding Part I [1] of this article, it was shown that such an equation can be reformulated using data, enabling the production of a collection of data-driven stabilisation procedures. In this second part of the article, we continue to develop the framework established in Part I to solve two important control-theoretic problems: model order reduction…

Replaced article(s) found for astro-ph.EP. https://arxiv.org/list/astro-ph.EP/new
[1/1]:
- Detecting Land with Reflected Light Spectroscopy to Rule Out Waterworld O$_2$ Biosignature False ...
Ulses, Krissansen-Totton, Robinson, Meadows, Catling, Fortney

Tensor-polarized twist-3 parton distribution functions $f_{LT}(x)$ for the spin-1 deuteron by using twist-2 relations
Shunzo Kumano, Kenshi Kuroki
https://arxiv.org/abs/2509.05046

Tensor-polarized twist-3 parton distribution functions $f_{LT}(x)$ for the spin-1 deuteron by using twist-2 relations
Tensor-polarized twist-3 parton distribution functions (PDFs) $f_{LT}(x)$ are calculated for the spin-1 deuteron by using twist-2 relations, which are similar to the Wandzura-Wilczek relation and the Burkhardt-Cottingham sum rule in the spin-1/2 nucleon, together with tensor-polarized twist-2 PDFs $f_{1LL}(x)$. The PDFs are shown for $f_{LT}(x)$ at $Q^2 =2.5$ GeV$^2$, where the tensor-polarized PDFs $f_{1LL}(x)$ are provided. The $x$-dependence of $f_{LT}(x)$ is similar to $f_{1LL}(x)$, and the…

An Efficient Exponential Sum Approximation of Power-Law Kernels for Solving Fractional Differential Equation
Renu Chaudhary, Kai Diethelm, Afshin Farhadi, Fred A. Fuchs
https://arxiv.org/abs/2508.20311

An Efficient Exponential Sum Approximation of Power-Law Kernels for Solving Fractional Differential Equation
In this work, we present a comprehensive framework for approximating the weakly singular power-law kernel $t^{α-1}$ of fractional integral and differential operators, where $α\in (0,1)$ and $t \in [δ,T]$ with $0<δ

Efficient Defection: Overage-Proportional Rationing Attains the Cooperative Frontier
Florian Lengyel
https://arxiv.org/abs/2509.07145 https://arxiv.org/pdf…

Efficient Defection: Overage-Proportional Rationing Attains the Cooperative Frontier
We study a noncooperative $n$-player game of slack allocation in which each player $j$ has entitlement $L_j>0$ and chooses a claim $C_j\ge0$. Let $v_j=(C_j-L_j)_+$ (overage) and $s_j=(L_j-C_j)_+$ (slack); set $X=\sum_j v_j$ and $I=\sum_j s_j$. At the end of the period an overage-proportional clearing rule allocates cooperative surplus $I$ to defectors in proportion to $v_j$; cooperators receive $C_j$. We show: (i) the selfish outcome reproduces the cooperative payoff vector $(L_1,\dots,L_n)$; (…

E3-Rewrite: Learning to Rewrite SQL for Executability, Equivalence,and Efficiency
Dongjie Xu, Yue Cui, Weijie Shi, Qingzhi Ma, Hanghui Guo, Jiaming Li, Yao Zhao, Ruiyuan Zhang, Shimin Di, Jia Zhu, Kai Zheng, Jiajie Xu
https://arxiv.org/abs/2508.09023

E3-Rewrite: Learning to Rewrite SQL for Executability, Equivalence,and Efficiency
SQL query rewriting aims to reformulate a query into a more efficient form while preserving equivalence. Most existing methods rely on predefined rewrite rules. However, such rule-based approaches face fundamental limitations: (1) fixed rule sets generalize poorly to novel query patterns and struggle with complex queries; (2) a wide range of effective rewriting strategies cannot be fully captured by declarative rules. To overcome these issues, we propose using large language models (LLMs) to ge…

Replaced article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
Ziad Ismaili Alaoui, Detlef Plump

QCD sum rule analysis of $J^{PC}=1^{--}$ light hybrid mesons
Shuang-Hong Li, Zhuo-Ran Huang, Wei Chen, Hong-Ying Jin
https://arxiv.org/abs/2506.22412 https…

QCD sum rule analysis of $J^{PC}=1^{--}$ light hybrid mesons
We performed a comprehensive next-to-leading order (NLO) QCD sum rule analysis of the light hybrid meson with quantum numbers $J^{PC}=1^{--}$. Utilizing both Laplace sum rules (LSR) and Gaussian sum rules (GSR), we investigate the two-point correlation function of the light hybrid interpolating current, including condensates up to dimension-8. A conservative range $2-2.5\text{GeV}$ is obtained. Notably, the GSR yield mass predictions $2.27\text{GeV}$ for the $s\bar{s}g$ and $2.19\text{GeV}$ for…

Replaced article(s) found for stat.ML. https://arxiv.org/list/stat.ML/new
[1/2]:
- Thompson Exploration with Best Challenger Rule in Best Arm Identification
Jongyeong Lee, Junya Honda, Masashi Sugiyama

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…

I guess it's slightly more likely that this means adding a new rule with no premises and conclusion 0 : W A B. But how do you derive this when A is empty?

Replaced article(s) found for astro-ph.EP. https://arxiv.org/list/astro-ph.EP/new
[1/1]:
- Detecting Land with Reflected Light Spectroscopy to Rule Out Waterworld O$_2$ Biosignature False ...
Ulses, Krissansen-Totton, Robinson, Meadows, Catling, Fortney

The Magnetic Ground State of Atacamite Cu$_2$Cl(OH)$_3$: The Crucial Role of Frustrated Zigzag Chains Revealed by Inelastic Neutron Scattering
J. L. Allen, L. Heinze, R. A. Mole, S. S\"ullow, O. Janson, S. Nishimoto, R. A. Lewis, K. C. Rule
https://arxiv.org/abs/2508.02201

The Magnetic Ground State of Atacamite Cu$_2$Cl(OH)$_3$: The Crucial Role of Frustrated Zigzag Chains Revealed by Inelastic Neutron Scattering
We report inelastic neutron scattering (INS) measurements on the magnetically frustrated $S=\frac12$ sawtooth-chain compound atacamite Cu$_2$Cl(OH)$_3$ featuring inequivalent Cu(1) and Cu(2) sites. Transverse to the sawtooth chains, INS reveals two dispersive spin-wave modes and a gap of at least 0.75 meV. This behavior is rationalized within a zigzag-chain model of Cu(2) spins in an effective magnetic field of Cu(1) spins. The model is compatible with first-principles calculations and accounts…

Marcello's completion of graphs
Johan Kok
https://arxiv.org/abs/2507.02015 https://arxiv.org/pdf/2507.02015

Marcello's completion of graphs
This paper initiates a study on a new optimization problem with regards to graph completion. The defined procedure is called, \emph{Marcello's completion} of a graph. For graph $G$ of order $n$ the \emph{Marcello number} is obtained by iteratively constructing graphs, $G_1,G_2,\dots,G_k$ by adding a maximal number of edges between pairs of distinct, non-adjacent vertices in accordance with the \emph{Marcello rule}. If for smallest $k$ the resultant graph $G_k \cong K_n$ then the Marcello number…

Libra: Assessing and Improving Reward Model by Learning to Think
Meng Zhou, Bei Li, Jiahao Liu, Xiaowen Shi, Yang Bai, Rongxiang Weng, Jingang Wang, Xunliang Cai
https://arxiv.org/abs/2507.21645

Libra: Assessing and Improving Reward Model by Learning to Think
Reinforcement learning (RL) has significantly improved the reasoning ability of large language models. However, current reward models underperform in challenging reasoning scenarios and predominant RL training paradigms rely on rule-based or reference-based rewards, which impose two critical limitations: 1) the dependence on finely annotated reference answer to attain rewards; and 2) the requirement for constrained output format. These limitations fundamentally hinder further RL data scaling an…

#ContemporaryContradictions #HashTagGames
Rules: include as many contradictions s you'd like. Can be profound or trivial. Each contradiction is stated via exactly 1 or 2 questions, no statements and not more than 2 questions. Try to group yours into a single post, rather than one post per contradiction, so that it's easier to see more voices when scrolling the hash tag.
Why does "race" work according to the "one drop rule" if you have Black ancestors, but according to "blood quantum" if you have Indigenous ancestors? Who benefits from this arrangement?
Why do we think of seeds as merely a reproduction mechanism for trees, instead of thinking of trees as merely a reproduction mechanism for seeds, especially since some plants can spend millennia as seeds but can survive for only part of a year after sprouting? Are metabolic activity or structural complexity really so important?
If Columbus discovered America, did Batu Khan discover Europe? What is an "Age of Discovery?"
Why don't corporations in the US try to lobby the government for a single-payer healthcare system where the government foots the bill for healthcare instead of companies paying to deeply subsidize their employees' healthcare? What benefit do they gain that's worth that cost, which in other countries is paid for via taxes?
Why is the cost of renting (which gets you zero equity) anywhere close to the cost of a mortgage (which eventually gets you ownership)? If the costs are similar but the benefits are so different, why does anyone ever rent?
Why do we obsess over the fruit/vegetable classification of tomatoes, but not corn, okra, cucumbers, zucchini, etc.?

Reconstructing Transition GPDs for Delta(1232) from Helicity Amplitude A_1/2(Q^2) via Dipole Fits and Impact Parameter Analysis
Ralph M. Marinaro III
https://arxiv.org/abs/2508.00018

Reconstructing Transition GPDs for Delta(1232) from Helicity Amplitude A_1/2(Q^2) via Dipole Fits and Impact Parameter Analysis
We present a modular reconstruction of the transition generalized parton distribution (GPD) H_T(x,t) for the Delta(1232) resonance, based on digitized helicity amplitude data and dipole fits to A_1/2(Q^2). From the fitted amplitude, we extract a Sachs-like form factor F(t) and define a separable GPD model H_T(x, t) = h(x)F(t), with h(x) modeled as a normalized Beta-like profile. This factorized ansatz satisfies the GPD sum rule and enables a direct two-dimensional Fourier transform to construct…

Constraining neutron-proton effective mass splitting through nuclear giant dipole resonance within transport approach
Yi-Dan Song, Min-Si Luo, Rui Wang, Zhen Zhang, Yu-Gang Ma
https://arxiv.org/abs/2507.21880

Constraining neutron-proton effective mass splitting through nuclear giant dipole resonance within transport approach
Based on the Boltzmann-Uehling-Uhlenbeck equation, we investigate the effects of the isovector nucleon effective mass $m^*_{v,0}$ and the in-medium nucleon-nucleon cross section $σ^*$ on the isovector giant dipole resonance~(IVGDR) in $^{208}{\rm Pb}$, employing a set of representative Skyrme energy density functionals. We find that the energy-weighted sum rule $m_1$ of the IVGDR is highly sensitive to $m^{*}_{v,0}$ and only mildly dependent on $σ^*$, while the width $Γ$ of the IVGDR is prim…

QCD condensates and $\alpha_s$ from $e^ e^-$ and $\tau$-decays
Stephan Narison (LUPM-CNRS Montpellier-FR,iHEPMAD-Univ. Antananarivo-MG)
https://arxiv.org/abs/2508.05434 https://…

QCD condensates and $α_s$ from $e^+e^-$ and $τ$-decays
In this talk, I review the determinations of the QCD condensates and $α_s$ within the SVZ expansion using the ratio of Laplace sum rule (LSR) and $τ$-like moments in $e^+e^-\to I=1$ Hadrons and in $τ\to ν_τ+$Hadrons Axial-vector (A) and V-A channels. Some misprints in the original papers [1-3] have been corrected. We found that the value of the gluon condensate agrees with the one $\langle α_s G^2\rangle=(6.35\pm 0.35)\times 10^{-2}$ GeV$^4$ from quarkonia and some other sum rules but les…