Source graph and encoded case-tree records
DefinitionKepler_LPCaseRecordA graph-code record consists of an ordered pair of arbitrary finite Unicode strings: one field called the graph identifier and one called the tree code. Empty strings and repeated strings are allowed. There are no parameters, validity conditions, decoding rules, uniqueness constraints or mathematical propositions attached to construction of such a record.
Source and scope. Primary §9; formal_lp/hypermap/lp_certificate.hl:4–30 and verify_all.hl. Pure Lean encoding bridge: graph identifier plus deterministic tree text; no proof or geometric predicate field.
import Mathlib.Data.Nat.Basic set_option autoImplicit false namespace KeplerMission.SourceLP structure SourceGraphCode where graphId : String treeCode : String end KeplerMission.SourceLP
Read-back
What the Lean code literally says, in plain math · gpt-6
A graph-code record consists of an ordered pair of arbitrary finite Unicode strings: one field called the graph identifier and one called the tree code. Empty strings and repeated strings are allowed. There are no parameters, validity conditions, decoding rules, uniqueness constraints or mathematical propositions attached to construction of such a record.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.