Starting with the grid

This puzzle was relatively straightforward, and we can start verifying whether certain cells in the grid are a part of the box using the arrows provided.

Original grid provided in the puzzle
Original grid provided in the puzzle

Using the arrows

Let CC denote the set of cells belonging to the box. Arrow cells are guaranteed to lie outside CC, and their arrows encode the direction(s) of the nearest box cell(s). For an arrow cell p∉Cp \notin C, define the directional distance dv(p,C)d_v(p, C) as the distance from pp to the nearest box cell lying in direction vv. The arrow at pp points in direction vv when vv achieves the smallest directional distance. In other words, the box is closer in the pointing directions than in any other direction. When the arrow points in multiple directions, those directions are all tied: the box is equally close in each of them.

This gives us an elimination rule. Let D(p)D(p) be the set of directions the arrow points to, and Dˉ(p)={N, S, E, W}∖D(p)\bar{D}(p) = \{\text{N, S, E, W}\} \setminus D(p) the non-pointing directions. The box is strictly farther away in every non-pointing direction than in any pointing direction. Since pp itself is not in the box, the nearest box cell in any pointing direction is at least 11 step away, which means the nearest box cell in any non-pointing direction is at least 22 steps away, indicating that the immediate neighbours of pp in a non-pointing direction are excluded from CC.

Grid after applying the elimination rule to all arrow cells
Grid after applying the elimination rule to all arrow cells

Once we have leveraged the existing rules to exclude as many cells as possible, we can use the numbers on the grid along with arrows pointing to them to mark certain cells as part of the box. For example, the arrow cell in the bottom right points both north and west, and the nearest box cell in the north is 9 cells away, hence the nearest box cell in the west must also be 9 cells away.

Finding the box cells

Numbers also indicate how many Chebyshev-adjacent cells are part of the box, and it is also stated that there are no holes in the connected area on the grid. From this, we can deduce that an arrow cell pointing in all four directions must have dv(p,C)≥2d_v(p, C) \geq 2 for every vv. If the box were only 11 step away in some direction, then the box would wrap around pp and create a hole in the box cells.

Red cells guaranteed, yellow cells uncertain
Red cells guaranteed, yellow cells uncertain

From here, we have several unfilled cells that may or may not be a part of the box, and several yellow cells that each represent a binary choice — exactly one of two candidate configurations must hold.

Connecting the faces

We leverage information that numbers with grey circles should be directly opposite another number with a grey circle, and numbers with gray squares should be orthogonally adjacent to another number with a gray square.

Number cells highlighted according to the shapes
Number cells highlighted according to the shapes

Additionally, we consider the number of folds between the grid areas, as well as the total surface area of the box in terms of cells. By considering the 3D structure of the puzzle, we narrow down the possibilities by different areas of the grid together via the given constraints and the geometric shapes.

Coloured borders correspond to connections in 3D
Coloured borders correspond to connections in 3D

From there, we fill in uncertain cells based on the configuration of the 3D box as required, and end up with our final solution.

Final solution, colour coded by 3D face
Final solution, colour coded by 3D face

The finished box

And of course we have to physically print and assemble the final solution.

Final solution physically assembled :)
Final solution physically assembled :)