fix: nitpicks from reviews

Author: jaybuidl

contracts/src/arbitration/KlerosCore.sol

@@ -1266,14 +1266,14 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             newDisputeKitID >= disputeKits.length ||
             newRoundNbVotes == 0
         ) {
-            // Falling back to the current court and dispute kit with default nbVotes.
+            // Falling back to the current court and dispute kit with default nbVotes increase.
             newCourtID = _dispute.courtID;
             newDisputeKitID = disputeKitID;
             newRoundNbVotes = (_round.nbVotes * 2) + 1;
         }
         // Ensure compatibility between the next round's court and dispute kit.
         if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-            // Falling back to `DisputeKitClassic` which is always supported and with default nbVotes.
+            // Falling back to `DisputeKitClassic` which is always supported and with default nbVotes increase.
             newDisputeKitID = DISPUTE_KIT_CLASSIC;
             newRoundNbVotes = (_round.nbVotes * 2) + 1;
         }

contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol

@@ -302,6 +302,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     ) internal isActive(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
         if (period != KlerosCore.Period.commit) revert NotCommitPeriod();
+        if (_voteIDs.length == 0) revert EmptyVoteIDs();
         if (_commit == bytes32(0)) revert EmptyCommit();
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];

contracts/src/libraries/SortitionTrees.sol

@@ -43,8 +43,7 @@ library SortitionTrees {
 
     /// @notice Draw an ID from a tree using a number.
     ///
-    /// @dev This function reverts if the sum of all values in the tree is 0.
-    /// `O(k * log_k(n))` where
+    /// @dev `O(k * log_k(n))` where
     /// `k` is the maximum number of children per node in the tree,
     ///  and `n` is the maximum number of nodes ever appended.
     ///