Searcharxiv⌕ Search

arXiv · 2610.23688

Two Seconds per Day: Limitations of Circadian Burden Metrics in the Permanent Daylight Saving Time Debate

Abstract

A 1410-word Letter to the Editor reporting a bug in a study published in PNAS. The authors of the original study executed their code to compute the yearly circadian burden with an Earth rotating backwards: the sun rising in the West, setting on the East. The authors have acknowledged the error and re-executed the code. We analyze authors's new average yearly circadian burden in the US to show that these results do not provide significant information for the current debate on the time policy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José María Martín-Olalla, Jorge Mira. 2026-10-16. Two Seconds per Day: Limitations of Circadian Burden Metrics in the Permanent Daylight Saving Time Debate. https://doi.org/10.1080/07420528.2026.2745645

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Stochastic Shockwave Dynamics in First-Order Traffic Flow

Moving congestion fronts vary across realizations even when the traffic-flow law is fixed. This paper develops a generator-based formulation of the Lighthill--Whitham--Richards (LWR) model with random initial density and a deterministic fundamental diagram. Randomness enters through the initial spatial density field; every realization follows the same conservation law. For a smooth strictly concave fundamental diagram, we adapt established one-sided spatial Markov closure to traffic variables under the stated spatial-process and regularity assumptions, and derive a kinetic balance for physically normalized front intensities. Evolving the spatial generator provides density laws and congestion-front statistics without solving a road-grid problem for every realization. The formulation is continuous in physical space and time, while its numerical implementation approximates density state and integrates physical time. Four experiments distinguish deterministic consistency from stochastic comparison. Riemann and signal examples recover independently constructed exact LWR solutions. Smooth strictly concave approximations approach the deterministic triangular-diagram signal solution over the tested finite horizons; this does not establish stochastic closure at contacts or the capacity kink. A matched Monte Carlo Godunov ensemble evaluates front counts, sizes, mergers, and density distributions. The evolved generator also yields an instantaneous travel-time distribution for a frozen density field, compared with the same functional of the matched Godunov profiles. This quantity is not experienced travel time through evolving traffic. Resolution checks identify remaining normalization and small-front-loss effects. The contribution is direct evolution and interpretation of traffic-state and front distributions under a fixed first-order traffic law.

physics.soc-ph↗

Stationary analysis of adaptive aspiration dynamics in graph-structured games

Aspiration dynamics can favor cooperation on finite graphs through a purely local satisfaction mechanism. In the model studied here, individuals compare their payoffs with adaptive aspiration levels and revise their strategies through a self-switching Fermi rule. Although the aspirations are continuous and endogenous, the resulting finite-population process has a unique stationary distribution for every finite selection intensity and every finite connected graph under degree-normalized average payoffs when restricted to the compact forward-invariant state space in which aspirations lie in the payoff interval. In the weak-selection regime, the first-order stationary abundance shift is positive when \(R+S>T+P\), negative when \(R+S T+P\) means that, under neutrality, the expected payoff of a cooperator exceeds that of a defector. The stationary variance reveals a different effect whose first-order correction is governed by the payoff-range contrast \((R-S)-(T-P)\). This contrast compares how strongly cooperator and defector payoffs respond to changes in local neighborhood composition and therefore measures the relative sensitivity of their payoffs to the local environment. Under degree-normalized average payoffs, these first-order results hold on every finite connected graph and are independent of degree sequence, topology, and aspiration learning rate. Simulations on regular and heterogeneous graphs compare averaged and accumulated payoffs and illustrate that graph heterogeneity and the aspiration learning rate can affect stationary behavior away from weak selection. The first-order coefficients are derived from the finite stochastic process and do not use pair approximation, mean-field closure, or a large-population limit.

physics.soc-ph↗

Fairness, Travel, and Market Potential: An Optimization Framework for NBA Expansion

The potential expansion of the National Basketball Association (NBA) to 32 teams raises the question of how to restructure its conferences and divisions while balancing travel efficiency, fairness in team travel burdens, and commercial exposure. This study provides a quantitative framework for expansion planning. We develop two optimization models: one minimizing total travel distance and another following the Kalai-Smorodinsky (KS) proportional-improvement principle. The KS model maximizes the smallest normalized travel improvement between a team's fixed reference and individual ideal. Both models incorporate an opponent-exposure constraint to account for commercial considerations, and take into account road trips when measuring travel distance. Using data from all 30 current franchises and six candidate cities (Seattle, Las Vegas, Montreal, Vancouver, Tampa, and Mexico City), we evaluate 15 pairwise expansion scenarios under alternative season lengths and divisional formats. In the 30-team comparison, KS strikes a good balance between overall travel efficiency and fairness across teams, giving greater attention to individual travel burdens while keeping total travel close to the distance-minimizing solution. The expansion results show that travel requirements depend jointly on the candidate city pair and the competition format, highlighting the need to assess expansion and realignment together. Our study offers a flexible decision support framework for league executives, policymakers, and sports economists. It makes the trade-offs between total travel, individual gains, and opponent exposure explicit, providing evidence-based guidance for strategic league design.

physics.soc-ph↗