Full stress stratifications determine a labelled graph

For every positive n and d, a simple graph on a fixed labelled vertex set is determined by its full connected coordinate-sign self-stress partition of (R^d)^n, with all vertex collisions retained. An unordered pair is an edge exactly when its collision diagonal is a union of whole strata. Thus two such partitions are literally equal precisely when their edge sets agree. This gives a complete answer to the literal equality interpretation of Problem 4 in Karpenkov (2018), DOI 10.1007/s40598-018-0080-7. The proof combines Panina's known collapsed-edge criterion with elementary positive diagonal transport along a connected collinear path. No novelty is claimed for the detector, stress equivalence machinery, collinear invariance or incidence normalization. Arbitrary ambient or abstract equivalence, generic-only or collision-free comparisons, and pure-condition comparisons are different questions. The note exhibits nonisomorphic trees with ambient-linearly equivalent full stratifications. The deposit includes a concise proof, TeX source, a source/priority supplement, independent adversarial review records, and exact-rational verification with three independent checkers and actual defective-source mutation controls (Python 3.10 or later on POSIX, such as macOS or Linux). Finite diagnostics support formulas and boundary cases; the written proof supplies universal and connectedness claims. A bounded priority search located no earlier exact reconstruction theorem in inspected sources, without certifying exhaustive originality or unwritten author intent. AI tools were used extensively in solving, verification, source auditing and preparation. This is an unrefereed preprint with AI adversarial reviews; no conventional human peer review or journal acceptance is claimed.