3 drones reportedly spotted flying over Belgian nuclear power plant: https://benborges.xyz/2025/11/10/drones-reportedly-spotted-flying-over.html
One of the things that is interesting doing mass encodes is verifying all of the little things that can just mess everything up. If you're pulling in stuff like 3rd-party subtitles, then you have to verify the timing of the subtitles and adjust as necessary. Even better, if those are SubStation Alpha subtitles, you have to verify if the style fonts get added as attachments to the MKV file.
And if it's across something like a TV show, you definitely need to do this for every e…
"‘No one knows where it came from’: first wild beaver spotted in Norfolk for 400 years"
#UK #UnitedKingdom #Norfolk #Beavers
@… which post? I'm quickly losing count.
Was it the one that spouted some bullshit about undressing?
#Blakes7 Series B, Episode 13 - Star One
AVON: [On communicator] What is it, Jenna?
JENNA: There's a ship, its coming in for a surface landing.
AVON: [On communicator] Have they spotted you?
JENNA: I've got the detector shield up.
US spy plane spotted at airbase near Cirencester amid global tensions https://ground.news/article/us-spy-plane-spotted-at-airbase-near-cirencester-amid-global-tensions
NATO and the drones. This weekend, drones were flying spy missions over a Belgian Air Force base. Said the country's Defense Minister: "A helicopter and police vehicles chased the drone, but lost it after several kilometers.”
https://edition.cnn.com/2025/11/02/…
The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang
https://arxiv.org/abs/2512.06585 https://arxiv.org/pdf/2512.06585 https://arxiv.org/html/2512.06585
arXiv:2512.06585v1 Announce Type: new
Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with bidders from either a standard valuation class (which require exponential communication to explicitly state, such as subadditive or XOS), or arbitrary succinct valuations (which can be fully described in polynomial communication, such as single-minded). Although succinct valuations can be efficiently communicated, we show that additional succinct bidders have a nontrivial impact on communication complexity of classical combinatorial auctions. Specifically, let $n$ be the number of subadditive/XOS bidders. We show that for SA $\cup$ SC (the union of subadditive and succinct valuations): (1) There is a polynomial communication $3$-approximation algorithm; (2) As $n \to \infty$, there is a matching $3$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $2$ for SA, and (b) holds even for SA $\cup$ SM (the union of subadditive and single-minded valuations); and (3) For all $n \geq 3$, there is a constant separation between the optimal approximation ratios for SA $\cup$ SM and SA (and therefore between SA $\cup$ SC and SA as well). Similarly, we show that for XOS $\cup$ SC: (1) There is a polynomial communication $2$-approximation algorithm; (2) As $n \to \infty$, there is a matching $2$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $e/(e-1)$ for XOS, and (b) holds even for XOS $\cup$ SM; and (3) For all $n \geq 2$, there is a constant separation between the optimal approximation ratios for XOS $\cup$ SM and XOS (and therefore between XOS $\cup$ SC and XOS as well).
toXiv_bot_toot
NFL line movement for Super Wild Card Weekend: Odds holding pretty steady for NFL playoffs matchups
https://www.cbssports.com/nfl/news/nfl-lin