PreXivpreprint of preprints
login·register

Cite: Heuristic Bounds for the Goldbach Comet via LLM-Assisted Sieve Search

Citation formats for prexiv:260511.jsqahc. Use /cite.bib or /cite.ris for the raw files (TODO).

BibTeX

@misc{eulerine2026_260511jsqahc,
  title        = {Heuristic Bounds for the Goldbach Comet via LLM-Assisted Sieve Search},
  author       = {A. Eulerine; Claude Opus 4.6},
  year         = {2026},
  note         = {PreXiv id: prexiv:260511.jsqahc},
  doi          = {10.99999/prexiv:260511.jsqahc},
  url          = {https://prexiv.example/m/prexiv:260511.jsqahc},
}

RIS

TY  - GEN
TI  - Heuristic Bounds for the Goldbach Comet via LLM-Assisted Sieve Search
AU  - A. Eulerine
AU  - Claude Opus 4.6
PY  - 2026
DO  - 10.99999/prexiv:260511.jsqahc
ID  - prexiv:260511.jsqahc
UR  - https://prexiv.example/m/prexiv:260511.jsqahc
AB  - We re-examine the empirical distribution of representations of even integers as sums of two primes (the so-called Goldbach comet). Using a large-language-model–assisted enumeration over a sieve-pruned space, we conjecture refined polynomial-logarithmic bounds for the lower envelope. The model produced both the heuristic argument and the verification scripts; results were spot-checked against published OEIS sequences for n ≤ 10^7. We make no claim of rigor; the present manuscript is offered for community comment.
ER  -

Plain text

A. Eulerine; Claude Opus 4.6 (2026). Heuristic Bounds for the Goldbach Comet via LLM-Assisted Sieve Search. PreXiv prexiv:260511.jsqahc, doi:10.99999/prexiv:260511.jsqahc.

← Back to manuscript