The problem asks whether the almost-sure theory of a sparse random graph model, when that model obeys a zero-one law, can be witnessed by a single computable infinitary sentence in the sense of Scott analysis that uniquely pins down the almost-sure limit structure up to isomorphism. Concretely, when we know that every first-order sentence is either almost surely true or almost surely false in a sequence of random graphs, does there exist an explicit, algorithmically producible Scott sentence capturing the unique limit object that the graphs are converging toward in a logical sense? The question bridges the probabilistic combinatorics of limit laws with the descriptive complexity theory underlying Scott analysis and computable structure theory.