manifest.json

{
  "source": "https://github.com/openai/math",
  "source_commit": "adc7f1241b42e322a6451854ab7e4b4c146bf78a",
  "tasks": [
    {
      "task": "abhyankar-sathaye",
      "challenge": "AbhyankarSathaye",
      "family": "049",
      "family_title": "A stable-coordinate counterexample in four variables",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.AbhyankarSathaye.exists_noncoordinate_polynomial"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 15,
      "bytes": 55824,
      "packages": [],
      "grade_timeout_sec": 10850,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 47
    },
    {
      "task": "affine-bernstein",
      "challenge": "AffineBernstein",
      "family": "353",
      "family_title": "The sharp dimension threshold for affine Bernstein rigidity",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.AffineBernstein.affine_bernstein"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 322,
      "bytes": 1998143,
      "packages": [],
      "grade_timeout_sec": 12598,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1429
    },
    {
      "task": "algorithmic-thin-trees",
      "challenge": "AlgorithmicThinTrees",
      "family": "174",
      "family_title": "Deterministic construction of strong thin spanning trees",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.AlgorithmicThinTrees.algorithmic_strong_thin_trees"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 736,
      "bytes": 4556988,
      "packages": [],
      "grade_timeout_sec": 14901,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2392
    },
    {
      "task": "amplitude-damping",
      "challenge": "AmplitudeDamping",
      "family": "276",
      "family_title": "The classical capacity of generalized amplitude damping",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.GAD.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 283452,
      "packages": [],
      "grade_timeout_sec": 11055,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 432
    },
    {
      "task": "artin-cat0",
      "challenge": "ArtinCAT0",
      "family": "254",
      "family_title": "Classifying spaces and geometric obstructions for Artin groups",
      "subject": "Group theory",
      "theorems": [
        "OAI.ArtinCAT0.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 20,
      "bytes": 414894,
      "packages": [],
      "grade_timeout_sec": 11173,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 193
    },
    {
      "task": "artin-parabolic-intersections",
      "challenge": "ArtinParabolicIntersections",
      "family": "254",
      "family_title": "Classifying spaces and geometric obstructions for Artin groups",
      "subject": "Group theory",
      "theorems": [
        "OAI.HarmonicArtin.ParabolicIntersections.unconditional_parabolic_intersections",
        "OAI.HarmonicArtin.ParabolicIntersections.unconditional_arbitrary_intersections",
        "OAI.HarmonicArtin.ParabolicIntersections.unconditional_parabolic_closure",
        "OAI.HarmonicArtin.ParabolicIntersections.unconditional_nonclique_dynamics"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 782,
      "bytes": 3300665,
      "packages": [],
      "grade_timeout_sec": 13770,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2200
    },
    {
      "task": "asymptotically-minimal-littlewood",
      "challenge": "AsymptoticallyMinimalLittlewood",
      "family": "076",
      "family_title": "Ultraflat real Littlewood polynomials",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.AsymptoticallyMinimalLittlewood.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 24,
      "bytes": 432620,
      "packages": [],
      "grade_timeout_sec": 11189,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 346
    },
    {
      "task": "atomic-gaussian",
      "challenge": "AtomicGaussian",
      "family": "090",
      "family_title": "Universal optimality of the triangular lattice",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.AtomicTriangular.sharp_gaussian_minorants_atomic"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 215,
      "bytes": 8527615,
      "packages": [],
      "grade_timeout_sec": 18474,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 10626
    },
    {
      "task": "auslander-reiten",
      "challenge": "AuslanderReiten",
      "family": "199",
      "family_title": "Counterexamples to conjectures of Auslander\u2013Reiten, Tachikawa, and Nakayama",
      "subject": "Algebra",
      "theorems": [
        "OAI.ArExplicit.Statement.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 732,
      "bytes": 2349871,
      "packages": [],
      "grade_timeout_sec": 12914,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2177
    },
    {
      "task": "backward-intertwiners",
      "challenge": "BackwardIntertwiners",
      "family": "293",
      "family_title": "A counterexample to the hyperinvariant-subspace problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.BackwardIntertwiners.direct_algebra_corollary"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 23,
      "bytes": 262844,
      "packages": [],
      "grade_timeout_sec": 11036,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 337
    },
    {
      "task": "balanced-box-routing",
      "challenge": "BalancedBoxRouting",
      "family": "376",
      "family_title": "Universal computation in forced Navier\u2013Stokes flows",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.BoxTransport.Routing.balanced_box_routing"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 7,
      "bytes": 164970,
      "packages": [],
      "grade_timeout_sec": 10948,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 141
    },
    {
      "task": "balanced-ryser",
      "challenge": "BalancedRyser",
      "family": "162",
      "family_title": "Counterexamples to Ryser's covering and Gyarfas's tree-cover conjectures",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Balanced.main_result"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 698,
      "bytes": 3897149,
      "packages": [],
      "grade_timeout_sec": 14307,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1384
    },
    {
      "task": "balanced-three-stack",
      "challenge": "BalancedThreeStack",
      "family": "376",
      "family_title": "Universal computation in forced Navier\u2013Stokes flows",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.BalancedTransport.balanced_three_stack_realization"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 60,
      "bytes": 495983,
      "packages": [],
      "grade_timeout_sec": 11246,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 392
    },
    {
      "task": "ball-packing",
      "challenge": "BallPacking",
      "family": "343",
      "family_title": "Sharp symplectic ball-packing criteria in higher dimensions",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.HigherDimensionalBallPacking.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 169,
      "bytes": 4529811,
      "packages": [],
      "grade_timeout_sec": 14876,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2433
    },
    {
      "task": "ball-packing-necessity",
      "challenge": "BallPackingNecessity",
      "family": "343",
      "family_title": "Sharp symplectic ball-packing criteria in higher dimensions",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.HigherDimensionalBallPacking.packing_necessity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 65,
      "bytes": 1673682,
      "packages": [],
      "grade_timeout_sec": 12306,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1186
    },
    {
      "task": "barnette-hamiltonian",
      "challenge": "BarnetteHamiltonian",
      "family": "180",
      "family_title": "Barnette's Hamiltonian-cycle conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Barnette.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 379455,
      "packages": [],
      "grade_timeout_sec": 11141,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 337
    },
    {
      "task": "bass-torsion-free",
      "challenge": "BassTorsionFree",
      "family": "207",
      "family_title": "The $\\ell^1$-Bass and complex Bass trace conjectures",
      "subject": "Algebra",
      "theorems": [
        "OAI.TorsionFreeBass.torsion_free_corollary"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 73,
      "bytes": 1022515,
      "packages": [],
      "grade_timeout_sec": 11720,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 650
    },
    {
      "task": "bass-trace",
      "challenge": "BassTrace",
      "family": "207",
      "family_title": "The $\\ell^1$-Bass and complex Bass trace conjectures",
      "subject": "Algebra",
      "theorems": [
        "OAI.BassTrace.RightProjective.bassTraceModules_vanishing_and_support"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 69,
      "bytes": 997569,
      "packages": [],
      "grade_timeout_sec": 11697,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 633
    },
    {
      "task": "benjamini-schramm",
      "challenge": "BenjaminiSchramm",
      "family": "214",
      "family_title": "The Benjamini\u2013Schramm nonuniqueness conjecture",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.Percolation.BenjaminiSchramm.full_main",
        "OAI.Percolation.BenjaminiSchramm.cayley_main",
        "OAI.Percolation.BenjaminiSchramm.critical_laws"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 970,
      "bytes": 6834429,
      "packages": [],
      "grade_timeout_sec": 16950,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2752
    },
    {
      "task": "bernoulli-nonflat-in-seven",
      "challenge": "BernoulliNonflatInSeven",
      "family": "367",
      "family_title": "The critical dimension for the one-phase Bernoulli problem",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.Bernoulli.nonflat_in_seven"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 91,
      "bytes": 640271,
      "packages": [],
      "grade_timeout_sec": 11376,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 664
    },
    {
      "task": "biholder-transport",
      "challenge": "BiholderTransport",
      "family": "360",
      "family_title": "Villani\u2019s convexity conjecture and regular optimal transport",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.WeakMTWTransport.uniform_biHolder_transport"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 645,
      "bytes": 3202559,
      "packages": [],
      "grade_timeout_sec": 13682,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2398
    },
    {
      "task": "bin-packing-gap",
      "challenge": "BinPackingGap",
      "family": "118",
      "family_title": "Unbounded bin-packing gaps and the modified integer round-up conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.BinPackingGap.main_results"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 284,
      "bytes": 7557041,
      "packages": [],
      "grade_timeout_sec": 17601,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1119
    },
    {
      "task": "binary-edit-lower",
      "challenge": "BinaryEditLower",
      "family": "099",
      "family_title": "The sharp distortion of edit distance into $\\ell_1$",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.TreeEdit.binary_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 84,
      "bytes": 464862,
      "packages": [],
      "grade_timeout_sec": 11218,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 280
    },
    {
      "task": "binary-matching",
      "challenge": "BinaryMatching",
      "family": "113",
      "family_title": "Approximate counting and the perfect-matching entropy conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.BinaryMatching.deterministic_approximate_counting"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 112,
      "bytes": 617632,
      "packages": [],
      "grade_timeout_sec": 11355,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 524
    },
    {
      "task": "binary-sweep",
      "challenge": "BinarySweep",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.binary_sweep_contraction_and_mixing"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 192,
      "bytes": 1151658,
      "packages": [],
      "grade_timeout_sec": 11836,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 768
    },
    {
      "task": "bipartite-crossing",
      "challenge": "BipartiteCrossing",
      "family": "165",
      "family_title": "Exact crossing numbers of complete and complete bipartite graphs",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Zarankiewicz.mainTarget_proof"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 339,
      "bytes": 893808,
      "packages": [],
      "grade_timeout_sec": 11604,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 448
    },
    {
      "task": "bogomolov-pop-injectivity",
      "challenge": "BogomolovPopInjectivity",
      "family": "009",
      "family_title": "Bogomolov\u2013Pop and Milnor $K$-theoretic reconstruction",
      "subject": "Number theory",
      "theorems": [
        "OAI.BogomolovPop.main_graph_injective"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 5,
      "bytes": 155277,
      "packages": [],
      "grade_timeout_sec": 10939,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 159
    },
    {
      "task": "boltzmann-nonuniqueness",
      "challenge": "BoltzmannNonuniqueness",
      "family": "363",
      "family_title": "Boltzmann nonuniqueness with exact local conservation",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.BoltzmannNonuniqueness.nonuniqueness"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 525,
      "bytes": 7330824,
      "packages": [],
      "grade_timeout_sec": 17397,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1339
    },
    {
      "task": "boone-higman",
      "challenge": "BooneHigman",
      "family": "250",
      "family_title": "The Boone\u2013Higman conjecture and higher finiteness",
      "subject": "Group theory",
      "theorems": [
        "OAI.FiniteAlgebraicEnvelopes.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 1687310,
      "packages": [],
      "grade_timeout_sec": 12318,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 379
    },
    {
      "task": "borsuk-nine",
      "challenge": "BorsukNine",
      "family": "156",
      "family_title": "Borsuk's conjecture fails in dimension nine",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.BorsukNine.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 269,
      "bytes": 3525234,
      "packages": [],
      "grade_timeout_sec": 13972,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1206
    },
    {
      "task": "bounded-recovery",
      "challenge": "BoundedRecovery",
      "family": "290",
      "family_title": "Connes' bicentralizer conjecture and relative bicentralizers",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.BoundedRecovery.bounded_recovery"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 27,
      "bytes": 368603,
      "packages": [],
      "grade_timeout_sec": 11131,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 494
    },
    {
      "task": "bounded-tree-potentials",
      "challenge": "BoundedTreePotentials",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.BoundedTreePotentials.TreeCalculus.main_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 46,
      "bytes": 595707,
      "packages": [],
      "grade_timeout_sec": 11336,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 358
    },
    {
      "task": "bounded-treewidth-l1",
      "challenge": "BoundedTreewidthL1",
      "family": "089",
      "family_title": "Bounded-distortion $L_1$ embeddings of planar and bounded-treewidth graphs",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.BoundedTreewidthL1.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 33,
      "bytes": 708126,
      "packages": [],
      "grade_timeout_sec": 11437,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 283
    },
    {
      "task": "brenier",
      "challenge": "Brenier",
      "family": "374",
      "family_title": "Sharp one-third stability of optimal transport maps",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.Problem358.one_third_stability",
        "OAI.Problem358.one_third_exponent_is_sharp"
      ],
      "definition_holes": [],
      "fixed_definitions": [
        "OAI.Problem358.E",
        "OAI.Problem358.uniformMeasure",
        "OAI.Problem358.IsSupported",
        "OAI.Problem358.IsCoupling",
        "OAI.Problem358.quadraticPlanCost",
        "OAI.Problem358.wasserstein2",
        "OAI.Problem358.graphPlan",
        "OAI.Problem358.IsQuadraticOptimalMap",
        "OAI.Problem358.IsUniqueQuadraticOptimalMap",
        "OAI.Problem358.mapL2Dist",
        "OAI.Problem358.cube",
        "OAI.Problem358.HasExactlyThreeAtoms"
      ],
      "n_modules": 89,
      "bytes": 1532625,
      "packages": [],
      "grade_timeout_sec": 12179,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 440
    },
    {
      "task": "brennan",
      "challenge": "Brennan",
      "family": "072",
      "family_title": "Brennan's conjecture and a counterexample to Kraetzer's prediction",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.Brennan.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 38,
      "bytes": 692980,
      "packages": [],
      "grade_timeout_sec": 11423,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 507
    },
    {
      "task": "brennan-sharp",
      "challenge": "BrennanSharp",
      "family": "072",
      "family_title": "Brennan's conjecture and a counterexample to Kraetzer's prediction",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.Brennan.Sharp.sharp_endpoints"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 711263,
      "packages": [],
      "grade_timeout_sec": 11440,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 354
    },
    {
      "task": "buffered-ising",
      "challenge": "BufferedIsing",
      "family": "218",
      "family_title": "Conformal universality for weakly interacting and disordered Ising models",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.BufferedIsing.finite_graph_comparison"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 15,
      "bytes": 136460,
      "packages": [],
      "grade_timeout_sec": 10922,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 127
    },
    {
      "task": "c0-absorption",
      "challenge": "C0Absorption",
      "family": "324",
      "family_title": "Lipschitz equivalence without linear isomorphism",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.C0Absorption.main_result"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 366161,
      "packages": [],
      "grade_timeout_sec": 11129,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 256
    },
    {
      "task": "c1-entropy-counterexample",
      "challenge": "C1EntropyCounterexample",
      "family": "151",
      "family_title": "A $C^1$ counterexample to Shub\u2019s entropy conjecture",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.Problem340.exists_C1_entropy_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 201,
      "bytes": 965060,
      "packages": [],
      "grade_timeout_sec": 11668,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 647
    },
    {
      "task": "ch-obstruction",
      "challenge": "CHObstruction",
      "family": "240",
      "family_title": "Shelah's eventual categoricity conjecture",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.CHObstruction.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 15,
      "bytes": 199905,
      "packages": [],
      "grade_timeout_sec": 10979,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 124
    },
    {
      "task": "cks-bondi-penrose",
      "challenge": "CKSBondiPenrose",
      "family": "260",
      "family_title": "Spacetime Penrose inequalities and rigidity",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.CKSSourceExterior.area_controlled_end_replacement",
        "OAI.CKSMain.schwarzschild_equality_examples"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 336,
      "bytes": 2829003,
      "packages": [],
      "grade_timeout_sec": 13346,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1417
    },
    {
      "task": "cannon-geometric-action",
      "challenge": "CannonGeometricAction",
      "family": "246",
      "family_title": "Cannon's conjecture",
      "subject": "Group theory",
      "theorems": [
        "OAI.CannonRelease.cannon"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 299,
      "bytes": 2904193,
      "packages": [],
      "grade_timeout_sec": 13413,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1075
    },
    {
      "task": "cayley-percolation",
      "challenge": "CayleyPercolation",
      "family": "214",
      "family_title": "The Benjamini\u2013Schramm nonuniqueness conjecture",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.Percolation.arbitrary_cayley"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 78,
      "bytes": 2644104,
      "packages": [],
      "grade_timeout_sec": 13179,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 698
    },
    {
      "task": "character-criterion",
      "challenge": "CharacterCriterion",
      "family": "299",
      "family_title": "The Kirchberg\u2013R\\o rdam character criterion",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.KirchbergRordam.character_criterion"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 62,
      "bytes": 1147190,
      "packages": [],
      "grade_timeout_sec": 11832,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 991
    },
    {
      "task": "choiceless-polynomial-time",
      "challenge": "ChoicelessPolynomialTime",
      "family": "243",
      "family_title": "Choiceless counting does not capture polynomial time",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.CPTSeparation.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 26,
      "bytes": 803577,
      "packages": [],
      "grade_timeout_sec": 11523,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 286
    },
    {
      "task": "circulant-hadamard",
      "challenge": "CirculantHadamard",
      "family": "179",
      "family_title": "The circulant Hadamard conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.CirculantHadamard.exists_iff_order_one_or_four"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 68,
      "bytes": 400871,
      "packages": [],
      "grade_timeout_sec": 11160,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 235
    },
    {
      "task": "classical-on",
      "challenge": "ClassicalON",
      "family": "215",
      "family_title": "Massive continuum limits and exact mass asymptotics for planar $O(n)$ models",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ClassicalON.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 117,
      "bytes": 582811,
      "packages": [],
      "grade_timeout_sec": 11324,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 752
    },
    {
      "task": "clique-free-log",
      "challenge": "CliqueFreeLog",
      "family": "184",
      "family_title": "Coloring and independence in graphs with forbidden subgraphs",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.CliqueFreeLog.logarithmic_independence_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 229474,
      "packages": [],
      "grade_timeout_sec": 11006,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 193
    },
    {
      "task": "coboundary-expanders",
      "challenge": "CoboundaryExpanders",
      "family": "177",
      "family_title": "Bounded-degree coboundary expanders in every dimension",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.CoboundaryExpanders.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 36,
      "bytes": 1459141,
      "packages": [],
      "grade_timeout_sec": 12113,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 437
    },
    {
      "task": "common-bases-fpras",
      "challenge": "CommonBasesFPRAS",
      "family": "114",
      "family_title": "Approximate counting of common integer polymatroid bases",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.common_bases_fpras"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1,
      "bytes": 1336009,
      "packages": [],
      "grade_timeout_sec": 12002,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 347
    },
    {
      "task": "commuting-derivations",
      "challenge": "CommutingDerivations",
      "family": "049",
      "family_title": "A stable-coordinate counterexample in four variables",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.AbhyankarSathaye.CommutingDerivations.commuting_derivations_with_ordinary_extras"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 32,
      "bytes": 135211,
      "packages": [],
      "grade_timeout_sec": 10921,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 81
    },
    {
      "task": "compact-banach",
      "challenge": "CompactBanach",
      "family": "098",
      "family_title": "A negative answer to the Lang\u2013Plaut problem",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.CompactBanach.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 28,
      "bytes": 207061,
      "packages": [],
      "grade_timeout_sec": 10986,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 303
    },
    {
      "task": "complete-crossing",
      "challenge": "CompleteCrossing",
      "family": "165",
      "family_title": "Exact crossing numbers of complete and complete bipartite graphs",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Paper170.complete_graph_crossing_number"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 300,
      "bytes": 1464297,
      "packages": [],
      "grade_timeout_sec": 12117,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 344
    },
    {
      "task": "complete-crouzeix",
      "challenge": "CompleteCrouzeix",
      "family": "325",
      "family_title": "The complete Crouzeix conjecture",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.CompleteCrouzeix.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 48,
      "bytes": 652138,
      "packages": [],
      "grade_timeout_sec": 11386,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 546
    },
    {
      "task": "complex-cancellation",
      "challenge": "ComplexCancellation",
      "family": "047",
      "family_title": "Complex counterexamples to cancellation and affine fibrations",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.ComplexCancellation.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 55,
      "bytes": 242585,
      "packages": [],
      "grade_timeout_sec": 11018,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 355
    },
    {
      "task": "conductivity",
      "challenge": "Conductivity",
      "family": "365",
      "family_title": "Joint metric and connection recovery from one boundary patch",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.ScalarConductivity.main_nonuniqueness"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 595,
      "bytes": 3618863,
      "packages": [],
      "grade_timeout_sec": 14056,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1793
    },
    {
      "task": "conjugate-points",
      "challenge": "ConjugatePoints",
      "family": "358",
      "family_title": "A three-manifold with no conjugate points and no nonpositively curved metric",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.ThreeManifold.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 19,
      "bytes": 1279256,
      "packages": [],
      "grade_timeout_sec": 11951,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 595
    },
    {
      "task": "contingency-tables",
      "challenge": "ContingencyTables",
      "family": "115",
      "family_title": "Sampling and counting contingency tables with arbitrary margins",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.ContingencyTables.boundedSampling",
        "OAI.ContingencyTables.exactSampling",
        "OAI.ContingencyTables.counting"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1297,
      "bytes": 9098638,
      "packages": [],
      "grade_timeout_sec": 18988,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 3262
    },
    {
      "task": "continuous-circle-weight",
      "challenge": "ContinuousCircleWeight",
      "family": "293",
      "family_title": "A counterexample to the hyperinvariant-subspace problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.ContinuousCircleWeight.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 908147,
      "packages": [],
      "grade_timeout_sec": 11617,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 530
    },
    {
      "task": "continuum-transition",
      "challenge": "ContinuumTransition",
      "family": "228",
      "family_title": "Continuum phase transitions for radial pair potentials",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ContinuumTemperature.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 161,
      "bytes": 697604,
      "packages": [],
      "grade_timeout_sec": 11427,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 942
    },
    {
      "task": "coordinate-sweeps",
      "challenge": "CoordinateSweeps",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CoordinateSweeps.conditional_main",
        "OAI.CoordinateSweeps.all_grid_moment"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 1085561,
      "packages": [],
      "grade_timeout_sec": 11777,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 383
    },
    {
      "task": "coordinate-trace",
      "challenge": "CoordinateTrace",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ThorpNine.Harmonic.Thorp.LowPlanes.regular_trace_smoothing"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 28,
      "bytes": 974102,
      "packages": [],
      "grade_timeout_sec": 11676,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 427
    },
    {
      "task": "cotype",
      "challenge": "Cotype",
      "family": "326",
      "family_title": "The cotype\u2013cotype conjecture under the approximation property",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.Cotype.mainTarget_proved"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 125,
      "bytes": 503929,
      "packages": [],
      "grade_timeout_sec": 11253,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 444
    },
    {
      "task": "coulomb-counterexample",
      "challenge": "CoulombCounterexample",
      "family": "373",
      "family_title": "Nonattainment in three-marginal Coulomb transport",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.Problem356.coulomb_counterexample_and_equal_infima"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 97,
      "bytes": 467629,
      "packages": [],
      "grade_timeout_sec": 11220,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 349
    },
    {
      "task": "coulomb-ionization",
      "challenge": "CoulombIonization",
      "family": "263",
      "family_title": "The ionization and generalized ionization conjectures",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.CoulombAtom.generalized_ionization"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 607,
      "bytes": 4613552,
      "packages": [],
      "grade_timeout_sec": 14952,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2150
    },
    {
      "task": "coulomb-radii",
      "challenge": "CoulombRadii",
      "family": "263",
      "family_title": "The ionization and generalized ionization conjectures",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.NeutralAtom.generalized_outer_radii"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 428,
      "bytes": 3858816,
      "packages": [],
      "grade_timeout_sec": 14272,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1444
    },
    {
      "task": "courtade-kumar",
      "challenge": "CourtadeKumar",
      "family": "119",
      "family_title": "The Courtade\u2013Kumar and Hellinger conjectures",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.LeanBlast.CourtadeKumar.courtadeKumarAndAttainment"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 43,
      "bytes": 327942,
      "packages": [],
      "grade_timeout_sec": 11095,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 251
    },
    {
      "task": "covering-density",
      "challenge": "CoveringDensity",
      "family": "092",
      "family_title": "The optimal order of convex-body covering density",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.CoveringOrder.optimal_order"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 143,
      "bytes": 1760761,
      "packages": [],
      "grade_timeout_sec": 12384,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 762
    },
    {
      "task": "critical-percolation",
      "challenge": "CriticalPercolation",
      "family": "213",
      "family_title": "No infinite critical clusters on quasi-transitive graphs",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CriticalPercolation.BondGraph.no_percolation_at_criticality"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 627,
      "bytes": 2911033,
      "packages": [],
      "grade_timeout_sec": 13419,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1685
    },
    {
      "task": "critical-sk",
      "challenge": "CriticalSK",
      "family": "227",
      "family_title": "The dynamical phase transition in the Sherrington\u2013Kirkpatrick model",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CriticalSK.realized_equilibrium_initial_states",
        "OAI.CriticalSK.covariance_and_linear_tests",
        "OAI.CriticalSK.critical_mixing_lower_bounds"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 890802,
      "packages": [],
      "grade_timeout_sec": 11601,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 322
    },
    {
      "task": "critical-sk-mixing",
      "challenge": "CriticalSKMixing",
      "family": "227",
      "family_title": "The dynamical phase transition in the Sherrington\u2013Kirkpatrick model",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CriticalSK.critical_mixing_bounds"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 593,
      "bytes": 5600145,
      "packages": [],
      "grade_timeout_sec": 15840,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2056
    },
    {
      "task": "critical-strip-mass",
      "challenge": "CriticalStripMass",
      "family": "237",
      "family_title": "The three-quarter diameter exponent for honeycomb walks",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CriticalStrip.critical_strip_mass"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 130,
      "bytes": 2796916,
      "packages": [],
      "grade_timeout_sec": 13317,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1033
    },
    {
      "task": "critical-z3",
      "challenge": "CriticalZ3",
      "family": "213",
      "family_title": "No infinite critical clusters on quasi-transitive graphs",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CriticalZ3.critical_no_infinite"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 461840,
      "packages": [],
      "grade_timeout_sec": 11215,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 230
    },
    {
      "task": "crouzeix-hilbert",
      "challenge": "CrouzeixHilbert",
      "family": "325",
      "family_title": "The complete Crouzeix conjecture",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.CrouzeixHilbert.hilbert"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 90,
      "bytes": 723645,
      "packages": [],
      "grade_timeout_sec": 11451,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 657
    },
    {
      "task": "cubic-torus",
      "challenge": "CubicTorus",
      "family": "354",
      "family_title": "Isoperimetric regions in the cubic three-torus",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.CubicTorus.unit_cubic_isoperimetric"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 162,
      "bytes": 6992456,
      "packages": [],
      "grade_timeout_sec": 17093,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1840
    },
    {
      "task": "cycle-decomposition",
      "challenge": "CycleDecomposition",
      "family": "181",
      "family_title": "The Erd\\H{o}s\u2013Gallai cycle-decomposition conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.ErdosGallai.erdos_gallai"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 998368,
      "packages": [],
      "grade_timeout_sec": 11698,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 295
    },
    {
      "task": "cylinder-covering",
      "challenge": "CylinderCovering",
      "family": "100",
      "family_title": "A counterexample to Bang's cylinder-covering bound",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.CylinderCovering.fourPaperMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 641,
      "bytes": 3013309,
      "packages": [],
      "grade_timeout_sec": 13511,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1626
    },
    {
      "task": "daugavet-moduli",
      "challenge": "DaugavetModuli",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.ExactModuli.exact_main",
        "OAI.ExactModuli.kadets_werner_existence",
        "OAI.ExactModuli.exact_example"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 28,
      "bytes": 201678,
      "packages": [],
      "grade_timeout_sec": 10981,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 230
    },
    {
      "task": "degree-rigidity",
      "challenge": "DegreeRigidity",
      "family": "241",
      "family_title": "Rigidity of the Turing degrees",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.TuringRigidity.ManuscriptMain.rigidity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 974,
      "bytes": 3922761,
      "packages": [],
      "grade_timeout_sec": 14330,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2006
    },
    {
      "task": "deligne-drinfeld",
      "challenge": "DeligneDrinfeld",
      "family": "008",
      "family_title": "The Deligne\u2013Drinfeld conjecture",
      "subject": "Number theory",
      "theorems": [
        "OAI.DeligneDrinfeld.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 21,
      "bytes": 1357966,
      "packages": [],
      "grade_timeout_sec": 12022,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 563
    },
    {
      "task": "depth-five",
      "challenge": "DepthFive",
      "family": "135",
      "family_title": "Sharp homogeneous depth-five complexity of matrix products",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.Problem335.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 164,
      "bytes": 880264,
      "packages": [],
      "grade_timeout_sec": 11592,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 462
    },
    {
      "task": "depth-three",
      "challenge": "DepthThree",
      "family": "112",
      "family_title": "Beyond the square-root exponent for depth-three circuits",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.DepthThreeLowerBound.exists_polynomial_time_language_depth_three_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 175,
      "bytes": 1026594,
      "packages": [],
      "grade_timeout_sec": 11723,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 398
    },
    {
      "task": "diamond-distortion",
      "challenge": "DiamondDistortion",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.DiamondDistortion.headline_all_pairs"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 32,
      "bytes": 472861,
      "packages": [],
      "grade_timeout_sec": 11225,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 268
    },
    {
      "task": "diluted-spin",
      "challenge": "DilutedSpin",
      "family": "221",
      "family_title": "The Mezard\u2013Parisi formula for diluted spin glasses",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.DilutedSpinGlass.mezard_parisi"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 405,
      "bytes": 2760702,
      "packages": [],
      "grade_timeout_sec": 13284,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1199
    },
    {
      "task": "dimension-ten-channel",
      "challenge": "DimensionTenChannel",
      "family": "272",
      "family_title": "Entanglement without secret key and the PPT-square conjecture",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.DimensionTen.exists_channel_fin21"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 148,
      "bytes": 3075057,
      "packages": [],
      "grade_timeout_sec": 13567,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1785
    },
    {
      "task": "dimension-ten-pair",
      "challenge": "DimensionTenPair",
      "family": "272",
      "family_title": "Entanglement without secret key and the PPT-square conjecture",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.DimensionTen.main_pair"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 129,
      "bytes": 2413995,
      "packages": [],
      "grade_timeout_sec": 12972,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1663
    },
    {
      "task": "direct-crouzeix",
      "challenge": "DirectCrouzeix",
      "family": "325",
      "family_title": "The complete Crouzeix conjecture",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.DirectCrouzeix.complete_crouzeix",
        "OAI.DirectCrouzeix.uniform_sharpness"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 42,
      "bytes": 314025,
      "packages": [],
      "grade_timeout_sec": 11082,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 429
    },
    {
      "task": "directed-feedback",
      "challenge": "DirectedFeedback",
      "family": "102",
      "family_title": "The Unique Games Conjecture and optimal approximation thresholds",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.DirectedFeedback.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 224,
      "bytes": 8506385,
      "packages": [],
      "grade_timeout_sec": 18455,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1607
    },
    {
      "task": "directional-ballisticity",
      "challenge": "DirectionalBallisticity",
      "family": "220",
      "family_title": "Directional zero\u2013one laws and ballisticity in random environments",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.DirectionalTransience.directional_transience_implies_ballisticity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 513,
      "bytes": 5012403,
      "packages": [],
      "grade_timeout_sec": 15311,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1803
    },
    {
      "task": "directional-walk",
      "challenge": "DirectionalWalk",
      "family": "220",
      "family_title": "Directional zero\u2013one laws and ballisticity in random environments",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.DirectionalZeroOne.directional_zero_one"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 69,
      "bytes": 951618,
      "packages": [],
      "grade_timeout_sec": 11656,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 459
    },
    {
      "task": "discrete-lipschitz-free",
      "challenge": "DiscreteLipschitzFree",
      "family": "330",
      "family_title": "A negative answer to Kalton's Lipschitz-free approximation question",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.DiscreteFree.source_endpoints"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 32,
      "bytes": 173635,
      "packages": [],
      "grade_timeout_sec": 10956,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 199
    },
    {
      "task": "disk-maximal",
      "challenge": "DiskMaximal",
      "family": "085",
      "family_title": "Endpoint regularity of the planar centered maximal function",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.CenteredDiskEndpoint.main_endpoint"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 30,
      "bytes": 970308,
      "packages": [],
      "grade_timeout_sec": 11673,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 415
    },
    {
      "task": "dixmier",
      "challenge": "Dixmier",
      "family": "251",
      "family_title": "Amenability, unitarizability, and Ulam stability",
      "subject": "Group theory",
      "theorems": [
        "OAI.Dixmier.main_theorem_all_universes"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 32,
      "bytes": 158919,
      "packages": [],
      "grade_timeout_sec": 10943,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 112
    },
    {
      "task": "dixmier-all-discrete",
      "challenge": "DixmierAllDiscrete",
      "family": "251",
      "family_title": "Amenability, unitarizability, and Ulam stability",
      "subject": "Group theory",
      "theorems": [
        "OAI.Dixmier.current_main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 39,
      "bytes": 181502,
      "packages": [],
      "grade_timeout_sec": 10963,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 194
    },
    {
      "task": "doubling-hilbert",
      "challenge": "DoublingHilbert",
      "family": "098",
      "family_title": "A negative answer to the Lang\u2013Plaut problem",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.DoublingHilbert.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 12,
      "bytes": 157722,
      "packages": [],
      "grade_timeout_sec": 10941,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 179
    },
    {
      "task": "dutta-domain",
      "challenge": "DuttaDomain",
      "family": "194",
      "family_title": "Lech's multiplicity conjecture",
      "subject": "Algebra",
      "theorems": [
        "OAI.Lech.dutta_domain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 278,
      "bytes": 2409516,
      "packages": [],
      "grade_timeout_sec": 12968,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1966
    },
    {
      "task": "dyadic-avoidance",
      "challenge": "DyadicAvoidance",
      "family": "084",
      "family_title": "The geometric case of the Erd\\H{o}s similarity conjecture",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.Problem310.dyadic_affine_avoidance"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 75,
      "bytes": 369234,
      "packages": [],
      "grade_timeout_sec": 11132,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 198
    },
    {
      "task": "edit-approximation",
      "challenge": "EditApproximation",
      "family": "121",
      "family_title": "Almost-linear expected-time approximation of edit distance",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.EditApproximation.almostLinearEditDistanceRawBand"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1024,
      "bytes": 7591774,
      "packages": [],
      "grade_timeout_sec": 17632,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2717
    },
    {
      "task": "edit-distance",
      "challenge": "EditDistance",
      "family": "099",
      "family_title": "The sharp distortion of edit distance into $\\ell_1$",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.edit_distance_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 46,
      "bytes": 1686015,
      "packages": [],
      "grade_timeout_sec": 12317,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 320
    },
    {
      "task": "egyptian-fractions",
      "challenge": "EgyptianFractions",
      "family": "025",
      "family_title": "Erd\\H{o}s\u2019s short Egyptian-fraction conjecture",
      "subject": "Number theory",
      "theorems": [
        "OAI.Problem337.egyptian_length_is_minimum",
        "OAI.Problem337.main_double_log_order",
        "OAI.Problem337.one_expansions_finite_and_bounded",
        "OAI.Problem337.counting_double_log_order",
        "OAI.Problem337.exact_marker_padding",
        "OAI.Problem337.every_exact_marker_occurs",
        "OAI.Problem337.quantitative_marked_length",
        "OAI.Problem337.missing_denominator_semantics",
        "OAI.Problem337.prescribed_denominator_corollary"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 290,
      "bytes": 1625178,
      "packages": [],
      "grade_timeout_sec": 12262,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 832
    },
    {
      "task": "eilenberg-ganea",
      "challenge": "EilenbergGanea",
      "family": "249",
      "family_title": "A finitely generated counterexample to Eilenberg\u2013Ganea",
      "subject": "Group theory",
      "theorems": [
        "OAI.EilenbergGanea.source_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 40,
      "bytes": 1718355,
      "packages": [],
      "grade_timeout_sec": 12346,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 3411
    },
    {
      "task": "elasticity-uniqueness",
      "challenge": "ElasticityUniqueness",
      "family": "372",
      "family_title": "Global uniqueness in smooth isotropic elasticity",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.Elasticity.global_uniqueness"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 42,
      "bytes": 1608239,
      "packages": [],
      "grade_timeout_sec": 12247,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 755
    },
    {
      "task": "elementary-positivity",
      "challenge": "ElementaryPositivity",
      "family": "169",
      "family_title": "The Shareshian\u2013Wachs $e$-positivity conjecture",
      "subject": "Combinatorics",
      "theorems": [],
      "definition_holes": [
        "OAI.elementaryPositivityWitness"
      ],
      "fixed_definitions": [],
      "n_modules": 549,
      "bytes": 3473360,
      "packages": [],
      "grade_timeout_sec": 13926,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2005
    },
    {
      "task": "entangled-games",
      "challenge": "EntangledGames",
      "family": "277",
      "family_title": "Threshold repetition for entangled games",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.ThresholdParallelRepetition.threshold_parallel_repetition"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 30,
      "bytes": 354352,
      "packages": [],
      "grade_timeout_sec": 11118,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 276
    },
    {
      "task": "entropy-photon-number",
      "challenge": "EntropyPhotonNumber",
      "family": "273",
      "family_title": "The entropy photon-number inequality",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.EntropyPhotonNumber.entropy_photon_number_inequality"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 26,
      "bytes": 1401086,
      "packages": [],
      "grade_timeout_sec": 12060,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 517
    },
    {
      "task": "euclidean-five-color",
      "challenge": "EuclideanFiveColor",
      "family": "158",
      "family_title": "The Euclidean plane cannot be colored with five colors",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanFiveColor.no_proper_five_coloring"
      ],
      "definition_holes": [],
      "fixed_definitions": [
        "OAI.EuclideanFiveColor.ProperColoring"
      ],
      "n_modules": 70,
      "bytes": 1548431,
      "packages": [],
      "grade_timeout_sec": 12193,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 597
    },
    {
      "task": "euclidean-ramsey",
      "challenge": "EuclideanRamsey",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanRamsey.classification"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 28,
      "bytes": 288245,
      "packages": [],
      "grade_timeout_sec": 11059,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 303
    },
    {
      "task": "euclidean-ramsey-circle",
      "challenge": "EuclideanRamseyCircle",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanRamsey.CircleConsequence.at_most_five_circle_points_ramsey"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 318701,
      "packages": [],
      "grade_timeout_sec": 11086,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 304
    },
    {
      "task": "euclidean-ramsey-nine",
      "challenge": "EuclideanRamseyNine",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanRamsey.NineStatement.nine_circle_configuration"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 16,
      "bytes": 77180,
      "packages": [],
      "grade_timeout_sec": 10869,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 137
    },
    {
      "task": "euclidean-ramsey-quadratic",
      "challenge": "EuclideanRamseyQuadratic",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanRamsey.spherical_quadraticIndependent_ramsey_all"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 29,
      "bytes": 299442,
      "packages": [],
      "grade_timeout_sec": 11069,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 297
    },
    {
      "task": "euclidean-ramsey-spherical",
      "challenge": "EuclideanRamseySpherical",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanRamsey.ramsey_cospherical"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 294907,
      "packages": [],
      "grade_timeout_sec": 11065,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 222
    },
    {
      "task": "euclidean-ramsey-transitive",
      "challenge": "EuclideanRamseyTransitive",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.EuclideanRamsey.TransitiveConsequence.subset_of_finite_transitive_ramsey"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 29,
      "bytes": 294470,
      "packages": [],
      "grade_timeout_sec": 11065,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 352
    },
    {
      "task": "even-barker",
      "challenge": "EvenBarker",
      "family": "179",
      "family_title": "The circulant Hadamard conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.CirculantHadamard.Barker.even_length_eq_two_or_four"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 73,
      "bytes": 410340,
      "packages": [],
      "grade_timeout_sec": 11169,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 251
    },
    {
      "task": "exact-fourier",
      "challenge": "ExactFourier",
      "family": "130",
      "family_title": "Fourier transforms below $n\\log n$",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.ExactFourier.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 848415,
      "packages": [],
      "grade_timeout_sec": 11563,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 480
    },
    {
      "task": "exact-infiniteness",
      "challenge": "ExactInfiniteness",
      "family": "303",
      "family_title": "From ordinary to strong pure infiniteness",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.WeakPureInfiniteness.exact_weaklyPurelyInfinite_individuallyProperlyInfinite_any",
        "OAI.WeakPureInfiniteness.exact_weaklyPurelyInfinite_stronglyPurelyInfinite"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1012,
      "bytes": 6724441,
      "packages": [],
      "grade_timeout_sec": 16851,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 4325
    },
    {
      "task": "exact-quantum-factoring",
      "challenge": "ExactQuantumFactoring",
      "family": "279",
      "family_title": "Exact quantum factoring over a fixed finite gate set",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.ExactQuantumFactoring.exact_quantum_factoring"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 546,
      "bytes": 2420616,
      "packages": [],
      "grade_timeout_sec": 12978,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1235
    },
    {
      "task": "fkcrt",
      "challenge": "FKCRT",
      "family": "211",
      "family_title": "Geometry, diffusion, and spectra of random planar maps",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.FKCRT.finite_fk_maps_converge_to_brownian_crt"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 61,
      "bytes": 1877777,
      "packages": [],
      "grade_timeout_sec": 12489,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 489
    },
    {
      "task": "factor-generation",
      "challenge": "FactorGeneration",
      "family": "296",
      "family_title": "The generator problem for finite factors",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.Generator.single_generation_of_II1_separable_predual"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 93,
      "bytes": 1679659,
      "packages": [],
      "grade_timeout_sec": 12311,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2800
    },
    {
      "task": "falconer-all-dimensions",
      "challenge": "FalconerAllDimensions",
      "family": "073",
      "family_title": "The Falconer distance conjecture",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.Falconer.falconer_distance_conjecture"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 2384,
      "bytes": 8957826,
      "packages": [],
      "grade_timeout_sec": 18862,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 5233
    },
    {
      "task": "filling-coefficient",
      "challenge": "FillingCoefficient",
      "family": "337",
      "family_title": "Cartan\u2013Hadamard isoperimetry and CAT$(0)$ fillings",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.SharpIntegralFillings.coefficient_optimal"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 112,
      "bytes": 696670,
      "packages": [],
      "grade_timeout_sec": 11427,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 480
    },
    {
      "task": "finite-circle",
      "challenge": "FiniteCircle",
      "family": "099",
      "family_title": "The sharp distortion of edit distance into $\\ell_1$",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.finiteCircle_fullMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 36,
      "bytes": 458380,
      "packages": [],
      "grade_timeout_sec": 11212,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 285
    },
    {
      "task": "finite-congruence-graph",
      "challenge": "FiniteCongruenceGraph",
      "family": "206",
      "family_title": "Finite lattice representation: counterexamples and undecidability",
      "subject": "Algebra",
      "theorems": [
        "OAI.FiniteCongruence.graph_criterion"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 2,
      "bytes": 22706,
      "packages": [],
      "grade_timeout_sec": 10820,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 19
    },
    {
      "task": "finite-entropy-separation",
      "challenge": "FiniteEntropySeparation",
      "family": "298",
      "family_title": "A counterexample to Voiculescu\u2019s free-entropy equality conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.FiniteEntropySeparation.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 153,
      "bytes": 786027,
      "packages": [],
      "grade_timeout_sec": 11507,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1014
    },
    {
      "task": "finite-factor",
      "challenge": "FiniteFactor",
      "family": "293",
      "family_title": "A counterexample to the hyperinvariant-subspace problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.FiniteFactor.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 271,
      "bytes": 1113695,
      "packages": [],
      "grade_timeout_sec": 11802,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 745
    },
    {
      "task": "finitistic-asymmetry",
      "challenge": "FinitisticAsymmetry",
      "family": "198",
      "family_title": "A counterexample to the little finitistic-dimension conjecture",
      "subject": "Algebra",
      "theorems": [
        "OAI.LittleFinitistic.extreme_left_right_asymmetry"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 588,
      "bytes": 2251227,
      "packages": [],
      "grade_timeout_sec": 12826,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1462
    },
    {
      "task": "fixed-clause-threshold",
      "challenge": "FixedClauseThreshold",
      "family": "235",
      "family_title": "Random-SAT thresholds, sharp variance and computability",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.FixedClauseThreshold.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 15,
      "bytes": 215586,
      "packages": [],
      "grade_timeout_sec": 10994,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 145
    },
    {
      "task": "forced-navier-stokes-computation",
      "challenge": "ForcedNavierStokesComputation",
      "family": "376",
      "family_title": "Universal computation in forced Navier\u2013Stokes flows",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.BalancedTransport.balanced_three_stack_realization"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 60,
      "bytes": 495983,
      "packages": [],
      "grade_timeout_sec": 11246,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 302
    },
    {
      "task": "forest-space",
      "challenge": "ForestSpace",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.ForestSpace.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 20,
      "bytes": 195404,
      "packages": [],
      "grade_timeout_sec": 10975,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 175
    },
    {
      "task": "formula-hitting",
      "challenge": "FormulaHitting",
      "family": "116",
      "family_title": "Uniform identity testing for noncommutative formulas",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.NCHitting.universal_hitting"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 24,
      "bytes": 123728,
      "packages": [],
      "grade_timeout_sec": 10911,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 63
    },
    {
      "task": "foulkes-howe",
      "challenge": "FoulkesHowe",
      "family": "210",
      "family_title": "Foulkes\u2019 conjecture for sixth powers and quadratic stabilization",
      "subject": "Algebra",
      "theorems": [
        "OAI.Problem346.canonical_foulkes_howe_surjective"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 63,
      "bytes": 197207,
      "packages": [],
      "grade_timeout_sec": 10977,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 276
    },
    {
      "task": "four-row-permanent",
      "challenge": "FourRowPermanent",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.FourRow.robust_permanent"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 5,
      "bytes": 24646,
      "packages": [],
      "grade_timeout_sec": 10822,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 90
    },
    {
      "task": "free-ising",
      "challenge": "FreeIsing",
      "family": "236",
      "family_title": "The factor-of-IID threshold for free Ising states on trees",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.Problem367.free_ising_factor_iff_threshold"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 891,
      "bytes": 5530584,
      "packages": [],
      "grade_timeout_sec": 15777,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2094
    },
    {
      "task": "free-uniform-spanning-forest",
      "challenge": "FreeUniformSpanningForest",
      "family": "231",
      "family_title": "The free uniform spanning forest is a factor of IID",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.Problem336.fusf_is_factor_iid"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 224,
      "bytes": 1069516,
      "packages": [],
      "grade_timeout_sec": 11762,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 624
    },
    {
      "task": "gamma-passage",
      "challenge": "GammaPassage",
      "family": "212",
      "family_title": "No bigeodesics and smooth limit shapes in planar first-passage percolation",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.GammaFPP.gamma_differentiability"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 203,
      "bytes": 947238,
      "packages": [],
      "grade_timeout_sec": 11652,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 466
    },
    {
      "task": "gaussian-finite-entropy",
      "challenge": "GaussianFiniteEntropy",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.RepeatedLocalization.FiniteEntropy.finite_expected_regularization"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 15,
      "bytes": 116875,
      "packages": [],
      "grade_timeout_sec": 10905,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 165
    },
    {
      "task": "gaussian-information",
      "challenge": "GaussianInformation",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.RepeatedLocalization.repeated_localization",
        "OAI.AllScaleInverseVolume.inverse_volume_without_support",
        "OAI.KernelPotential.kernel_coercivity",
        "OAI.KernelPotential.actual_row_drift"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 111,
      "bytes": 782263,
      "packages": [],
      "grade_timeout_sec": 11504,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 572
    },
    {
      "task": "gaussian-moat",
      "challenge": "GaussianMoat",
      "family": "028",
      "family_title": "The Gaussian moat conjecture",
      "subject": "Number theory",
      "theorems": [
        "OAI.GaussianMoat.fullMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 41,
      "bytes": 598190,
      "packages": [],
      "grade_timeout_sec": 11338,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 422
    },
    {
      "task": "gaussian-propeller",
      "challenge": "GaussianPropeller",
      "family": "096",
      "family_title": "The Gaussian propeller conjecture",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.GaussianPropeller.all_partitions"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 583488,
      "packages": [],
      "grade_timeout_sec": 11325,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 496
    },
    {
      "task": "gaussian-replacement",
      "challenge": "GaussianReplacement",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.CurrentProjection.mixedMomentMain",
        "OAI.CurrentProjection.actualRowMain",
        "OAI.CurrentProjection.actualRowRefinement",
        "OAI.CurrentProjection.actualRowSourceMain",
        "OAI.CurrentProjection.actualRowSourceRefinement",
        "OAI.CurrentProjection.criticalComparisonMain",
        "OAI.CurrentProjection.oneLevelComparisonMain",
        "OAI.CurrentProjection.twoLabelComparisonMain",
        "OAI.CurrentProjection.hybridBlockMain",
        "OAI.CurrentProjection.fiberTwoPointMain",
        "OAI.CurrentProjection.fiberBlockMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 760043,
      "packages": [],
      "grade_timeout_sec": 11484,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 486
    },
    {
      "task": "general-mahler",
      "challenge": "GeneralMahler",
      "family": "087",
      "family_title": "The Mahler conjectures and symplectic width",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.GeneralMahler.general_mahler"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 302,
      "bytes": 2142572,
      "packages": [],
      "grade_timeout_sec": 12728,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 5721
    },
    {
      "task": "generalized-star-height",
      "challenge": "GeneralizedStarHeight",
      "family": "134",
      "family_title": "Generalized star height at most three",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.GeneralizedStarHeight.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 37,
      "bytes": 522626,
      "packages": [],
      "grade_timeout_sec": 11270,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 235
    },
    {
      "task": "gotsman-linial",
      "challenge": "GotsmanLinial",
      "family": "127",
      "family_title": "The asymptotic Gotsman\u2013Linial conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.LeanBlast.GotsmanLinial.gotsmanLinialStatement"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 22,
      "bytes": 172016,
      "packages": [],
      "grade_timeout_sec": 10954,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 72
    },
    {
      "task": "graham-spherical",
      "challenge": "GrahamSpherical",
      "family": "172",
      "family_title": "Classification of finite Euclidean Ramsey configurations",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.GrahamSpherical.full_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 18,
      "bytes": 38396,
      "packages": [],
      "grade_timeout_sec": 10834,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 92
    },
    {
      "task": "grothendieck-elementary-expansion",
      "challenge": "GrothendieckElementaryExpansion",
      "family": "312",
      "family_title": "The Grothendieck homotopy hypothesis",
      "subject": "Topology",
      "theorems": [
        "OAI.Grothendieck.elementary_expansion"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 58,
      "bytes": 580875,
      "packages": [],
      "grade_timeout_sec": 11322,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 436
    },
    {
      "task": "group-ring-determinant",
      "challenge": "GroupRingDeterminant",
      "family": "197",
      "family_title": "Nonsofic groups and group-ring counterexamples",
      "subject": "Algebra",
      "theorems": [
        "OAI.GroupRingDeterminant.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 155,
      "bytes": 680917,
      "packages": [],
      "grade_timeout_sec": 11412,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 788
    },
    {
      "task": "hadamard-cube-fiber",
      "challenge": "HadamardCubeFiber",
      "family": "266",
      "family_title": "Exactly three mutually unbiased bases in dimension six",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.HadamardSix.rowRatio_cubeFiber_sum_zero"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 6,
      "bytes": 39551,
      "packages": [],
      "grade_timeout_sec": 10835,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 64
    },
    {
      "task": "halving-lines",
      "challenge": "HalvingLines",
      "family": "183",
      "family_title": "Power savings for planar halving lines and $k$-sets",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.PlanarHalving.power_bounds"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 886978,
      "packages": [],
      "grade_timeout_sec": 11598,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 410
    },
    {
      "task": "hard-sphere",
      "challenge": "HardSphere",
      "family": "267",
      "family_title": "Positive-temperature Bose\u2013Einstein condensation and quantum depletion",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.HardSphere.condensation_with_mixed"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 466,
      "bytes": 3471981,
      "packages": [],
      "grade_timeout_sec": 13924,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1832
    },
    {
      "task": "harmonic-artin",
      "challenge": "HarmonicArtin",
      "family": "254",
      "family_title": "Classifying spaces and geometric obstructions for Artin groups",
      "subject": "Group theory",
      "theorems": [
        "OAI.HarmonicArtin.salvetti_cover_contractible"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 660,
      "bytes": 2801461,
      "packages": [],
      "grade_timeout_sec": 13321,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1678
    },
    {
      "task": "harmonic-growth",
      "challenge": "HarmonicGrowth",
      "family": "361",
      "family_title": "Counterexamples to Yau's harmonic dimension bound",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.HarmonicCounterexample.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 36,
      "bytes": 1683568,
      "packages": [],
      "grade_timeout_sec": 12315,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 799
    },
    {
      "task": "heilbronn-triangle",
      "challenge": "HeilbronnTriangle",
      "family": "191",
      "family_title": "A power improvement in the Heilbronn triangle problem",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Problem355.heilbronn_power_lower_bound",
        "OAI.Problem355.almost_n_minus_two_refuted"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 195,
      "bytes": 1015459,
      "packages": [],
      "grade_timeout_sec": 11713,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 640
    },
    {
      "task": "heisenberg",
      "challenge": "Heisenberg",
      "family": "271",
      "family_title": "Bloch's law and spontaneous ferromagnetic order",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.Heisenberg.spontaneous_magnetization"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 128,
      "bytes": 1109282,
      "packages": [],
      "grade_timeout_sec": 11798,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1106
    },
    {
      "task": "henon-emden",
      "challenge": "HenonEmden",
      "family": "370",
      "family_title": "The subcritical Lane\u2013Emden and Henon\u2013Lane\u2013Emden conjectures",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.HenonLaneEmden.main_nonexistence"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 96,
      "bytes": 645822,
      "packages": [],
      "grade_timeout_sec": 11381,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 584
    },
    {
      "task": "hilbert-crouzeix",
      "challenge": "HilbertCrouzeix",
      "family": "325",
      "family_title": "The complete Crouzeix conjecture",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.HilbertCrouzeix.numericalClosure_geometry",
        "OAI.HilbertCrouzeix.exists_finite_compression",
        "OAI.HilbertCrouzeix.rational_denominator_isUnit",
        "OAI.HilbertCrouzeix.zeroConclusion"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 7,
      "bytes": 36730,
      "packages": [],
      "grade_timeout_sec": 10833,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 136
    },
    {
      "task": "honeycomb-bridge-finiteness",
      "challenge": "HoneycombBridgeFiniteness",
      "family": "237",
      "family_title": "The three-quarter diameter exponent for honeycomb walks",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.PolynomialVacuumBridge.Corridor.finite_bridge_sums"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 43,
      "bytes": 322795,
      "packages": [],
      "grade_timeout_sec": 11090,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 192
    },
    {
      "task": "honeycomb-free-energy",
      "challenge": "HoneycombFreeEnergy",
      "family": "237",
      "family_title": "The three-quarter diameter exponent for honeycomb walks",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.HoneycombForce.logPartition_tendsto"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1,
      "bytes": 41826,
      "packages": [],
      "grade_timeout_sec": 10837,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 51
    },
    {
      "task": "hot-spots",
      "challenge": "HotSpots",
      "family": "369",
      "family_title": "The hot spots conjecture for simply connected planar domains",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.StrictHotSpots.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 1382075,
      "packages": [],
      "grade_timeout_sec": 12043,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 578
    },
    {
      "task": "hyperbolic-cones",
      "challenge": "HyperbolicCones",
      "family": "095",
      "family_title": "Hyperbolicity cones without semidefinite lifts",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.Paper256.main_result"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 86,
      "bytes": 217979,
      "packages": [],
      "grade_timeout_sec": 10996,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 350
    },
    {
      "task": "hyperbolic-obstruction",
      "challenge": "HyperbolicObstruction",
      "family": "257",
      "family_title": "A hyperbolic group with no geometric CAT(0) action",
      "subject": "Group theory",
      "theorems": [
        "OAI.HyperbolicObstruction.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 417,
      "bytes": 2430541,
      "packages": [],
      "grade_timeout_sec": 12987,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1278
    },
    {
      "task": "hyperinvariant-subspaces",
      "challenge": "HyperinvariantSubspaces",
      "family": "293",
      "family_title": "A counterexample to the hyperinvariant-subspace problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.Hyperinvariant.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 277,
      "bytes": 1129103,
      "packages": [],
      "grade_timeout_sec": 11816,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 870
    },
    {
      "task": "independent-products",
      "challenge": "IndependentProducts",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.IndependentProducts.main_general",
        "OAI.IndependentProducts.main_exponential",
        "OAI.IndependentProducts.main_gaussian_24",
        "OAI.IndependentProducts.main_gaussian_12"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 22,
      "bytes": 178152,
      "packages": [],
      "grade_timeout_sec": 10960,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 250
    },
    {
      "task": "independent-sets",
      "challenge": "IndependentSets",
      "family": "106",
      "family_title": "Hardness of coloring three-colorable graphs",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.LargeIndependentSets.mainTheoremReal"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 454,
      "bytes": 4478613,
      "packages": [],
      "grade_timeout_sec": 14830,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1204
    },
    {
      "task": "individual-strong-infiniteness",
      "challenge": "IndividualStrongInfiniteness",
      "family": "303",
      "family_title": "From ordinary to strong pure infiniteness",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.MainGap.Manuscript.individual_to_strong_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 25,
      "bytes": 283030,
      "packages": [],
      "grade_timeout_sec": 11054,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 355
    },
    {
      "task": "infinite-matroid",
      "challenge": "InfiniteMatroid",
      "family": "185",
      "family_title": "Counterexamples to infinite matroid intersection and packing/covering",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.InfiniteMatroidCounterexample.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 25,
      "bytes": 174500,
      "packages": [],
      "grade_timeout_sec": 10957,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 111
    },
    {
      "task": "infinite-matroid-corollaries",
      "challenge": "InfiniteMatroidCorollaries",
      "family": "185",
      "family_title": "Counterexamples to infinite matroid intersection and packing/covering",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.InfiniteMatroidCounterexample.partitional_intersection_counterexample",
        "OAI.InfiniteMatroidCounterexample.separate_covering_packing_counterexamples"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 33,
      "bytes": 193312,
      "packages": [],
      "grade_timeout_sec": 10973,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 155
    },
    {
      "task": "interpolated-factors",
      "challenge": "InterpolatedFactors",
      "family": "287",
      "family_title": "All nonabelian free group factors are isomorphic",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.FreeGroupFactorMain.Interpolation.allInterpolatedIsomorphic"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 77,
      "bytes": 1249281,
      "packages": [],
      "grade_timeout_sec": 11924,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1361
    },
    {
      "task": "invariant-ising",
      "challenge": "InvariantIsing",
      "family": "234",
      "family_title": "All-temperature pressure for orthogonally invariant Ising spin glasses",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.InvariantIsing.limiting_pressure_of_extreme_limits_unconditional",
        "OAI.InvariantIsing.limiting_wasserstein_field_pressure_of_extreme_limits_unconditional",
        "OAI.InvariantIsing.positive_temperature_pressure_unconditional",
        "OAI.InvariantIsing.ground_state_limit_unconditional",
        "OAI.InvariantIsing.random_pressure_tendsto_in_measure_unconditional",
        "OAI.InvariantIsing.random_pressure_limit_unconditional",
        "OAI.InvariantIsing.random_pressure_tendsto_ae_unconditional",
        "OAI.InvariantIsing.random_field_pressure_tendsto_ae_unconditional",
        "OAI.InvariantIsing.gaussianPattern_pressure_limit_unconditional",
        "OAI.InvariantIsing.gaussianPattern_ground_limit_unconditional",
        "OAI.InvariantIsing.gaussianPattern_norm_limits_unconditional"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 2123,
      "bytes": 10537287,
      "packages": [],
      "grade_timeout_sec": 20283,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 5030
    },
    {
      "task": "irrational-rotation",
      "challenge": "IrrationalRotation",
      "family": "293",
      "family_title": "A counterexample to the hyperinvariant-subspace problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.Invariant233.Results.prescribed_irrational_counterexample",
        "OAI.Invariant233.Results.product_realization"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 735,
      "bytes": 3645017,
      "packages": [],
      "grade_timeout_sec": 14080,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2128
    },
    {
      "task": "irrational-triangle-billiard",
      "challenge": "IrrationalTriangleBilliard",
      "family": "150",
      "family_title": "Weak mixing of irrational triangular billiards",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.TriangularBilliards.irrational_triangle_billiard"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 39,
      "bytes": 594085,
      "packages": [],
      "grade_timeout_sec": 11334,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 347
    },
    {
      "task": "ising-finiteness",
      "challenge": "IsingFiniteness",
      "family": "222",
      "family_title": "Perceptron free energies and microscopic jamming",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.IsingPerceptron.variationalValue_real_of_continuous"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 45,
      "bytes": 1494396,
      "packages": [],
      "grade_timeout_sec": 12144,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 327
    },
    {
      "task": "isometric-immersion",
      "challenge": "IsometricImmersion",
      "family": "334",
      "family_title": "A smooth surface metric with no local immersion in $\\mathbb R^3$",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.SmoothLocal.Geometry.exists_local_metric_without_local_immersion"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 446,
      "bytes": 2824652,
      "packages": [],
      "grade_timeout_sec": 13342,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 698
    },
    {
      "task": "kl-invariance",
      "challenge": "KLInvariance",
      "family": "168",
      "family_title": "Combinatorial invariance of Kazhdan\u2013Lusztig polynomials",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.KLInvariance.combinatorial_invariance"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 1831275,
      "packages": [],
      "grade_timeout_sec": 12448,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1231
    },
    {
      "task": "k-median-recovery",
      "challenge": "KMedianRecovery",
      "family": "125",
      "family_title": "The approximation threshold for metric $k$-median",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MetricKMedianRecovery.global_application"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 506,
      "bytes": 3720803,
      "packages": [],
      "grade_timeout_sec": 14148,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1418
    },
    {
      "task": "k-median-refined-recovery",
      "challenge": "KMedianRefinedRecovery",
      "family": "125",
      "family_title": "The approximation threshold for metric $k$-median",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MetricKMedianRecovery.RefinedRecovery.refined_recovery"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 586,
      "bytes": 2580016,
      "packages": [],
      "grade_timeout_sec": 13122,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1462
    },
    {
      "task": "k-median-threshold",
      "challenge": "KMedianThreshold",
      "family": "125",
      "family_title": "The approximation threshold for metric $k$-median",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MetricKMedian.threshold"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 765,
      "bytes": 3236997,
      "packages": [],
      "grade_timeout_sec": 13713,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2180
    },
    {
      "task": "k-server",
      "challenge": "KServer",
      "family": "110",
      "family_title": "Optimal-order randomized $k$-server on arbitrary metrics",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.KServer.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [
        "OAI.KServer.Configuration",
        "OAI.KServer.LabelDistribution",
        "OAI.KServer.Policy",
        "OAI.KServer.serve",
        "OAI.KServer.serviceCost",
        "OAI.KServer.pathProbability",
        "OAI.KServer.expectedCost",
        "OAI.KServer.optimalCost",
        "OAI.KServer.MainStatement"
      ],
      "n_modules": 37,
      "bytes": 1783312,
      "packages": [],
      "grade_timeout_sec": 12404,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 322
    },
    {
      "task": "kadison-ringrose",
      "challenge": "KadisonRingrose",
      "family": "295",
      "family_title": "The Kadison\u2013Ringrose cohomology conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.BoundedHochschild.KadisonRingrose.main_result"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 372,
      "bytes": 2793925,
      "packages": [],
      "grade_timeout_sec": 13314,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1426
    },
    {
      "task": "kadison-similarity",
      "challenge": "KadisonSimilarity",
      "family": "288",
      "family_title": "Kadison's similarity conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.KadisonSimilarity.universalCommutatorTheorem",
        "OAI.KadisonSimilarity.universalHyperreflexivity",
        "OAI.KadisonSimilarity.similarityTheorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 816,
      "bytes": 5791602,
      "packages": [],
      "grade_timeout_sec": 16012,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 4111
    },
    {
      "task": "kahler-splitting",
      "challenge": "KahlerSplitting",
      "family": "052",
      "family_title": "Tangent-bundle splittings and universal covers",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.UniversalCoverSplitting.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 46,
      "bytes": 726796,
      "packages": [],
      "grade_timeout_sec": 11454,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 468
    },
    {
      "task": "kaplansky-direct-finiteness",
      "challenge": "KaplanskyDirectFiniteness",
      "family": "197",
      "family_title": "Nonsofic groups and group-ring counterexamples",
      "subject": "Algebra",
      "theorems": [
        "OAI.KaplanskyCounterexample.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 121,
      "bytes": 544294,
      "packages": [],
      "grade_timeout_sec": 11289,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 704
    },
    {
      "task": "kaplansky-finitely-presented",
      "challenge": "KaplanskyFinitelyPresented",
      "family": "197",
      "family_title": "Nonsofic groups and group-ring counterexamples",
      "subject": "Algebra",
      "theorems": [
        "OAI.KaplanskyCounterexample.finitelyPresented_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 126,
      "bytes": 556097,
      "packages": [],
      "grade_timeout_sec": 11300,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 723
    },
    {
      "task": "kaplansky-quasitrace",
      "challenge": "KaplanskyQuasitrace",
      "family": "294",
      "family_title": "A counterexample to Kaplansky's quasitrace conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.Kaplansky.kaplansky_quasitrace_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 123,
      "bytes": 1501004,
      "packages": [],
      "grade_timeout_sec": 12150,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 492
    },
    {
      "task": "kaplansky-stable-finiteness",
      "challenge": "KaplanskyStableFiniteness",
      "family": "294",
      "family_title": "A counterexample to Kaplansky's quasitrace conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.KaplanskyConsequences.stable_finiteness_bundle"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 181,
      "bytes": 1739197,
      "packages": [],
      "grade_timeout_sec": 12365,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 720
    },
    {
      "task": "kervaire",
      "challenge": "Kervaire",
      "family": "256",
      "family_title": "Howie's conjecture on equations over groups",
      "subject": "Group theory",
      "theorems": [
        "OAI.Kervaire.coefficient_injective"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 508441,
      "packages": [],
      "grade_timeout_sec": 11257,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 506
    },
    {
      "task": "laughlin",
      "challenge": "Laughlin",
      "family": "269",
      "family_title": "The Laughlin gap and stability under scalar disorder",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.Laughlin.mainTarget_proved"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1258,
      "bytes": 2971285,
      "packages": [],
      "grade_timeout_sec": 13474,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 6435
    },
    {
      "task": "laughlin-fock",
      "challenge": "LaughlinFock",
      "family": "269",
      "family_title": "The Laughlin gap and stability under scalar disorder",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.LaughlinFock.thm_fock"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 293,
      "bytes": 8419306,
      "packages": [],
      "grade_timeout_sec": 18377,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 6157
    },
    {
      "task": "laughlin-gap",
      "challenge": "LaughlinGap",
      "family": "269",
      "family_title": "The Laughlin gap and stability under scalar disorder",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.LaughlinGap.thm_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 106,
      "bytes": 2339387,
      "packages": [],
      "grade_timeout_sec": 12905,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 4594
    },
    {
      "task": "laughlin-planar",
      "challenge": "LaughlinPlanar",
      "family": "269",
      "family_title": "The Laughlin gap and stability under scalar disorder",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.Laughlin.planar_gap"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1279,
      "bytes": 3060235,
      "packages": [],
      "grade_timeout_sec": 13554,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 5977
    },
    {
      "task": "lieb-thirring",
      "challenge": "LiebThirring",
      "family": "262",
      "family_title": "Sharp one-dimensional Lieb\u2013Thirring inequalities",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.SharpLiebThirring.sharp_lieb_thirring"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 38,
      "bytes": 654331,
      "packages": [],
      "grade_timeout_sec": 11388,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 478
    },
    {
      "task": "lipschitz-equivalence",
      "challenge": "LipschitzEquivalence",
      "family": "324",
      "family_title": "Lipschitz equivalence without linear isomorphism",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.LipschitzCounterexample.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 60,
      "bytes": 475733,
      "packages": [],
      "grade_timeout_sec": 11228,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 460
    },
    {
      "task": "lipschitz-hilbert",
      "challenge": "LipschitzHilbert",
      "family": "083",
      "family_title": "Stein's conjecture for Hilbert transforms along Lipschitz directions",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.LipschitzHilbert.main",
        "OAI.LipschitzHilbert.uniform_truncation"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1910,
      "bytes": 9262948,
      "packages": [],
      "grade_timeout_sec": 19136,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2873
    },
    {
      "task": "list-hadwiger",
      "challenge": "ListHadwiger",
      "family": "157",
      "family_title": "Counterexamples to the Hadwiger and Colin de Verdiere conjectures",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.LinearListHadwiger.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 53,
      "bytes": 902720,
      "packages": [],
      "grade_timeout_sec": 11612,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 402
    },
    {
      "task": "little-finitistic",
      "challenge": "LittleFinitistic",
      "family": "198",
      "family_title": "A counterexample to the little finitistic-dimension conjecture",
      "subject": "Algebra",
      "theorems": [
        "OAI.LittleFinitistic.Main.exists_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 546,
      "bytes": 2050368,
      "packages": [],
      "grade_timeout_sec": 12645,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1382
    },
    {
      "task": "littlewood-finite-flatness",
      "challenge": "LittlewoodFiniteFlatness",
      "family": "076",
      "family_title": "Ultraflat real Littlewood polynomials",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.AsymptoticallyMinimalLittlewoodFiniteFlatness.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 28,
      "bytes": 449707,
      "packages": [],
      "grade_timeout_sec": 11204,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 316
    },
    {
      "task": "log-brunn-minkowski",
      "challenge": "LogBrunnMinkowski",
      "family": "091",
      "family_title": "The logarithmic Brunn\u2013Minkowski conjecture",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.LogBrunnMinkowski.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1,
      "bytes": 1228745,
      "packages": [],
      "grade_timeout_sec": 11905,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 432
    },
    {
      "task": "log-concave-query",
      "challenge": "LogConcaveQuery",
      "family": "139",
      "family_title": "Subpolynomial queries for log-concave sampling",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.LogConcaveSampling.exact_source_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 326,
      "bytes": 3000883,
      "packages": [],
      "grade_timeout_sec": 13500,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1273
    },
    {
      "task": "log-kodaira-fiber-negative",
      "challenge": "LogKodairaFiberNegative",
      "family": "033",
      "family_title": "Campana's orbifold Iitaka conjecture and logarithmic subadditivity",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.ReverseLogKodaira.SmoothProjectiveVariety.veryGenerally_fiber_negative_branch"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 14,
      "bytes": 176794,
      "packages": [],
      "grade_timeout_sec": 10959,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 296
    },
    {
      "task": "mahler-conjecture",
      "challenge": "MahlerConjecture",
      "family": "087",
      "family_title": "The Mahler conjectures and symplectic width",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.SymmetricMahler.symmetric_mahler"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 229,
      "bytes": 995887,
      "packages": [],
      "grade_timeout_sec": 11696,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 514
    },
    {
      "task": "markov-type",
      "challenge": "MarkovType",
      "family": "327",
      "family_title": "Markov type characterizes superreflexivity",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.MarkovSuperreflexivity.hasNontrivialMarkovType_iff_hasEquivalentUCNorm"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 207,
      "bytes": 1098511,
      "packages": [],
      "grade_timeout_sec": 11788,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 277
    },
    {
      "task": "mass-action",
      "challenge": "MassAction",
      "family": "149",
      "family_title": "Permanence for weakly reversible reaction networks",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.Problem326.global_bounded_persistent_solution"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 71,
      "bytes": 328720,
      "packages": [],
      "grade_timeout_sec": 11095,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 255
    },
    {
      "task": "matching-affine-lift",
      "challenge": "MatchingAffineLift",
      "family": "126",
      "family_title": "Exponential semidefinite complexity of perfect matching",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.PerfectMatchingPSD.affine_lift_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 66,
      "bytes": 322172,
      "packages": [],
      "grade_timeout_sec": 11089,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 380
    },
    {
      "task": "matching-entropy",
      "challenge": "MatchingEntropy",
      "family": "113",
      "family_title": "Approximate counting and the perfect-matching entropy conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MatchingEntropy.entropy_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 18,
      "bytes": 156848,
      "packages": [],
      "grade_timeout_sec": 10941,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 156
    },
    {
      "task": "matching-entropy-bounds",
      "challenge": "MatchingEntropyBounds",
      "family": "113",
      "family_title": "Approximate counting and the perfect-matching entropy conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MatchingEntropyBounds.Refined.pointwise_entropy"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 345956,
      "packages": [],
      "grade_timeout_sec": 11111,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 363
    },
    {
      "task": "matching-fpras",
      "challenge": "MatchingFPRAS",
      "family": "113",
      "family_title": "Approximate counting and the perfect-matching entropy conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MatchingFPRAS.thm_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 415,
      "bytes": 3091883,
      "packages": [],
      "grade_timeout_sec": 13582,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1243
    },
    {
      "task": "matching-psd",
      "challenge": "MatchingPSD",
      "family": "126",
      "family_title": "Exponential semidefinite complexity of perfect matching",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.PerfectMatchingPSD.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 53,
      "bytes": 296495,
      "packages": [],
      "grade_timeout_sec": 11066,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 382
    },
    {
      "task": "matrix-fields",
      "challenge": "MatrixFields",
      "family": "107",
      "family_title": "Matrix multiplication with exponent at most $9/4$",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MatrixAllFields.MatrixMultiplication.AllFieldMain.omega_lt_source_constant"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 354,
      "bytes": 12952806,
      "packages": [],
      "grade_timeout_sec": 21600,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 4284
    },
    {
      "task": "matrix-removal",
      "challenge": "MatrixRemoval",
      "family": "190",
      "family_title": "Polynomial removal fails for ordered binary matrices",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Problem348.no_polynomial_removal_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 61,
      "bytes": 322573,
      "packages": [],
      "grade_timeout_sec": 11090,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 215
    },
    {
      "task": "matroid-prophet",
      "challenge": "MatroidProphet",
      "family": "111",
      "family_title": "One-sample matroid prophet inequalities against an almighty adversary",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MatroidProphet.one_sample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 125,
      "bytes": 666444,
      "packages": [],
      "grade_timeout_sec": 11399,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 310
    },
    {
      "task": "matroid-secretary",
      "challenge": "MatroidSecretary",
      "family": "111",
      "family_title": "One-sample matroid prophet inequalities against an almighty adversary",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MatroidProphet.Assigned.one_sample",
        "OAI.MatroidProphet.Assigned.hidden_vector",
        "OAI.MatroidProphet.Assigned.secretary"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 243,
      "bytes": 1175443,
      "packages": [],
      "grade_timeout_sec": 11857,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 478
    },
    {
      "task": "maximal-seshadri-constants",
      "challenge": "MaximalSeshadriConstants",
      "family": "039",
      "family_title": "Nagata's conjecture and maximal Seshadri constants",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.MaximalSeshadri.Geometry.maximalSeshadriConstants"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 421,
      "bytes": 2494022,
      "packages": [],
      "grade_timeout_sec": 13044,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2150
    },
    {
      "task": "memory-precision",
      "challenge": "MemoryPrecision",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MemoryPrecision.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 88,
      "bytes": 780345,
      "packages": [],
      "grade_timeout_sec": 11502,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 420
    },
    {
      "task": "metric-entropy-duality",
      "challenge": "MetricEntropyDuality",
      "family": "329",
      "family_title": "A counterexample to Pietsch's metric-entropy duality conjecture",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.MetricEntropyDuality.exists_entropy_duality_counterexample_with_covers"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 52,
      "bytes": 267910,
      "packages": [],
      "grade_timeout_sec": 11041,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 77
    },
    {
      "task": "metric-k-median",
      "challenge": "MetricKMedian",
      "family": "125",
      "family_title": "The approximation threshold for metric $k$-median",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MetricKMedian.main_finite_work"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 569,
      "bytes": 2480461,
      "packages": [],
      "grade_timeout_sec": 13032,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1760
    },
    {
      "task": "midpoint-lenses",
      "challenge": "MidpointLenses",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.SegmentLenses.midpoint_lens_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 11,
      "bytes": 129714,
      "packages": [],
      "grade_timeout_sec": 10916,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 139
    },
    {
      "task": "min-uncut",
      "challenge": "MinUncut",
      "family": "102",
      "family_title": "The Unique Games Conjecture and optimal approximation thresholds",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.MinUncut.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 375,
      "bytes": 5995678,
      "packages": [],
      "grade_timeout_sec": 16196,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1263
    },
    {
      "task": "nagata",
      "challenge": "Nagata",
      "family": "039",
      "family_title": "Nagata's conjecture and maximal Seshadri constants",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.Nagata.Workers.W30.exists_positive_degree_equation_of_homogeneous_cycle",
        "OAI.Nagata.nagata_conjecture",
        "OAI.Nagata.nagata_conjecture_coordinates"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 117,
      "bytes": 1609242,
      "packages": [],
      "grade_timeout_sec": 12248,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 296
    },
    {
      "task": "naimark",
      "challenge": "Naimark",
      "family": "297",
      "family_title": "A ZFC counterexample to Naimark's problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.NaimarkZFC.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [
        "OAI.NaimarkZFC.IsSimpleCStar",
        "OAI.NaimarkZFC.IsState",
        "OAI.NaimarkZFC.IsFaithfulTracialState",
        "OAI.NaimarkZFC.IsIrreducible",
        "OAI.NaimarkZFC.UnitarilyEquivalent",
        "OAI.NaimarkZFC.HasUniqueIrreducibleRepresentation",
        "OAI.NaimarkZFC.IsIsomorphicToCompacts"
      ],
      "n_modules": 16,
      "bytes": 1208784,
      "packages": [],
      "grade_timeout_sec": 11887,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2390
    },
    {
      "task": "navier-stokes-alternating",
      "challenge": "NavierStokesAlternating",
      "family": "376",
      "family_title": "Universal computation in forced Navier\u2013Stokes flows",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.AlternatingNS.alternating"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 41,
      "bytes": 385862,
      "packages": [],
      "grade_timeout_sec": 11147,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 471
    },
    {
      "task": "navier-stokes-velocity",
      "challenge": "NavierStokesVelocity",
      "family": "376",
      "family_title": "Universal computation in forced Navier\u2013Stokes flows",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.VelocityDetection.main_result"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 152,
      "bytes": 1031916,
      "packages": [],
      "grade_timeout_sec": 11728,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 925
    },
    {
      "task": "nodal-length",
      "challenge": "NodalLength",
      "family": "350",
      "family_title": "Yau's nodal conjecture: surfaces and counterexamples",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.SharpNodal.Main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 59,
      "bytes": 1484359,
      "packages": [],
      "grade_timeout_sec": 12135,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 915
    },
    {
      "task": "noiseless-regression",
      "challenge": "NoiselessRegression",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.NoiselessRegression.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 22,
      "bytes": 200854,
      "packages": [],
      "grade_timeout_sec": 10980,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 225
    },
    {
      "task": "odd-kaplansky",
      "challenge": "OddKaplansky",
      "family": "197",
      "family_title": "Nonsofic groups and group-ring counterexamples",
      "subject": "Algebra",
      "theorems": [
        "OAI.OddKaplansky.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 138,
      "bytes": 832311,
      "packages": [],
      "grade_timeout_sec": 11549,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 901
    },
    {
      "task": "one-way-liveness",
      "challenge": "OneWayLiveness",
      "family": "129",
      "family_title": "Exponential state costs for two-way automata",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.OneWayLiveness.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 16,
      "bytes": 172519,
      "packages": [],
      "grade_timeout_sec": 10955,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 95
    },
    {
      "task": "optimal-max-cut",
      "challenge": "OptimalMaxCut",
      "family": "102",
      "family_title": "The Unique Games Conjecture and optimal approximation thresholds",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.OptimalMaxCut.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 372,
      "bytes": 8863088,
      "packages": [],
      "grade_timeout_sec": 18776,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1492
    },
    {
      "task": "ordinary-elliott",
      "challenge": "OrdinaryElliott",
      "family": "007",
      "family_title": "Two-point Chowla and the corrected binary Elliott conjecture",
      "subject": "Number theory",
      "theorems": [
        "OAI.OrdinaryCorrelations.binary_corrected_elliott"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 628,
      "bytes": 3068303,
      "packages": [],
      "grade_timeout_sec": 13561,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2016
    },
    {
      "task": "parity-lifts",
      "challenge": "ParityLifts",
      "family": "133",
      "family_title": "The complexity of Weisfeiler\u2013Leman refinement",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.ParityWL.parity_reduction"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 22,
      "bytes": 181099,
      "packages": [],
      "grade_timeout_sec": 10962,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 137
    },
    {
      "task": "partial-permutation",
      "challenge": "PartialPermutation",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.PartialPermutation.complementaryCosets_finite"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 62,
      "bytes": 245598,
      "packages": [],
      "grade_timeout_sec": 11021,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 352
    },
    {
      "task": "partition-consistency",
      "challenge": "PartitionConsistency",
      "family": "244",
      "family_title": "The partition principle does not imply choice",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.PartitionConsistency.main_consistency"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 75,
      "bytes": 1501215,
      "packages": [],
      "grade_timeout_sec": 12151,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 344
    },
    {
      "task": "partition-principle",
      "challenge": "PartitionPrinciple",
      "family": "244",
      "family_title": "The partition principle does not imply choice",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.PartitionPilot.Forcing.TransitiveGround.exists_model_partitionPrinciple_without_choice"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 943,
      "bytes": 12843154,
      "packages": [],
      "grade_timeout_sec": 21600,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2875
    },
    {
      "task": "perceptron-free-energy",
      "challenge": "PerceptronFreeEnergy",
      "family": "222",
      "family_title": "Perceptron free energies and microscopic jamming",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SphericalPerceptronFreeEnergy.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 411,
      "bytes": 3856745,
      "packages": [],
      "grade_timeout_sec": 14271,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1308
    },
    {
      "task": "perfect-completeness",
      "challenge": "PerfectCompleteness",
      "family": "105",
      "family_title": "The 2-to-1 Games Conjecture with perfect completeness",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.PerfectCompleteness.Theorem11.exists_reduction"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 863,
      "bytes": 12353482,
      "packages": [],
      "grade_timeout_sec": 21600,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2718
    },
    {
      "task": "periodic-group",
      "challenge": "PeriodicGroup",
      "family": "247",
      "family_title": "An infinite finitely presented residually finite $2$-group",
      "subject": "Group theory",
      "theorems": [
        "OAI.SourceBurnside.thm_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 63,
      "bytes": 1797133,
      "packages": [],
      "grade_timeout_sec": 12417,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 528
    },
    {
      "task": "periodic-tiling-three",
      "challenge": "PeriodicTilingThree",
      "family": "155",
      "family_title": "A counterexample to periodic tiling in dimension three",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.PeriodicTilingThree.periodic_tiling_counterexample_and_minimality"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 122,
      "bytes": 661551,
      "packages": [],
      "grade_timeout_sec": 11395,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 409
    },
    {
      "task": "permanent-cubic",
      "challenge": "PermanentCubic",
      "family": "108",
      "family_title": "A cubic permanent\u2013determinant lower bound",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.PermanentBorder.permanent_cubic_lower_bounds"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 915904,
      "packages": [],
      "grade_timeout_sec": 11624,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 591
    },
    {
      "task": "petty-projection-volume",
      "challenge": "PettyProjectionVolume",
      "family": "088",
      "family_title": "Petty's projection-volume conjecture and simplex counterexamples",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.PettyProjection.petty_projection_volume"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 33,
      "bytes": 662308,
      "packages": [],
      "grade_timeout_sec": 11396,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 459
    },
    {
      "task": "pi-exponent",
      "challenge": "PiExponent",
      "family": "017",
      "family_title": "The irrationality exponent of $\\pi$ is $2$",
      "subject": "Number theory",
      "theorems": [
        "OAI.PiExponent.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 869,
      "bytes": 4321464,
      "packages": [],
      "grade_timeout_sec": 14689,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2846
    },
    {
      "task": "pinched-kahler",
      "challenge": "PinchedKahler",
      "family": "359",
      "family_title": "Negative Kahler curvature without bounded holomorphic coordinates",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.PinchedHartogs.main_theorem",
        "OAI.PinchedHartogs.controlled_potential",
        "OAI.PinchedHartogs.metric_transfer"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 119,
      "bytes": 921746,
      "packages": [],
      "grade_timeout_sec": 11629,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 909
    },
    {
      "task": "pinned-distances",
      "challenge": "PinnedDistances",
      "family": "167",
      "family_title": "Pinned distances and a power saving for planar unit distances",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.WeakPinned.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 739601,
      "packages": [],
      "grade_timeout_sec": 11465,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 467
    },
    {
      "task": "planar-anderson-spectrum",
      "challenge": "PlanarAndersonSpectrum",
      "family": "261",
      "family_title": "Localization and delocalization in the Anderson model",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.PlanarAnderson.anderson_spectrum_ae"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1,
      "bytes": 35165,
      "packages": [],
      "grade_timeout_sec": 10831,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 96
    },
    {
      "task": "planar-falconer",
      "challenge": "PlanarFalconer",
      "family": "073",
      "family_title": "The Falconer distance conjecture",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.PlanarFalconer.mainTarget_proved"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 719,
      "bytes": 2640523,
      "packages": [],
      "grade_timeout_sec": 13176,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1590
    },
    {
      "task": "planar-first-passage",
      "challenge": "PlanarFirstPassage",
      "family": "212",
      "family_title": "No bigeodesics and smooth limit shapes in planar first-passage percolation",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.PlanarFPP.manuscriptMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 195,
      "bytes": 854325,
      "packages": [],
      "grade_timeout_sec": 11568,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 462
    },
    {
      "task": "planar-l1",
      "challenge": "PlanarL1",
      "family": "089",
      "family_title": "Bounded-distortion $L_1$ embeddings of planar and bounded-treewidth graphs",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.PlanarL1.planar_graph_metrics_embed_L1"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 63,
      "bytes": 1567179,
      "packages": [],
      "grade_timeout_sec": 12210,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 421
    },
    {
      "task": "planar-unit-distances",
      "challenge": "PlanarUnitDistances",
      "family": "167",
      "family_title": "Pinned distances and a power saving for planar unit distances",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.PlanarUnitDistances.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 40,
      "bytes": 1344796,
      "packages": [],
      "grade_timeout_sec": 12010,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 513
    },
    {
      "task": "plane-coloring",
      "challenge": "PlaneColoring",
      "family": "158",
      "family_title": "The Euclidean plane cannot be colored with five colors",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Problem160.properColoring_seven"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 9,
      "bytes": 17840,
      "packages": [],
      "grade_timeout_sec": 10816,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 99
    },
    {
      "task": "posterior-replicas",
      "challenge": "PosteriorReplicas",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.PosteriorReplicas.source_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 136,
      "bytes": 716462,
      "packages": [],
      "grade_timeout_sec": 11444,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 621
    },
    {
      "task": "power-free-values",
      "challenge": "PowerFreeValues",
      "family": "020",
      "family_title": "Squarefree quartics and power-free polynomial values",
      "subject": "Number theory",
      "theorems": [
        "OAI.QuarticPowerFree.allDegrees"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 63,
      "bytes": 1138297,
      "packages": [],
      "grade_timeout_sec": 11824,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 692
    },
    {
      "task": "prime-gaps",
      "challenge": "PrimeGaps",
      "family": "026",
      "family_title": "Positive lower density of large prime gaps",
      "subject": "Number theory",
      "theorems": [
        "OAI.Problem344.large_gaps_and_ratio_density"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 56,
      "bytes": 1086346,
      "packages": [],
      "grade_timeout_sec": 11777,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 560
    },
    {
      "task": "product-brown",
      "challenge": "ProductBrown",
      "family": "293",
      "family_title": "A counterexample to the hyperinvariant-subspace problem",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.FiniteFactor.productBrown"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 292,
      "bytes": 1198654,
      "packages": [],
      "grade_timeout_sec": 11878,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 889
    },
    {
      "task": "projection-counterexample",
      "challenge": "ProjectionCounterexample",
      "family": "088",
      "family_title": "Petty's projection-volume conjecture and simplex counterexamples",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.ProjectionCounterexample.universal_simplex_upper_bound_false"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 41,
      "bytes": 131947,
      "packages": [],
      "grade_timeout_sec": 10918,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 142
    },
    {
      "task": "projection-moments",
      "challenge": "ProjectionMoments",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.ProjectionMoments.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 46,
      "bytes": 515196,
      "packages": [],
      "grade_timeout_sec": 11263,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 343
    },
    {
      "task": "projection-volume",
      "challenge": "ProjectionVolume",
      "family": "088",
      "family_title": "Petty's projection-volume conjecture and simplex counterexamples",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.Paper092.product_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 29,
      "bytes": 128826,
      "packages": [],
      "grade_timeout_sec": 10915,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 182
    },
    {
      "task": "qac-parity",
      "challenge": "QACParity",
      "family": "274",
      "family_title": "Moore's parity conjecture for $\\mathrm{QAC}^0$",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.QAC.parity_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 21,
      "bytes": 152586,
      "packages": [],
      "grade_timeout_sec": 10937,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 171
    },
    {
      "task": "quadric-bundles",
      "challenge": "QuadricBundles",
      "family": "050",
      "family_title": "A counterexample to Griffiths' positivity conjecture",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.QuadricCounterexample.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 604021,
      "packages": [],
      "grade_timeout_sec": 11343,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 408
    },
    {
      "task": "quantitative-van-der-waerden",
      "challenge": "QuantitativeVanDerWaerden",
      "family": "160",
      "family_title": "Superexponential van der Waerden numbers",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.QuantitativeVanDerWaerden.uniform_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 115,
      "bytes": 643306,
      "packages": [],
      "grade_timeout_sec": 11378,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 170
    },
    {
      "task": "quintic-lienard",
      "challenge": "QuinticLienard",
      "family": "143",
      "family_title": "Uniform limit-cycle bounds in Hilbert's sixteenth problem",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.QuinticLienard.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 146,
      "bytes": 816084,
      "packages": [],
      "grade_timeout_sec": 11534,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 829
    },
    {
      "task": "radial-density-interval",
      "challenge": "RadialDensityInterval",
      "family": "228",
      "family_title": "Continuum phase transitions for radial pair potentials",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.RadialTransition.densityInterval"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 104,
      "bytes": 698440,
      "packages": [],
      "grade_timeout_sec": 11428,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 678
    },
    {
      "task": "radial-transition",
      "challenge": "RadialTransition",
      "family": "228",
      "family_title": "Continuum phase transitions for radial pair potentials",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.RadialTransition.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 103,
      "bytes": 693070,
      "packages": [],
      "grade_timeout_sec": 11423,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 888
    },
    {
      "task": "ramsey-five",
      "challenge": "RamseyFive",
      "family": "170",
      "family_title": "Sharp logarithmic exponents for off-diagonal Ramsey numbers",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SharpRamseyFive.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 482,
      "bytes": 3634776,
      "packages": [],
      "grade_timeout_sec": 14071,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2034
    },
    {
      "task": "randomized-mean-payoff",
      "challenge": "RandomizedMeanPayoff",
      "family": "104",
      "family_title": "Quasipolynomial algorithms for mean-payoff, stochastic and parity games",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.randomized_quasipolynomial_mean_payoff"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 89,
      "bytes": 1301045,
      "packages": [],
      "grade_timeout_sec": 11970,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 809
    },
    {
      "task": "rational-hitting",
      "challenge": "RationalHitting",
      "family": "116",
      "family_title": "Uniform identity testing for noncommutative formulas",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.RationalHitting.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 53,
      "bytes": 700555,
      "packages": [],
      "grade_timeout_sec": 11430,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 472
    },
    {
      "task": "real-l1-renorming",
      "challenge": "RealL1Renorming",
      "family": "330",
      "family_title": "A negative answer to Kalton's Lipschitz-free approximation question",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.DiscreteFree.real_l1_quantitative_renorming"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 33,
      "bytes": 179835,
      "packages": [],
      "grade_timeout_sec": 10961,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 172
    },
    {
      "task": "recursive-potentials",
      "challenge": "RecursivePotentials",
      "family": "331",
      "family_title": "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.ComparatorModel.RecursivePotentials.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 12,
      "bytes": 445768,
      "packages": [],
      "grade_timeout_sec": 11201,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 218
    },
    {
      "task": "reflexive-fixed-points",
      "challenge": "ReflexiveFixedPoints",
      "family": "328",
      "family_title": "Fixed points of nonexpansive maps in reflexive Banach spaces",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.ReflexiveFixedPoints.exists_fixedPoint_of_canonicallyReflexive"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 86,
      "bytes": 480875,
      "packages": [],
      "grade_timeout_sec": 11232,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 221
    },
    {
      "task": "regular-parity",
      "challenge": "RegularParity",
      "family": "274",
      "family_title": "Moore's parity conjecture for $\\mathrm{QAC}^0$",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.QAC.parity_lower_bound_polynomial_size"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 22,
      "bytes": 154244,
      "packages": [],
      "grade_timeout_sec": 10938,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 185
    },
    {
      "task": "relative-generation",
      "challenge": "RelativeGeneration",
      "family": "296",
      "family_title": "The generator problem for finite factors",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.RelativeGeneration.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 102,
      "bytes": 1722505,
      "packages": [],
      "grade_timeout_sec": 12350,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2953
    },
    {
      "task": "rokhlin",
      "challenge": "Rokhlin",
      "family": "145",
      "family_title": "Rokhlin's multiple-mixing problem",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.Rokhlin.mixing_all_finite_orders"
      ],
      "definition_holes": [],
      "fixed_definitions": [
        "OAI.Rokhlin.timeMap",
        "OAI.Rokhlin.IsMixing",
        "OAI.Rokhlin.layoutTime",
        "OAI.Rokhlin.MixingOfOrder"
      ],
      "n_modules": 13,
      "bytes": 1407449,
      "packages": [],
      "grade_timeout_sec": 12066,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 627
    },
    {
      "task": "ruled-covering",
      "challenge": "RuledCovering",
      "family": "100",
      "family_title": "A counterexample to Bang's cylinder-covering bound",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.RuledApproximation.fullMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 30,
      "bytes": 195883,
      "packages": [],
      "grade_timeout_sec": 10976,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 265
    },
    {
      "task": "ryser-covering",
      "challenge": "RyserCovering",
      "family": "162",
      "family_title": "Counterexamples to Ryser's covering and Gyarfas's tree-cover conjectures",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.RyserCoveringCounterexample.exists_prime_eventually_counterexampleRank"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 217,
      "bytes": 1129016,
      "packages": [],
      "grade_timeout_sec": 11816,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 355
    },
    {
      "task": "ryser-odd-extensions",
      "challenge": "RyserOddExtensions",
      "family": "162",
      "family_title": "Counterexamples to Ryser's covering and Gyarfas's tree-cover conjectures",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.RyserOdd.eventualOddFailures_and_infinite"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 219,
      "bytes": 1140439,
      "packages": [],
      "grade_timeout_sec": 11826,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 205
    },
    {
      "task": "sat-computability",
      "challenge": "SATComputability",
      "family": "235",
      "family_title": "Random-SAT thresholds, sharp variance and computability",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.FixedClauseThreshold.Computability.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 592,
      "bytes": 4186949,
      "packages": [],
      "grade_timeout_sec": 14568,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1515
    },
    {
      "task": "sat-sharpness",
      "challenge": "SATSharpness",
      "family": "235",
      "family_title": "Random-SAT thresholds, sharp variance and computability",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.RandomKSAT.sharpness"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 26,
      "bytes": 237426,
      "packages": [],
      "grade_timeout_sec": 11013,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 167
    },
    {
      "task": "sat-variance",
      "challenge": "SATVariance",
      "family": "235",
      "family_title": "Random-SAT thresholds, sharp variance and computability",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.RandomKSAT.variance_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 299818,
      "packages": [],
      "grade_timeout_sec": 11069,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 245
    },
    {
      "task": "sk-barriers",
      "challenge": "SKBarriers",
      "family": "227",
      "family_title": "The dynamical phase transition in the Sherrington\u2013Kirkpatrick model",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SK.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 574,
      "bytes": 2610000,
      "packages": [],
      "grade_timeout_sec": 13149,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1847
    },
    {
      "task": "sk-full-support",
      "challenge": "SKFullSupport",
      "family": "281",
      "family_title": "QAOA optimality for the SK model",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.ZeroTemperatureSK.full_support"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 135,
      "bytes": 989995,
      "packages": [],
      "grade_timeout_sec": 11690,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 656
    },
    {
      "task": "sk-high-temperature",
      "challenge": "SKHighTemperature",
      "family": "227",
      "family_title": "The dynamical phase transition in the Sherrington\u2013Kirkpatrick model",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SKGap.sk_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 556,
      "bytes": 4702297,
      "packages": [],
      "grade_timeout_sec": 15032,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2268
    },
    {
      "task": "sk-ratio",
      "challenge": "SKRatio",
      "family": "227",
      "family_title": "The dynamical phase transition in the Sherrington\u2013Kirkpatrick model",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SKRatio.ratio_cutoff"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 260,
      "bytes": 2087158,
      "packages": [],
      "grade_timeout_sec": 12678,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 7778
    },
    {
      "task": "sk-value",
      "challenge": "SKValue",
      "family": "281",
      "family_title": "QAOA optimality for the SK model",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.SKValue.value_consequences"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 212,
      "bytes": 1487979,
      "packages": [],
      "grade_timeout_sec": 12139,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 650
    },
    {
      "task": "sle-lower-positivity",
      "challenge": "SLELowerPositivity",
      "family": "230",
      "family_title": "Exact Hausdorff measure for SLE",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SLEExactGauge.sourceLowerMain_proved"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 65,
      "bytes": 2264389,
      "packages": [],
      "grade_timeout_sec": 12837,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 527
    },
    {
      "task": "saxl",
      "challenge": "Saxl",
      "family": "205",
      "family_title": "Saxl's conjecture and universal tensor squares",
      "subject": "Algebra",
      "theorems": [
        "OAI.Saxl.saxl_conjecture"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 38,
      "bytes": 321190,
      "packages": [],
      "grade_timeout_sec": 11089,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 504
    },
    {
      "task": "second-kahn-kalai",
      "challenge": "SecondKahnKalai",
      "family": "176",
      "family_title": "The second Kahn\u2013Kalai conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.LeanBlast.SecondKahnKalai.secondKahnKalaiBounds"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 37,
      "bytes": 288343,
      "packages": [],
      "grade_timeout_sec": 11059,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 76
    },
    {
      "task": "self-similar",
      "challenge": "SelfSimilar",
      "family": "148",
      "family_title": "The dimension formula for self-similar measures on the line",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.EntropyRateDimension.entropy_rate_dimension"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 57,
      "bytes": 523984,
      "packages": [],
      "grade_timeout_sec": 11271,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 382
    },
    {
      "task": "self-similar-corollaries",
      "challenge": "SelfSimilarCorollaries",
      "family": "148",
      "family_title": "The dimension formula for self-similar measures on the line",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.EntropyRateDimension.Extensions.homogeneous_dimension_direct",
        "OAI.CorSetReference.cor_set"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 64,
      "bytes": 559526,
      "packages": [],
      "grade_timeout_sec": 11303,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 399
    },
    {
      "task": "sensitivity-separation",
      "challenge": "SensitivitySeparation",
      "family": "132",
      "family_title": "A counterexample to the quadratic sensitivity conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.Paper320.quantitative_separation"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 42,
      "bytes": 159617,
      "packages": [],
      "grade_timeout_sec": 10943,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 133
    },
    {
      "task": "separable-quotient-negative",
      "challenge": "SeparableQuotientNegative",
      "family": "323",
      "family_title": "Relative independence of the separable quotient problem",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.SeparableQuotient.negative_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 669194,
      "packages": [],
      "grade_timeout_sec": 11402,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 545
    },
    {
      "task": "seymour-second-neighborhood",
      "challenge": "SeymourSecondNeighborhood",
      "family": "173",
      "family_title": "Seymour's second-neighborhood conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SeymourSecondNeighborhood.exists_goodVertex"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 43,
      "bytes": 190801,
      "packages": [],
      "grade_timeout_sec": 10971,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 59
    },
    {
      "task": "sharp-cat0-filling",
      "challenge": "SharpCAT0Filling",
      "family": "337",
      "family_title": "Cartan\u2013Hadamard isoperimetry and CAT$(0)$ fillings",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.CAT0Fillings.sharp_integral_filling"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 330,
      "bytes": 2329103,
      "packages": [],
      "grade_timeout_sec": 12896,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1023
    },
    {
      "task": "sharp-log-ramsey",
      "challenge": "SharpLogRamsey",
      "family": "170",
      "family_title": "Sharp logarithmic exponents for off-diagonal Ramsey numbers",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SharpLogRamsey.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 408,
      "bytes": 2902698,
      "packages": [],
      "grade_timeout_sec": 13412,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1307
    },
    {
      "task": "sharp-threshold",
      "challenge": "SharpThreshold",
      "family": "186",
      "family_title": "The Friedgut\u2013Kalai graph and hypergraph threshold conjectures",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.Problem313.sharp_threshold_width"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 78,
      "bytes": 313943,
      "packages": [],
      "grade_timeout_sec": 11082,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 221
    },
    {
      "task": "short-egyptian-fractions",
      "challenge": "ShortEgyptianFractions",
      "family": "025",
      "family_title": "Erd\\H{o}s\u2019s short Egyptian-fraction conjecture",
      "subject": "Number theory",
      "theorems": [
        "OAI.ShortEgyptian.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 58,
      "bytes": 383383,
      "packages": [],
      "grade_timeout_sec": 11145,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 357
    },
    {
      "task": "sidorenko-counterexample",
      "challenge": "SidorenkoCounterexample",
      "family": "161",
      "family_title": "Counterexamples to Sidorenko's conjecture and the forcing conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SidorenkoCounterexample.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 35,
      "bytes": 1216768,
      "packages": [],
      "grade_timeout_sec": 11895,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 837
    },
    {
      "task": "signed-finite-band",
      "challenge": "SignedFiniteBand",
      "family": "085",
      "family_title": "Endpoint regularity of the planar centered maximal function",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.SignedDisk.CenteredDiskEndpoint.main_signed_finite_band"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 39,
      "bytes": 841812,
      "packages": [],
      "grade_timeout_sec": 11557,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 376
    },
    {
      "task": "signed-sweep-moment",
      "challenge": "SignedSweepMoment",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SignedSweeps.signed_occurrence_moment_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 174,
      "bytes": 1198418,
      "packages": [],
      "grade_timeout_sec": 11878,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 796
    },
    {
      "task": "simple-amenable",
      "challenge": "SimpleAmenable",
      "family": "253",
      "family_title": "An infinite finitely presented simple amenable group",
      "subject": "Group theory",
      "theorems": [
        "OAI.SimpleAmenable.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 550,
      "bytes": 3943717,
      "packages": [],
      "grade_timeout_sec": 14349,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1969
    },
    {
      "task": "simple-overgroups",
      "challenge": "SimpleOvergroups",
      "family": "250",
      "family_title": "The Boone\u2013Higman conjecture and higher finiteness",
      "subject": "Group theory",
      "theorems": [
        "OAI.SimpleFInftyOvergroups.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 238,
      "bytes": 4013491,
      "packages": [],
      "grade_timeout_sec": 14412,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1221
    },
    {
      "task": "single-fold",
      "challenge": "SingleFold",
      "family": "242",
      "family_title": "Single-fold Diophantine representations",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.SingleFold.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 28,
      "bytes": 336998,
      "packages": [],
      "grade_timeout_sec": 11103,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 344
    },
    {
      "task": "single-lattice-covering",
      "challenge": "SingleLatticeCovering",
      "family": "092",
      "family_title": "The optimal order of convex-body covering density",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.SingleLatticeCovering.single_lattice_covering"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 41,
      "bytes": 1145959,
      "packages": [],
      "grade_timeout_sec": 11831,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 519
    },
    {
      "task": "singleton-loop-matching",
      "challenge": "SingletonLoopMatching",
      "family": "113",
      "family_title": "Approximate counting and the perfect-matching entropy conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.LoopMatching.fullEndpoint"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 136,
      "bytes": 719294,
      "packages": [],
      "grade_timeout_sec": 11447,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 576
    },
    {
      "task": "smooth-initial-form",
      "challenge": "SmoothInitialForm",
      "family": "108",
      "family_title": "A cubic permanent\u2013determinant lower bound",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.PermanentBorder.smooth_initial_form_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 17,
      "bytes": 290725,
      "packages": [],
      "grade_timeout_sec": 11061,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 334
    },
    {
      "task": "smooth-obstruction",
      "challenge": "SmoothObstruction",
      "family": "152",
      "family_title": "Zero entropy does not guarantee a smooth positive-volume model",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.SmoothObstruction.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 53,
      "bytes": 1540084,
      "packages": [],
      "grade_timeout_sec": 12186,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 472
    },
    {
      "task": "smooth-yau",
      "challenge": "SmoothYau",
      "family": "350",
      "family_title": "Yau's nodal conjecture: surfaces and counterexamples",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.YauCounterexamples.sphere_three",
        "OAI.YauCounterexamples.sphere_two_torus_two"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 436,
      "bytes": 4544098,
      "packages": [],
      "grade_timeout_sec": 14889,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1965
    },
    {
      "task": "snaky-conditional",
      "challenge": "SnakyConditional",
      "family": "187",
      "family_title": "Snaky in 21 Maker moves",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SnakyConditional.snaky_winning_strategy_with_legal_states"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 209,
      "bytes": 7279627,
      "packages": [],
      "grade_timeout_sec": 17351,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 3069
    },
    {
      "task": "soft-channel204",
      "challenge": "SoftChannel204",
      "family": "119",
      "family_title": "The Courtade\u2013Kumar and Hellinger conjectures",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.SoftChannel204.fullMain"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 70,
      "bytes": 495679,
      "packages": [],
      "grade_timeout_sec": 11246,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 323
    },
    {
      "task": "solenoidal-sheet-programs",
      "challenge": "SolenoidalSheetPrograms",
      "family": "376",
      "family_title": "Universal computation in forced Navier\u2013Stokes flows",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.Solenoidal.sheet_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 26,
      "bytes": 295192,
      "packages": [],
      "grade_timeout_sec": 11065,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 244
    },
    {
      "task": "spherical-field",
      "challenge": "SphericalField",
      "family": "222",
      "family_title": "Perceptron free energies and microscopic jamming",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.SphericalPerceptron.spherical_linear_field_formula"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 142,
      "bytes": 1253471,
      "packages": [],
      "grade_timeout_sec": 11928,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 698
    },
    {
      "task": "split-tangent-integrability",
      "challenge": "SplitTangentIntegrability",
      "family": "052",
      "family_title": "Tangent-bundle splittings and universal covers",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.SplitTangent.integrability_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 15,
      "bytes": 804852,
      "packages": [],
      "grade_timeout_sec": 11524,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 360
    },
    {
      "task": "square-difference",
      "challenge": "SquareDifference",
      "family": "182",
      "family_title": "Power savings for polynomial-difference-free sets",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SquareDifference.power_saving"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 81,
      "bytes": 1102925,
      "packages": [],
      "grade_timeout_sec": 11792,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 524
    },
    {
      "task": "square-root-degree",
      "challenge": "SquareRootDegree",
      "family": "192",
      "family_title": "A counterexample to the Gopalan\u2013Servedio conjecture",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SquareRootDegree.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 21,
      "bytes": 158632,
      "packages": [],
      "grade_timeout_sec": 10942,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 207
    },
    {
      "task": "standard-map-components",
      "challenge": "StandardMapComponents",
      "family": "146",
      "family_title": "Sinai's positive-entropy conjecture for the standard map",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.StandardMapEntropy.main_components"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 274,
      "bytes": 2886579,
      "packages": [],
      "grade_timeout_sec": 13397,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1312
    },
    {
      "task": "standard-map-entropy",
      "challenge": "StandardMapEntropy",
      "family": "146",
      "family_title": "Sinai's positive-entropy conjecture for the standard map",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.StandardMapEntropy.main_entropy"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 205,
      "bytes": 1320589,
      "packages": [],
      "grade_timeout_sec": 11988,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1510
    },
    {
      "task": "standard-map-lyapunov",
      "challenge": "StandardMapLyapunov",
      "family": "146",
      "family_title": "Sinai's positive-entropy conjecture for the standard map",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.StandardMapEntropy.main_entropy_complete"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 211,
      "bytes": 1383590,
      "packages": [],
      "grade_timeout_sec": 12045,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1019
    },
    {
      "task": "steinitz-bergstrom",
      "challenge": "SteinitzBergstrom",
      "family": "097",
      "family_title": "The Euclidean Steinitz\u2013Bergstrom conjecture",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.EuclideanSteinitzBergstrom.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 29,
      "bytes": 716227,
      "packages": [],
      "grade_timeout_sec": 11444,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 440
    },
    {
      "task": "strict-means",
      "challenge": "StrictMeans",
      "family": "072",
      "family_title": "Brennan's conjecture and a counterexample to Kraetzer's prediction",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.StrictInverseFirstPower.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 94,
      "bytes": 718706,
      "packages": [],
      "grade_timeout_sec": 11446,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 845
    },
    {
      "task": "strong-kadison-kastler",
      "challenge": "StrongKadisonKastler",
      "family": "289",
      "family_title": "The strong Kadison\u2013Kastler conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.KadisonKastler.universal_strong_stability"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 2652,
      "bytes": 14567629,
      "packages": [],
      "grade_timeout_sec": 21600,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 10799
    },
    {
      "task": "strong-thin-tree",
      "challenge": "StrongThinTree",
      "family": "174",
      "family_title": "Deterministic construction of strong thin spanning trees",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.StrongThinTree.strongThinTree"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 72,
      "bytes": 775264,
      "packages": [],
      "grade_timeout_sec": 11497,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 487
    },
    {
      "task": "strongly-rayleigh-dpp",
      "challenge": "StronglyRayleighDPP",
      "family": "231",
      "family_title": "The free uniform spanning forest is a factor of IID",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.Problem336AdditiveD139.finite_strongly_rayleigh_response",
        "OAI.Problem336AdditiveD139.strongly_rayleigh_group_factor",
        "OAI.Problem336AdditiveD139.finite_positive_contraction_dpp_is_strongly_rayleigh",
        "OAI.Problem336AdditiveD139.countable_positive_contraction_dpp_exists_unique",
        "OAI.Problem336AdditiveD139.invariant_positive_contraction_dpp_factor",
        "OAI.Problem336AdditiveD139.translation_invariant_kernel_dpp_factor"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 107,
      "bytes": 512357,
      "packages": [],
      "grade_timeout_sec": 11261,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 364
    },
    {
      "task": "structural-crouzeix",
      "challenge": "StructuralCrouzeix",
      "family": "325",
      "family_title": "The complete Crouzeix conjecture",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.StructuralCrouzeixReference.challenge"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 60,
      "bytes": 698525,
      "packages": [],
      "grade_timeout_sec": 11428,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 546
    },
    {
      "task": "subpolynomial-lp",
      "challenge": "SubpolynomialLp",
      "family": "094",
      "family_title": "Subpolynomial dimension reduction in $L_p$",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.SubpolynomialLp.source_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 44,
      "bytes": 369072,
      "packages": [],
      "grade_timeout_sec": 11132,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 381
    },
    {
      "task": "subsphere-current",
      "challenge": "SubsphereCurrent",
      "family": "140",
      "family_title": "Memory\u2013sample lower bounds for noiseless Gaussian regression",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.SubsphereCurrent.full_current_main_scope"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 25,
      "bytes": 477744,
      "packages": [],
      "grade_timeout_sec": 11229,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 258
    },
    {
      "task": "superstring",
      "challenge": "Superstring",
      "family": "128",
      "family_title": "A factor-two approximation for shortest common superstring",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.Superstring.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 940918,
      "packages": [],
      "grade_timeout_sec": 11646,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 297
    },
    {
      "task": "switch-chain",
      "challenge": "SwitchChain",
      "family": "131",
      "family_title": "Polynomial mixing of graph switches with prescribed degrees",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.Problem315.switch_chain_main",
        "OAI.Problem315.switch_chain_tv_bound",
        "OAI.Problem315.switch_connectivity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 165,
      "bytes": 921825,
      "packages": [],
      "grade_timeout_sec": 11629,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 413
    },
    {
      "task": "symmetric-domains",
      "challenge": "SymmetricDomains",
      "family": "058",
      "family_title": "The Kollar\u2013Pardon universal-cover conjecture",
      "subject": "Algebraic and complex geometry",
      "theorems": [
        "OAI.Release061.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 335,
      "bytes": 2114940,
      "packages": [],
      "grade_timeout_sec": 12703,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1240
    },
    {
      "task": "symmetric-mahler-equality",
      "challenge": "SymmetricMahlerEquality",
      "family": "087",
      "family_title": "The Mahler conjectures and symplectic width",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.SymmetricMahler.symmetric_mahler_equality"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 237,
      "bytes": 1330350,
      "packages": [],
      "grade_timeout_sec": 11997,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 662
    },
    {
      "task": "symmetric-polar",
      "challenge": "SymmetricPolar",
      "family": "087",
      "family_title": "The Mahler conjectures and symplectic width",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.SymmetricPolar.symmetric_polar_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 46,
      "bytes": 543383,
      "packages": [],
      "grade_timeout_sec": 11289,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 686
    },
    {
      "task": "tachikawa",
      "challenge": "Tachikawa",
      "family": "199",
      "family_title": "Counterexamples to conjectures of Auslander\u2013Reiten, Tachikawa, and Nakayama",
      "subject": "Algebra",
      "theorems": [
        "OAI.Tachikawa.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 1264529,
      "packages": [],
      "grade_timeout_sec": 11938,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 974
    },
    {
      "task": "talagrand-discrete-convexity",
      "challenge": "TalagrandDiscreteConvexity",
      "family": "175",
      "family_title": "Talagrand's conjectures and graph decompositions at expectation thresholds",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.TalagrandDiscreteConvexity.talagrand_discrete_convexity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 36,
      "bytes": 174257,
      "packages": [],
      "grade_timeout_sec": 10956,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 72
    },
    {
      "task": "talagrand-expectation-threshold",
      "challenge": "TalagrandExpectationThreshold",
      "family": "175",
      "family_title": "Talagrand's conjectures and graph decompositions at expectation thresholds",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.TalagrandThreshold.talagrand_expectation_threshold_equivalence"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 47,
      "bytes": 192418,
      "packages": [],
      "grade_timeout_sec": 10973,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 64
    },
    {
      "task": "thomason-model-structures",
      "challenge": "ThomasonModelStructures",
      "family": "317",
      "family_title": "Thomason model structures in every strict higher dimension",
      "subject": "Topology",
      "theorems": [
        "OAI.Thomason.main",
        "OAI.Thomason.nerveDetection_allDimensions"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 85,
      "bytes": 2875278,
      "packages": [],
      "grade_timeout_sec": 13387,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 599
    },
    {
      "task": "thompson-nonamenability",
      "challenge": "ThompsonNonamenability",
      "family": "248",
      "family_title": "Thompson's group $F$ is nonamenable",
      "subject": "Group theory",
      "theorems": [
        "OAI.ThompsonNonamenability.thompson_F_nonamenable_composition"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 68,
      "bytes": 372798,
      "packages": [],
      "grade_timeout_sec": 11135,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 141
    },
    {
      "task": "thorp-first-reciprocal",
      "challenge": "ThorpFirstReciprocal",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.Thorp.Current.first_reciprocal_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 367273,
      "packages": [],
      "grade_timeout_sec": 11130,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 344
    },
    {
      "task": "thorp-remaining",
      "challenge": "ThorpRemaining",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ThorpResults.remaining_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 92,
      "bytes": 1378792,
      "packages": [],
      "grade_timeout_sec": 12040,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 472
    },
    {
      "task": "thorp-routing",
      "challenge": "ThorpRouting",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ThorpNine.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 170,
      "bytes": 6581773,
      "packages": [],
      "grade_timeout_sec": 16723,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1031
    },
    {
      "task": "thorp-weighted-compatibility",
      "challenge": "ThorpWeightedCompatibility",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ThorpCompatibility.weightedCompatibility_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 34,
      "bytes": 135549,
      "packages": [],
      "grade_timeout_sec": 10921,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 171
    },
    {
      "task": "three-machine",
      "challenge": "ThreeMachine",
      "family": "124",
      "family_title": "Polynomial-time scheduling on three identical machines",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.ThreeMachine.main_theorem"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 53,
      "bytes": 851902,
      "packages": [],
      "grade_timeout_sec": 11566,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 338
    },
    {
      "task": "three-state-supercritical",
      "challenge": "ThreeStateSupercritical",
      "family": "229",
      "family_title": "Sharp three- and four-state reconstruction thresholds",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ThreeState.regular_supercritical",
        "OAI.ThreeState.poisson_supercritical"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 27,
      "bytes": 382667,
      "packages": [],
      "grade_timeout_sec": 11144,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 180
    },
    {
      "task": "three-state-tree-clauses",
      "challenge": "ThreeStateTreeClauses",
      "family": "229",
      "family_title": "Sharp three- and four-state reconstruction thresholds",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.ThreeState.TreeClauses.Tree.regular_reconstructs_above_KS",
        "OAI.ThreeState.TreeClauses.Tree.poisson_reconstructs_above_KS"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 383958,
      "packages": [],
      "grade_timeout_sec": 11145,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 328
    },
    {
      "task": "three-torus",
      "challenge": "ThreeTorus",
      "family": "144",
      "family_title": "Banach's simple Lebesgue-spectrum problem",
      "subject": "Dynamical systems and ergodic theory",
      "theorems": [
        "OAI.ThreeTorus.simple_lebesgue_spectrum"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 37,
      "bytes": 1720327,
      "packages": [],
      "grade_timeout_sec": 12348,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 645
    },
    {
      "task": "tingley-sphere-isometry",
      "challenge": "TingleySphereIsometry",
      "family": "322",
      "family_title": "Tingley's sphere-isometry problem",
      "subject": "Functional analysis",
      "theorems": [
        "OAI.Tingley.tingley_sphere_isometry_full"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 67,
      "bytes": 382424,
      "packages": [],
      "grade_timeout_sec": 11144,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 94
    },
    {
      "task": "torsion-free-hyperbolic",
      "challenge": "TorsionFreeHyperbolic",
      "family": "252",
      "family_title": "A non-residually-finite torsion-free hyperbolic group",
      "subject": "Group theory",
      "theorems": [
        "OAI.Release075.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 29,
      "bytes": 482151,
      "packages": [],
      "grade_timeout_sec": 11233,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 216
    },
    {
      "task": "torsion-free-zero-divisors",
      "challenge": "TorsionFreeZeroDivisors",
      "family": "196",
      "family_title": "A counterexample to Kaplansky's zero-divisor conjecture",
      "subject": "Algebra",
      "theorems": [
        "OAI.TorsionFreeZeroDivisors.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 123,
      "bytes": 2064427,
      "packages": [],
      "grade_timeout_sec": 12657,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 560
    },
    {
      "task": "trace-reconstruction",
      "challenge": "TraceReconstruction",
      "family": "122",
      "family_title": "Superpolynomial lower bounds and quasipolynomial reconstruction from deletion traces",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.TraceReconstruction.quantitative_sample_lower_bound",
        "OAI.TraceReconstruction.superpolynomial_one_trace",
        "OAI.TraceReconstruction.superpolynomial_sample_complexity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 31,
      "bytes": 1632943,
      "packages": [],
      "grade_timeout_sec": 12269,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 316
    },
    {
      "task": "tree-edit",
      "challenge": "TreeEdit",
      "family": "099",
      "family_title": "The sharp distortion of edit distance into $\\ell_1$",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.TreeEdit.binary_torus"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 22,
      "bytes": 243012,
      "packages": [],
      "grade_timeout_sec": 11018,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 167
    },
    {
      "task": "triangle-face",
      "challenge": "TriangleFace",
      "family": "113",
      "family_title": "Approximate counting and the perfect-matching entropy conjecture",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.TriangleFace198.triangle_expansion_face"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 37,
      "bytes": 326247,
      "packages": [],
      "grade_timeout_sec": 11093,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 174
    },
    {
      "task": "triangle-removal",
      "challenge": "TriangleRemoval",
      "family": "188",
      "family_title": "The sharp constant in random triangle removal",
      "subject": "Combinatorics",
      "theorems": [
        "OAI.SharpTerminalLeave.sharp_terminal_leave"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 287,
      "bytes": 1468947,
      "packages": [],
      "grade_timeout_sec": 12122,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 986
    },
    {
      "task": "triangular-covering",
      "challenge": "TriangularCovering",
      "family": "100",
      "family_title": "A counterexample to Bang's cylinder-covering bound",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.TriangularCovering.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 9,
      "bytes": 96114,
      "packages": [],
      "grade_timeout_sec": 10886,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 140
    },
    {
      "task": "triangular-energy",
      "challenge": "TriangularEnergy",
      "family": "090",
      "family_title": "Universal optimality of the triangular lattice",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.AtomicTriangular.universal_energy_minimum"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 227,
      "bytes": 8590367,
      "packages": [],
      "grade_timeout_sec": 18531,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 10732
    },
    {
      "task": "triangular-gaussian",
      "challenge": "TriangularGaussian",
      "family": "090",
      "family_title": "Universal optimality of the triangular lattice",
      "subject": "Convex and metric geometry",
      "theorems": [
        "OAI.AtomicTriangular.sharp_gaussian_minorants_with_construction"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 216,
      "bytes": 8531599,
      "packages": [],
      "grade_timeout_sec": 18478,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 9985
    },
    {
      "task": "triangular-hilbert",
      "challenge": "TriangularHilbert",
      "family": "082",
      "family_title": "Maximal and variational bounds for the triangular Hilbert transform",
      "subject": "Real and complex analysis",
      "theorems": [
        "OAI.TriangularHilbert.main_estimate"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 105,
      "bytes": 499653,
      "packages": [],
      "grade_timeout_sec": 11249,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 621
    },
    {
      "task": "truffet-counterexample",
      "challenge": "TruffetCounterexample",
      "family": "104",
      "family_title": "Quasipolynomial algorithms for mean-payoff, stochastic and parity games",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.TruffetV4Counterexample.finite_execution_not_optimal"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 2,
      "bytes": 11050,
      "packages": [],
      "grade_timeout_sec": 10809,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 46
    },
    {
      "task": "two-way-complementation",
      "challenge": "TwoWayComplementation",
      "family": "129",
      "family_title": "Exponential state costs for two-way automata",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.TwoWayComplementation.complementation_lower_bound_finite"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 19,
      "bytes": 192919,
      "packages": [],
      "grade_timeout_sec": 10973,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 106
    },
    {
      "task": "two-way-determinization",
      "challenge": "TwoWayDeterminization",
      "family": "129",
      "family_title": "Exponential state costs for two-way automata",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.TwoWayComplementation.explicit_family_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 41,
      "bytes": 378696,
      "packages": [],
      "grade_timeout_sec": 11140,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 137
    },
    {
      "task": "type-system-normalization",
      "challenge": "TypeSystemNormalization",
      "family": "245",
      "family_title": "The $\\beta$-Barendregt\u2013Geuvers\u2013Klop conjecture",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.PureTypeSystem.weak_implies_strong"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 33,
      "bytes": 1579764,
      "packages": [],
      "grade_timeout_sec": 12221,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 187
    },
    {
      "task": "uniform-commutator",
      "challenge": "UniformCommutator",
      "family": "288",
      "family_title": "Kadison's similarity conjecture",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.Kadison.uniform_commutator"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 656,
      "bytes": 2642027,
      "packages": [],
      "grade_timeout_sec": 13177,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 7060
    },
    {
      "task": "uniform-gamma",
      "challenge": "UniformGamma",
      "family": "291",
      "family_title": "Toms\u2013Winter and equivariant Jiang\u2013Su stability",
      "subject": "Operator algebras",
      "theorems": [
        "OAI.ComparatorModel.CurrentMain.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 51,
      "bytes": 736242,
      "packages": [],
      "grade_timeout_sec": 11462,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 534
    },
    {
      "task": "uniform-k-server",
      "challenge": "UniformKServer",
      "family": "110",
      "family_title": "Optimal-order randomized $k$-server on arbitrary metrics",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.UniformKServer.uniform_squared_logarithmic_main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 410,
      "bytes": 2194822,
      "packages": [],
      "grade_timeout_sec": 12775,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1209
    },
    {
      "task": "uniform-sparsest-cut",
      "challenge": "UniformSparsestCut",
      "family": "117",
      "family_title": "Uniform sparsest cut: hardness and semidefinite gaps",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.UniformSparsestCut.mainGap"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 55,
      "bytes": 488362,
      "packages": [],
      "grade_timeout_sec": 11239,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 392
    },
    {
      "task": "unique-games-theorem",
      "challenge": "UniqueGamesTheorem",
      "family": "102",
      "family_title": "The Unique Games Conjecture and optimal approximation thresholds",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.UniqueGamesTheorem.theorem11"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 478,
      "bytes": 8704327,
      "packages": [],
      "grade_timeout_sec": 18633,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1292
    },
    {
      "task": "universal-f-infinity",
      "challenge": "UniversalFInfinity",
      "family": "250",
      "family_title": "The Boone\u2013Higman conjecture and higher finiteness",
      "subject": "Group theory",
      "theorems": [
        "OAI.UniversalFInfinity.universal_group_of_type_FInfinity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 50,
      "bytes": 884044,
      "packages": [],
      "grade_timeout_sec": 11595,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 502
    },
    {
      "task": "variable-wl",
      "challenge": "VariableWL",
      "family": "133",
      "family_title": "The complexity of Weisfeiler\u2013Leman refinement",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.VariableWL.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 61,
      "bytes": 1182668,
      "packages": [],
      "grade_timeout_sec": 11864,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 456
    },
    {
      "task": "velocity-hemisphere",
      "challenge": "VelocityHemisphere",
      "family": "220",
      "family_title": "Directional zero\u2013one laws and ballisticity in random environments",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.DirectionalTransience.positive_probability_transience_velocity_hemisphere"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 585,
      "bytes": 5974000,
      "packages": [],
      "grade_timeout_sec": 16176,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1928
    },
    {
      "task": "vertex-algebra-net",
      "challenge": "VertexAlgebraNet",
      "family": "280",
      "family_title": "Strong locality for strongly rational unitary vertex operator algebras",
      "subject": "Mathematical physics",
      "theorems": [
        "OAI.MinimalVertex.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 77,
      "bytes": 1413292,
      "packages": [],
      "grade_timeout_sec": 12071,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 725
    },
    {
      "task": "vertex-cover",
      "challenge": "VertexCover",
      "family": "102",
      "family_title": "The Unique Games Conjecture and optimal approximation thresholds",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.VertexCover.explicit_cover_gap",
        "OAI.VertexCover.every_fixed_factor_below_two"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 351,
      "bytes": 2275461,
      "packages": [],
      "grade_timeout_sec": 12847,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1027
    },
    {
      "task": "vlasov-maxwell",
      "challenge": "VlasovMaxwell",
      "family": "362",
      "family_title": "Global smoothness for relativistic Vlasov\u2013Maxwell",
      "subject": "Partial differential equations",
      "theorems": [
        "OAI.RVM.global_classical_solution"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 207,
      "bytes": 4841359,
      "packages": [],
      "grade_timeout_sec": 15157,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1368
    },
    {
      "task": "wl-identification",
      "challenge": "WLIdentification",
      "family": "133",
      "family_title": "The complexity of Weisfeiler\u2013Leman refinement",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.WLIdentification.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 67,
      "bytes": 765224,
      "packages": [],
      "grade_timeout_sec": 11488,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 358
    },
    {
      "task": "weak-hessian",
      "challenge": "WeakHessian",
      "family": "356",
      "family_title": "Gigli's characterization of Alexandrov curvature",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.WeakHessian.every_geodesic"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 542,
      "bytes": 3136506,
      "packages": [],
      "grade_timeout_sec": 13622,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 1565
    },
    {
      "task": "weak-mtw-global-support",
      "challenge": "WeakMTWGlobalSupport",
      "family": "360",
      "family_title": "Villani\u2019s convexity conjecture and regular optimal transport",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.WeakMTWGlobalSupport.current_main_convexity"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 210,
      "bytes": 903567,
      "packages": [],
      "grade_timeout_sec": 11613,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 891
    },
    {
      "task": "weighted-sweep-moments",
      "challenge": "WeightedSweepMoments",
      "family": "238",
      "family_title": "Optimal logarithmic mixing of the Thorp shuffle",
      "subject": "Probability and statistical mechanics",
      "theorems": [
        "OAI.CubeShuffle.WeightedSweep.weighted_sweep_moments"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 40,
      "bytes": 815310,
      "packages": [],
      "grade_timeout_sec": 11533,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 329
    },
    {
      "task": "weisfeiler-leman",
      "challenge": "WeisfeilerLeman",
      "family": "133",
      "family_title": "The complexity of Weisfeiler\u2013Leman refinement",
      "subject": "Theoretical computer science",
      "theorems": [
        "OAI.WLTime.unconditional_time_lower_bound"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 43,
      "bytes": 917937,
      "packages": [],
      "grade_timeout_sec": 11626,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 301
    },
    {
      "task": "witnessed-choice",
      "challenge": "WitnessedChoice",
      "family": "243",
      "family_title": "Choiceless counting does not capture polynomial time",
      "subject": "Mathematical logic",
      "theorems": [
        "OAI.WitnessedChoice.main"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 27,
      "bytes": 1118157,
      "packages": [],
      "grade_timeout_sec": 11806,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 485
    },
    {
      "task": "yau-counterexample",
      "challenge": "YauCounterexample",
      "family": "350",
      "family_title": "Yau's nodal conjecture: surfaces and counterexamples",
      "subject": "Differential geometry",
      "theorems": [
        "OAI.Yau.Target.yau_nodal_set_upper_bound_counterexample"
      ],
      "definition_holes": [],
      "fixed_definitions": [],
      "n_modules": 1068,
      "bytes": 3664066,
      "packages": [],
      "grade_timeout_sec": 14097,
      "oracle_result": "accepted",
      "oracle_grade_seconds": 2217
    }
  ],
  "excluded": [
    {
      "challenge": "DefocusingNLS",
      "reason": "OAI.DefocusingNLS.sobolevProduct: open definition the theorem statements depend on"
    }
  ],
  "not_validated": [
    {
      "task": "arnold-counterexample",
      "challenge": "ArnoldCounterexample",
      "family": "347",
      "reason": "memory"
    },
    {
      "task": "catalan",
      "challenge": "Catalan",
      "family": "005",
      "reason": "missing-package"
    },
    {
      "task": "coarse-assembly",
      "challenge": "CoarseAssembly",
      "family": "307",
      "reason": "memory"
    },
    {
      "task": "continuum-coulomb-hardness",
      "challenge": "ContinuumCoulombHardness",
      "family": "275",
      "reason": "memory"
    },
    {
      "task": "cycle-clique-ramsey",
      "challenge": "CycleCliqueRamsey",
      "family": "189",
      "reason": "memory"
    },
    {
      "task": "dirichlet-seven-eighths",
      "challenge": "DirichletSevenEighths",
      "family": "003",
      "reason": "missing-package"
    },
    {
      "task": "duke-prime-degree",
      "challenge": "DukePrimeDegree",
      "family": "015",
      "reason": "missing-package"
    },
    {
      "task": "einstein-four",
      "challenge": "EinsteinFour",
      "family": "348",
      "reason": "missing-package"
    },
    {
      "task": "erdos-reciprocal",
      "challenge": "ErdosReciprocal",
      "family": "159",
      "reason": "not completed"
    },
    {
      "task": "hecke-seven-eighths",
      "challenge": "HeckeSevenEighths",
      "family": "003",
      "reason": "missing-package"
    },
    {
      "task": "jacobsthal",
      "challenge": "Jacobsthal",
      "family": "021",
      "reason": "missing-package"
    },
    {
      "task": "jacobsthal-improved",
      "challenge": "JacobsthalImproved",
      "family": "021",
      "reason": "missing-package"
    },
    {
      "task": "joint-dickman",
      "challenge": "JointDickman",
      "family": "012",
      "reason": "missing-package"
    },
    {
      "task": "koebe-circle-domains",
      "challenge": "KoebeCircleDomains",
      "family": "071",
      "reason": "missing-package"
    },
    {
      "task": "mub-six",
      "challenge": "MUBSix",
      "family": "266",
      "reason": "not completed"
    },
    {
      "task": "matrix-multiplication",
      "challenge": "MatrixMultiplication",
      "family": "107",
      "reason": "missing-package"
    },
    {
      "task": "nuclear-ultrapower",
      "challenge": "NuclearUltrapower",
      "family": "292",
      "reason": "memory"
    },
    {
      "task": "occupied-overlap",
      "challenge": "OccupiedOverlap",
      "family": "238",
      "reason": "definition-mismatch"
    },
    {
      "task": "ordinary-two-point-correlations",
      "challenge": "OrdinaryTwoPointCorrelations",
      "family": "007",
      "reason": "missing-package"
    },
    {
      "task": "ostmann-complete",
      "challenge": "OstmannComplete",
      "family": "013",
      "reason": "missing-package"
    },
    {
      "task": "ostmann-primes",
      "challenge": "OstmannPrimes",
      "family": "013",
      "reason": "missing-package"
    },
    {
      "task": "patterson-first-moment",
      "challenge": "PattersonFirstMoment",
      "family": "023",
      "reason": "missing-package"
    },
    {
      "task": "planar-packing",
      "challenge": "PlanarPacking",
      "family": "090",
      "reason": "memory"
    },
    {
      "task": "polycyclic-recognition",
      "challenge": "PolycyclicRecognition",
      "family": "255",
      "reason": "missing-package"
    },
    {
      "task": "quasi-riemann-hypothesis",
      "challenge": "QuasiRiemannHypothesis",
      "family": "003",
      "reason": "missing-package"
    },
    {
      "task": "riesz-quantitative",
      "challenge": "RieszQuantitative",
      "family": "081",
      "reason": "missing-package"
    },
    {
      "task": "siegel-zeros",
      "challenge": "SiegelZeros",
      "family": "003",
      "reason": "missing-package"
    },
    {
      "task": "snaky-certificate",
      "challenge": "SnakyCertificate",
      "family": "187",
      "reason": "memory"
    },
    {
      "task": "snaky-twenty-one",
      "challenge": "SnakyTwentyOne",
      "family": "187",
      "reason": "memory"
    },
    {
      "task": "spin-angle",
      "challenge": "SpinAngle",
      "family": "238",
      "reason": "definition-mismatch"
    },
    {
      "task": "surface-immersion",
      "challenge": "SurfaceImmersion",
      "family": "333",
      "reason": "missing-package"
    },
    {
      "task": "taming-compatibility",
      "challenge": "TamingCompatibility",
      "family": "342",
      "reason": "memory"
    },
    {
      "task": "totient-asymptotic",
      "challenge": "TotientAsymptotic",
      "family": "024",
      "reason": "missing-package"
    },
    {
      "task": "totient-companion-zero",
      "challenge": "TotientCompanionZero",
      "family": "024",
      "reason": "missing-package"
    },
    {
      "task": "universal-tensor-squares",
      "challenge": "UniversalTensorSquares",
      "family": "205",
      "reason": "memory"
    }
  ]
}