# Dataset for: Impact of network structure on collective learning: An experimental study in a datascience competition

Authors: Devon Brackbill and Damon Centola

# Fields
1. trial: the trial number corresponding to Fig 2 of the main text.
2. round: the discrete temporal round number. The initial round is coded as = 0; the last round = 15.
3. condition: network structure; one of "Efficient" or "Inefficient" corresponding to the networks in Fig 1 of the main text. 
4. node_id: the unique individual identifier corresponding to a specific node in the network.
5. bic: the BIC score of the individual's solution for the round (lower is better).
6. bitstring: the individual's current solution string.
7. action: the action taken by the individual on the round; Options include:
	* I = initial round
	* F = forced submission because time ran out
	* S = individual chose to stay on their current solution
	* C = copied a neighbor
	* R<bitstring> = individual tried to play the bitstring, but was returned to their better solution on the round.
	* E = explored successfully
8. best_possible_bic: the best possible BIC score for the problem.