Tootfinder

Free-MAD: Consensus-Free Multi-Agent Debate
Yu Cui, Hang Fu, Haibin Zhang, Licheng Wang, Cong Zuo
https://arxiv.org/abs/2509.11035 https://arxiv.org/pdf/25…

Free-MAD: Consensus-Free Multi-Agent Debate
Multi-agent debate (MAD) is an emerging approach to improving the reasoning capabilities of large language models (LLMs). Existing MAD methods rely on multiple rounds of interaction among agents to reach consensus, and the final output is selected by majority voting in the last round. However, this consensus-based design faces several limitations. First, multiple rounds of communication increases token overhead and limits scalability. Second, due to the inherent conformity of LLMs, agents that …

Distributed Finite-Horizon Optimal Control for Consensus with Differential Privacy Guarantees
Yuwen Ma, Yongqiang Wang, Sarah K. Spurgeon, Boli Chen
https://arxiv.org/abs/2509.11917

Distributed Finite-Horizon Optimal Control for Consensus with Differential Privacy Guarantees
This paper addresses the problem of privacy-preserving consensus control for multi-agent systems (MAS) using differential privacy. We propose a novel distributed finite-horizon linear quadratic regulator (LQR) framework, in which agents share individual state information while preserving the confidentiality of their local pairwise weight matrices, which are considered sensitive data in MAS. Protecting these matrices effectively safeguards each agent's private cost function and control preferenc…

Timeliness, Consensus, and Composition of the Crowd: Community Notes on X
Olesya Razuvayevskaya, Adel Tayebi, Ulrikke Dybdal S{\o}rensen, Kalina Bontcheva, Richard Rogers
https://arxiv.org/abs/2510.12559

Timeliness, Consensus, and Composition of the Crowd: Community Notes on X
This study presents the first large-scale quantitative analysis of the efficiency of X's Community Notes, a crowdsourced moderation system for identifying and contextualising potentially misleading content. Drawing on over 1.8 million notes, we examine three key dimensions of crowdsourced moderation: participation inequality, consensus formation, and timeliness. Despite the system's goal of collective moderation, we find substantial concentration effect, with the top 10% of contributors produci…

You know these conversations have long been happening in private. To say it in public is to propose a consensus around which EU nations are going to build policy.

@… yup. It is ugly where we are, and odd how clearly we have seen what where we are has looked like in other real and imagine contexts.
And yet for many, today is somehow, astoundingly, just another Friday.
There is still not full consensus on that what is happening is in fact happening.

CryptPad: Zero-Knowledge Architecture
While Google Docs reads everything you type, CryptPad's XSalsa20-Poly1305 encryption and Nakamoto-style consensus protocol ensure the server never decrypts your documents.
https://www.sambent.com/cryptpad-zero-knowledge-architecture…

CryptPad: Zero-Knowledge Architecture
While Google Docs reads everything you type, CryptPad's XSalsa20-Poly1305 encryption and Nakamoto-style consensus protocol ensure the server never decrypts your documents.

Anthropic open sources a method to score AI model political evenhandedness; Gemini 2.5 Pro got 97%, Grok 4 96%, Claude Opus 4.1 95%, GPT-5 89%, and Llama 4 66% (Ina Fried/Axios)
https://www.axios.com/2025/11/13/anthropic-bot-bias-data

Anthropic tries to measure bot bias
There's no consensus over what constitutes political bias in AI systems.

A Range-Based Sharding (RBS) Protocol for Scalable Enterprise Blockchain
M. Z. Haider, M. Dias de Assuncao, Kaiwen Zhang
https://arxiv.org/abs/2509.11006 https://

A Range-Based Sharding (RBS) Protocol for Scalable Enterprise Blockchain
Blockchain technology offers decentralization and security but struggles with scalability, particularly in enterprise settings where efficiency and controlled access are paramount. Sharding is a promising solution for private blockchains, yet existing approaches face challenges in coordinating shards, ensuring fault tolerance with limited nodes, and minimizing the high overhead of consensus mechanisms like PBFT. This paper proposes the Range-Based Sharding (RBS) Protocol, a novel sharding mecha…

Exponential convergence of multiagent systems with lack of connection
Fabio Ancona, Mohamed Bentaibi, Francesco Rossi
https://arxiv.org/abs/2510.11334 https://

Exponential convergence of multiagent systems with lack of connection
Finding conditions ensuring consensus, i.e. convergence to a common value, for a networked system is of crucial interest, both for theoretical reasons and applications. This goal is harder to achieve when connections between agents are temporarily lost. Here, we prove that known conditions (introduced by Moreau) ensure an exponential convergence to consensus, with explicit rate of convergence. The key result is related to the length of the graph (i.e. the number of connections to reach a comm…

Bill Gates Gave $3.5M to Think Tank Run by Climate Crisis Denier Bjorn Lomborg https://www.desmog.com/2025/11/05/bill-gates-donated-climate-denier-bjorn-lomborg-copenhagen-consensus-center/

Bill Gates Gave $3.5M to Think Tank Run by Climate Crisis Denier Bjorn Lomborg 
Tax records reveal that the billionaire’s foundation has donated for years to Lomborg’s Copenhagen Consensus Center.

Continuous-Time Distributed Learning for Collective Wisdom Maximization
Luka Bakovi\'c, Giacomo Como, Fabio Fagnani, Anton Proskurnikov, Emma Tegling
https://arxiv.org/abs/2509.11808

Continuous-Time Distributed Learning for Collective Wisdom Maximization
Motivated by the well established idea that collective wisdom is greater than that of an individual, we propose a novel learning dynamics as a sort of companion to the Abelson model of opinion dynamics. Agents are assumed to make independent guesses about the true state of the world after which they engage in opinion exchange leading to consensus. We investigate the problem of finding the optimal parameters for this exchange, e.g. those that minimize the variance of the consensus value. Specifi…

MEC$^3$O: Multi-Expert Consensus for Code Time Complexity Prediction
Joonghyuk Hahn, Soohan Lim, Yo-Sub Han
https://arxiv.org/abs/2510.09049 https://arxiv.…

MEC$^3$O: Multi-Expert Consensus for Code Time Complexity Prediction
Predicting the complexity of source code is essential for software development and algorithm analysis. Recently, Baik et al. (2025) introduced CodeComplex for code time complexity prediction. The paper shows that LLMs without fine-tuning struggle with certain complexity classes. This suggests that no single LLM excels at every class, but rather each model shows advantages in certain classes. We propose MEC$^3$O, a multi-expert consensus system, which extends the multi-agent debate frameworks. M…

Consensus AI: Why will The vOICe sensory substitution defeat Neuralink Blindsight and other brain implants for restoring vision? https://consensus.app/search/why-will-the-voice-sensory-substitution-defeat-neu/dWrnJDjIR9uP48YkWTX_Ag/

Why will The vOICe sensory substitution defeat Neuralink Blindsight and other brain implants for restoring vision? - Consensus
Restoring vision in blind individuals can be approached through invasive brain implants (like Neuralink or visual prostheses) or non-invasive sensory substitution devices (SSDs) such as The vOICe, which converts visual information into sound. Each method has distinct strengths and limitations. Current evidence suggests that sensory substitution devices like The vOICe offer unique advantages in safety, flexibility, and practical visual rehabilitation, but do not fully replicate natural vision.

This utter arsehole is happy to posture but as leader of the world's 6th richest country he won't contribute to the vital fund to protect and restore tropical rainforests.
This utter arsehole postures on climate while greenlighting huge energy guzzling data centres.
This utter arsehole is happy to expand aviation while witterring about 'climate consensus'
Starmer warns 'consensus is gone' on fighting climate change as leaders gather at COP30 - BBC News…

Starmer warns 'consensus is gone' on fighting climate change as leaders gather at COP30 - follow live
Prince William says the climate threat is "fast approaching", as the UN warns it is now "virtually impossible" to keep the 1.5C global limit.

S-D-RSM: Stochastic Distributed Regularized Splitting Method for Large-Scale Convex Optimization Problems
Maoran Wang, Xingju Cai, Yongxin Chen
https://arxiv.org/abs/2511.10133 https://arxiv.org/pdf/2511.10133 https://arxiv.org/html/2511.10133
arXiv:2511.10133v1 Announce Type: new
Abstract: This paper investigates the problems large-scale distributed composite convex optimization, with motivations from a broad range of applications, including multi-agent systems, federated learning, smart grids, wireless sensor networks, compressed sensing, and so on. Stochastic gradient descent (SGD) and its variants are commonly employed to solve such problems. However, existing algorithms often rely on vanishing step sizes, strong convexity assumptions, or entail substantial computational overhead to ensure convergence or obtain favorable complexity. To bridge the gap between theory and practice, we integrate consensus optimization and operator splitting techniques (see Problem Reformulation) to develop a novel stochastic splitting algorithm, termed the \emph{stochastic distributed regularized splitting method} (S-D-RSM). In practice, S-D-RSM performs parallel updates of proximal mappings and gradient information for only a randomly selected subset of agents at each iteration. By introducing regularization terms, it effectively mitigates consensus discrepancies among distributed nodes. In contrast to conventional stochastic methods, our theoretical analysis establishes that S-D-RSM achieves global convergence without requiring diminishing step sizes or strong convexity assumptions. Furthermore, it achieves an iteration complexity of $\mathcal{O}(1/\epsilon)$ with respect to both the objective function value and the consensus error. Numerical experiments show that S-D-RSM achieves up to 2--3$\times$ speedup compared to state-of-the-art baselines, while maintaining comparable or better accuracy. These results not only validate the algorithm's theoretical guarantees but also demonstrate its effectiveness in practical tasks such as compressed sensing and empirical risk minimization.
toXiv_bot_toot

A comparison of approaches to incorporate patient-selected and patient-ranked outcomes in clinical trials
David S. Robertson, Thomas Jaki
https://arxiv.org/abs/2510.11578 https:…

A comparison of approaches to incorporate patient-selected and patient-ranked outcomes in clinical trials
A key aspect of patient-focused drug development is identifying and measuring outcomes that are important to patients in clinical trials. Many medical conditions affect multiple symptom domains, and a consensus approach to determine the relative importance of the associated multiple outcomes ignores the heterogeneity in individual patient preferences. Patient-selected outcomes offer one way to incorporate individual patient preferences, as proposed in recent regulatory guidance for the treatmen…

MusicSwarm: Biologically Inspired Intelligence for Music Composition
Markus J. Buehler
https://arxiv.org/abs/2509.11973 https://arxiv.org/pdf/2509.11973

MusicSwarm: Biologically Inspired Intelligence for Music Composition
We show that coherent, long-form musical composition can emerge from a decentralized swarm of identical, frozen foundation models that coordinate via stigmergic, peer-to-peer signals, without any weight updates. We compare a centralized multi-agent system with a global critic to a fully decentralized swarm in which bar-wise agents sense and deposit harmonic, rhythmic, and structural cues, adapt short-term memory, and reach consensus. Across symbolic, audio, and graph-theoretic analyses, the swa…

Evidence of Physiological Co-Modulation During Human-Animal Interaction: A Systematic Review
G. Bargigli, L. Frassineti, A. Lanata', P. Baragli, C. Scopa, A. Vignoli
https://arxiv.org/abs/2510.10559

Evidence of Physiological Co-Modulation During Human-Animal Interaction: A Systematic Review
This review examines the evidence in the literature for physiological co-modulation during human-animal interaction. The aim of this work is to identify studies that assessed co-modulation via simultaneous measurement of physiological signals in both species, performing quantitative comparisons, and evaluate the consistency of the findings.\\ We searched PubMed, EM-BASE, Scopus, Google Scholar, Animal Studies Repository, and the ''Consensus app'' tool between June and August 2025 (last search: …

Sharp bettor backs side before line moves on Raiders-Eagles game https://www.reviewjournal.com/sports/betting/sharp-bettor-backs-side-before-line-moves-on-raiders-eagles-game-3594700/

Jammer dat Eenvandaag weer met t voorbeeld van het toiletbezoek van Orban kwam toen het over consensus in de EU ging.
Veel belangrijker is dat in diezelfde tijd meer zaken 'gedelegeerd' werden naar groepen landen met precies hetzelfde belang. Zo is toen een deel van de EU-defensie geregeld.
Per definitie zitten er ook grote verschillen tussen verschillende regio's. Zo'n oplossing is dan ook zo gek nog niet. (En zet een 'Hongarije' buiten spel)
#EU #Eenvandaag

Bill Gates Gave $3.5M to Think Tank Run by Climate Crisis Denier Bjorn Lomborg (Rei Takver/DeSmog)
https://www.desmog.com/2025/11/05/bill-gates-donated-climate-denier-bjorn-lomborg-copenhagen-consensus-center/
http://www.memeorandum.com/251105/p151#a251105p151

Austerity in Crisis?: A Narrative Review of Its Economic, Social, and Political Effects in Times of Crisis
Ricardo Alonzo Fern\'andez Salguero
https://arxiv.org/abs/2510.10449

Austerity in Crisis?: A Narrative Review of Its Economic, Social, and Political Effects in Times of Crisis
The 2008 global financial crisis marked the beginning of a decade dominated by fiscal austerity policies in much of the developed world. This paper presents a qualitative narrative review of an extensive collection of academic literature to synthesize evidence on the multifaceted effects of austerity. Following a thematic approach inspired by PRISMA guidelines, the economic, social, and political consequences of these measures are examined. The analysis reveals a majority consensus regarding th…

PoS-CoPOR: Proof-of-Stake Consensus Protocol with Native Onion Routing Providing Scalability and DoS-Resistance
Ivan Homoliak, Martin Pere\v{s}\'ini, Marek Tama\v{s}kovi\v{c}, Timotej Ponek, Luk\'a\v{s} Hellebrandt, Kamil Malinka
https://arxiv.org/abs/2510.04619

PoS-CoPOR: Proof-of-Stake Consensus Protocol with Native Onion Routing Providing Scalability and DoS-Resistance
Proof-of-Stake (PoS) consensus protocols often face a trade-off between performance and security. Protocols that pre-elect leaders for subsequent rounds are vulnerable to Denial-of-Service (DoS) attacks, which can disrupt the network and compromise liveness. In this work, we present PoS-CoPOR, a single-chain PoS consensus protocol that mitigates this vulnerability by integrating a native onion routing mechanism into the consensus protocol itself. PoS-CoPOR combines stake-weighted probabilistic …

Twenty years after the U.S. invaded Iraq,
the American consensus is clear:
It was wrong.
Neocons admit it.
Reaganite conservatives admit it.
Liberals who helped sell the war admit it.
Bret Stephens — well, Bret Stephens regrets nothing,
Even George W. Bush himself won’t come out and publicly defend the war he started,
leaving Peter Baker to write an entire article premised on the question,
but what if he did?
Yet as a society w…

The wrongest war

Odontoceti: Ultra-Fast DAG Consensus with Two Round Commitment
Preston Vander Vos
https://arxiv.org/abs/2510.01216 https://arxiv.org/pdf/2510.01216

Odontoceti: Ultra-Fast DAG Consensus with Two Round Commitment
Users of blockchains value scalability, expecting fast confirmations and immediate transaction processing. Odontoceti, the latest in DAG-based consensus, addresses these concerns by prioritizing low latency and high throughput, making a strategic trade-off in security by operating with a 20% fault tolerance instead of the established 33% level. It is the first DAG-based protocol to achieve commitment in just two communication rounds, delivering median latency of 300 milliseconds while processin…

Partial Resilient Leader-Follower Consensus in Time-Varying Graphs
Haejoon Lee, Dimitra Panagou
https://arxiv.org/abs/2510.01144 https://arxiv.org/pdf/2510…

Partial Resilient Leader-Follower Consensus in Time-Varying Graphs
This work studies resilient leader-follower consensus with a bounded number of adversaries. Existing approaches typically require robustness conditions of the entire network to guarantee resilient consensus. However, the behavior of such systems when these conditions are not fully met remains unexplored. To address this gap, we introduce the notion of partial leader-follower consensus, in which a subset of non-adversarial followers successfully tracks the leader's reference state despite insuff…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 71604 edges.
Tags: Biolo…

Alignment conditions of the human eye for few-photon vision experiments
T. H. A. van der Reep, W. L\"offler
https://arxiv.org/abs/2510.09186 https://a…

Alignment conditions of the human eye for few-photon vision experiments
In experiments probing human vision at the few-photon level, precise alignment of the eye is necessary such that stimuli reach the highest-density rod region of the retina. However, in literature there seems to be no consensus on the optimal eye alignment for such experiments. Typically, experiments are performed by presenting stimuli nasally or temporally, but the angle under which the few-photon pulses are presented varies between 7 deg and 23 deg. Here we combine a $3$-dimensional eye model …

Zk-SNARK Marketplace with Proof of Useful Work
Samuel Oleksak, Richard Gazdik, Martin Peresini, Ivan Homoliak
https://arxiv.org/abs/2510.09729 https://arxi…

Zk-SNARK Marketplace with Proof of Useful Work
Proof of Work (PoW) is widely regarded as the most secure permissionless blockchain consensus protocol. However, its reliance on computationally intensive yet externally useless puzzles results in excessive electric energy wasting. To alleviate this, Proof of Useful Work (PoUW) has been explored as an alternative to secure blockchain platforms while also producing real-world value. Despite this promise, existing PoUW proposals often fail to embed the integrity of the chain and identity of the m…

Federated Consistency- and Complementarity-aware Consensus-enhanced Recommendation
Yunqi Mi, Boyang Yan, Guoshuai Zhao, Jialie Shen, Xueming Qian
https://arxiv.org/abs/2509.22659

Federated Consistency- and Complementarity-aware Consensus-enhanced Recommendation
Personalized federated recommendation system (FedRec) has gained significant attention for its ability to preserve privacy in delivering tailored recommendations. To alleviate the statistical heterogeneity challenges among clients and improve personalization, decoupling item embeddings into the server and client-specific views has become a promising way. Among them, the global item embedding table serves as a consensus representation that integrates and reflects the collective patterns across a…

Sums of Exponential Terms, Conserved Quantities, and the Real Wave Numbers
Terence R. Smith
https://arxiv.org/abs/2510.07803 https://arxiv.org/pdf/2510.078…

Sums of Exponential Terms, Conserved Quantities, and the Real Wave Numbers
There is consensus that sums $S_n={ {Σ}_{k=1}^n R_{0k} e^{i θ_k}}$ of complex exponential terms, despite their mathematical significance, only possess closed-form representations for specific values of n and special values of their parameters and that there are no generally-accepted recursive formulae for their computation. This note is focused on recursive formulae that: (1) provide closed-form analytic representations of $S_n$ for any finite n; (2) include generalizations of the usual formu…

🟢 Was ist eigentlich #Greenwashing? Eine neue Übersichtsstudie hat 646 Definitionen ausgewertet.
Greenwashing bedeutet, dass Unternehmen sich „grüner“ darstellen, als sie wirklich sind – oft durch vage, irrelevante oder selektive Infos.
Das „Need for Balance“-Modell beschreibt auch das Gegenteil –

What is greenwashing- a scoping review of greenwashing definitions and development of the need-for- balance model - Journal of Sustainable Business
As organizations are under increasing pressure to demonstrate environmental responsibility, concerns about greenwashing have grown considerably. Despite its significance, there is no consensus on its definition, which complicates both research and mitigation efforts. To address this gap, we conducted a scoping review of 332 articles published across 174 journals, analyzing 646 definitions of greenwashing. While terminology varies, common themes emerge, and two main types of definitions can be d…

⏰ Fear of desynchronization: Why doesn’t Europe abolish daylight saving time?
https://english.elpais.com/society/2025-10-24/fear-of-desynchronization-why-doesnt-europe-abolish-daylight-saving-time.html

Fear of desynchronization: Why doesn’t Europe abolish daylight saving time?
EU member states have failed to reach consensus on the risks of maintaining time according to geography

Replaced article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
Yaguang Yang
https://arxiv.org/abs/1212.5929
- Quantum computing and the stable set problem
Alja\v{z} Krpan, Janez Povh, Dunja Pucher
https://arxiv.org/abs/2405.12845 https://mastoxiv.page/@arXiv_mathOC_bot/112483516437815686
- Mean Field Game with Reflected Jump Diffusion Dynamics: A Linear Programming Approach
Zongxia Liang, Xiang Yu, Keyu Zhang
https://arxiv.org/abs/2508.20388 https://mastoxiv.page/@arXiv_mathOC_bot/115111048711698998
- Differential Dynamic Programming for the Optimal Control Problem with an Ellipsoidal Target Set a...
Sungjun Eom, Gyunghoon Park
https://arxiv.org/abs/2509.07546 https://mastoxiv.page/@arXiv_mathOC_bot/115179281556444440
- On the Moreau envelope properties of weakly convex functions
Marien Renaud, Arthur Leclaire, Nicolas Papadakis
https://arxiv.org/abs/2509.13960 https://mastoxiv.page/@arXiv_mathOC_bot/115224514482363803
- Automated algorithm design via Nevanlinna-Pick interpolation
Ibrahim K. Ozaslan, Tryphon T. Georgiou, Mihailo R. Jovanovic
https://arxiv.org/abs/2509.21416 https://mastoxiv.page/@arXiv_mathOC_bot/115286533597711930
- Optimal Control of a Bioeconomic Crop-Energy System with Energy Reinvestment
Othman Cherkaoui Dekkaki
https://arxiv.org/abs/2510.11381 https://mastoxiv.page/@arXiv_mathOC_bot/115372322896073250
- Point Convergence Analysis of the Accelerated Gradient Method for Multiobjective Optimization: Co...
Yingdong Yin
https://arxiv.org/abs/2510.26382 https://mastoxiv.page/@arXiv_mathOC_bot/115468018035252078
- History-Aware Adaptive High-Order Tensor Regularization
Chang He, Bo Jiang, Yuntian Jiang, Chuwen Zhang, Shuzhong Zhang
https://arxiv.org/abs/2511.05788
- Equivalence of entropy solutions and gradient flows for pressureless 1D Euler systems
Jos\'e Antonio Carrillo, Sondre Tesdal Galtung
https://arxiv.org/abs/2312.04932 https://mastoxiv.page/@arXiv_mathAP_bot/111560077272113052
- Kernel Modelling of Fading Memory Systems
Yongkang Huo, Thomas Chaffey, Rodolphe Sepulchre
https://arxiv.org/abs/2403.11945 https://mastoxiv.page/@arXiv_eessSY_bot/112121123836064435
- The Maximum Theoretical Ground Speed of the Wheeled Vehicle
Altay Zhakatayev, Mukatai Nemerebayev
https://arxiv.org/abs/2502.15341 https://mastoxiv.page/@arXiv_physicsclassph_bot/114057765769441123
- Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
Giacomo Greco, Luca Tamanini
https://arxiv.org/abs/2504.11133 https://mastoxiv.page/@arXiv_mathPR_bot/114346453424694503
- Optimizing the ground state energy of the three-dimensional magnetic Dirichlet Laplacian with con...
Matthias Baur
https://arxiv.org/abs/2504.21597 https://mastoxiv.page/@arXiv_mathph_bot/114431404740241516
- A localized consensus-based sampling algorithm
Arne Bouillon, Alexander Bodard, Panagiotis Patrinos, Dirk Nuyens, Giovanni Samaey
https://arxiv.org/abs/2505.24861 https://mastoxiv.page/@arXiv_mathNA_bot/114612580684567066
- A Novel Sliced Fused Gromov-Wasserstein Distance
Moritz Piening, Robert Beinert
https://arxiv.org/abs/2508.02364 https://mastoxiv.page/@arXiv_csLG_bot/114976243138728278
- Minimal Regret Walras Equilibria for Combinatorial Markets via Duality, Integrality, and Sensitiv...
Alo\"is Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
https://arxiv.org/abs/2511.09021 https://mastoxiv.page/@arXiv_csGT_bot/115541243299714775
toXiv_bot_toot

Exploring one-dimensional, binary, radius-2 cellular automata, over cyclic configurations, in terms of their ability to solve decision problems by distributed consensus
Eurico Ruivo, Pedro Paulo Balbi, K\'evin Perrot, Marco Montalva-Medel, Eric Goles
https://arxiv.org/abs/2510.01040

Exploring one-dimensional, binary, radius-2 cellular automata, over cyclic configurations, in terms of their ability to solve decision problems by distributed consensus
Probing the ability of automata networks to solve decision problems has received a continuous attention in the literature, and specially with the automata reaching the answer by distributed consensus, i.e., their all taking on a same state, out of two. In the case of binary automata networks, regardless of the kind of update employed, the networks should display only two possible attractors, the fixed points $0^L$ and $1^L$, for all cyclic configurations of size $L$. A previous investigation in…

2026 NFL Draft consensus rankings: Three QBs in top 10, Arvell Reese at No. 1 https://www.nytimes.com/athletic/6817289/2025/11/19/nfl-draft-2026-rankings-board-ty-simpson/

NeurIPS should lead scientific consensus on AI policy
Rishi Bommasani
https://arxiv.org/abs/2510.00075 https://arxiv.org/pdf/2510.00075

NeurIPS should lead scientific consensus on AI policy
Designing wise AI policy is a grand challenge for society. To design such policy, policymakers should place a premium on rigorous evidence and scientific consensus. While several mechanisms exist for evidence generation, and nascent mechanisms tackle evidence synthesis, we identify a complete void on consensus formation. In this position paper, we argue NeurIPS should actively catalyze scientific consensus on AI policy. Beyond identifying the current deficit in consensus formation mechanisms, w…

A Semantics-Aware Hierarchical Self-Supervised Approach to Classification of Remote Sensing Images
Giulio Weikmann, Gianmarco Perantoni, Lorenzo Bruzzone
https://arxiv.org/abs/2510.04916

A Semantics-Aware Hierarchical Self-Supervised Approach to Classification of Remote Sensing Images
Deep learning has become increasingly important in remote sensing image classification due to its ability to extract semantic information from complex data. Classification tasks often include predefined label hierarchies that represent the semantic relationships among classes. However, these hierarchies are frequently overlooked, and most approaches focus only on fine-grained classification schemes. In this paper, we present a novel Semantics-Aware Hierarchical Consensus (SAHC) method for learn…

AT 2018cow at ~5 years: additional evidence for a tidal disruption origin
Anne Inkenhaag, Andrew J. Levan, Andrew Mummery, Peter G. Jonker
https://arxiv.org/abs/2510.08505 https…

AT 2018cow at ~5 years: additional evidence for a tidal disruption origin
The Luminous Fast Blue Optical Transient (LFBOT) AT 2018cow is the prototype of its class with an extensive set of multi-wavelength observations. Despite a rich data set there is, still, no consensus about the physical nature and origin of this event. AT 2018cow remained UV bright 2-4 years after the explosion, which points at an additional energy injection source, most likely from an accretion disk. We present additional late time UV data obtained with the Hubble Space Telescope, to show there…

On the Limits of Consensus under Dynamic Availability and Reconfiguration
Joachim Neu, Javier Nieto, Ling Ren
https://arxiv.org/abs/2510.03625 https://arxi…

On the Limits of Consensus under Dynamic Availability and Reconfiguration
Proof-of-stake blockchains require consensus protocols that support Dynamic Availability and Reconfiguration (so-called DAR setting), where the former means that the consensus protocol should remain live even if a large number of nodes temporarily crash, and the latter means it should be possible to change the set of operating nodes over time. State-of-the-art protocols for the DAR setting, such as Ethereum, Cardano's Ouroboros, or Snow White, require unrealistic additional assumptions, such as…

Resilient Multi-Dimensional Consensus and Distributed Optimization against Agent-Based and Denial-of-Service Attacks
Hongjian Chen, Changyun Wen, Xiaolei Li, Jiaqi Yan
https://arxiv.org/abs/2510.06835 …

Resilient Multi-Dimensional Consensus and Distributed Optimization against Agent-Based and Denial-of-Service Attacks
In this paper, we consider the resilient multi-dimensional consensus and distributed optimization problems of multi-agent systems (MASs) in the presence of both agent-based and denial-of-service (DoS) attacks. The considered agent-based attacks can cover malicious, Byzantine, and stubborn agents. The links between agents in the network can be blocked by DoS attacks, which may lead the digraph to be time-varying and even disconnected. The objective is to ensure that the remaining benign agents a…

Consensus as cooling: a granular gas model for continuous opinions on structured networks
Carlos Uriarte, Pablo Rodriguez-Lopez, Nagi Khalil
https://arxiv.org/abs/2510.06807 htt…

Consensus as cooling: a granular gas model for continuous opinions on structured networks
A continuous-opinion model accounting for the social compromise propensity is theoretically and numerically analysed. An agent's opinion is represented by a real number that can be changed through social interactions with her neighbours. The proposed dynamics depends on two fundamental parameters, $α\in[-1,1]$ and $β\ge 0$. If an interaction takes place between two agents, their relative opinions decreases an amount given by $α$. The probability of two neighbours to interact is proportional …

researchers picked 2000 posts from r/AmITheAsshole where consensus response was "yes, YTA", and they asked LLMs to respond.
Claude and GPT said "no, NTA" 50% of the time.
Gemini was the least sycophantic at 20% NTA.
they also tested human reaction to sycophantic vs non-sycophantic LLMs. results are as expected (but not very large)
arxiv.org/abs/2510.01395

Sharp bettors cause line move in Raiders-Titans matchup https://www.reviewjournal.com/sports/betting/sharp-bettors-cause-line-move-in-raiders-titans-matchup-3484407/

Empirical Optimization of the Source-Surface Height in the PFSS extrapolation
Munehito Shoda, Kyogo Tokoro, Daikou Shiota, Shinsuke Imada
https://arxiv.org/abs/2510.05513 https:…

Empirical Optimization of the Source-Surface Height in the PFSS extrapolation
The potential field source surface (PFSS) method is a widely used magnetic field extrapolation technique in the space weather community. The only free parameter in the PFSS method is the source-surface height ($R_{\rm SS}$), beyond which all field lines are open. Although $R_{\rm SS}$ is known to vary with solar activity, there is no consensus on how to determine it for a given surface magnetic field distribution. In this study, we investigate the nature of $R_{\rm SS}$ using a long-period (200…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 54480 edges.
Tags: Biolo…

> Like an unattended turkey deep frying on the patio, truly global distributed consensus promises deliciousness while yielding only immolation.
https://fly.io/blog/corrosion/ 👨‍🍳🤌

Corrosion
Corrosion is distributed service discovery based on Rust, SQLite, and CRDTs.

They should really build the Epstein-Memorial-Ballroom in this pinkish color https://mastodon.social/@jeffjarvis/115440077009509193

Large-scale peculiar velocities in the universe
Christos G. Tsagas, Leandros Perivolaropoulos, Kerkyra Asvesta
https://arxiv.org/abs/2510.05340 https://arx…

Large-scale peculiar velocities in the universe
Observations have repeatedly confirmed the presence of large-scale peculiar motions in the universe, commonly referred to as ``bulk flows''. These are vast regions of the observable universe, typically spanning scales of several hundred Mpc, that move coherently with speeds of the order of several hundred km/sec. While there is a general consensus on the direction of these motions, discrepancies persist in their reported sizes and velocities, with some of them exceeding the predictions of the s…

Optimal Good-Case Latency for Sleepy Consensus
Yuval Efron, Joachim Neu, Ling Ren, Ertem Nusret Tas
https://arxiv.org/abs/2510.06023 https://arxiv.org/pdf/…

Optimal Good-Case Latency for Sleepy Consensus
In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a BB or BA protocol under certain favorable conditions, namely the designated leader being correct (for BB), or all parties having the same input value (for BA). We provide a full characterization of the feasibility and impossibility of good-case latency, for both BA and BB, in the synchronous sleepy model. Surprisingly…

Angelfish: Consensus with Optimal Throughput and Latency Across the Leader-DAG Spectrum
Qianyu Yu, Giuliano Losa, Nibesh Shrestha, Xuechao Wang
https://arxiv.org/abs/2509.15847 …

Angelfish: Consensus with Optimal Throughput and Latency Across the Leader-DAG Spectrum
To maximize performance, many modern blockchain systems rely on eventually-synchronous, Byzantine fault-tolerant (BFT) consensus protocols. Two protocol designs have emerged in this space: protocols that minimize latency using a leader that drives both data dissemination and consensus, and protocols that maximize throughput using a separate, asynchronous data dissemination layer. Recent protocols such as Partially-Synchronous Bullshark and Sailfish combine elements of both approaches by using a…

@… I think we need at least two FAANG (sic) for consensus but to be clear I just do whatever meta does

We are unable to reach a consensus in our demands. #TOTP

I'm currently reading The Long Heat by Wim Carton and Andreas Malm and highly recommend it. Do not be daunted by the page count of 704 pages. It has so many notes at the back, without back matter it's only ~420 pages. Hard to read emotionally, though. It paints a stark picture of earth's near future and the massive destruction of human and other-than-human life ahead, and the insane brinkmanship of elite consensus.

dHPR: A Distributed Halpern Peaceman--Rachford Method for Non-smooth Distributed Optimization Problems
Zhangcheng Feng, Defeng Sun, Yancheng Yuan, Guojun Zhang
https://arxiv.org/abs/2511.10069 https://arxiv.org/pdf/2511.10069 https://arxiv.org/html/2511.10069
arXiv:2511.10069v1 Announce Type: new
Abstract: This paper introduces the distributed Halpern Peaceman--Rachford (dHPR) method, an efficient algorithm for solving distributed convex composite optimization problems with non-smooth objectives, which achieves a non-ergodic $O(1/k)$ iteration complexity regarding Karush--Kuhn--Tucker residual. By leveraging the symmetric Gauss--Seidel decomposition, the dHPR effectively decouples the linear operators in the objective functions and consensus constraints while maintaining parallelizability and avoiding additional large proximal terms, leading to a decentralized implementation with provably fast convergence. The superior performance of dHPR is demonstrated through comprehensive numerical experiments on distributed LASSO, group LASSO, and $L_1$-regularized logistic regression problems.
toXiv_bot_toot

Consensus!
Shared spaces don't work - separate cars, bikes and pedestrians.
https://road.cc/content/news/bollards-and-kerbs-key-safe-streets-316491

Physical separation between cyclists, pedestrians and motorists key to safer streets, research shows
The study also found that bad behaviour is the biggest contributing factor towards streets hostile to walking and wheeling

Interesting graph from @….
There was a •fascinating• 99pi about the push to create an official Category 6 — and the surprisingly compelling arguments against doing that (more fully developed in the story audio than in the web text summary):
https://99percentinvisible.org/episode/category-6/
One thing that’s a clear point of consensus in that debate is that the existing Saffir-Simpson hurricane scale isn’t up to the task of describing what we face now. https://fediscience.org/@rahmstorf/115481161250561175

😍😍
https://mastodon.social/@arstechnica/115571398905888467

Ars Technica (@arstechnica@mastodon.social)
Attached: 1 image Stranded astronaut finds an alien ally in Project Hail Mary trailer "The consensus here is that it would be preferable if you did not die." https://arstechnica.com/culture/2025/11/stranded-astronaut-finds-an-alien-ally-in-project-hail-mary-trailer/?utm_brand=arstechnica&utm_social-type=owned&utm_source=mastodon&utm_medium=social

One Prompt Fits All: Universal Graph Adaptation for Pretrained Models
Yongqi Huang, Jitao Zhao, Dongxiao He, Xiaobao Wang, Yawen Li, Yuxiao Huang, Di Jin, Zhiyong Feng
https://arxiv.org/abs/2509.22416 …

One Prompt Fits All: Universal Graph Adaptation for Pretrained Models
Graph Prompt Learning (GPL) has emerged as a promising paradigm that bridges graph pretraining models and downstream scenarios, mitigating label dependency and the misalignment between upstream pretraining and downstream tasks. Although existing GPL studies explore various prompt strategies, their effectiveness and underlying principles remain unclear. We identify two critical limitations: (1) Lack of consensus on underlying mechanisms: Despite current GPLs have advanced the field, there is no …

"We are not Future-ready": Understanding AI Privacy Risks and Existing Mitigation Strategies from the Perspective of AI Developers in Europe
Alexandra Klymenko, Stephen Meisenbacher, Patrick Gage Kelley, Sai Teja Peddinti, Kurt Thomas, Florian Matthes
https://arxiv.org/abs/2510.00909

"We are not Future-ready": Understanding AI Privacy Risks and Existing Mitigation Strategies from the Perspective of AI Developers in Europe
The proliferation of AI has sparked privacy concerns related to training data, model interfaces, downstream applications, and more. We interviewed 25 AI developers based in Europe to understand which privacy threats they believe pose the greatest risk to users, developers, and businesses and what protective strategies, if any, would help to mitigate them. We find that there is little consensus among AI developers on the relative ranking of privacy risks. These differences stem from salient reas…

Not interested in a debate on what ways are better or worse but it seems to me that @TheASF has a fair bit of material on "The Apache Way" which one could approach as a How-To even for projects that are not under the ASF or any other domiciling organization. It's not perfect but I'm not aware of any ASF project having the sort of nasty takeover like the Ruby affair.
OTOH, it may require the "hippie" vibe of ASF focused on consensus and community over code t…

Elastic Energy Storage Mechanism in Hovering Animal Flight: A Discriminative Method Based on Wing Kinematics
Shijie Sheng, Jianghao Wu, Renxuan Bo, Long Chen, Yanlai Zhang
https://arxiv.org/abs/2510.02819

Elastic Energy Storage Mechanism in Hovering Animal Flight: A Discriminative Method Based on Wing Kinematics
Existing research has yet to reach a consensus on whether and how small flying animals utilize elastic energy storage mechanisms to reduce flight energy expenditure, and there is a lack of systematic and universal methods for assessment. To address these gaps, this study proposes a method to evaluate elastic energy storage capacity based on wing kinematic parameters (flapping amplitude and flapping frequency), grounded in the hypothesis that animals tend to minimize flight energy expenditure. B…

Model-Free Dynamic Consensus in Multi-Agent Systems: A Q-Function Perspective
Maryam Babazadeh, Naim Bajcinca
https://arxiv.org/abs/2509.24598 https://arxi…

Model-Free Dynamic Consensus in Multi-Agent Systems: A Q-Function Perspective
This paper presents a new method for achieving dynamic consensus in linear discrete-time homogeneous multi-agent systems (MAS) with marginally stable or unstable dynamics. The guarantee of consensus in this setting involves a set of constraints based on the graph's spectral properties, complicating the design of the coupling gains. This challenge intensifies for large-scale systems with diverse graph Laplacian spectra. The proposed approach reformulates the dynamic consensus problem with a pres…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 54480 edges.
Tags: Biolo…

CoNeT-GIANT: A compressed Newton-type fully distributed optimization algorithm
Souvik Das, Subhrakanti Dey
https://arxiv.org/abs/2510.08806 https://arxiv.o…

CoNeT-GIANT: A compressed Newton-type fully distributed optimization algorithm
Compression techniques are essential in distributed optimization and learning algorithms with high-dimensional model parameters, particularly in scenarios with tight communication constraints such as limited bandwidth. This article presents a communication-efficient second-order distributed optimization algorithm, termed as CoNet-GIANT, equipped with a compression module, designed to minimize the average of local strongly convex functions. CoNet-GIANT incorporates two consensus-based averaging …

QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
Hasan Heydari, Alysson Bessani, Kartik Nayak
https://arxiv.org/abs/2510.01536 https://ar…

QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
Existing distributed ledger protocols either incur a high communication complexity and are thus suited to systems with a small number of processes (e.g., PBFT), or rely on committee-sampling-based approaches that only work for a very large number of processes (e.g., Algorand). Neither of these lines of work is well-suited for moderate-scale distributed ledgers ranging from a few hundred to a thousand processes, which are common in production (e.g, Redbelly, Sui). The goal of this work is to des…

Taiwan's minister Wu Cheng-wen says the US won't impose "punishing" tariffs on Taiwan, after a "consensus" that Taiwan would support the US chip industry (Financial Times)
https://www.ft.com/content/28648c5f-5dcf-4300-9074-b1b0ef4704fd

On Robustness of Consensus over Pseudo-Undirected Path Graphs
Abhinav Sinha, Dwaipayan Mukherjee, Shashi Ranjan Kumar
https://arxiv.org/abs/2509.20314 https://

On Robustness of Consensus over Pseudo-Undirected Path Graphs
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed graphs permit asymmetry but make consensus dependent on root nodes and their influence. Both paradigms impose inherent restrictions on achievable consensus values and network robustness. This paper introduces a theoretical framework for achieving consensus over a…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 112890 edges.
Tags: Biol…

Latest view of CTA 1 with VERITAS
Alisha Chromey
https://arxiv.org/abs/2510.04414 https://arxiv.org/pdf/2510.04414

Latest view of CTA 1 with VERITAS
CTA 1 is a shell-type supernova remnant (SNR) with a central pulsar wind nebula (PWN), visible at very-high-energy (VHE) from 50 GeV to 100 TeV from a moderately extended emission region. While general consensus concludes the VHE emission originates from relativistic leptons accelerated by the PWN and undergoing inverse Compton scattering, questions remain about electron escape and propagation, as well as the evolutionary stage of this particular PWN. CTA 1 is on the cusp of middle age (~13 kyr…

Recommendations include —
•Avoid repeating misinfo w/o correction
•Leverage trusted sources to counter misinformation & provide accurate health info
•Debunk misinformation often &repeatedly w/ evidence-based methods
**•Fund basic & translational
research on the psychology of health misinformation , including effective ways to counter it **

Sander van der Linden (@profsanderlinden.bsky.social)
Public health is under attack by a deluge of misinformation. We offer a consensus report from the American Psychological Association summarizing what we know & what interventions are effective in countering it. We provide 8 concrete recommendations. Open-access - https://awspntest.apa.org/fulltext/2026-77135-001.pdf

Heaven & Hell: One-Step Hub Consensus
Nnamdi Daniel Aghanya
https://arxiv.org/abs/2509.19630 https://arxiv.org/pdf/2509.19630

Heaven & Hell: One-Step Hub Consensus
Many networked systems require a central authority to enforce a global configuration against local peer influence. We study influence dynamics on finite weighted directed graphs with a distinguished hub node and binary vertex states ('Glory' or 'Gnash'). We give a sharp, local, and efficiently checkable criterion that guarantees global convergence to Glory in a single synchronous update from any initial state. At each non-hub vertex, the incoming weight from the hub must at least match the tota…

Fantasy football start/sit, Week 5: Start C.J. Stroud vs. Ravens, Sit Baker Mayfield vs. Seahawks

https://www.cbssports.com/betting/news/fan

Sharp money moves total on Raiders-Bears Week 4 matchup https://www.reviewjournal.com/sports/betting/sharp-money-moves-total-on-raiders-bears-week-4-matchup-3466577/

Network Consensus in the Wasserstein Space of Probability Measures Defined on Multi-Dimensional Euclidean Spaces
Pilgyu Jung, Yoon Mo Jung
https://arxiv.org/abs/2509.25895 https…

Network Consensus in the Wasserstein Space of Probability Measures Defined on Multi-Dimensional Euclidean Spaces
The consensus problem -- achieving agreement among a network of agents -- is a central theme in both theory and applications. Recently, this problem has been extended from Euclidean spaces to the space of probability measures, where the natural notion of averaging is given by the Wasserstein barycenter. While prior work established convergence in one dimension, the case of higher dimensions poses additional challenges due to the curved geometry of Wasserstein space. In this paper, we develop a …

pBeeGees: A Prudent Approach to Certificate-Decoupled BFT Consensus
Kaiji Yang, Jingjing Zhang, Junyao Zheng, Qiwen Liu, Weigang Wu, Jieying Zhou
https://arxiv.org/abs/2509.17496

pBeeGees: A Prudent Approach to Certificate-Decoupled BFT Consensus
Pipelined Byzantine Fault Tolerant (BFT) consensus is fundamental to permissioned blockchains. However, many existing protocols are limited by the requirement for view-consecutive quorum certificates (QCs). This constraint impairs performance and creates liveness vulnerabilities under adverse network conditions. Achieving "certificate decoupling"-committing blocks without this requirement-is therefore a key research goal. While the recent BeeGees algorithm achieves this, our work reveals that i…

🍽️ Can you really be addicted to food? Researchers are uncovering convincing similarities to drug addiction
https://theconversation.com/can-you-really-be-addicted-to-food-researchers-are-uncovering-con…

Can you really be addicted to food? Researchers are uncovering convincing similarities to drug addiction
A consensus is emerging among scientists that certain foods are addictive for some people. But questions remain about which foods, which people and why.

Hornet Node and the Hornet DSL: A Minimal, Executable Specification for Bitcoin Consensus
Toby Sharp
https://arxiv.org/abs/2509.15754 https://arxiv.org/pdf…

Hornet Node and the Hornet DSL: A Minimal, Executable Specification for Bitcoin Consensus
Bitcoin's consensus rules are encoded in the implementation of its reference client: "The code is the spec." Yet this code is unsuitable for formal verification due to side effects, mutable state, concurrency, and legacy design. A standalone formal specification would enable verification both across versions of the reference client and against new client implementations, strengthening decentralization by reducing the risk of consensus-splitting bugs. Yet such a specification has long been consi…

Delay-Tolerant Augmented-Consensus-based Distributed Directed Optimization
Mohammadreza Doostmohammadian, Narahari Kasagatta Ramesh, Alireza Aghasi
https://arxiv.org/abs/2510.02889

Delay-Tolerant Augmented-Consensus-based Distributed Directed Optimization
Distributed optimization finds applications in large-scale machine learning, data processing and classification over multi-agent networks. In real-world scenarios, the communication network of agents may encounter latency that may affect the convergence of the optimization protocol. This paper addresses the case where the information exchange among the agents (computing nodes) over data-transmission channels (links) might be subject to communication time-delays, which is not well addressed in t…

Internalizing Self-Consistency in Language Models: Multi-Agent Consensus Alignment
Ankur Samanta, Akshayaa Magesh, Youliang Yu, Runzhe Wu, Ayush Jain, Daniel Jiang, Boris Vidolov, Paul Sajda, Yonathan Efroni, Kaveh Hassani
https://arxiv.org/abs/2509.15172

Internalizing Self-Consistency in Language Models: Multi-Agent Consensus Alignment
Language Models (LMs) are inconsistent reasoners, often generating contradictory responses to identical prompts. While inference-time methods can mitigate these inconsistencies, they fail to address the core problem: LMs struggle to reliably select reasoning pathways leading to consistent outcomes under exploratory sampling. To address this, we formalize self-consistency as an intrinsic property of well-aligned reasoning models and introduce Multi-Agent Consensus Alignment (MACA), a reinforceme…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 80270 edges.
Tags: Biolo…

Diversity mitigates polarization and consensus in opinion dynamics
Sidharth Pradhan, Sangeeta Rani Ujjwal
https://arxiv.org/abs/2509.19860 https://arxiv.or…

Diversity mitigates polarization and consensus in opinion dynamics
We study the opinion dynamics in a population by considering a variant of Kuramoto model where the phase of an oscillator represents the opinion of an individual on a single topic. Two extreme phases separated by $π$ represent opposing views. Any other phase is considered as an intermediate opinion between the two extremes. The interaction (or attitude) between two individuals depends on the difference between their opinions and can be positive (attractive) or negative (repulsive) based on the…

I’m an industry dev turned comp sci prof. I’ve been writing code for 40-some years; my first commercial software was for the Apple ][ . I’ve worked on web, mobile, desktop, server, and data plumbing projects for companies ranging from startups to Fortune 100 to arts nonprofits. In short, I’ve been lucky to know a lot of people in a lot of corners of tech.
@…’s opening paragraphs are spot on. If consensus is not 100%, well, it’s 99%.
https://www.anildash.com//2025/10/17/the-majority-ai-view/

Universally Composable Termination Analysis of Tendermint
Zhixin Dong, Xian Xu, Yuhang Zeng, Mingchao Wan, Chunmiao Li
https://arxiv.org/abs/2510.01097 https://

Universally Composable Termination Analysis of Tendermint
Modern blockchain systems operating in adversarial environments require robust consensus protocols that guarantee both safety and termination under network delay attacks. Tendermint, a widely adopted consensus protocol in consortium blockchains, achieves high throughput and finality. However, previous analysis of the safety and termination has been done in a standalone fashion, with no consideration of the composition with other protocols interacting with it in a concurrent manner. Moreover, th…

Sharp bettors fade side in Raiders-Browns game in Sanders’ 1st start https://www.reviewjournal.com/sports/betting/sharp-bettors-fade-side-in-raiders-browns-game-in-sanders-1st-start-3585017/

Consensus, polarization, and optimization of the mean value in a nonlinear model of opinion dynamics
David N. Reynolds, Pedro J. Torres
https://arxiv.org/abs/2509.14918 https://…

Consensus, polarization, and optimization of the mean value in a nonlinear model of opinion dynamics
This paper investigates some aspects of a recently proposed nonlinear mathematical model of opinion dynamics. The main objective is to identify the network structures that maximize the average equilibrium opinion (HMO). We prove that consensus is not generally attainable for populations with heterogeneous convictions, and that the highest mean does not necessarily correspond to consensus. Our analysis includes a necessary and sufficient condition for achieving the HMO, description of an algorit…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 80270 edges.
Tags: Biolo…

An early termination strategy for the distributed biased min-consensus protocol under disturbances
Zicheng Huang, Wangzhi Zhou, Yuanqiu Mo
https://arxiv.org/abs/2509.19832 https…

An early termination strategy for the distributed biased min-consensus protocol under disturbances
The distributed biased min-consensus (DBMC) protocol is an iterative scheme that solves the shortest path problem asymptotically, requiring only local information exchange between neighboring nodes. By appropriately designing the gain function, prior work [1] proposed a DBMC-based system that ensures convergence within a pre-specified time interval. However, this guarantee assumes the absence of disturbances. In this paper, we study the DBMC-based system under disturbances affecting the edge we…

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[2/7]:
- Internalizing Self-Consistency in Language Models: Multi-Agent Consensus Alignment
Samanta, Magesh, Yu, Wu, Jain, Jiang, Vidolov, Sajda, Efroni, Hassani

A Brief Note on Cryptographic Pseudonyms for Anonymous Credentials
Ren\'e Mayrhofer, Anja Lehmann, abhi shelat
https://arxiv.org/abs/2510.05419 https://

A Brief Note on Cryptographic Pseudonyms for Anonymous Credentials
This paper describes pseudonyms for the upcoming European Identity Wallet (EUDIW) architecture from both a cryptographic and an implementation perspective. Its main goal is to provide technical insights into the achievable properties and cryptographic realizations. In particular, we (1) outline the security and privacy requirements of EUDI pseudonyms as the basis for building consensus on the cross-country decision maker level; (2) sketch an abstract cryptographic protocol that fulfills these r…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 96857 edges.
Tags: Biolo…

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[2/7]:
- Internalizing Self-Consistency in Language Models: Multi-Agent Consensus Alignment
Samanta, Magesh, Yu, Wu, Jain, Jiang, Vidolov, Sajda, Efroni, Hassani

Consensus-Based Optimization Beyond Finite-Time Analysis
Pascal Bianchi (IP Paris, S2A), Alexandru-Radu Dragomir (IP Paris, S2A), Victor Priser (IP Paris, S2A)
https://arxiv.org/abs/2509.12907

Consensus-Based Optimization Beyond Finite-Time Analysis
We analyze a zeroth-order particle algorithm for the global optimization of a non-convex function, focusing on a variant of Consensus-Based Optimization (CBO) with small but fixed noise intensity. Unlike most previous studies restricted to finite horizons, we investigate its long-time behavior with fixed parameters. In the mean-field limit, a quantitative Laplace principle shows exponential convergence to a neighborhood of the minimizer x * . For finitely many particles, a block-wise analysis y…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 93708 edges.
Tags: Biolo…

Bribers, Bribers on The Chain, Is Resisting All in Vain? Trustless Consensus Manipulation Through Bribing Contracts
Bence So\'oki-T\'oth, Istv\'an Andr\'as Seres, Kamilla Kara, \'Abel Nagy, Bal\'azs Pej\'o, Gergely Bicz\'ok
https://arxiv.org/abs/2509.17185

Bribers, Bribers on The Chain, Is Resisting All in Vain? Trustless Consensus Manipulation Through Bribing Contracts
The long-term success of cryptocurrencies largely depends on the incentive compatibility provided to the validators. Bribery attacks, facilitated trustlessly via smart contracts, threaten this foundation. This work introduces, implements, and evaluates three novel and efficient bribery contracts targeting Ethereum validators. The first bribery contract enables a briber to fork the blockchain by buying votes on their proposed blocks. The second contract incentivizes validators to voluntarily exi…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 121755 edges.
Tags: Biol…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 93708 edges.
Tags: Biolo…

Polynomial Optimization via Random Projection and Consensus
Etienne Buehrle, Christoph Stiller
https://arxiv.org/abs/2509.12859 https://arxiv.org/pdf/2509.…

Polynomial Optimization via Random Projection and Consensus
We propose a black-box approach to reducing large semidefinite programs to a set of smaller semidefinite programs by projecting to random linear subspaces. We evaluate our method on a set of polynomial optimization problems, demonstrating improved scalability.

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 80270 edges.
Tags: Biolo…