Tootfinder

of interest to a few certain strains of music heads: huge stash of NME back issues now dropping on @…, 300 issues, 1969-1983 (so far).

This makes me so twitchy. This patient status page, served over HTTP and not HTTPS, has the credentials as query parameters. Such shocking op sec in a healthcare environment, both as a deployed solution and a commercial product.
We know the username, have a head start on the password (with a good idea of the encoding), and the presence of a “user privileges” tab [not pictured] suggests the account has more permissions than necessary.
Dear god. 🤦

This rock wrote some seriously based shit you should definitely read!
🔗 #Anarchism

General query: are you anticipating the return of 1974 gas lines and perhaps even/odd gasoline filling days?
(I am.)
By-the-way, when that was happening I would go fill my car at midnight - a time when it was ambiguous whether the day was an even one or an odd one.

from my link log —
JSONata: a JSON query and transformation language.
https://jsonata.org/
saved 2026-02-09 https://dotat.at/:/CEJOA.html

tuning(7) begins:
"The swap partition should typically be approximately 2x the size of main memory for systems with less than 4GB of RAM, or approximately equal to the size of main memory if you have more. "
I can't believe that 64 GB swap should be a norm for a system with 64 GB RAM.
<

"Hey, let's get some Chinese characters tattooed on our body without knowing any Chinese language!"
https://www.youtube.com/@ChinesewithJessie/search?query=Tattoo

Chinese with Jessie
Hi guys, it's Jessie here! I was born and raised in rural China, learn and laugh with me on this channel! For business inquiries: jessica87968@gmail.com

Diese zweiteilige Doku enthält einige Knaller:
Putins Netzwerk in Europa
Das konkrete Truppenangebot in Divisionsstärke für den bewaffneten Kampf von Separatisten in Europa war mir neu.
https://mediathekviewweb.de/#query=Putins Netzwerk in Europa

#ReleaseThursday 🎉 Just pushed a new version of the https://thi.ng/column-store database and query engine which adds support for new column types (fixed-size n-dimensional int/uint/float vectors) and RLE (run-…

In-memory column store database with indexing (WIP)

@… Have you seen this story? https://www.phoronix.com/news/ATI-R300-Occlusion-Query-Fix Developer in Czechia working on fixing up R300…

Old ATI R300 Open-Source Driver Sees Another New Fix In 2026
The Radeon R300 series turns 24 years old this year and thanks to the open-source ATI R300 Gallium3D driver that began via reverse engineering, it's still continuing to see the occasional random fixes from the open-source community.

Trend in the volume of new questions on StackOverflow https://data.stackexchange.com/stackoverflow/query/1926661

ProphetKV: User-Query-Driven Selective Recomputation for Efficient KV Cache Reuse in Retrieval-Augmented Generation
Shihao Wang, Jiahao Chen, Yanqi Pan, Hao Huang, Yichen Hao, Xiangyu Zou, Wen Xia, Wentao Zhang, Haitao Wang, Junhong Li, Chongyang Qiu, Pengfei Wang
https://arxiv.org/abs/2602.02579 https://arxiv.org/pdf/2602.02579 https://arxiv.org/html/2602.02579
arXiv:2602.02579v1 Announce Type: new
Abstract: The prefill stage of long-context Retrieval-Augmented Generation (RAG) is severely bottlenecked by computational overhead. To mitigate this, recent methods assemble pre-calculated KV caches of retrieved RAG documents (by a user query) and reprocess selected tokens to recover cross-attention between these pre-calculated KV caches. However, we identify a fundamental "crowding-out effect" in current token selection criteria: globally salient but user-query-irrelevant tokens saturate the limited recomputation budget, displacing the tokens truly essential for answering the user query and degrading inference accuracy.
We propose ProphetKV, a user-query-driven KV Cache reuse method for RAG scenarios. ProphetKV dynamically prioritizes tokens based on their semantic relevance to the user query and employs a dual-stage recomputation pipeline to fuse layer-wise attention metrics into a high-utility set. By ensuring the recomputation budget is dedicated to bridging the informational gap between retrieved context and the user query, ProphetKV achieves high-fidelity attention recovery with minimal overhead. Our extensive evaluation results show that ProphetKV retains 96%-101% of full-prefill accuracy with only a 20% recomputation ratio, while achieving accuracy improvements of 8.8%-24.9% on RULER and 18.6%-50.9% on LongBench over the state-of-the-art approaches (e.g., CacheBlend, EPIC, and KVShare).
toXiv_bot_toot

SQL is the lingua franca. Hiring, maintenance, and reviews get easier when the query is the spec.
Over time, all NoSQL framework include SQL interfaces.
https://medium.com/@Modexa/the-sql-comeback-fabb86f6bfce

Did you miss one of the Web414 meetings in 2007? Looks like we recorded them!
#mke

I just finished reorganizing the cable drawer.
The timeline of events was something like:
- the DNS server for internal name resolution runs inside a Docker container only reachable via IPv4
- if an Android device gets both IPv4 and IPv6 DNS servers, it will only query the IPv6 one
- fuck Docker; I'll install the DNS server on a Raspberry Pi
- creating a Pi image with sshd enabled didn't work
- this household has surprisingly few HDMI cables
- oh, …

I just finished reorganizing the cable drawer.
The timeline of events was something like:
- the DNS server for internal name resolution runs inside a Docker container only reachable via IPv4
- if an Android device gets both IPv4 and IPv6 DNS servers, it will only query the IPv6 one
- fuck Docker; I'll install the DNS server on a Raspberry Pi
- creating a Pi image with sshd enabled didn't work
- this household has surprisingly few HDMI cables
- oh, …

Yesterday, after a mild query by some parents, my daughter’s primary school sent out a notice to say they were going to stop using their X account for comms.
It’s as simple as that. There are plenty of alternatives.
But even if there weren’t you can’t contribute to that.
And it can be as simple as
asking to prompt a change.

anyquery works :-) on any CSV file on the internet, nice complement to datasette me thinks :-) e.g. to query thunderbird desktop february 2026 questions:
`anyquery> SELECT * FROM read_csv('https://raw.githubuse…

Custom self-leveling, poured polyurethane art floors. Cool video.
I found others, e.g., on youtube:
"epoxy flooring 3d"
https://www.youtube.com/results?search_query=epoxy flooring 3d

Tonight I made a daiquiri.
And then I realized, the way it’s spelled looks a lot like a portmanteau of daj (Polish: Give) and query.
So maybe every time someone gives you a SQL query, that’s actually a daiquiri.

Reading an article about how to optimize EF Queries. Honestly, step #0 should be to actually measure your query performance so that you have a baseline.
I've made the sin of just applying techniques without first measuring, and you can just end up making things worse, like waaaaaaaaay worse.
Folks, seriously, add some telemetry as the first step, then tackle each query one at a time.

Do you have a long running calculation freezing up your shiny app? {callr} or {crew} might help: https://discindo.org/post/asynchronous-execution-in-shiny/

Hey @… can I request attention towards:
https://bugs.kde.org/show_bug.cgi?id=515271
I like

<https://github.com/freebsd/freebsd-src/blob/main/CONTRIBUTING.md#style> mentions the one-sentence-per-line rule for manual pages, however:
a) there's no such rule in mdoc(7) <

🔧 Cost-based query optimizer with full EXPLAIN / EXPLAIN ANALYZE support and table statistics via ANALYZE
📦 100 built-in functions across string, math, date/time, JSON and aggregate categories – batteries fully included
🛠️ Simple integration via Cargo with a single dependency: stoolap = "0.1" – plus a CLI tool for REPL or direct query execution

Wait Sama started talking Trump now, or was it always the case?
> Water is totally fake. It used to be true, we used to do evaporative cooling in data centres, but now that we don’t do that, you see these things on the internet where, don’t use ChatGPT, it’s 17 gallons of water for each query or whatever, this is completely untrue. Totally insane. No connection to reality.

How much water do the data centres use? It’s a secret
The AI companies insist: we barely use water, hardly a drop! But we won’t tell you how much water we use. And we’ll take you to court to stop you from finding out. Google wants to build a new data …

In #Clojure, if you query a set for a member, and that member is present, that member is returned:
user=> (#{:a :b :c} :a)
:a
The traditional #Lisp function ASSOC has the signature
(ASSOC store key) => value
where store is assumed to be a list of (key . value) dotted pai…

Epstein Files Transparency Act:
"The Attorney General shall ... make publicly available in a searchable and downloadable format."
NYT:
The DOJ "website also contains a search function, though it is unclear if it’s working properly.
A query for 'Epstein' returned no results."
-- Ryan Goodman

Ryan Goodman (@rgoodlaw.bsky.social)
Epstein Files Transparency Act: "The Attorney General shall ... make publicly available in a searchable and downloadable format." NYT: The DOJ "website also contains a search function, though it is unclear if it’s working properly. A query for 'Epstein' returned no results."

#AISlop #shitpost #shitposting

die @… lässt sich aus aus OpenRefine heraus ansteuern. Bsp.: Ich habe eine GND-ID einer Person und will wissen, ob die DDB zu der Person Material hat: Edit column > Add column by fetching URLs > dann als GREL "

the rise and fall of stackoverflow
the graph of posts per month is quite something
the decline over the last four years is almost a mirror of the rise 2008-2012
and they are now down to near zero
https://data.stackexchange.com/stackoverflow/query/1926661#gr…

TIL that "compositing" has slowed down my #xfce since forever. I don't see any change after disabling it, just that everything is a lot faster 😅
xfconf-query -c xfwm4 -p /general/use_compositing -s false

We asked 6 Druid Historical Calculation servers if they could calculate 5 years of data at once for a very complicated multi-stage query. Their answer will surprise you!

There's a media query for JS enabled/disabled: https://developer.mozilla.org/en-US/docs/Web/CSS/Reference/At-rules/@media/scripting

scripting - CSS | MDN
The scripting CSS media feature can be used to test whether scripting (such as JavaScript) is available.

Semi-regular query to see if anyone else remembers CBC Vancouver's "The Dog and Trombone", written by Jurgen Gothe and Bill Phillips; and, more to the point, if they've got recordings of it, especially episode 5 featuring Hap Hafner's cousin Hugo?
#CBCRadio #JurgenGothe

The rapid decline of #StackOverflow et al in the age of #AI slop https://data.stackexchange.com/stackov

Is it just me or is the #Wikidata Query Service quite flaky as of late? When using the public API, I sporadically get HTTP 504 (upstream timeout) errors.

Elizabeth Christensen, Devrim Gunduz, Ryan Booz will speak on 'Postgres Query Tuning - Hour 6 of Postgres Training Day' as part of our PostgreSQL@SCaLE track at SCaLE 23x. Full details: https://www.socallinuxexpo.org/scale/23x

Source: OpenAI targets ~$60 per 1,000 views for ChatGPT ads, on par with live NFL broadcasts and above Meta's sub-$20 CPM, while offering little conversion data (The Information)
https://www.theinformation.com/articles/openai-seeks-premium-prices-early-…

OpenAI Seeks Premium Prices in Early Ads Push
In its initial rollout of ads, OpenAI is charging prices that rival those for coveted video programs like the NFL, and well above what rivals such as Meta Platforms’ social media apps charge. But unlike Meta or Google, OpenAI won’t be providing detailed information about the query responses ...

@… I also think that as a stop gap it would help if both proects offered some official API to query what the latest version is and perhaps offered RSS/ATOM feeds of updates so that knowledgeable users could subscribe to that and be notified right away, direct from the source.

today's rabbithole: scroll shadows with just css.
- background-attachment - well-established hack, works ok, but tricky to do in some layouts (eg sticky footer)
- container query scroll-state stuck - chrome only for now and kinda buggy
- scroll animation - works ok in chrome and safari. not yet firefox without flag. awkward if you want a smooth fade at a particular closeness.
leaning toward scroll animation, because it feels like the most natural way to express it

RE: https://hachyderm.io/@thomasfuchs/115945071431971557
Also, yes you can connect to WiFi in Mac OS 9.2 with AirPort in a 27 year old iBook from 1999 and yes, iTunes can still query Gracenote for CD track titles.

ah yes, Japan comes from Japan

Welfarist Formulations for Diverse Similarity Search
Siddharth Barman, Nirjhar Das, Shivam Gupta, Kirankumar Shiragur
https://arxiv.org/abs/2602.08742 https://arxiv.org/pdf/2602.08742 https://arxiv.org/html/2602.08742
arXiv:2602.08742v1 Announce Type: new
Abstract: Nearest Neighbor Search (NNS) is a fundamental problem in data structures with wide-ranging applications, such as web search, recommendation systems, and, more recently, retrieval-augmented generations (RAG). In such recent applications, in addition to the relevance (similarity) of the returned neighbors, diversity among the neighbors is a central requirement. In this paper, we develop principled welfare-based formulations in NNS for realizing diversity across attributes. Our formulations are based on welfare functions -- from mathematical economics -- that satisfy central diversity (fairness) and relevance (economic efficiency) axioms. With a particular focus on Nash social welfare, we note that our welfare-based formulations provide objective functions that adaptively balance relevance and diversity in a query-dependent manner. Notably, such a balance was not present in the prior constraint-based approach, which forced a fixed level of diversity and optimized for relevance. In addition, our formulation provides a parametric way to control the trade-off between relevance and diversity, providing practitioners with flexibility to tailor search results to task-specific requirements. We develop efficient nearest neighbor algorithms with provable guarantees for the welfare-based objectives. Notably, our algorithm can be applied on top of any standard ANN method (i.e., use standard ANN method as a subroutine) to efficiently find neighbors that approximately maximize our welfare-based objectives. Experimental results demonstrate that our approach is practical and substantially improves diversity while maintaining high relevance of the retrieved neighbors.
toXiv_bot_toot

from my link log —
AEQuery: Apple Events command line query tool without AppleScript.
https://markalldritt.com/?p=1368
saved 2026-02-08 https://dotat.a…

AEQuery
AEQuery I’ve released a new command-line tool called AEQuery. It queries scriptable macOS applications using XPath-like expressions, translating them directly into Apple Events. The short version: …

🔧 Configurable thresholds for scan warnings, query cost limits & small table optimization
🧩 Custom analyser support via QueryAnalyser interface for PostgreSQL or other databases
🎯 Works with #PHPUnit setUp() & #Pest beforeEach() including "paranoid mode"
📦 compos…

You know that Firefox feature where bookmarks could contain a %s in the url somewhere and then the name of the bookmark could be used as a prefix in the address bar to quickly query some website? What's that feature called? Does it exist in Safari?
#askfedi

Source: OpenAI targets ~$60 per 1,000 views for ChatGPT ads, on par with live NFL broadcasts and above Meta's sub-$20 CPM, while offering little conversion data (The Information)
https://www.theinformation.com/articles/openai-seeks-premium-prices-early-…

OpenAI Seeks Premium Prices in Early Ads Push
In its initial rollout of ads, OpenAI is charging prices that rival those for coveted video programs like the NFL, and well above what rivals such as Meta Platforms’ social media apps charge. But unlike Meta or Google, OpenAI won’t be providing detailed information about the query responses ...

Statistical Query Lower Bounds for Smoothed Agnostic Learning
Ilias Diakonikolas, Daniel M. Kane
https://arxiv.org/abs/2602.21191 https://arxiv.org/pdf/2602.21191 https://arxiv.org/html/2602.21191
arXiv:2602.21191v1 Announce Type: new
Abstract: We study the complexity of smoothed agnostic learning, recently introduced by~\cite{CKKMS24}, in which the learner competes with the best classifier in a target class under slight Gaussian perturbations of the inputs. Specifically, we focus on the prototypical task of agnostically learning halfspaces under subgaussian distributions in the smoothed model. The best known upper bound for this problem relies on $L_1$-polynomial regression and has complexity $d^{\tilde{O}(1/\sigma^2) \log(1/\epsilon)}$, where $\sigma$ is the smoothing parameter and $\epsilon$ is the excess error. Our main result is a Statistical Query (SQ) lower bound providing formal evidence that this upper bound is close to best possible. In more detail, we show that (even for Gaussian marginals) any SQ algorithm for smoothed agnostic learning of halfspaces requires complexity $d^{\Omega(1/\sigma^{2} \log(1/\epsilon))}$. This is the first non-trivial lower bound on the complexity of this task and nearly matches the known upper bound. Roughly speaking, we show that applying $L_1$-polynomial regression to a smoothed version of the function is essentially best possible. Our techniques involve finding a moment-matching hard distribution by way of linear programming duality. This dual program corresponds exactly to finding a low-degree approximating polynomial to the smoothed version of the target function (which turns out to be the same condition required for the $L_1$-polynomial regression to work). Our explicit SQ lower bound then comes from proving lower bounds on this approximation degree for the class of halfspaces.
toXiv_bot_toot

some excellent notes on the recent stash of boredoms recordings surfaced by @…. https://archive.org/search?query=subject:"boredoms%2…

reading a prelim paper on scaling up gpu-accelerated database query engines and feeling kinda gobsmacked at where that world is at
i remember when we built a “massive” memory machine at princeton with … i think it was 256 MB of RAM. (it sat idle except when ken thompson was logged in and building hash tables for chess endgames which was most of the time)

#ReleaseSunday 🎉 Quite a few https://thi.ng/column-store updates over the past month, including further performance optimizations, more tests and documentation updates...
Just also added a small section an…

Extended The vOICe web app with xres and yres query parameters for setting the capture and on-screen preview resolution (default 320 x 240), e.g. https://www.seeingwithsound.com/webvoice/webvoice.htm?preview&xres=1200&yres=800 You may hav…

@… Hey, it is me again 😅
Just to let you know that I receive some 400 Bad Request errors from some DoH servers (dns.quad9.net and ns0.fdn.fr for instance) while some others accept my queries (dns.google and Cloudflare 1.1.1.1).
I am not sure yet if the error is on my use of the library or within the library itself.
Here is the code to run the query:

@… ha, thanks … the bears page was amongst the top search results at <https://www.startpage.com/do/dsearch?query="d…

Polars is a lightning fast DataFrame library/in-memory query engine with parallel execution and cache efficiency. And now you can use is with the tidyverse syntax: #rstats

More Efficient Tidyverse Code, Using Polars in the Background
Polars is a cross-language tool for manipulating very large data. However, one drawback is that the R implementation has a syntax that will look odd to many R users who are not used to Python syntax. The objective of tidypolars is to improve the ease-of-use of Polars in R by providing tidyverse syntax to polars.

Quantum Computing for Query Containment of Conjunctive Queries
Luisa Gerlach, Tobias K\"oppl, Ren\`e Zander, Nicole Schweikardt, Stefanie Scherzinger
https://arxiv.org/abs/2602.21803

📊 EXPLAIN-based index analysis detects full table scans, missing indexes, filesort & temporary tables on #MySQL, #MariaDB & #SQLite
🔄 Duplicate query detection finds identical queries…

Somebody Told Me (The User Provider Should Use An Adaptor To Proxy The Query Factory Builder)
https://youtu.be/p03oO_7sCaY

A programmer estimates his typical day of coding with Claude Code is equivalent to running the dishwasher an extra time, much more energy than a "median query" (Simon P. Couch)
https://www.simonpcouch.com/blog/2026-01-20-cc-impact/

ZOR filters: fast and smaller than fuse filters
Antoine Limasset
https://arxiv.org/abs/2602.03525 https://arxiv.org/pdf/2602.03525 https://arxiv.org/html/2602.03525
arXiv:2602.03525v1 Announce Type: new
Abstract: Probabilistic membership filters support fast approximate membership queries with a controlled false-positive probability $\varepsilon$ and are widely used across storage, analytics, networking, and bioinformatics \cite{chang2008bigtable,dayan2018optimalbloom,broder2004network,harris2020improved,marchet2023scalable,chikhi2025logan,hernandez2025reindeer2}. In the static setting, state-of-the-art designs such as XOR and fuse filters achieve low overhead and very fast queries, but their peeling-based construction succeeds only with high probability, which complicates deterministic builds \cite{graf2020xor,graf2022binary,ulrich2023taxor}.
We introduce \emph{ZOR filters}, a deterministic continuation of XOR/fuse filters that guarantees construction termination while preserving the same XOR-based query mechanism. ZOR replaces restart-on-failure with deterministic peeling that abandons a small fraction of keys, and restores false-positive-only semantics by storing the remainder in a compact auxiliary structure. In our experiments, the abandoned fraction drops below $1\%$ for moderate arity (e.g., $N\ge 5$), so the auxiliary handles a negligible fraction of keys. As a result, ZOR filters can achieve overhead within $1\%$ of the information-theoretic lower bound $\log_2(1/\varepsilon)$ while retaining fuse-like query performance; the additional cost is concentrated on negative queries due to the auxiliary check. Our current prototype builds several-fold slower than highly optimized fuse builders because it maintains explicit incidence information during deterministic peeling; closing this optimisation gap is an engineering target.
toXiv_bot_toot

@… I guess, you mean font size in the virtual terminal (vt) when you're not using MATE.
screen.font
– in vt(4) examples and in loader.conf(5).
<http…

The US House Armed Services Committee formally asks the Defense Department how it plans to safeguard Stars and Stripes' congressionally required independence (@erikwemple)
https://x.com/erikwemple/status/2013744189641470264

ErikWemple (@ErikWemple) on X
A little followup on the Pentagon's move to "refocus" Stars and Stripes: The House Armed Services Committee has sent a bipartisan query to the Defense Department asking how it plans to safeguard the publication's congressionally required independence, among other questions.

Prune, Don't Rebuild: Efficiently Tuning $\alpha$-Reachable Graphs for Nearest Neighbor Search
Tian Zhang, Ashwin Padaki, Jiaming Liang, Zack Ives, Erik Waingarten
https://arxiv.org/abs/2602.08097 https://arxiv.org/pdf/2602.08097 https://arxiv.org/html/2602.08097
arXiv:2602.08097v1 Announce Type: new
Abstract: Vector similarity search is an essential primitive in modern AI and ML applications. Most vector databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, such as DiskANN (Subramanya et al., 2019), which have demonstrated state-of-the-art empirical performance. DiskANN's graph construction is governed by a reachability parameter $\alpha$, which gives a trade-off between construction time, query time, and accuracy. However, adaptively tuning this trade-off typically requires rebuilding the index for different $\alpha$ values, which is prohibitive at scale. In this work, we propose RP-Tuning, an efficient post-hoc routine, based on DiskANN's pruning step, to adjust the $\alpha$ parameter without reconstructing the full index. Within the $\alpha$-reachability framework of prior theoretical works (Indyk and Xu, 2023; Gollapudi et al., 2025), we prove that pruning an initially $\alpha$-reachable graph with RP-Tuning preserves worst-case reachability guarantees in general metrics and improved guarantees in Euclidean metrics. Empirically, we show that RP-Tuning accelerates DiskANN tuning on four public datasets by up to $43\times$ with negligible overhead.
toXiv_bot_toot

CAG-Avatar: Cross-Attention Guided Gaussian Avatars for High-Fidelity Head Reconstruction
Zhe Chang, Haodong Jin, Yan Song, Hui Yu
https://arxiv.org/abs/2601.14844 https://arxiv.org/pdf/2601.14844 https://arxiv.org/html/2601.14844
arXiv:2601.14844v1 Announce Type: new
Abstract: Creating high-fidelity, real-time drivable 3D head avatars is a core challenge in digital animation. While 3D Gaussian Splashing (3D-GS) offers unprecedented rendering speed and quality, current animation techniques often rely on a "one-size-fits-all" global tuning approach, where all Gaussian primitives are uniformly driven by a single expression code. This simplistic approach fails to unravel the distinct dynamics of different facial regions, such as deformable skin versus rigid teeth, leading to significant blurring and distortion artifacts. We introduce Conditionally-Adaptive Gaussian Avatars (CAG-Avatar), a framework that resolves this key limitation. At its core is a Conditionally Adaptive Fusion Module built on cross-attention. This mechanism empowers each 3D Gaussian to act as a query, adaptively extracting relevant driving signals from the global expression code based on its canonical position. This "tailor-made" conditioning strategy drastically enhances the modeling of fine-grained, localized dynamics. Our experiments confirm a significant improvement in reconstruction fidelity, particularly for challenging regions such as teeth, while preserving real-time rendering performance.
toXiv_bot_toot

When running a query with "out count;" in Overpass Ultra, where is that count actually displayed? I can't find any ui button to switch from the map view to response xml/json (like overpass turbo has).
#overpassultra #overpassql #osm

🎯 Zero accuracy loss - preserves what matters: errors, anomalies, high-scoring items & query-relevant content using BM25/embedding similarity
✅ Full provider support: #OpenAI, #Anthropic, #Google

OK, but the results are still just paper links, not what the LLM thinks about them. So the only thing that changed is that it is much much slower now?
Maybe the LLM just formulates a query to the old scholar? Too many layers of "oh how can we build an LLM into this"...
OK, nobody in #math uses Google Scholar like this anyway. We only use it look at publication records of people and do reverse citation search (which papers cite this one I have).

@… thanks!
Hints:
― procfs(5) is deprecated (the FreeBSD Handbook is outdated; <https://man.freebsd.org/cgi/man.cgi?qu

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Optimal Hardness of Online Algorithms for Large Independent Sets
David Gamarnik, Eren C. K{\i}z{\i}lda\u{g}, Lutz Warnke
https://arxiv.org/abs/2504.11450 https://mastoxiv.page/@arXiv_csDS_bot/114346418465357434
- An Approximation Algorithm for Monotone Submodular Cost Allocation
Ryuhei Mizutani
https://arxiv.org/abs/2511.00470 https://mastoxiv.page/@arXiv_csDS_bot/115490466535056736
- Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
Md. Rawha Siddiqi Riad, Md. Tanzeem Rahat, Md. Manzurul Hasan
https://arxiv.org/abs/2512.00506 https://mastoxiv.page/@arXiv_csDS_bot/115648910775471187
- Nested and outlier embeddings into trees
Shuchi Chawla, Kristin Sheridan
https://arxiv.org/abs/2601.15470 https://mastoxiv.page/@arXiv_csDS_bot/115943420904659985
- Bankrupting DoS Attackers
Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia, Maxwell Young
https://arxiv.org/abs/2205.08287
- An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
Amit Chattopadhyay, Yashwanth Ramamurthi, Osamu Saeki
https://arxiv.org/abs/2403.06564 https://mastoxiv.page/@arXiv_csCG_bot/112081476174323525
- On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact...
Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar
https://arxiv.org/abs/2410.07388 https://mastoxiv.page/@arXiv_csSI_bot/113287589348257824
- A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving ...
Jianqiang Li
https://arxiv.org/abs/2510.05588 https://mastoxiv.page/@arXiv_quantph_bot/115337999786748703
- On Purely Private Covariance Estimation
Tommaso d'Orsi, Gleb Novikov
https://arxiv.org/abs/2510.26717 https://mastoxiv.page/@arXiv_csLG_bot/115468358153466988
- The Query Complexity of Local Search in Rounds on General Graphs
Simina Br\^anzei, Ioannis Panageas, Dimitris Paparas
https://arxiv.org/abs/2601.13266 https://mastoxiv.page/@arXiv_csCC_bot/115932039505257286
toXiv_bot_toot

#PHPUnit Query Count Assertions for #Laravel #PHP #testing