A command line tool for computational hard problems and their reductions
active 2026-01-25 → 2026-08-10 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 198 days from 2026-01-25 to 2026-08-10. Pushes: 681 total, peak 60 in a day. Pull requests: 95 total, peak 8 in a day. Issues: 468 total, peak 134 in a day. Comments: 408 total, peak 30 in a day. Stars: 4 total, peak 1 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 |
|---|---|---|---|---|
| GiggleLiu | 662 | 419 | 66 | 91 |
| isPANN | 587 | 151 | 13 | 116 |
| zazabap | 271 | 105 | 14 | 70 |
| Copilot | 108 | 2 | 1 | 78 |
| codecov[bot] | 50 | 0 | 0 | 50 |
| QingyunQian | 17 | 0 | 0 | 0 |
| github-actions[bot] | 7 | 4 | 0 | 3 |
| hmyuuu | 6 | 0 | 1 | 0 |
| zhangjieqingithub | 3 | 0 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
- Pull request#1122isPANN2026-08-07 11:24
- Issue#434isPANN2026-05-28 05:38[Rule] Optimal Linear Arrangement to Consecutive Ones Matrix Augmentation
- Issue#413isPANN2026-05-27 18:11[Model] ShortestCommonSuperstring
- Issue comment#363isPANN2026-05-27 07:19[Rule] PARTITION to INTEGRAL FLOW WITH MULTIPLIERS
- Issue#1027isPANN2026-05-26 05:34[Rule] PrizeCollectingSteinerForest to SteinerTree
- Issue#1027isPANN2026-05-26 05:34[Rule] PrizeCollectingSteinerForest to SteinerTree
- Issue comment#475isPANN2026-05-26 04:44[Rule] Register Sufficiency to Sequencing to Minimize Maximum Cumulative Cost
- Issue comment#470isPANN2026-05-26 04:31[Rule] Clique to Sequencing to Minimize Tardy Tasks
- Issue comment#472isPANN2026-05-26 04:31[Rule] Optimal Linear Arrangement to Sequencing to Minimize Weighted Completion Time
- Issue#435isPANN2026-05-26 03:23[Rule] Hamiltonian Path to Consecutive Block Minimization
- Issue#435isPANN2026-05-26 03:23[Rule] Hamiltonian Path to Consecutive Block Minimization
- Issue#435isPANN2026-05-26 03:23[Rule] Hamiltonian Path to Consecutive Block Minimization
- Issue comment#435isPANN2026-05-26 03:23[Rule] Hamiltonian Path to Consecutive Block Minimization
- Issue comment#781isPANN2026-05-26 03:17[Rule] IntegerKnapsack to ILP
- Issue#781isPANN2026-05-26 03:14[Rule] IntegerKnapsack to ILP
- Issue comment#781isPANN2026-05-26 03:14[Rule] IntegerKnapsack to ILP
- Issue comment#425isPANN2026-05-26 03:05[Rule] Vertex Cover to Multiple Copy File Allocation
- Issue#865isPANN2026-05-26 03:02[Rule] MINIMUM COVER to MINIMUM DISJUNCTIVE NORMAL FORM
- Issue comment#517isPANN2026-05-26 03:02[Rule] Partition to Quadratic Programming
- Issue comment#433isPANN2026-05-26 03:02[Rule] Hamiltonian Path (for cubic graphs) to Consecutive Ones Matrix Partition
- Issue comment#238isPANN2026-05-25 18:22[Rule] HAMILTONIAN CIRCUIT to BOUNDED COMPONENT SPANNING FOREST
- Pull request#1060isPANN2026-05-01 01:03
- Issue comment#1056codecov[bot]2026-04-18 00:38Redefine BMF as exact Boolean matrix factorization
- Issue#1006GiggleLiu2026-04-17 02:53bug: 5 unsound reductions — reduce_to() constructions are mathematically incorrect
- Issue comment#944isPANN2026-04-14 11:49[Rule] ExactCoverBy3Sets → MinimumWeightSolutionToLinearEquations
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 4 stars here means stars gained during the window, not the repo's star count.