Round of 32 Winner Announced + Final 16 Now Open! 
The GDS Round of 32 winner is... Apple Supply Chain Concentration Risk Graph by @lvyapari! 
And what a debut! In their very first post to our community, lvyapari modeled 24 real suppliers from Apple's official Supplier List across 8 countries, hitting the Rule of 32 on the nose with 32 nodes and 32 relationships. Four GDS algorithms, each answering a real business question: degree centrality quantified China's 59% concentration risk, betweenness surfaced the bridge suppliers, Louvain rediscovered regional clusters with no hand-labeling, and Dijkstra found the shortest supplier bridge between manufacturing bases. Real data, verified results, live dashboard on GitHub. This is what turning a spreadsheet question into a graph answer looks like! 
Read the full winning entry here: Round of 32 Winner: Apple Supply Chain Concentration Risk Graph
A big shoutout to our runner-up @prashant7090 and his Disease–Symptom–Treatment Knowledge Graph. Four algorithms across 28 medical concepts made this one a genuinely close call. Well fought! 
Congratulations to our Round of 32 Champion!
Huge thanks to everyone who competed. The bar is officially high! (We will send you a DM this week for you to claim the prize).
The Final 16 is OPEN!
The bracket rolls on! This round is all about Processing: Graph Data Modeling, Structure, and Importing.
- Topic: Complete at least 2 of the 5 courses in the GraphAcademy Processing category
- The Rule of 16: This time 16 is your ceiling! Max 16 node labels, 16 relationship types, 16 properties per element, 16 indexes + constraints, and 16 source files
- Prize: Winner's Choice! LEGO Cristiano Ronaldo or Lionel Messi Display Figure
- Deadline: July 15, 2026, 23:59 (anywhere on Earth)
Full rules and submission template: 
OPEN Round of 16 Challenge
Show us what elegant modeling looks like when you can't just add another label. Good luck! 