Tootfinder

"The essence of the so-called capitalist world or the communist world, is not an evil volition to subject their people by the power of indoctrination or the power of finance; but simply the natural ambition of any organization to plan all its actions."
— alpha 60
#alphaville

Jensen Huang hailed AI models from DeepSeek, Alibaba, and Tencent as "world class" at a Beijing expo and said US licenses for H20 chips "will come very fast" (Reuters)
https://www.reuters.com/world/china/nvidias-huang-hail…

#linktipp
#Pakistan is home to one of the largest concentrations of sellers on Alibaba.com
https://restofworld…

Defining neurosymbolic AI
Lennert De Smet, Luc De Raedt
https://arxiv.org/abs/2507.11127 https://arxiv.org/pdf/2507.11127

Defining neurosymbolic AI
Neurosymbolic AI focuses on integrating learning and reasoning, in particular, on unifying logical and neural representations. Despite the existence of an alphabet soup of neurosymbolic AI systems, the field is lacking a generally accepted formal definition of what neurosymbolic models and inference really are. We introduce a formal definition for neurosymbolic AI that makes abstraction of its key ingredients. More specifically, we define neurosymbolic inference as the computation of an integra…

Symbol Alphabets in QCD and Flag Cluster Algebras
Andrzej Pokraka, Marcus Spradlin, Anastasia Volovich, He-Chen Weng
https://arxiv.org/abs/2506.11895 https…

"Alibaba Cloud will be discontinuing services in the Nanjing - Local Region Zone A (cn-nanjing-a) And Fuzhou - Local Region Zone A (cn-fuzhou-a) regions."
New orders end 2025-08-15, service fully discontinued 2026-07-14.
#AS37963

Maximal sets of a given diameter in Hamming cubes
Boris Bukh, Aleksandre Saatashvili
https://arxiv.org/abs/2507.10828 https://arxiv.o…

Maximal sets of a given diameter in Hamming cubes
A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or contains a non-trivial Hamming ball. The bound of $(n+o(n))^d$ is asymptotically tight. Additionally, we give a non-trivial lower bound on the size of any $d$-maximal set and show that the number of essentially different $d$-maximal sets is finite.

🤖 Models available: WebSailor-3B on #HuggingFace & WebDancer-QwQ-32B for complex reasoning
🛠️ Complete post-training methodology with DUPO algorithm for efficient agentic RL
https://github.com/Alibaba-NLP/W…

Alibaba is putting $7B in Taobao promotions as JD.com invests $1.4B to grow food delivery, with both offering discounts to become China's leading "everyday app" (Eleanor Olcott/Financial Times)
https://www.ft.com/content/3ee074a1-0210-4f09-ba6a-563ad0860aa3

Amsterdam-based Tebi, which offers a payments platform for hospitality companies, raised €30M led by CapitalG, after a €20M Series A in October 2024 (Anna Heim/TechCrunch)
https://techcrunch.com/2025/06/10/tebi

Tebi, the new startup by Adyen's departed cofounder, raises a fresh $30M from Alphabet's CapitalG | TechCrunch
Co-founded by Adyen's former CTO, Tebi helps restaurants, bars and other hospitality businesses manage their operations with an all-in-one subscription-based platform that can handle payments, reservations, inventory, and more.