A photograph taken during U.S. Attorney General Pam Bondi’s combative appearance before the House Judiciary Committee on Wednesday
suggests that the Justice Department has been tracking the search history of lawmakers who are combing through the unredacted Epstein files.
As Bondi launched into various tirades against lawmakers, photojournalists managed to snag a picture of her notes,
showcasing that her paperwork included the search history of Rep. Pramila Jayapal (D-Washin…
Isomorphic Labs, a Google DeepMind spinoff, unveils IsoDDE, a drug design system it says surpasses AlphaFold 3 in predicting biomolecular structures (Isomorphic Labs)
https://www.isomorphiclabs.com/articles/the-isomorphic-labs-drug-design…
We see how El Cheato has blocked the opening of the new bridge between Canada and the US in Detroit - apparently in an effort to maintain a flow of bridge toll revenue from a competing bridge owned by a Cheato-buddy.
If I were Canada I might consider retaliation by shutting down the older Cheato-buddy bridge.
„Die größten Lücken der NIS2- und DORA-Umsetzung“ (Analyse, 9.2.)
Eine aktuelle Studie zu „Cybersicherheit und Digitale Resilienz 2026“ zeigt, dass nur etwa jedes dritte Unternehmen große Cyberrisiken offensiv adressiert und viele Organisationen bei NIS2- und DORA-Anforderungen im Rückstand sind. #Computerwoche
Disinformation works:
Two-thirds of UK voters wrongly think immigration is rising, poll finds
https://www.theguardian.com/uk-news/2026/jan/10/two-thirds-of-uk-voters-wrongly-think-immigratio…
Towards Efficient Data Structures for Approximate Search with Range Queries
Ladan Kian, Dariusz R. Kowalski
https://arxiv.org/abs/2602.06860 https://arxiv.org/pdf/2602.06860 https://arxiv.org/html/2602.06860
arXiv:2602.06860v1 Announce Type: new
Abstract: Range queries are simple and popular types of queries used in data retrieval. However, extracting exact and complete information using range queries is costly. As a remedy, some previous work proposed a faster principle, {\em approximate} search with range queries, also called single range cover (SRC) search. It can, however, produce some false positives. In this work we introduce a new SRC search structure, a $c$-DAG (Directed Acyclic Graph), which provably decreases the average number of false positives by logarithmic factor while keeping asymptotically same time and memory complexities as a classic tree structure. A $c$-DAG is a tunable augmentation of the 1D-Tree with denser overlapping branches ($c \geq 3$ children per node). We perform a competitive analysis of a $c$-DAG with respect to 1D-Tree and derive an additive constant time overhead and a multiplicative logarithmic improvement of the false positives ratio, on average. We also provide a generic framework to extend our results to empirical distributions of queries, and demonstrate its effectiveness for Gowalla dataset. Finally, we quantify and discuss security and privacy aspects of SRC search on $c$-DAG vs 1D-Tree, mainly mitigation of structural leakage, which makes $c$-DAG a good data structure candidate for deployment in privacy-preserving systems (e.g., searchable encryption) and multimedia retrieval.
toXiv_bot_toot
"Government cyber unit" sounds like a class of robot enemies in a futuristic video game.
https://www.gov.uk/government/news/new-cyber-action-plan-to-tackle-threats-and-strengthen-public-services
Internal memo: OpenAI CEO Sam Altman declares a "code red" to shift more resources into improving ChatGPT amid rising competition, delaying other plans like ads (The Information)
https://www.theinformation.com/articles/op
In October, I gave a talk about post-quantum #cryptography at the #OpenSSL Conference in Prague. Yesterday, the video dropped. If you're interested, head to https:/…