We:
1. Scrape hacker information from the team-finding channel in each hackathon's Slack
2. Use Mixtral-8x7B to extract school, background, and interest from each hacker
3. Embed each hacker's background and interests
4. Create a graph with the hackers as vertices and connect two hackers if their cosine similarity is "close enough"
Our code is at https://github.com/freeman-jiang/nexus, and we owe a lot of the cool visualization work to https://github.com/anvaka/ngraph.pixel. This is my first HN submission. Hope you like it!