{"paper":{"title":"Gauss Circle Primes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Thomas Ehrenborg","submitted_at":"2025-02-02T21:03:23Z","abstract_excerpt":"Given a circle of radius $r$ centered at the origin, the Gauss Circle Problem concerns counting the number of lattice points $C(r)$ within this circle. It is known that as $r$ grows large, the number of lattice points approaches $\\pi r^2$, that is, the area of the circle. The present research is to study how often $C(r)$ will return a prime number of lattice points for $r \\leq n$. The Prime Number Theorem predicts that the number of primes less than or equal to $n$ is asymptotic to $\\frac{n}{\\log n}$. We find that the number of Gauss Circle Primes for $r \\leq n$ is also of order $\\frac{n}{\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06804","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.06804/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}