When a terrible idea comes from on high, there’s always pushback from the folks on the ground who actually understand how things work: the engineers at the computers, the teachers in the classrooms, the facilities crews, the kitchen staff, whatever. The folks who live their lives zoomed in on a specific thing may be missing the big picture, but they’re the ones who first see when a managerial notion will have execution problems.
3/
@… hey there; just sent you an e-mail about Notion.cafe, when you've got a sec. Unsure if it fell through the cracks or something!
Currently reading the collection «Practicing Embodied Thinking in Research and Learning» edited by Donata Schoeller, Sigridur Thorgeirsdottir, and Greg Walkerden and it is really very good! Not only does the concept of «embodied critical thinking» resonate with everything I’ve been working towards in my own research, but it also offers a really simple and common-sense antidote to AI in higher education, based on the notion of bringing our own embodied experiences and felt sense to critical t…
"...who campaigned on a promise to extricate the US from decades of “endless wars” during his 2024 run for president."
It'simportant to note these are airstrikes and bombings - and that's very different from wars. It avoids the distressful images of wounded and dead service members returning to the US, while using very expensive technology, thus providing purchase orders to very important business interests, and it provides the psycological benefit of violence to imp…
"...who campaigned on a promise to extricate the US from decades of “endless wars” during his 2024 run for president."
It'simportant to note these are airstrikes and bombings - and that's very different from wars. It avoids the distressful images of wounded and dead service members returning to the US, while using very expensive technology, thus providing purchase orders to very important business interests, and it provides the psycological benefit of violence to imp…
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…
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.
A generalization of the notion of helix
Pascual Lucas, Jos\'e Antonio Ortega-Yag\"ues
https://arxiv.org/abs/2601.18020 https://arxiv.org/pdf/2601.…
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
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…
Le «plus grand danger pour la sécurité de notre siècle» est le réchauffement climatique, affirme Annalena Baerbock. Avec l’ensevelissement du village de Blatten (VS) suite Š l’effondrement d’un glacier Š la fin mai, «le changement climatique n’est plus seulement une notion abstraite, mais est devenu très concret», estime-t-elle. «Si nous ne maîtrisons pas la crise climatique, nous verrons malheureusement partout des catastrophes comme celle de Blatten».
https://www.letemps.ch/suisse/geneve/pour-annalena-baerbock-la-geneve-internationale-n-est-pas-en-danger
John Brooks always looks like he’s in over his head. His decisions don’t dispel that notion either.
#LFC
“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 ¯\_(ツ)_/¯]
There's a word at the beginning and end of Dawn of Everything that feels self-referential right now: Kairos.
> We began this book with a quote which refers to the Greek notion of kairos as one of those occasional moments in a society’s history when its frames of reference undergo a shift – a metamorphosis of the fundamental principles and symbols, when the lines between myth and history, science and magic become blurred – and, therefore, real change is possible. Philosophers sometimes like to speak of ‘the Event’ – a political revolution, a scientific discovery, an artistic masterpiece – that is, a breakthrough which reveals aspects of reality that had previously been unimaginable but, once seen, can never be unseen. If so, kairos is the kind of time in which Events are prone to happen.
> Societies around the world appear to be cascading towards such a point. This is particularly true of those which, since the First World War, have been in the habit of calling themselves ‘Western’. On the one hand, fundamental breakthroughs in the physical sciences, or even artistic expression, no longer seem to occur with anything like the regularity people came to expect in the late nineteenth and early twentieth centuries. Yet at the same time, our scientific means of understanding the past, not just our species’ past but that of our planet, has been advancing with dizzying speed. Scientists in 2020 are not (as readers of mid-twentieth-century science fiction might have hoped) encountering alien civilizations in distant star systems; but they are encountering radically different forms of society under their own feet, some forgotten and newly rediscovered, others more familiar, but now understood in entirely new ways.
Reading this as I write something very inspired by this work feels especially serendipitous, especially at this time. When they wrote the book, I think that kairos felt more serendipitous itself. But as the frequency of opportunity increases, the veil between realities feels more malleable... that perhaps we can poke a finger through and open a portal to a completely different future than the one we've felt locked into for such a long time.
https://anarchoccultism.org/building-zion/the-coordinated-swarm-lyhr
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
If you're in #tech and struggling to figure out what your career look like now — this piece is my answer. You've heard "it's here to stay" or "it's better than nothing."
Reject these frames.
Look at the system being built around you. Manufacturing validation for "inevitable" success. Rewriting our roles from human-centered creative to featu…
Sources: Notion told staff it is doing a $300M tender offer at an $11B valuation, ahead of a potential IPO; it passed $600M in ARR, half of it from AI products (Anna Tong/Forbes)
http://www.forbes.com/sites/annatong/2025
This image is from an official blog post by the AFfiNE team (a "source available" alternative to Notion, trying to pass as "open source").
The article was posted on December 18th, 2024. No one has tried to fix it since then.
AI slop & noise all the way down, carelessness as the new dominant creed.
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
"Le cas du député Emmanuel Pellerin révèle les contradictions entre le discours politique intransigeant Š l’égard de la consommation de drogues et la réalité de la réponse judiciaire quand un élu est mis cause pour de tels faits" résume le tribunal dans son jugement, en indiquant que ces révélations portent pleinement sur un « sujet d’intérêt général ».
C'est compliqué, apparemment, pour un avocat-député de comprendre cette notion d'intérêt général.
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
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
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
Time-periodic branched transport
Jun Kitagawa, Cecilia Mikat
https://arxiv.org/abs/2511.10498 https://arxiv.org/pdf/2511.10498 https://arxiv.org/html/2511.10498
arXiv:2511.10498v1 Announce Type: new
Abstract: We develop a new framework for branched transport between probability measures which are allowed to vary in time. This framework can be used to model problems where the underlying transportation network displays a branched structure, but the source and target mass distributions can change cyclically over time, such as road networks or circulatory systems. We introduce the notion of time-dependent transport paths along with associated energies and distances, and prove existence of transport paths whose energy achieves the distance. We also show the time-dependent transport yields a metric structure on subsets of appropriately defined measure-valued Sobolev spaces.
toXiv_bot_toot
@… 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…
This morning, President Trump unilaterally launched a regime-change war against Nicolšs Maduro of Venezuela,
ordering strikes on multiple military targets in the country and seizing its leader and his wife.
They were “captured and flown out of the country,” Trump stated on Truth Social.
“They will soon face the full wrath of American justice on American soil in American courts,” Attorney General Pam Bondi stated,
in something like an inversion of the notion that jus…
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…
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
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
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…
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
Residual Symmetry Reductions and Painlev\'e Solitons
Yan Li, Ya-Rong Xia, Ruo-Xia Yao, S. Y. Lou
https://arxiv.org/abs/2511.09077 https://arxiv.org/pdf/2511.09077 https://arxiv.org/html/2511.09077
arXiv:2511.09077v1 Announce Type: new
Abstract: This letter introduces the novel concept of Painlev\'e solitons -- waves arising from the interaction between Painlev\'e waves and solitons in integrable systems. Painlev\'e solitons may also be viewed as solitons propagating against a Painlev\'e wave background, in analogy with the established notion of elliptic solitons, which refer to solitons on an elliptic wave background. By employing a novel symmetry decomposition method aided by nonlocal residual symmetries, we explicitly construct (extended) Painlev\'e II solitons for the Korteweg-de Vries (KdV) equation and (extended) Painlev\'e IV solitons for the Boussinesq equation.
toXiv_bot_toot
Verification of Sequential Convex Programming for Parametric Non-convex Optimization
Rajiv Sambharya, Nikolai Matni, George Pappas
https://arxiv.org/abs/2511.10622 https://arxiv.org/pdf/2511.10622 https://arxiv.org/html/2511.10622
arXiv:2511.10622v1 Announce Type: new
Abstract: We introduce a verification framework to exactly verify the worst-case performance of sequential convex programming (SCP) algorithms for parametric non-convex optimization. The verification problem is formulated as an optimization problem that maximizes a performance metric (e.g., the suboptimality after a given number of iterations) over parameters constrained to be in a parameter set and iterate sequences consistent with the SCP update rules. Our framework is general, extending the notion of SCP to include both conventional variants such as trust-region, convex-concave, and prox-linear methods, and algorithms that combine convex subproblems with rounding steps, as in relaxing and rounding schemes. Unlike existing analyses that may only provide local guarantees under limited conditions, our framework delivers global worst-case guarantees--quantifying how well an SCP algorithm performs across all problem instances in the specified family. Applications in control, signal processing, and operations research demonstrate that our framework provides, for the first time, global worst-case guarantees for SCP algorithms in the parametric setting.
toXiv_bot_toot
📢 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) ?
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
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