The finale states the register split: exact one-hot selection and rational probabilities, with the logarithm named. It is one loss, not a broader claim.

highlighted = computed this step

What is exact

The exact register contains the one-hot target, the rational probability vector, the sum-to-one check, and the structural selection of the correct class probability 1/2.

pk=1/2selected exactlyp_k=1/2\quad\text{selected exactly}
Cross-entropy exactlyOne-hot selection with named log boundary.cross-entropy term selectionclassy_ip_itermA01/40 (one-hot drop)B11/2-log(1/2)C01/40 (one-hot drop)H=-log(1/2)exact one-hot selection plus named log boundary; one loss on one pinned probabilitydistribution; NOT learning

What is named

The loss value is named as -log(1/2). The render pins no logarithm decimal. The required note states exact one-hot selection plus named log boundary.

H=log(1/2)namedH=-\log(1/2)\quad\text{named}
Cross-entropy exactlyOne-hot selection with named log boundary.cross-entropy term selectionclassy_ip_itermA01/40 (one-hot drop)B11/2-log(1/2)C01/40 (one-hot drop)H=-log(1/2)exact one-hot selection plus named log boundary; one loss on one pinned probabilitydistribution; NOT learning

What cross-entropy is and is not

This is one loss on one pinned probability distribution. It is exact up to the named log boundary; it is NOT learning, NOT a softmax computation, and NOT a broader model claim.

one exact-or-named loss, deferred claims explicit\text{one exact-or-named loss, deferred claims explicit}
Cross-entropy exactlyOne-hot selection with named log boundary.cross-entropy term selectionclassy_ip_itermA01/40 (one-hot drop)B11/2-log(1/2)C01/40 (one-hot drop)H=-log(1/2)exact one-hot selection plus named log boundary; one loss on one pinned probabilitydistribution; NOT learning