Dying Chinese man, 61, leaves US$43 million fortune to young wife, enrages ex-wife’s family
A terminally ill Chinese man left 300 million yuan (US$43 million) to his wife who is 28 years younger than him, causing a dispute with his ex-wife’s family. The 61-year-old from the southern Chinese island of Hainan, surnamed Hou, reportedly left all his fortune to his young wife, Liyuan, who is 33. Liyuan said she had been with him since she was 21. They married 10 years ago and have a five-year-old son. In November, the couple announced on their social media account, which has 44,000...
A terminally ill Chinese man left 300 million yuan (US$43 million) to his wife who is 28 years younger than him, causing a dispute with his ex-wife’s family.
The 61-year-old from the southern Chinese island of Hainan, surnamed Hou, reportedly left all his fortune to his young wife, Liyuan, who is 33.
Liyuan said she had been with him since she was 21. They married 10 years ago and have a five-year-old son.
Terminally ill Hou and his wife, Liyuan, who is almost three decades his junior. Photo: Weibo
In November, the couple announced on their social media account, which has 44,000 followers, that Hou had been diagnosed with terminal lung cancer.
Liyuan said she grew up overnight, from a little girl wanting to be looked after, to a cancer patient’s carer.
She received many comments speculating that she would run away when her husband was ill.
But she said his illness and her reaction to it were a test that they are destined to overcome together.
Hou shows off a necklace that he bought for Liyuan as a gift. Photo: Weibo
Sign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
announcemillionreport
DeepEye-SQL: A Software-Engineering-Inspired Text-to-SQL Framework
arXiv:2510.17586v3 Announce Type: replace Abstract: Large language models (LLMs) have advanced Text-to-SQL, yet existing solutions still fall short of system-level reliability. The limitation is not merely in individual modules -- e.g., schema linking, reasoning, and verification -- but more critically in the lack of structured orchestration that enforces correctness across the entire workflow. This gap motivates a paradigm shift: treating Text-to-SQL not as free-form language generation but as a software-engineering problem that demands structured, verifiable orchestration. We present DeepEye-SQL, a software-engineering-inspired framework that reframes Text-to-SQL as the development of a small software program, executed through a verifiable process guided by the Software Development Life
ResidualPlanner+: a scalable matrix mechanism for marginals and beyond
arXiv:2305.08175v4 Announce Type: replace Abstract: Noisy marginals are a common form of confidentiality protecting data release and are useful for many downstream tasks such as contingency table analysis, construction of Bayesian networks, and even synthetic data generation. Privacy mechanisms that provide unbiased noisy answers to linear queries (such as marginals) are known as matrix mechanisms. We propose ResidualPlanner and ResidualPlanner+, two highly scalable matrix mechanisms. ResidualPlanner is both optimal and scalable for answering marginal queries with Gaussian noise, while ResidualPlanner+ provides support for more general workloads, such as combinations of marginals and range queries or prefix-sum queries. ResidualPlanner can optimize for many loss functions that can be writt
LitMOF: An LLM Multi-Agent for Literature-Validated Metal-Organic Frameworks Database Correction and Expansion
arXiv:2512.01693v2 Announce Type: replace Abstract: Metal-organic framework (MOF) databases have grown rapidly through experimental deposition and large-scale literature extraction, but recent analyses show that nearly half of their entries contain substantial structural errors. These inaccuracies propagate through high-throughput screening and machine-learning workflows, limiting the reliability of data-driven MOF discovery. Correcting such errors is exceptionally difficult because true repairs require integrating crystallographic files, synthesis descriptions, and contextual evidence scattered across the literature. Here we introduce LitMOF, a large language model-driven multi-agent framework that validates crystallographic information directly from the original literature and cross-vali
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Releases
ResidualPlanner+: a scalable matrix mechanism for marginals and beyond
arXiv:2305.08175v4 Announce Type: replace Abstract: Noisy marginals are a common form of confidentiality protecting data release and are useful for many downstream tasks such as contingency table analysis, construction of Bayesian networks, and even synthetic data generation. Privacy mechanisms that provide unbiased noisy answers to linear queries (such as marginals) are known as matrix mechanisms. We propose ResidualPlanner and ResidualPlanner+, two highly scalable matrix mechanisms. ResidualPlanner is both optimal and scalable for answering marginal queries with Gaussian noise, while ResidualPlanner+ provides support for more general workloads, such as combinations of marginals and range queries or prefix-sum queries. ResidualPlanner can optimize for many loss functions that can be writt
Distance Comparison Operations Are Not Silver Bullets in Vector Similarity Search: A Benchmark Study on Their Merits and Limits
arXiv:2604.02801v1 Announce Type: new Abstract: Distance Comparison Operations (DCOs), which decide whether the distance between a data vector and a query is within a threshold, are a critical performance bottleneck in vector similarity search. Recent DCO methods that avoid full-dimensional distance computations promise significant speedups, but their readiness for production vector database systems remains an open question. To address this, we conduct a comprehensive benchmark of 8 DCO algorithms across 10 datasets (with up to 100M vectors and 12,288 dimensions) and diverse hardware configurations (CPUs with/without SIMD, and GPUs). Our study reveals that these methods are not silver bullets: their efficiency is highly sensitive to data dimensionality, degrades under out-of-distribution q
Efficient Path Query Processing in Relational Database Systems
arXiv:2604.02553v1 Announce Type: new Abstract: Path queries are crucial for property graphs, and there is growing interest in queries that combine regular expressions over labels with constraints on property values of vertices and edges. Efficient evaluation of such general path queries requires that intermediate results be eliminated early when there is no possible completion to a full result path. Neither state-of-the-art (SOA) graph DBMS nor relational DBMS currently can do this effectively for a large class of queries. We show that this problem can be addressed by giving a relational optimizer ``a little help'' by specifying early filtering opportunities explicitly in the query. To this end, we propose ReCAP, an abstraction that greatly simplifies the implementation of early filtering
Universities of Wisconsin, UW Credit Union launch free short-form online learning series on Artificial Intelligence - Universities of Wisconsin
Universities of Wisconsin, UW Credit Union launch free short-form online learning series on Artificial Intelligence Universities of Wisconsin
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!