{"id":7479,"job_id":14471,"problem_id":1,"lane_id":5,"type":"explore","user_id":127,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Job #14471: route 447 first look, outcome `progress`. Granville–Kurlberg (2005) is the framework; the twin tile fails its hypothesis (1) exactly at shift-2 collisions; the averaged form holds\n\nSource reading only; cpu_hours 0.\n\n## Evidence\nSource reading; no computation. Rung of each statement: derived from the cited text, checkable by reading.\n\n**Nearest prior work is not on route 447's record:** Granville and Kurlberg, \"Poisson statistics via the Chinese remainder theorem\", arXiv:math/0412135v2 (2005; local copy sha256 f3f1add6…). For CRT sets Ω_q = ∏ Ω_p, they prove that k-level correlations converge to Poisson, R_k(X, Ω_q) → vol(X), and hence that spacings are Poisson as s_q = q/|Ω_q| → ∞ (Theorem 12, p. 18; Theorem 1, p. 3). The hypothesis is (1): N_k(h, Ω_p) = r_p^k · p · (1 + O_k((1 − r_p) p^(−ε))) for every h with distinct entries mod p. It recovers Hooley's reduced-residue case, where Ω_p = Z/p minus {0}.\n\n**The twin-slot tile violates (1), exactly through the shift by 2.** Here Ω_p = Z/p minus {0, −2} for p ≥ 5, and r_p = 1 − 2/p. For h with distinct entries:\n- N_k = p − 2k + c(h), where c(h) counts pairs with h_j − h_i ≡ ±2 (mod p);\n- so ε_k(h, p) = c(h)/p + O(k²/p²).\n\nAt a colliding tuple the error is about 1/p = (1 − r_p) · Θ(1), with no factor p^(−ε). The proof uses the worst case A_{p,k} (Proposition 11, p. 15; display (16), p. 16). Its small-d Euler product then contains ∏_{p≤x}(1 + O(k/p)) ≍ (log x)^(O(k)). Since s_q ≍ ln² x for the tile, the polynomial saving s_q^(−δ) cannot absorb this. So neither Theorem 1 nor Theorem 12 applies as stated.\n\n**What does hold.** Averaged over h mod p, the tile's error is small. Colliding tuples are a fraction O(k²/p) of all h and carry error O(1/p); the rest carry O(k²/p²). So (1/p^(k−1)) Σ_h |ε_k(h, p)| ≪ k²/p², which is summable. That is the averaged hypothesis GK raise on p. 4 (\"perhaps it suffices to simply assume an averaged form of (1)\") and leave unproved.\n\nTwo repairs are needed:\n1. Small d: replace p·A_{p,k} in (16) by the h-sum, which gives ∏(1 + O(k²/p²)), a convergent product.\n2. Large d: the γ_{i,j}(h) = gcd(c, h_j − h_i) bookkeeping of §3.1 (Lemma 6, Corollaries 8 and 9) must also track the coincidences h_j − h_i ≡ ±2. Use gcd(c, (h_j − h_i)(h_j − h_i − 2)(h_j − h_i + 2)); each condition then places h_j in at most 3 classes, which costs factors 3^(ω(γ)).\n\nThat is a bounded derivation, not a new method.\n\n**A second gap the route names, (ii), is real and GK do not close it.** They give correlations, hence convergence of the gap distribution, but no moment bound. E[g²]/mbar² → 2, i.e. CV²_tile → 1, also needs uniform integrability of (g/mbar)². Montgomery–Vaughan (Ann. Math. 1986) bound V_λ only for one class. A two-class third-moment bound is still needed.\n\n**Effect on the route.** Step (i) of the held method maps to a named, citable framework with one identified failing hypothesis, rather than a from-scratch Gallagher average. The finite check (iii) is not needed to decide (i).\n\n## Sources\n- A. Granville, P. Kurlberg, Poisson statistics via the Chinese remainder theorem, [arXiv:math/0412135](https://arxiv.org/abs/math/0412135), v2 (21 Feb 2005), pp. 1–4 and 9–19. Local copy sha256 f3f1add6fd5c91780ebbd0c15e57aa36a240e644202b7769b5aa7779cfc5f498, local-only.\n- Route 447 (revision 1); return #7395.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-11-21T01:35:35.894Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[7395],"messages":[]},"tokens":{"log":"summary","input":20,"models":{"claude-opus-5-5":11411},"output":11411,"source":"reported","entries":0,"cache_read":5083883,"cache_write":33507,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"medium","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":{"outcome":"progress","route_id":447,"next_step":{"method":"(1) Prove (1/p^(k−1)) Σ_{h mod p} |ε_k(h, p)| ≪_k p^(−2) for the tile, with explicit constants: count colliding tuples and expand N_k = p − 2k + c(h). (2) Redo display (16) of arXiv:math/0412135 with that average in place of p·A_{p,k}, and state the resulting Euler product. (3) Redo §3.1 with γ_{i,j}(h) = gcd(c, (h_j − h_i)(h_j − h_i − 2)(h_j − h_i + 2)). Re-prove Lemma 6 and Corollaries 8 and 9 with the extra factor 3^(ω(γ)), and check that the large-d terms (20)–(21) still give s_q^(−δ) with s_q ≍ ln² x. (4) State plainly that this gives the gap distribution only. Record which moment bound is still needed for E[g²]/mbar² → 2 (a two-class analogue of Montgomery–Vaughan V_3).","compute":{"ram_gb":1,"disk_gb":0,"cpu_hours":0},"failure":"Some step needs a bound that the shift-2 coincidences break, for example the large-d count losing more than a power of log against s_q ≍ ln² x. Name the failing inequality.","success":"A written derivation of steps (1)–(3), with explicit k-dependence, giving R_k → vol(X) for the tile. The remaining obligation is then only the uniform-integrability moment bound.","question":"Does Granville–Kurlberg's Proposition 11 go through for the twin-slot tile (Ω_p = Z/p minus {0, −2}, p ≥ 5) once the worst-case bound A_{p,k} is replaced by the h-average of |ε_k(h, p)| and the coincidence structure includes h_j − h_i ≡ ±2? Does it give R_k(X, Ω_q) → vol(X) for every fixed k?","budget_hours":3,"required_tools":[],"required_sources":[]},"depends_on":[7395],"evidence_md":"Source reading; no computation. Rung of each statement: derived from the cited text, checkable by reading.\n\n**Nearest prior work is not on route 447's record:** Granville and Kurlberg, \"Poisson statistics via the Chinese remainder theorem\", arXiv:math/0412135v2 (2005; local copy sha256 f3f1add6…). For CRT sets Ω_q = ∏ Ω_p, they prove that k-level correlations converge to Poisson, R_k(X, Ω_q) → vol(X), and hence that spacings are Poisson as s_q = q/|Ω_q| → ∞ (Theorem 12, p. 18; Theorem 1, p. 3). The hypothesis is (1): N_k(h, Ω_p) = r_p^k · p · (1 + O_k((1 − r_p) p^(−ε))) for every h with distinct entries mod p. It recovers Hooley's reduced-residue case, where Ω_p = Z/p minus {0}.\n\n**The twin-slot tile violates (1), exactly through the shift by 2.** Here Ω_p = Z/p minus {0, −2} for p ≥ 5, and r_p = 1 − 2/p. For h with distinct entries:\n- N_k = p − 2k + c(h), where c(h) counts pairs with h_j − h_i ≡ ±2 (mod p);\n- so ε_k(h, p) = c(h)/p + O(k²/p²).\n\nAt a colliding tuple the error is about 1/p = (1 − r_p) · Θ(1), with no factor p^(−ε). The proof uses the worst case A_{p,k} (Proposition 11, p. 15; display (16), p. 16). Its small-d Euler product then contains ∏_{p≤x}(1 + O(k/p)) ≍ (log x)^(O(k)). Since s_q ≍ ln² x for the tile, the polynomial saving s_q^(−δ) cannot absorb this. So neither Theorem 1 nor Theorem 12 applies as stated.\n\n**What does hold.** Averaged over h mod p, the tile's error is small. Colliding tuples are a fraction O(k²/p) of all h and carry error O(1/p); the rest carry O(k²/p²). So (1/p^(k−1)) Σ_h |ε_k(h, p)| ≪ k²/p², which is summable. That is the averaged hypothesis GK raise on p. 4 (\"perhaps it suffices to simply assume an averaged form of (1)\") and leave unproved.\n\nTwo repairs are needed:\n1. Small d: replace p·A_{p,k} in (16) by the h-sum, which gives ∏(1 + O(k²/p²)), a convergent product.\n2. Large d: the γ_{i,j}(h) = gcd(c, h_j − h_i) bookkeeping of §3.1 (Lemma 6, Corollaries 8 and 9) must also track the coincidences h_j − h_i ≡ ±2. Use gcd(c, (h_j − h_i)(h_j − h_i − 2)(h_j − h_i + 2)); each condition then places h_j in at most 3 classes, which costs factors 3^(ω(γ)).\n\nThat is a bounded derivation, not a new method.\n\n**A second gap the route names, (ii), is real and GK do not close it.** They give correlations, hence convergence of the gap distribution, but no moment bound. E[g²]/mbar² → 2, i.e. CV²_tile → 1, also needs uniform integrability of (g/mbar)². Montgomery–Vaughan (Ann. Math. 1986) bound V_λ only for one class. A two-class third-moment bound is still needed.\n\n**Effect on the route.** Step (i) of the held method maps to a named, citable framework with one identified failing hypothesis, rather than a from-scratch Gallagher average. The finite check (iii) is not needed to decide (i).","prior_art_md":"Search 2026-11-21 (standard), query: \"Granville Kurlberg Poisson statistics via the Chinese remainder theorem spacings reduced residues primorial condition\". Inspected in full: arXiv:math/0412135v2, Theorem 1 (p. 3), §3 (pp. 10–17: Lemma 6, Proposition 7, Corollaries 8–9, Lemma 10, Proposition 11), Theorem 12 and Lemma 13 (p. 18), and the averaged-hypothesis remark (p. 4). Route record: Montgomery–Vaughan 1986; Aryan (k-tuples of reduced residues); FKMPT arXiv:1802.07604; Gallagher 1976; #7395 (CV² 0.5285 at x = 31, about 0.93 at 1e5). Search results also listed arXiv:1502.05062 (gaps between reduced residues; not opened). Exact uncovered step: GK's Proposition 11 with the averaged ε and the shift-2 coincidence bookkeeping, for sets removing two classes {0, −2} per prime; plus a two-class moment bound for uniform integrability. No source found doing either."},"research_route_id":447,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_a81e55ec8c7b2cd27fdc59f3","run_id":"run_08723b65c05d2b7854357532","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"daanmlab","job_brief":"Search online for existing attempts, results, tables and datasets before testing feasibility. Reuse the recorded search and inspect the closest sources and weakest assumption. Use published numbers with citations; do not reproduce them in a first look. Seek the smallest experiment on the uncovered step. Recommend promising only with specific evidence and a bounded next step; do not claim the route is proved. Map the assumptions of any borrowed method onto this problem.\n\nRead GET <project base>/research-routes/447 and return #7395. Return the ordinary report and transcript plus research: {route_id: 447, outcome: \"promising|progress|blocked|inconclusive|known|result|needs_capability\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive: research findings only>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed. If this machine or its budget cannot run the experiment (no suitable GPU, a tool or source it lacks, CPU hours beyond its offer), that is not an obstacle: return outcome needs_capability with next_step (the same experiment, unchanged unless you learned something) whose compute (cpu_hours, ram_gb, disk_gb, gpu, gpu_name, vram_gb), required_tools and required_sources state what it needs and whose shortfall says what this machine lacked. The route stays active and the step is offered only to a machine that has it.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"7395","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[447],"research_url":"/projects/twin-primes/research-routes/447","transcript_url":"/projects/twin-primes/return/7479/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"98202052e94c171314c6d9ff5c18df268bcf8ab2ab16b5b5fd66814ace6065c0","next_step_sha256":"28faed7719f0d30a3ba18bbaeeb9b9071ad68c5b793c4a0df89541524327cb4a","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}