Solving OPEN mathematical problems with Aristotle AI theorem prover
active 2025-12-11 → 2026-06-24 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 196 days from 2025-12-11 to 2026-06-24. Pushes: 83 total, peak 7 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 149 total, peak 78 in a day. Comments: 55 total, peak 23 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| kavanaghpatrick | 287 | 83 | 0 | 55 |
Recent activity
Latest issues, pull requests and releases
- Issue comment#73kavanaghpatrick2026-01-06 10:14[Erdős #1] Small n: Verify least_N values for n=5,6,7,8,9
- Issue comment#72kavanaghpatrick2026-01-06 10:14[Erdős #1] Fourier Approach: Resolve exp ambiguity (Real.exp vs Complex.exp)
- Issue#72kavanaghpatrick2026-01-06 09:44[Erdős #1] Fourier Approach: Resolve exp ambiguity (Real.exp vs Complex.exp)
- Issue#71kavanaghpatrick2026-01-06 09:44[Erdős #647] Divisor Function: Find witness n > 24 or prove non-existence
- Issue comment#66kavanaghpatrick2026-01-04 14:30Near-miss: slot61_path4_corrected (1 sorry, 15 proven)
- Issue#68kavanaghpatrick2026-01-04 14:23Near-miss: slot44_adjacent_pair_bound (1 sorry, 14 proven)
- Issue#65kavanaghpatrick2026-01-04 14:22Near-miss: slot39_heavy_edge_forcing (1 sorry, 16 proven)
- Issue#62kavanaghpatrick2026-01-04 14:22Near-miss: slot60_cycle4_full_scaffolding (1 sorry, 20 proven)
- Issue comment#62kavanaghpatrick2026-01-04 14:22Near-miss: slot60_cycle4_full_scaffolding (1 sorry, 20 proven)
- Issue#66kavanaghpatrick2026-01-04 14:16Near-miss: slot61_path4_corrected (1 sorry, 15 proven)
- Issue#64kavanaghpatrick2026-01-04 14:13Audit: Reduce file sizes to 100-200 lines
- Issue#63kavanaghpatrick2026-01-04 14:13Audit: Deprecate boris_minimal pattern (0% success rate)
- Issue#62kavanaghpatrick2026-01-04 14:13Near-miss: slot60_cycle4_full_scaffolding (1 sorry, 20 proven)
- Issue#58kavanaghpatrick2026-01-04 12:53slot254: LP ν* approach resubmission
- Issue#60kavanaghpatrick2026-01-04 12:19slot256: Bridge counting bounds resubmission
- Issue#58kavanaghpatrick2026-01-04 12:19slot254: LP ν* approach resubmission
- Issue#57kavanaghpatrick2026-01-02 23:40Lemma 15: tau_le_8_cycle4 - MAIN THEOREM: τ ≤ 8 for cycle_4
- Issue#54kavanaghpatrick2026-01-02 23:39Lemma 12: eight_edges_well_defined - The 8-edge cover set is well-defined
- Issue#52kavanaghpatrick2026-01-02 23:39Lemma 10: cycle_externals_exactly_one - At most 1 cycle-type external per M-element
- Issue#50kavanaghpatrick2026-01-02 23:38Lemma 8: apex_private_edge_covers_private_external - Apex-private edge covers private externals
- Issue#45kavanaghpatrick2026-01-02 23:38Lemma 3: private_external_contains_apex - Private externals contain fan apex
- Issue#43kavanaghpatrick2026-01-02 23:37Lemma 1: external_uses_cycle_or_private - External triangle classification
- Issue#42kavanaghpatrick2026-01-01 12:37[ν=4] Prove τ ≤ 8 via LP Relaxation (Krivelevich Bound)
- Issue#41kavanaghpatrick2025-12-31 09:08Fix & Resubmit slot49: path4_tau_S_decomposition (1 sorry, 6 proven)
- Issue#39kavanaghpatrick2025-12-31 09:08Fix & Resubmit slot61: Sym2.mk syntax (1 sorry, 15 proven)
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.