Reconstruct the hidden graph used by triple-edge-count queries.
All challenges
Select an independent set under the original complement-style Frontier-CS scoring formula.
Construct a permutation whose increasing-subsequence count matches the target value.
Predict an interactive wager stream while competing against the best hidden participant.
Emit the static reference token for the graph-game migration payload.
Train a synthetic ImageNet-like CPU model under a 5M parameter budget.
Train a synthetic ImageNet-like CPU model under a 500K parameter budget.
Train a synthetic ImageNet-like CPU model under a 200K parameter budget.
Train a synthetic ImageNet-like CPU model under a 2.5M parameter budget.
Train a synthetic ImageNet-like CPU model under a 1M parameter budget.
Recover a hidden tree through triple-node median queries.
Recover the hidden pair of positions from the source answer metadata.