Humach Graph: Node Classification
Reason about graph structure, node features, message passing and leakage across connected data.
Download mini_graph.csvUse Python, SQL, Excel or your preferred workflow unless a task specifies otherwise.
Project dataset
Download CSVInspect the CSV before you answer the tasks
Scroll horizontally or vertically to examine the exact miniature data used by the validator.
| node_id | degree | activity | community | target |
|---|---|---|---|---|
| 1 | 5 | 0.29 | 1 | 1 |
| 2 | 8 | 0.38 | 2 | 0 |
| 3 | 3 | 0.47 | 0 | 0 |
| 4 | 6 | 0.56 | 1 | 1 |
| 5 | 9 | 0.65 | 2 | 0 |
| 6 | 4 | 0.74 | 0 | 0 |
| 7 | 7 | 0.83 | 1 | 1 |
| 8 | 2 | 0.92 | 2 | 0 |
| 9 | 5 | 0.2 | 0 | 0 |
| 10 | 8 | 0.29 | 1 | 1 |
| 11 | 3 | 0.38 | 2 | 0 |
| 12 | 6 | 0.47 | 0 | 0 |
| 13 | 9 | 0.56 | 1 | 1 |
| 14 | 4 | 0.65 | 2 | 0 |
| 15 | 7 | 0.74 | 0 | 0 |
| 16 | 2 | 0.83 | 1 | 1 |
| 17 | 5 | 0.92 | 2 | 0 |
| 18 | 8 | 0.2 | 0 | 0 |
| 19 | 3 | 0.29 | 1 | 1 |
| 20 | 6 | 0.38 | 2 | 0 |
| 21 | 9 | 0.47 | 0 | 0 |
| 22 | 4 | 0.56 | 1 | 1 |
| 23 | 7 | 0.65 | 2 | 0 |
| 24 | 2 | 0.74 | 0 | 0 |
| 25 | 5 | 0.83 | 1 | 1 |
| 26 | 8 | 0.92 | 2 | 0 |
| 27 | 3 | 0.2 | 0 | 0 |
| 28 | 6 | 0.29 | 1 | 1 |
| 29 | 9 | 0.38 | 2 | 0 |
| 30 | 4 | 0.47 | 0 | 0 |
Project workspace
Analyse → validate → submit.
Numeric and decision tasks are auto-checked. Written reasoning is checked for completeness and key ideas, then included in your local submission report.
0/5 validated
How many nodes have target=1?
What is mean node degree?
After two message-passing layers, a node representation can depend on approximately…
Describe one way a random node split can leak information in a graph setting.
Submit your project locally
HumachLearn stores no server-side data. Submission creates a portable JSON report containing your answers, validation state and timestamp.