From the webpage:
Welcome to our monthly puzzles
You are cordially invited to match wits with some of the best minds in IBM Research.
Seems some of us can’t see a problem without wanting to take a crack at solving it. Does that sound like you? Good. Forge ahead and ponder this month’s problem. We’ll post a new one every month, and allow a month for you to submit solutions (we may even publish submitted answers, especially if they’re correct). We usually won’t reply individually to submitted solutions but every few days we will update a list of people who answered correctly. At the beginning of the next month, we’ll post the answer.
The August 2013 puzzle starts off:
Put five-bit numbers on the vertices of a 9-dimensional hypercube such that, from any vertex, you can reach any number in no more than two moves along the edges of the hypercube.
(…)
A worked example using four-bit numbers on a 5-dimensional hypercube is given.
Are higher dimension data structures in your future?