{"analysis_contract_sha256":"5a4075ac9691fba54e6f077cd4f970f1b86a6ee27643cff5f559685de42071df","analysis_id":"analysis.word-ladder-records-v1","calculations":[{"calculation_id":"research.count-v1","confidence":"deterministic","description":"Count vertices, edges, islands, components, or solvable doublet pairs in each declared group.","formula":"count(records)","limitations":[],"source_fields":["normalized_spelling","frequency_tier"]},{"calculation_id":"research.share-v1","confidence":"deterministic","description":"Calculate the exact share of eligible records inside a declared connectivity group.","formula":"100 * group_count / eligible_records","limitations":["Shares depend directly on source breadth and the declared eligibility policy."],"source_fields":["normalized_spelling","frequency_tier"]},{"calculation_id":"research.maximum-v1","confidence":"deterministic","description":"Take the largest connected-component size within a declared length graph.","formula":"max(component_size)","limitations":["The maximum depends on the exact eligible vertex population."],"source_fields":["normalized_spelling"]},{"calculation_id":"research.shortest-path-v1","confidence":"deterministic","description":"Find the exact fewest substitution steps between two named eligible endpoints.","formula":"min_steps(breadth_first_search(start, target))","limitations":["A missing value means no ladder exists inside this build's eligible graph, not that no ladder exists in English."],"source_fields":["normalized_spelling"]},{"calculation_id":"research.longest-shortest-path-found-v1","confidence":"heuristic","description":"Take the longest certified breadth-first distance found by deterministic farthest-vertex sweeps over every component.","formula":"max(certified_bfs_distance over sweeps)","limitations":["The sweep certifies a lower bound; the true longest shortest path may be longer."],"source_fields":["normalized_spelling"]}],"charts":[{"accessible_summary":"Exact per-length counts appear in the adjacent table.","category_column_id":"length","chart_id":"study.word-ladder-records.connectivity-chart","chart_type":"grouped-bar","dataset_id":"study.word-ladder-records.connectivity","heading":"Eligible records and islands by length","series":[{"label":"Eligible records","value_column_id":"word_count"},{"label":"Island records","value_column_id":"island_count"}],"table_id":"study.word-ladder-records.connectivity-table"}],"citations":[{"citation_id":"citation.lexical-sources","citation_kind":"dataset","data_version":"2026.07-lexical.6","publisher":"The Word Index","source_id":null,"title":"The Word Index pinned lexical source manifest","url":"/about/data","version":"2026.07-lexical.6"},{"citation_id":"citation.frequencywords","citation_kind":"dataset","data_version":null,"publisher":"FrequencyWords","source_id":"frequencywords-en-2018","title":"FrequencyWords English 2018","url":"https://raw.githubusercontent.com/hermitdave/FrequencyWords/525f9b560de45753a5ea01069454e72e9aa541c6/content/2018/en/en_50k.txt","version":"git:525f9b560de45753a5ea01069454e72e9aa541c6; corpus-release:2018"},{"citation_id":"citation.content-policy","citation_kind":"policy","data_version":null,"publisher":"The Word Index","source_id":"offensive-term-policy","title":"The Word Index content-safety exclusion policy","url":"/about/data","version":"2026.07-review-pending.2"},{"citation_id":"citation.carroll-doublets","citation_kind":"method","data_version":null,"publisher":"Vanity Fair (1879)","source_id":null,"title":"Doublets: a verbal puzzle","url":"https://en.wikipedia.org/wiki/Word_ladder","version":"1879"}],"concise_result":"Across lengths 3-7, 51,741 eligible records form 101,904 one-letter substitution links; the longest certified shortest ladder found spans 52 steps, and 10 of 10 classic doublet pairs have a ladder in this build.","content_artifact_digest":"477542693badcafd96a49a013917cb986d413ee48d738561b13d04fa8f330416","data_version":"2026.07-lexical.6","datasets":[{"columns":[{"calculation_id":null,"column_id":"row_id","label":"Row ID","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":null,"column_id":"stage","label":"Population stage","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":"research.count-v1","column_id":"record_count","label":"Records","role":"measure","unit":"records","value_type":"integer"}],"dataset_id":"study.word-ladder-records.population","description":"Exact record counts before and after the declared product-policy and study filters.","primary_download":false,"rows":[{"record_count":394595,"row_id":"raw","stage":"Raw lexical ledger"},{"record_count":150,"row_id":"policy-excluded","stage":"Excluded by product policy"},{"record_count":394445,"row_id":"safe","stage":"Safe normalized-spelling records"},{"record_count":51741,"row_id":"analysis","stage":"Records meeting this study's inclusion criteria"}],"title":"Study population"},{"columns":[{"calculation_id":null,"column_id":"row_id","label":"Row ID","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":null,"column_id":"measure","label":"Measure","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":"research.count-v1","column_id":"item_count","label":"Count","role":"measure","unit":"items","value_type":"integer"},{"calculation_id":"research.share-v1","column_id":"share_percent","label":"Share of eligible records","role":"measure","unit":"percent","value_type":"decimal-string"},{"calculation_id":"research.longest-shortest-path-found-v1","column_id":"path_steps","label":"Ladder length (steps)","role":"measure","unit":"steps","value_type":"integer"}],"dataset_id":"study.word-ladder-records.summary","description":"Headline connectivity records derived from the per-length graphs.","primary_download":false,"rows":[{"item_count":51741,"measure":"Eligible records across lengths 3-7","path_steps":null,"row_id":"eligible-records","share_percent":null},{"item_count":101904,"measure":"Substitution links","path_steps":null,"row_id":"substitution-links","share_percent":null},{"item_count":11855,"measure":"Island records with no substitution neighbor","path_steps":null,"row_id":"island-records","share_percent":"22.91"},{"item_count":10,"measure":"Classic doublet pairs with a ladder in this build","path_steps":null,"row_id":"solved-doublets","share_percent":null},{"item_count":null,"measure":"Longest certified shortest ladder found","path_steps":52,"row_id":"longest-path-found","share_percent":null}],"title":"Ladder-record summary"},{"columns":[{"calculation_id":null,"column_id":"row_id","label":"Row ID","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":null,"column_id":"length","label":"Letters","role":"dimension","unit":null,"value_type":"integer"},{"calculation_id":"research.count-v1","column_id":"word_count","label":"Eligible records","role":"measure","unit":"records","value_type":"integer"},{"calculation_id":"research.count-v1","column_id":"edge_count","label":"Substitution links","role":"measure","unit":"edges","value_type":"integer"},{"calculation_id":"research.count-v1","column_id":"island_count","label":"Island records","role":"measure","unit":"records","value_type":"integer"},{"calculation_id":"research.count-v1","column_id":"component_count","label":"Components","role":"measure","unit":"components","value_type":"integer"},{"calculation_id":"research.maximum-v1","column_id":"largest_component_size","label":"Largest component","role":"measure","unit":"records","value_type":"integer"},{"calculation_id":"research.share-v1","column_id":"largest_component_share_percent","label":"Largest-component share","role":"measure","unit":"percent","value_type":"decimal-string"},{"calculation_id":"research.longest-shortest-path-found-v1","column_id":"longest_path_steps","label":"Longest certified ladder found","role":"measure","unit":"steps","value_type":"integer"}],"dataset_id":"study.word-ladder-records.connectivity","description":"Eligible vertices, substitution edges, isolated island records, components, and the longest certified shortest ladder found at each length.","primary_download":true,"rows":[{"component_count":6,"edge_count":7767,"island_count":5,"largest_component_share_percent":"99.48","largest_component_size":965,"length":3,"longest_path_steps":9,"row_id":"length-3","word_count":970},{"component_count":78,"edge_count":20740,"island_count":66,"largest_component_share_percent":"97.55","largest_component_size":3785,"length":4,"longest_path_steps":17,"row_id":"length-4","word_count":3880},{"component_count":913,"edge_count":24635,"island_count":743,"largest_component_share_percent":"85.59","largest_component_size":7364,"length":5,"longest_path_steps":30,"row_id":"length-5","word_count":8604},{"component_count":4374,"edge_count":24721,"island_count":3259,"largest_component_share_percent":"55.15","largest_component_size":8385,"length":6,"longest_path_steps":39,"row_id":"length-6","word_count":15204},{"component_count":10277,"edge_count":24041,"island_count":7782,"largest_component_share_percent":"33.07","largest_component_size":7634,"length":7,"longest_path_steps":52,"row_id":"length-7","word_count":23083}],"title":"Ladder-graph connectivity by length"},{"columns":[{"calculation_id":null,"column_id":"row_id","label":"Row ID","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":null,"column_id":"doublet_pair","label":"Doublet","role":"dimension","unit":null,"value_type":"text"},{"calculation_id":null,"column_id":"length","label":"Letters","role":"dimension","unit":null,"value_type":"integer"},{"calculation_id":"research.count-v1","column_id":"eligible_endpoints","label":"Eligible endpoints","role":"measure","unit":"records","value_type":"integer"},{"calculation_id":"research.shortest-path-v1","column_id":"shortest_path_steps","label":"Shortest ladder (steps)","role":"measure","unit":"steps","value_type":"integer"}],"dataset_id":"study.word-ladder-records.classic-doublets","description":"Lewis Carroll's published doublet endpoints checked for eligibility and an exact shortest substitution ladder; an empty step count means no ladder exists within this build's eligible graph.","primary_download":false,"rows":[{"doublet_pair":"ape to man","eligible_endpoints":2,"length":3,"row_id":"doublet-ape-man","shortest_path_steps":5},{"doublet_pair":"eel to pie","eligible_endpoints":2,"length":3,"row_id":"doublet-eel-pie","shortest_path_steps":4},{"doublet_pair":"pig to sty","eligible_endpoints":2,"length":3,"row_id":"doublet-pig-sty","shortest_path_steps":5},{"doublet_pair":"cold to warm","eligible_endpoints":2,"length":4,"row_id":"doublet-cold-warm","shortest_path_steps":4},{"doublet_pair":"four to five","eligible_endpoints":2,"length":4,"row_id":"doublet-four-five","shortest_path_steps":6},{"doublet_pair":"head to tail","eligible_endpoints":2,"length":4,"row_id":"doublet-head-tail","shortest_path_steps":4},{"doublet_pair":"flour to bread","eligible_endpoints":2,"length":5,"row_id":"doublet-flour-bread","shortest_path_steps":6},{"doublet_pair":"tears to smile","eligible_endpoints":2,"length":5,"row_id":"doublet-tears-smile","shortest_path_steps":6},{"doublet_pair":"wheat to bread","eligible_endpoints":2,"length":5,"row_id":"doublet-wheat-bread","shortest_path_steps":6},{"doublet_pair":"winter to summer","eligible_endpoints":2,"length":6,"row_id":"doublet-winter-summer","shortest_path_steps":6}],"title":"Classic doublet pairs checked against this build"}],"description":"Reproducible connectivity statistics for one-letter-substitution ladder graphs of lengths three through seven, with classic doublet pairs checked against this build.","downloads":[{"contains":["study.word-ladder-records.population","study.word-ladder-records.summary","study.word-ladder-records.connectivity","study.word-ladder-records.classic-doublets"],"filename":"word-ladder-records.csv","media_type":"text/csv","sha256":"54c99e38006afb47ec40b6f66b29e103e2745a7f1fe0227ee0013cb0736a2081","size_bytes":53446,"status":"available-review-pending"}],"exclusions":[{"criterion_id":"word-ladder-records.product-policy","description":"Exclude spellings matched by the exact first-party content-safety policy before building the graphs."},{"criterion_id":"word-ladder-records.outside-length-window","description":"Exclude spellings shorter than three or longer than seven letters from the graphs."}],"facts":[{"calculation_id":"research.count-v1","column_id":"record_count","dataset_id":"study.word-ladder-records.population","denominator":null,"display_value":"51,741","fact_id":"study.word-ladder-records.analysis-record-count","label":"Analysis population","numerator":null,"row_id":"analysis","unit":"records","value":51741},{"calculation_id":"research.count-v1","column_id":"item_count","dataset_id":"study.word-ladder-records.summary","denominator":null,"display_value":"51,741","fact_id":"study.word-ladder-records.eligible-count","label":"Eligible ladder records","numerator":null,"row_id":"eligible-records","unit":"records","value":51741},{"calculation_id":"research.share-v1","column_id":"share_percent","dataset_id":"study.word-ladder-records.summary","denominator":51741,"display_value":"22.91%","fact_id":"study.word-ladder-records.island-share","label":"Eligible records with no substitution neighbor","numerator":11855,"row_id":"island-records","unit":"percent","value":"22.91"},{"calculation_id":"research.longest-shortest-path-found-v1","column_id":"path_steps","dataset_id":"study.word-ladder-records.summary","denominator":null,"display_value":"52","fact_id":"study.word-ladder-records.longest-path-found","label":"Longest certified shortest ladder found","numerator":null,"row_id":"longest-path-found","unit":"steps","value":52},{"calculation_id":"research.count-v1","column_id":"item_count","dataset_id":"study.word-ladder-records.summary","denominator":null,"display_value":"10","fact_id":"study.word-ladder-records.solved-doublet-count","label":"Classic doublet pairs solvable in this build","numerator":null,"row_id":"solved-doublets","unit":"pairs","value":10}],"inclusion_criteria":[{"criterion_id":"word-ladder-records.vertex-eligibility","description":"Include safe normalized spellings of lengths three through seven with ranking tier three or better as graph vertices."},{"criterion_id":"word-ladder-records.edge-rule","description":"Connect two vertices of the same length exactly when they differ by one letter substitution."}],"initial_cohort":false,"lexical_build_id":"647a998abcbf65af6a16c86cb8460cb4a88761a94544468e9c9e992208fc327c","lexical_manifest_sha256":"46665edef6a77a00080debaa2209f630f4d220ad2888055fa730731f93dc0561","lexical_release_timestamp":"2026-07-26T00:00:00+00:00","limitations":["Vertex eligibility uses build-specific ranking bands and the product safety policy, so connectivity describes this exact build only.","The longest-ladder records are certified lower bounds from deterministic sweeps, not exhaustive all-pairs searches.","Classic doublet endpoints are quoted from a public-domain 1879 puzzle; historical solutions may use spellings this build excludes.","The aggregate download contains counts, step records, and the quoted doublet endpoints only; it does not redistribute word lists."],"narrative":[{"block_id":"study.word-ladder-records.result","fact_ids":["study.word-ladder-records.eligible-count","study.word-ladder-records.longest-path-found","study.word-ladder-records.solved-doublet-count"],"heading":null,"interpretation_kind":"computed","paragraphs":["Across lengths 3-7, 51,741 eligible records form 101,904 one-letter substitution links; the longest certified shortest ladder found spans 52 steps, and 10 of 10 classic doublet pairs have a ladder in this build."]},{"block_id":"study.word-ladder-records.scope","fact_ids":["study.word-ladder-records.island-share"],"heading":"How the records are certified","interpretation_kind":"methodological","paragraphs":["Longest-ladder values come from deterministic farthest-vertex sweeps: each is an exact shortest path between two eligible records, so it is a certified lower bound and the true maximum may be longer. Vertex eligibility uses build-specific ranking tiers and the product safety policy; it does not establish universal English usage or acceptance in any game."]}],"output_license":"No reuse licence asserted; source-rights review pending","output_license_url":"/about/data","population_sha256":"7798828cb6e2550c00fb9a5d580356d6651d4efd562f192dda4824636ccd2b1f","publication_status":"published","related_searches":[{"label":"Find one-letter-different words","relevance":"Explore substitution neighbors for any spelling with pattern wildcards.","url":"/pattern-finder"}],"reproducibility_command":"make studies_reproduce STUDY=word-ladder-records","research_question":"How connected are this build's one-letter-substitution ladder graphs at each length, how long are the longest certified shortest ladders, and which classic doublet pairs remain solvable here?","review":{"approved_analysis_contract_digest":"5a4075ac9691fba54e6f077cd4f970f1b86a6ee27643cff5f559685de42071df","approved_content_artifact_digest":"477542693badcafd96a49a013917cb986d413ee48d738561b13d04fa8f330416","approved_content_version":"1.0.1","approved_data_version":"2026.07-lexical.6","approved_lexical_build_id":"647a998abcbf65af6a16c86cb8460cb4a88761a94544468e9c9e992208fc327c","approved_result_sha256":"f345513834072a8e9aa014222e704200dbb572959d84f1aaafa6ba98b2420b82","editorial_approval":"TWI-v1.4.0-editorial-review-2026-08-02-r1","editorial_status":"approved","factual_approval":null,"factual_status":"machine-validated","legal_approval":null,"legal_status":"pending","reevaluate_on":"2026-10-13","reviewed_at":"2026-08-02","reviewer":"Matthew Iles","search_approval":null,"search_eligibility_reason":"The reproducible artifact remains noindex pending source-rights review and separate search approval.","search_eligible":false},"schema_version":1,"slug":"word-ladder-records","sources":[{"artifact_sha256":"3ed0c94610d8bcf7c11bbb49c56aa49c7234d32b66824df91f554169e572da48","attribution":"dwyl/english-words; the repository carries an Unlicense notice, while its pinned README attributes upstream copyright to Infochimps","establishes":["source-membership","surface-spelling-as-listed"],"legal_review_status":"pending","licence_name":"Unlicense notice; upstream dataset rights unresolved","licence_url":"https://raw.githubusercontent.com/dwyl/english-words/8179fe68775df3f553ef19520db065228e65d1d3/LICENSE.md","limitations":["The pinned repository licence is the Unlicense, but the pinned README says copyright in the extracted source list remains with Infochimps. Human legal review of the upstream rights chain is required.","Do not assert a redistribution right until the Infochimps-to-dwyl rights chain has been reviewed by a human.","Dialect or scope: unspecified"],"redistribution_status":"pending","source_class":"broad-orthographic-list","source_id":"dwyl-english-words","source_version":"git:8179fe68775df3f553ef19520db065228e65d1d3","url":"https://raw.githubusercontent.com/dwyl/english-words/8179fe68775df3f553ef19520db065228e65d1d3/words_alpha.txt"},{"artifact_sha256":"d3fbe8485022088fcf527edcde2fbdc18b4bbc141ac58123c9adb462e086eaf7","attribution":"ENABLE (Enhanced North American Benchmark Lexicon); exact reuse terms are pending legal review","establishes":["source-membership","surface-spelling-as-listed"],"legal_review_status":"pending","licence_name":"Licence terms not stated by the source","licence_url":"https://www.wordgamedictionary.com/enable/","limitations":["The downloaded artifact is content-pinned by SHA-256, but it contains no licence notice and the configured source page does not state reuse terms.","The artifact is reproducibly pinned but no affirmative reuse grant has been located; redistribution approval remains pending.","Dialect or scope: North-American-oriented; exact edition metadata unavailable"],"redistribution_status":"pending","source_class":"historical-game-word-list","source_id":"enable","source_version":"artifact-sha256:d3fbe8485022088fcf527edcde2fbdc18b4bbc141ac58123c9adb462e086eaf7","url":"https://www.wordgamedictionary.com/enable/download/enable.txt"},{"artifact_sha256":"ee2d83651fbb91642bbed2bd30ead404c2cfbdfece01dacf284af6ea47795811","attribution":"first20hours/google-10000-english, derived from the Google Web Trillion Word Corpus and Peter Norvig's compilation","establishes":["source-membership","source-order"],"legal_review_status":"pending","licence_name":"No explicit licence grant in pinned repository metadata","licence_url":"https://raw.githubusercontent.com/first20hours/google-10000-english/bdf4c221bc120b0b7f6c3f1eff1cc1abb975f8d8/LICENSE.md","limitations":["The exact pinned LICENSE.md describes provenance but contains no explicit public-domain dedication or licence grant. Human review is required.","The pinned repository documents provenance but does not supply an affirmative licence grant; do not describe it as public domain.","Dialect or scope: USA no-swears variant"],"redistribution_status":"pending","source_class":"ranked-web-corpus-derived-list","source_id":"google-10000-english","source_version":"git:bdf4c221bc120b0b7f6c3f1eff1cc1abb975f8d8","url":"https://raw.githubusercontent.com/first20hours/google-10000-english/bdf4c221bc120b0b7f6c3f1eff1cc1abb975f8d8/google-10000-english-usa-no-swears.txt"},{"artifact_sha256":"5351ff405b1126ef555791dd4d9798a48e3e9a501a9fc481a9da957752cfb458","attribution":"FrequencyWords content derived from OpenSubtitles, licensed CC BY-SA 4.0","establishes":["source-token-observation","source-token-count"],"legal_review_status":"pending","licence_name":"CC BY-SA 4.0 (content)","licence_url":"https://raw.githubusercontent.com/hermitdave/FrequencyWords/525f9b560de45753a5ea01069454e72e9aa541c6/README.md","limitations":["The exact pinned README states MIT for code and CC BY-SA 4.0 for content. Human review is required for attribution and ShareAlike obligations on compiled and derived data.","Content is declared CC BY-SA 4.0. Attribution and ShareAlike treatment of the compiled frequency evidence and derived tiers require human approval.","Dialect or scope: unspecified"],"redistribution_status":"pending","source_class":"subtitle-derived-token-frequency","source_id":"frequencywords-en-2018","source_version":"git:525f9b560de45753a5ea01069454e72e9aa541c6; corpus-release:2018","url":"https://raw.githubusercontent.com/hermitdave/FrequencyWords/525f9b560de45753a5ea01069454e72e9aa541c6/content/2018/en/en_50k.txt"},{"artifact_sha256":"ef70bc128a3ae67c23c5a4e31ec6b0ef3780e94881faa3adf9b73c2f7f684b4d","attribution":"The Word Index first-party content-safety exclusion policy","establishes":["content_filter","search_results","result_counts"],"legal_review_status":"pending","licence_name":"Reuse terms not yet approved","licence_url":null,"limitations":["This bounded policy list cannot determine whether every usage is offensive or benign."],"redistribution_status":"pending","source_class":"first-party-content-safety-policy","source_id":"offensive-term-policy","source_version":"2026.07-review-pending.2","url":"/about/data"}],"study_build_id":"58d14ba703bf2aa768fc674b3e0f25cae2ad7ec7eb59a0149d5b0d22feb95a5b","study_id":"study.word-ladder-records","study_version":"1.0.1","tables":[{"caption":"The exact population used by this version of the analysis.","column_ids":["stage","record_count"],"dataset_id":"study.word-ladder-records.population","heading":"Population and exclusions","note":null,"row_ids":["raw","policy-excluded","safe","analysis"],"table_id":"study.word-ladder-records.population-table"},{"caption":"Counts and step records derive from the per-length graphs below.","column_ids":["measure","item_count","share_percent","path_steps"],"dataset_id":"study.word-ladder-records.summary","heading":"Headline ladder records","note":null,"row_ids":["eligible-records","substitution-links","island-records","solved-doublets","longest-path-found"],"table_id":"study.word-ladder-records.summary-table"},{"caption":"An island record has no eligible one-letter substitution neighbor; isolated records count as singleton components.","column_ids":["length","word_count","edge_count","island_count","component_count","largest_component_size","largest_component_share_percent","longest_path_steps"],"dataset_id":"study.word-ladder-records.connectivity","heading":"Connectivity by spelling length","note":null,"row_ids":["length-3","length-4","length-5","length-6","length-7"],"table_id":"study.word-ladder-records.connectivity-table"},{"caption":"Step counts are exact breadth-first shortest paths inside the eligible graph; historical solutions may use spellings this build excludes.","column_ids":["doublet_pair","length","eligible_endpoints","shortest_path_steps"],"dataset_id":"study.word-ladder-records.classic-doublets","heading":"Classic doublets checked against this build","note":null,"row_ids":["doublet-ape-man","doublet-eel-pie","doublet-pig-sty","doublet-cold-warm","doublet-four-five","doublet-head-tail","doublet-flour-bread","doublet-tears-smile","doublet-wheat-bread","doublet-winter-summer"],"table_id":"study.word-ladder-records.doublet-table"}],"title":"Word-ladder connectivity records and classic doublets","transformation_steps":[{"description":"Bucket vertices by single-blank hole patterns to enumerate substitution edges, then derive components, islands, and certified path records with deterministic breadth-first searches.","deterministic":true,"limitations":["Insertion and deletion edges are deliberately out of scope for this graph version."],"transformation_id":"word-ladder-records.graph-build-v1"}],"update_history":[{"data_version":"2026.07-lexical.5","effective_date":"2026-07-25","result_sha256":"aa9ce9bdb34a71f396a63c9c8b2e546908e4c9fcd1cbfc41bd10c4c731725d95","review_status":"machine-validated","reviewer":null,"study_version":"1.0.0","summary":"Initial reproducible aggregate release, bound at the 2026.07-lexical.5 integration build."},{"data_version":"2026.07-lexical.6","effective_date":"2026-07-26","result_sha256":"aa9ce9bdb34a71f396a63c9c8b2e546908e4c9fcd1cbfc41bd10c4c731725d95","review_status":"machine-validated","reviewer":null,"study_version":"1.0.0","summary":"Rebound byte-identical results to the 2026.07-lexical.6 data release; no numeric changes."},{"data_version":"2026.07-lexical.6","effective_date":"2026-08-01","result_sha256":"f345513834072a8e9aa014222e704200dbb572959d84f1aaafa6ba98b2420b82","review_status":"machine-validated","reviewer":null,"study_version":"1.0.1","summary":"Bound the user relevance claim to this build and its declared source and eligibility rules."}],"user_relevance":"The records show whether a ladder is possible between two spellings in this build and explain why a pair may lack a path under the declared source and eligibility rules."}