OCMEBilingual mathematics & derivations繁體中文

Explore related knowledge and questions →

Question 27529: Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 138

← Question derivation index · Original question batch

R0054-27529 · q-20261015-advance-20261118-r06-regular-expression-0079

Original question and givens

Use mode=bounded_equality, complete model={"alphabet":["a"],"left":{"type":"epsilon"},"right":{"type":"union","children":[{"type":"epsilon"},{"type":"concat","children":[{"type":"symbol","value":"a"},{"type":"symbol","value":"a"}]}]},"max_length":1}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).

  • G001 — Use mode=bounded_equality, complete model={"alphabet":["a"],"left":{"type":"epsilon"},"right":{"type":"union","children":[{"type":"epsilon"},{"type":"concat","children":[{"type":"symbol","value":"a"},{"type":"symbol","value":"a"}]}]},"max_length":1}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

source roles = [regex-boundary]

After

derived = [[mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary]]

Conditions: none

List the complete operation/mode field order without JavaScript or answer-shape inference;Boolean,string,null and an unclaimed result remain distinct.

Step identifiers and dependencies

Rule: source_ordered_fields_without_JS · Uses: G001

S002 · implies

Before

source roles = [Regex boundary LEFT.ast, [a], {'type': 'epsilon'}]

After

derived = [{'type': 'epsilon'}, {type:"epsilon"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S001

S003 · implies

Before

source roles = [[a], 1]

After

derived = [2]

Conditions: none

The bounded universe has sum |alphabet|^k words,including epsilon,and source budget<=4096.This defines complete bounded enumeration,not unbounded equivalence.

Step identifiers and dependencies

Rule: Regex_COMPLETE_bounded_word_universe_not_unbounded_equivalence · Uses: G001, S002

S004 · implies

Before

source roles = [Regex boundary LEFT.language, epsilon, {'type': 'epsilon'}, 1]

After

derived = [[[]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S003

S005 · implies

Before

source roles = [Regex boundary RIGHT.ast.children[0], [a], {'type': 'epsilon'}]

After

derived = [{'type': 'epsilon'}, {type:"epsilon"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S004

S006 · implies

Before

source roles = [Regex boundary RIGHT.ast.children[1].children[0], [a], {'type': 'symbol', 'value': 'a'}]

After

derived = [{'type': 'symbol', 'value': 'a'}, {type:"symbol",value:"a"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S005

S007 · implies

Before

source roles = [Regex boundary RIGHT.ast.children[1].children[1], [a], {'type': 'symbol', 'value': 'a'}]

After

derived = [{'type': 'symbol', 'value': 'a'}, {type:"symbol",value:"a"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S006

S008 · implies

Before

source roles = [Regex boundary RIGHT.ast.children[1], [a], {'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}]

After

derived = [{'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}, {children:[{type:"symbol",value:"a"},{type:"symbol",value:"a"}],type:"concat"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S007

S009 · implies

Before

source roles = [Regex boundary RIGHT.ast, [a], {'type': 'union', 'children': [{'type': 'epsilon'}, {'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}]}]

After

derived = [{'type': 'union', 'children': [{'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}, {'type': 'epsilon'}]}, {children:[{children:[{type:"symbol",value:"a"},{type:"symbol",value:"a"}],type:"concat"},{type:"epsilon"}],type:"union"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S008

S010 · implies

Before

source roles = [[a], 1]

After

derived = [2]

Conditions: none

The bounded universe has sum |alphabet|^k words,including epsilon,and source budget<=4096.This defines complete bounded enumeration,not unbounded equivalence.

Step identifiers and dependencies

Rule: Regex_COMPLETE_bounded_word_universe_not_unbounded_equivalence · Uses: G001, S009

S011 · implies

Before

source roles = [Regex boundary RIGHT.language.union[0].concat[0], symbol, {'type': 'symbol', 'value': 'a'}, 1]

After

derived = [[[a]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S010

S012 · implies

Before

source roles = [Regex boundary RIGHT.language.union[0], 0, 1, [[]], [[a]]]

After

derived = [[[a]]]

Conditions: none

In ORIGINAL concatenation order take EVERY prefix/next-child word concatenation and discard only excessive length.If total length<=m,every factor length<=m,so truncation loses no allowed combination.

Step identifiers and dependencies

Rule: Regex_EACH_ordered_concatenation_complete_cartesian_word_products · Uses: G001, S011

S013 · implies

Before

source roles = [Regex boundary RIGHT.language.union[0].concat[1], symbol, {'type': 'symbol', 'value': 'a'}, 1]

After

derived = [[[a]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S012

S014 · implies

Before

source roles = [Regex boundary RIGHT.language.union[0], 1, 1, [[a]], [[a]]]

After

derived = [[]]

Conditions: none

In ORIGINAL concatenation order take EVERY prefix/next-child word concatenation and discard only excessive length.If total length<=m,every factor length<=m,so truncation loses no allowed combination.

Step identifiers and dependencies

Rule: Regex_EACH_ordered_concatenation_complete_cartesian_word_products · Uses: G001, S013

S015 · implies

Before

source roles = [Regex boundary RIGHT.language.union[1], epsilon, {'type': 'epsilon'}, 1]

After

derived = [[[]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S014

S016 · implies

Before

source roles = [Regex boundary RIGHT.language, 1, [[], [[]]]]

After

derived = [[[]]]

Conditions: none

Union includes ALL child languages,retaining each word once without reordering its symbols.Structural induction accounts for inclusion/exclusion of every word within the bound.

Step identifiers and dependencies

Rule: Regex_union_ALL_child_languages_extensional_bound · Uses: G001, S015

S017 · implies

Before

source roles = [Regex boundary LEFT next.ast, [a], {'type': 'epsilon'}]

After

derived = [{'type': 'epsilon'}, {type:"epsilon"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S016

S018 · implies

Before

source roles = [[a], 2]

After

derived = [3]

Conditions: none

The bounded universe has sum |alphabet|^k words,including epsilon,and source budget<=4096.This defines complete bounded enumeration,not unbounded equivalence.

Step identifiers and dependencies

Rule: Regex_COMPLETE_bounded_word_universe_not_unbounded_equivalence · Uses: G001, S017

S019 · implies

Before

source roles = [Regex boundary LEFT next.language, epsilon, {'type': 'epsilon'}, 2]

After

derived = [[[]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S018

S020 · implies

Before

source roles = [Regex boundary RIGHT next.ast.children[0], [a], {'type': 'epsilon'}]

After

derived = [{'type': 'epsilon'}, {type:"epsilon"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S019

S021 · implies

Before

source roles = [Regex boundary RIGHT next.ast.children[1].children[0], [a], {'type': 'symbol', 'value': 'a'}]

After

derived = [{'type': 'symbol', 'value': 'a'}, {type:"symbol",value:"a"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S020

S022 · implies

Before

source roles = [Regex boundary RIGHT next.ast.children[1].children[1], [a], {'type': 'symbol', 'value': 'a'}]

After

derived = [{'type': 'symbol', 'value': 'a'}, {type:"symbol",value:"a"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S021

S023 · implies

Before

source roles = [Regex boundary RIGHT next.ast.children[1], [a], {'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}]

After

derived = [{'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}, {children:[{type:"symbol",value:"a"},{type:"symbol",value:"a"}],type:"concat"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S022

S024 · implies

Before

source roles = [Regex boundary RIGHT next.ast, [a], {'type': 'union', 'children': [{'type': 'epsilon'}, {'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}]}]

After

derived = [{'type': 'union', 'children': [{'type': 'concat', 'children': [{'type': 'symbol', 'value': 'a'}, {'type': 'symbol', 'value': 'a'}]}, {'type': 'epsilon'}]}, {children:[{children:[{type:"symbol",value:"a"},{type:"symbol",value:"a"}],type:"concat"},{type:"epsilon"}],type:"union"}]

Conditions: none

For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.

Step identifiers and dependencies

Rule: Regex_EACH_typed_node_exact_keys_symbol_scope_union_set_concat_order · Uses: G001, S023

S025 · implies

Before

source roles = [[a], 2]

After

derived = [3]

Conditions: none

The bounded universe has sum |alphabet|^k words,including epsilon,and source budget<=4096.This defines complete bounded enumeration,not unbounded equivalence.

Step identifiers and dependencies

Rule: Regex_COMPLETE_bounded_word_universe_not_unbounded_equivalence · Uses: G001, S024

S026 · implies

Before

source roles = [Regex boundary RIGHT next.language.union[0].concat[0], symbol, {'type': 'symbol', 'value': 'a'}, 2]

After

derived = [[[a]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S025

S027 · implies

Before

source roles = [Regex boundary RIGHT next.language.union[0], 0, 2, [[]], [[a]]]

After

derived = [[[a]]]

Conditions: none

In ORIGINAL concatenation order take EVERY prefix/next-child word concatenation and discard only excessive length.If total length<=m,every factor length<=m,so truncation loses no allowed combination.

Step identifiers and dependencies

Rule: Regex_EACH_ordered_concatenation_complete_cartesian_word_products · Uses: G001, S026

S028 · implies

Before

source roles = [Regex boundary RIGHT next.language.union[0].concat[1], symbol, {'type': 'symbol', 'value': 'a'}, 2]

After

derived = [[[a]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S027

S029 · implies

Before

source roles = [Regex boundary RIGHT next.language.union[0], 1, 2, [[a]], [[a]]]

After

derived = [[[a, a]]]

Conditions: none

In ORIGINAL concatenation order take EVERY prefix/next-child word concatenation and discard only excessive length.If total length<=m,every factor length<=m,so truncation loses no allowed combination.

Step identifiers and dependencies

Rule: Regex_EACH_ordered_concatenation_complete_cartesian_word_products · Uses: G001, S028

S030 · implies

Before

source roles = [Regex boundary RIGHT next.language.union[1], epsilon, {'type': 'epsilon'}, 2]

After

derived = [[[]]]

Conditions: none

The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.

Step identifiers and dependencies

Rule: Regex_atomic_language_EMPTY_versus_EPS_versus_literal_symbol · Uses: G001, S029

S031 · implies

Before

source roles = [Regex boundary RIGHT next.language, 2, [[[a, a]], [[]]]]

After

derived = [[[a, a], []]]

Conditions: none

Union includes ALL child languages,retaining each word once without reordering its symbols.Structural induction accounts for inclusion/exclusion of every word within the bound.

Step identifiers and dependencies

Rule: Regex_union_ALL_child_languages_extensional_bound · Uses: G001, S030

S032 · implies

Before

source roles = [1, [[]], [[]], 2]

After

derived = [[[]], [[], [a, a]], Yes, Yes, No]

Conditions: none

First verify complete equality through the bound,then an ACTUAL difference at the next bound.This concrete distinction refutes unbounded equivalence,not nonmembership inferred from an insufficient short enumeration.

Step identifiers and dependencies

Rule: Regex_ACTUAL_equal_through_bound_AND_next_length_distinction · Uses: G001, S031

Reverse checks

  • S032 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S031 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S030 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S029 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S028 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S027 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S026 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S025 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S024 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S023 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S022 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S021 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S020 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S019 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S018 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S017 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S016 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S015 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S014 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S013 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S012 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S011 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S010 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S009 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S008 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S007 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S006 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S005 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S004 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S003 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S002 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S001 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.

Result

(bounded_equality, 1, [[]], [[]], Yes, 2, [[]], [[], [a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: f611775611c437300ce66596e559c9b4e89b13b46c006de660c2c71823a40e3c
  • candidate record SHA-256: 54fd4eedde7a6d2eac08912685d8161a3f21b873dfa2e4c0b29b083ae42e1159
  • semantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54
  • question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON