OpenAI says GPT-5.2 Thinking hallucinates less than GPT-5.1 and has improved reliability for agentic AI needs; pre-release testers include Notion, Box, Shopify (Hayden Field/The Verge)
https://www.theverge.com/ai-artificial-intelligence/842529/open…
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
heise | Wissen clever organisieren: Notion, Obsidian und Anytype im Vergleich
Notion, Obsidian und Anytype ordnen das digitale Chaos und verwalten persönliches Wissen. Welche App sich für wen am besten eignet, erklärt unser Ratgeber.
@… one for the feature-requests: I'd love to see a 'jump to' hotkey with fuzzy-search, ala ⌘P in VScode / Notion, ⌘K in Discord / Beeper / Spotify / Slack,
Pictured: (annoyingly) ⌘F in my beloved @…; one of the slicker/simp…
Study: ~200 Instacart shoppers in four US cities were shown different prices for the same 20 grocery items; Instacart confirms it is running short term "tests" (Ben Casselman/New York Times)
https://www.nytimes.com/2025/12/09/business/instacart-algori…
“Meeting detected!! Let’s start transcribing AI Meeting Notes!!“
No thanks, Notion, I’m just listing to Aesop Rock via my audio interface … 😂 (Fantastic album btw! 👉 https://aesoprock.com/collections/i-heard-its-a-mess-there-too)
[Quits Notion ¯\_(ツ)_/¯]
Robust equilibria in continuous games: From strategic to dynamic robustness
Kyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos, Jose Blanchet
https://arxiv.org/abs/2512.08138 https://arxiv.org/pdf/2512.08138 https://arxiv.org/html/2512.08138
arXiv:2512.08138v1 Announce Type: new
Abstract: In this paper, we examine the robustness of Nash equilibria in continuous games, under both strategic and dynamic uncertainty. Starting with the former, we introduce the notion of a robust equilibrium as those equilibria that remain invariant to small -- but otherwise arbitrary -- perturbations to the game's payoff structure, and we provide a crisp geometric characterization thereof. Subsequently, we turn to the question of dynamic robustness, and we examine which equilibria may arise as stable limit points of the dynamics of "follow the regularized leader" (FTRL) in the presence of randomness and uncertainty. Despite their very distinct origins, we establish a structural correspondence between these two notions of robustness: strategic robustness implies dynamic robustness, and, conversely, the requirement of strategic robustness cannot be relaxed if dynamic robustness is to be maintained. Finally, we examine the rate of convergence to robust equilibria as a function of the underlying regularizer, and we show that entropically regularized learning converges at a geometric rate in games with affinely constrained action spaces.
toXiv_bot_toot
When you don't know the gender of a person because he/she/they doesn't talk about it, what is the best/preferred approach in English?
1) Gender the person based on their appearance, based on the heuristic that most people are cisgender
I don't like this heuristic because it gives strength to stereotypes and the notion of "normality"
2) Use a neutral pronoun like the singular they
It feels more natural, but maybe some people will consider this som…
As somebody who’s taking a break from his working on his absurdly custom bespoke static site generator for a course, I approve the (hand waving) grand general notion here.
1/2 https://hcommons.social/@zeblarson/115500289981846435
LLMs are a fundamentally useless technology because their applications (supposedly) boil down to humans not having to think for themselves or do their own writing / drawing / filming.
But if you can do it on your own - why would you need a robot to do it? It’s, at best, a novelty.
That’s why this shit only resonates with executives and capital owners. “Get things done with fewer people and expenses” is at least an actual pitch. “Get things done faster for yourself” isn’t.
The individual angle really works for things you already were trying to avoid doing because you’re either disinterested or don’t have enough time to do things right.
“Avoid your work” as a value proposition doesn’t work when you’re dealing with intellectual labor rather than commodities. Not large scale, not long term.
Sorry for the rant, I saw some Notion ads on the subway and got irritated 😅
#AI #llm #LLMs
KI-Update kompakt: KI-Brillen von Meta, LinkedIn, Notion 3.0, DSA-Beschwerde
Das "KI-Update" liefert drei mal pro Woche eine Zusammenfassung der wichtigsten KI-Entwicklungen.
https://www.
Needed to build something quite weird that involves NFC tags and mainly Notion DB as storage and UI
Didn’t feel like learning Notion cos I am not a fan.
Worked with ChatGPT to make a spec and prompt this was useful while doing that totally changed my mind to something better
Gave it to codex and it one-shot built it perfectly in 20 minutes without interaction, worked first time once I fixed a mistake I made in Notion.
Lots of issues with AI but it’s certainly moving…
📢 Looking forward to my return visit to Norwich and the @…, this time to give the Dame Janet Thornton lecture on Thursday 13th.
Register link (with reception afterwards 🍰, do come and say hello!):
➡️ #circadian clocks in #plantsci 🌿 and a bit on #OpenData infrastructure 💽, I'm re-using the notion of Arrival from Katherine Trebeck and Jeremy Williams' book, the #Economics of Arrival. Might this help us researchers to bridge the Knowledge-Action Gap (see below) ?
Notion launches customizable agents that can create documents and perform other actions in the background, and says it has reached $500M in annualized revenue (Jordan Novet/CNBC)
https://www.cnbc.com/2025/09/18/notion-launches-ai-agen…
things that will not convince me to go to bed:
- lateness of the hour
- eepy
- have work tomorrow
- bed is soft and warm
things that will convince me to go to bed:
- cloudflare outage
Trump’s brazen approach,
publicly flaunting his corruption,
awards him perverse credit for authenticity
and takes the sting out of scandals that used to be career-ending when uncovered by muckraking journalists.
“This is a dangerous notion that,
just because a president chooses to be corrupt in public openly,
it’s OK,” said Larry Sabato,
director of the Center for Politics at the University of Virginia.
“People say, well, if it were really corru…
Characteristic polynomials of tensors via Grassmann integrals and distributions of roots for random Gaussian tensors
Nicolas Delporte, Giacomo La Scala, Naoki Sasakura, Reiko Toriumi
https://arxiv.org/abs/2510.04068
@… with all due respect, the notion of "five minutes" to learn vi is detached from reality.
You have no idea what it's like. No idea how frustrating.
Imagine someone being severely allergic to nuts.
cc @…
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers
Peter Shaw, James Cohan, Jacob Eisenstein, Kristina Toutanova
https://arxiv.org/abs/2509.22445
A TSO-DSO Coordination Framework via Analytical Representation and Monetization of PQV-Based Distribution System Flexibility
Burak Dindar, Can Berk Saner, H\"useyin Kemal \c{C}akmak, Veit Hagenmeyer
https://arxiv.org/abs/2510.01854
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
Replaced article(s) found for math.GR. https://arxiv.org/list/math.GR/new
[1/1]:
- A notion of quasiconvex subgroups in acylindrically hyperbolic groups
Ping Wan
Why did Republicans close ranks around Donald Trump in 2016,
when they could have salvaged their old party and rebuilt after losing?
From the vantage point of today, it’s easy to dismiss the notion. “That’s just what parties do, of course, particularly Republicans in their era of hyperpartisanship.”
But the people who might say that have forgotten how unsettled Republicans were a decade ago.
The idea that they might be forced to withdraw support from Trump and accep…
Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
David Pennock, Daniel Schoepflin, Kangning Wang
https://arxiv.org/abs/2512.05235 https://arxiv.org/pdf/2512.05235 https://arxiv.org/html/2512.05235
arXiv:2512.05235v1 Announce Type: new
Abstract: We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among $n$ teams in a league. Such a mechanism should satisfy the natural properties of monotonicity and Condorcet consistency. Moreover, from the league's perspective, the winner-determination tournament rule should be strategyproof, meaning that no team can do better by losing a game on purpose.
Past work considered settings in which each team is fully selfish, caring only about its own probability of winning, and settings in which each team is fully selfless, caring only about the total winning probability of itself and the team to which it deliberately loses. More recently, researchers considered a mixture of these two settings with a parameter $\lambda$. Intermediate selfishness $\lambda$ means that a team will not lose on purpose unless its pair gains at least $\lambda s$ winning probability, where $s$ is the individual team's sacrifice from its own winning probability. All of the dozens of previously known tournament rules require $\lambda = \Omega(n)$ to be strategyproof, and it has been an open problem to find such a rule with the smallest $\lambda$.
In this work, we make significant progress by designing a tournament rule that is strategyproof with $\lambda = 11$. Along the way, we propose a new notion of multiplicative pairwise non-manipulability that ensures that two teams cannot manipulate the outcome of a game to increase the sum of their winning probabilities by more than a multiplicative factor $\delta$ and provide a rule which is multiplicatively pairwise non-manipulable for $\delta = 3.5$.
toXiv_bot_toot
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
An Ohba-like Result for Flexible List Coloring
Michael C. Bowdoin, Yanghong Chi, Christian B. Ellington, Bella Ives, Seoju Lee, Fennec Morrissette, Jeffrey A. Mudrock
https://arxiv.org/abs/2509.24013