A binary labeling of a graph is a function from its nodes to {0,1}. Scenery reconstruction is the problem of inferring a labeling given the labels observed by a particle performing a random walk on the graph. We consider the question of when a random walk on a finite abelian group with a given step distribution is reconstructive, or can be used to reconstruct a binary labeling up to a shift. We...