Tootfinder

Opt-in global Mastodon full text search. Join the index!

@arXiv_csCC_bot@mastoxiv.page
2025-09-22 07:39:41

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
Pablo Concha-Vega, Eric Goles, Pedro Montealegre, K\'evin Perrot
arxiv.org/abs/2509.16065

@tiotasram@kolektiva.social
2025-08-12 09:01:39

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

@arXiv_csCY_bot@mastoxiv.page
2025-07-22 09:52:10

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

@arXiv_statCO_bot@mastoxiv.page
2025-08-22 08:34:51

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
arxiv.org/abs/2508.15265

@aral@mastodon.ar.al
2025-09-18 10:09:01

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. mastodon.social/@8124/11521536

@arXiv_csDB_bot@mastoxiv.page
2025-08-19 09:23:30

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

@aardrian@toot.cafe
2025-08-19 10:45:35

karlgroves.com/how-much-should
“… 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…

@ubuntourist@mastodon.social
2025-08-14 19:14:54

How Can the Government ‘Take Back’ a City It Largely Controls?
DC collects taxes and funds its own *balanced* budgets.
nytimes.com/2025/08/14/upshot/

@arXiv_hepph_bot@mastoxiv.page
2025-08-19 10:13:50

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

@pygospa@social.linux.pizza
2025-09-20 10:00:18

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

Screenshot of a terminal in background showing a manual triggering of mbsync with one of my mail addresses, and a GTK window in foreground (pinentry-gtk) prompting me to insert the PIN to unlock my Yubikey to decript the passwords provided by the GPG encrypted password store from pass.
Full-screen terminal window showing the output from `journalctl -n0 -f` when I plug in the youbikey and wait while for the automatic mailsync service to trigger.

The output shows that while the Yubikey is inserted and properly recognized, when mbsyncer starts it asks for the PIN, but directly gets a `PIN callback returned error: IPC call has been cancelled` message, which in turn makes the decription fail, which leads to a skipping of the account in mbsync. And this will continue for the next …
Termial showing the bat output from the udev rule I wrote:

`ACTION=="add", SUBSYSTEM=="usb", ATTR{idVendor}=="1050", ATTR{idProduct}=="0407", TAG+="systemd", ENV{SYSTEMD_USER_WANTS}="yubikey-unlock.service"`

This file lives under: `/etc/udev/rules.d/99-yubikey-unlock.rules`
Console with vim showing the content of the new `systemd` service I wrote, which lives in my home dir under: `.config/systemd/user/yubikey-unlock.service`

Content:

```
[Unit]
Description=Yubikey GPG Unlock
After=graphical-session.target

[Service]
Type=oneshot
ExecStart=/bin/bash -c 'TEMP_FILE=$(/usr/bin/mktemp); echo "unlock test" | /usr/bin/gpg --encrypt -r FEE1636BFD47D3E8 > "$TEMP_FILE"; /usr/bin/gpg --quiet --decrypt "$TEMP_FILE" >/dev/null 2>&1; /usr/bin/rm "$TEMP_FILE"'
Environmen…
@arXiv_quantph_bot@mastoxiv.page
2025-08-19 15:41:41

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

@arXiv_csCL_bot@mastoxiv.page
2025-09-16 12:25:57

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
arxiv.org/abs/2509.12130

@arXiv_statML_bot@mastoxiv.page
2025-09-15 10:40:40

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

@pbloem@sigmoid.social
2025-08-15 11:07:22

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

@newsie@darktundra.xyz
2025-08-14 15:14:01

FCC’s data breach reporting rules for telecoms are upheld in appeals court therecord.media/fcc-data-breac

@arXiv_csRO_bot@mastoxiv.page
2025-09-16 11:39:47

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

@arXiv_heplat_bot@mastoxiv.page
2025-08-19 12:43:50

Crosslisted article(s) found for hep-lat. 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

@arXiv_csAI_bot@mastoxiv.page
2025-09-10 09:41:51

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
arxiv.org/abs/2509.07473

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.

@arXiv_qbioQM_bot@mastoxiv.page
2025-08-15 12:07:57

Replaced article(s) found for q-bio.QM. 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

@arXiv_condmatstrel_bot@mastoxiv.page
2025-07-16 13:32:44

Replaced article(s) found for cond-mat.str-el. arxiv.org/list/cond-mat.str-el
[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

@arXiv_mathRT_bot@mastoxiv.page
2025-07-10 07:44:31

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

@arXiv_statAP_bot@mastoxiv.page
2025-08-15 08:12:02

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

@arXiv_astrophEP_bot@mastoxiv.page
2025-07-17 08:54:50

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
arxiv.org/abs/2507.11612

@arXiv_mathph_bot@mastoxiv.page
2025-08-08 08:12:12

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

@arXiv_hepph_bot@mastoxiv.page
2025-08-15 09:23:02

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
arxiv.org/abs/2508.10249

@arXiv_mathCO_bot@mastoxiv.page
2025-08-12 10:20:13

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

@arXiv_csDB_bot@mastoxiv.page
2025-07-16 12:51:52

Replaced article(s) found for cs.DB. 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

@grumpybozo@toad.social
2025-09-06 00:50:26

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.

@Laur12@social.linux.pizza
2025-08-11 21:39:09

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

@arXiv_qbioPE_bot@mastoxiv.page
2025-08-15 12:05:45

Replaced article(s) found for q-bio.PE. 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

@arXiv_condmatmeshall_bot@mastoxiv.page
2025-08-12 09:34:03

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

@arXiv_csSD_bot@mastoxiv.page
2025-09-12 08:29:19

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

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…

@arXiv_mathGT_bot@mastoxiv.page
2025-08-27 08:41:22

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

@arXiv_csPL_bot@mastoxiv.page
2025-07-30 12:52:38

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

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?

@arXiv_physicschemph_bot@mastoxiv.page
2025-09-10 11:32:12

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

@tiotasram@kolektiva.social
2025-08-11 13:30:26

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

@arXiv_csSE_bot@mastoxiv.page
2025-08-07 09:35:54

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

@arXiv_econEM_bot@mastoxiv.page
2025-09-11 07:38:22

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
arxiv.org/abs/2509.08107

@arXiv_mathOA_bot@mastoxiv.page
2025-08-12 10:05:13

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

@arXiv_astrophEP_bot@mastoxiv.page
2025-09-12 11:42:03

Replaced article(s) found for astro-ph.EP. 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

@arXiv_statML_bot@mastoxiv.page
2025-08-08 13:15:44

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

@arXiv_mathAT_bot@mastoxiv.page
2025-06-26 12:04:36

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

@arXiv_condmatsoft_bot@mastoxiv.page
2025-06-30 07:56:40

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…

@arXiv_hepph_bot@mastoxiv.page
2025-09-08 09:37:30

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

@arXiv_hepth_bot@mastoxiv.page
2025-07-25 09:43:32

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

@arXiv_eessSY_bot@mastoxiv.page
2025-08-26 10:22:46

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

@arXiv_mathNA_bot@mastoxiv.page
2025-08-29 08:20:11

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

@arXiv_csDB_bot@mastoxiv.page
2025-08-13 08:29:52

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
arxiv.org/abs/2508.09023

@arXiv_econTH_bot@mastoxiv.page
2025-09-10 07:43:01

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

@arXiv_csPF_bot@mastoxiv.page
2025-07-30 13:00:32

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

@arXiv_statML_bot@mastoxiv.page
2025-08-12 17:49:57

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

@arXiv_hepph_bot@mastoxiv.page
2025-06-30 09:51:00

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

@arXiv_csIR_bot@mastoxiv.page
2025-08-25 09:26:10

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
arxiv.org/abs/2508.16438

@arXiv_mathOC_bot@mastoxiv.page
2025-07-30 09:38:31

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

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?

@arXiv_astrophEP_bot@mastoxiv.page
2025-07-09 13:14:45

Replaced article(s) found for astro-ph.EP. 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

@arXiv_condmatstrel_bot@mastoxiv.page
2025-08-05 10:37:10

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
arxiv.org/abs/2508.02201

@arXiv_mathCO_bot@mastoxiv.page
2025-07-04 08:12:41

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

@arXiv_csCL_bot@mastoxiv.page
2025-07-30 10:18:01

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
arxiv.org/abs/2507.21645

@arXiv_mathGM_bot@mastoxiv.page
2025-06-24 08:43:39

A study of a family of self-referential sequences
Benoit Cloitre
arxiv.org/abs/2506.18103 arxiv.org/pdf/2506.18103

@tiotasram@kolektiva.social
2025-07-29 11:17:44

#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.?

@arXiv_quantph_bot@mastoxiv.page
2025-06-25 08:22:19

Dissipative quantum North-East-Center model: steady-state phase diagram, universality and nonergodic dynamics
Pietro Brighi, Alberto Biella
arxiv.org/abs/2506.19011

@arXiv_hepph_bot@mastoxiv.page
2025-08-04 07:59:31

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
arxiv.org/abs/2508.00018

@arXiv_nuclth_bot@mastoxiv.page
2025-07-30 08:49:01

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
arxiv.org/abs/2507.21880

@arXiv_hepph_bot@mastoxiv.page
2025-08-08 09:53:12

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