Pith. sign in

REVIEW 3 cited by

Chook -- A comprehensive suite for generating binary optimization problems with planted solutions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.14344 v2 pith:RQQQIWV2 submitted 2020-05-28 quant-ph cond-mat.dis-nncs.OH

Dilina Perera , Inimfon Akpabio , Firas Hamze , Salvatore Mandra , Nathan Rose , Maliheh Aramon , Helmut G. Katzgraber This is my paper · ORCID
classification quant-phcond-mat.dis-nncs.OH
keywords plantingchookproblemsoptimizationsolutionsbinarycomplexitygenerate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present Chook, an open-source Python-based tool to generate discrete optimization problems of tunable complexity with a priori known solutions. Chook provides a cross-platform unified environment for solution planting using a number of techniques, such as tile planting, Wishart planting, equation planting, and deceptive cluster loop planting. Chook also incorporates planted solutions for higher-order (beyond quadratic) binary optimization problems. The support for various planting schemes and the tunable hardness allows the user to generate problems with a wide range of complexity on different graph topologies ranging from hypercubic lattices to fully-connected graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cosm: Collective Switched Motion for Fast and Accurate Sparse Ising Optimization

    cs.CE 2026-04 accept novelty 7.5 of 10

    Cosm finds certified optimal cuts on Gset G72/G77/G81 and reduces best-known times-to-target on G61/G70 from hundreds of hours to 36–303 s via switched circular dynamics.

  2. Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines

    cond-mat.dis-nn 2024-11 accept novelty 6.0 of 10

    A tensor-network branch-and-bound solver is slower and slightly less accurate than Ising machines on large random Pegasus and Zephyr spin glasses, but beats them on planted-instance energy.

  3. Continuous Approximation of the Ising Hamiltonian: Exact Ground States and Applications to Fidelity Assessment in Ising Machines

    physics.comp-ph 2024-11 conditional novelty 5.0 of 10

    For couplings J_ij=(i^d+j^d)/N^d, the ground state is a two-block configuration whose boundary is set by an algebraic equation, giving an exact benchmark for Ising machines.

Pith tools