{"schema":"vela.problem-packet.v0.1","problem":745,"statement":"Describe the size of the second largest component of the random graph on $n$ vertices, where each edge is included independently with probability $1/n$.","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}