REVIEW 2 cited by
A Simple Proof of Thue's Theorem on Circle Packing
Not yet reviewed by Pith; the record is open.
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
A Simple Proof of Thue's Theorem on Circle Packing
read the original abstract
A simple proof of Thue theorem on Circle Packing is given. The proof is only based on density analysis of Delaunay triangulation for the set of points that are centers of circles in a saturated circle configuration.
Forward citations
Cited by 2 Pith papers
-
Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems
Neural networks transform initial embeddings into feasible unit disk configurations for QUBO problems on Rydberg qubits and outperform the Gurobi solver in experiments.
-
Neural optimization for quantum architectures: graph embedding problems with Distance Encoder Networks
A modified autoencoder with a custom embedding loss learns spatial mappings to solve the constrained unit disk problem for qubit embedding on neutral-atom quantum processors and outperforms classical solvers under fix...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.