Inverse Greedy — five-vertex exponential-clock uniformity classification
Source: github.com/jfairfaxball-348/Inverse-Greedy/tree/f4079bc4601…
Formal classification of positive-rate independent exponential-clock random greedy maximal-independent-set uniformity for all finite simple graphs on at most five vertices: exactly the five-vertex path is excluded, up to graph isomorphism.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-19-000021
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000021/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000021/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'