AI Slop Code Risk Monitor

haifengl/smile

SlopCodeMonitor badge for haifengl/smile Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).

Statistical Machine Intelligence & Learning Engine

1.6 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for haifengl/smile, a Java project with 6,428 GitHub stars. SynthScan examined 754,717 lines of code across 2439 source files, recording 356 pattern matches distributed across 17 syntactic categories. The legacy adjusted pattern signal is 1.6 (Low pattern signal); it is not an authorship estimate.

Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.

1.6
Adjusted Signal
1.6
Raw Pattern Score
100%
Time Factor
2026-10-31
Last Push
6.4K
Stars
Java
Language
754.7K
Lines of Code
2.4K
Files
356
Pattern Hits
2026-10-31
Scan Date
0.01
HC Hit Rate

Risk Review · Payload v1

Use each vector to guide manual verification of the underlying findings.

Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.

Cognitive Ownership Risk 0.8/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 75 finding(s).

Hallucinated Dependency & Supply Chain Risk 1.9/100 · LOW

Are imports declared and package/API names verified? 32 finding(s).

Agent Over-Engineering Ratio 5.4/100 · LOW

Are wrappers, guards, and repeated structures necessary? 250 finding(s).

PR Review Velocity Impact 7.2/100 · LOW

Which changes need focused human review? 356 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.

Severity Breakdown

Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.

CRITICAL 25HIGH 6MEDIUM 254LOW 71

Directory Score Breakdown

This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.

Pattern Findings

The scanner identified 356 distinct pattern matches across 17 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.

Decorative Section Separators244 hits · 814 pts
SeverityFileLineSnippetContext
MEDIUM⚡core/ASSOCIATION_RULE_MINING.md421// ── FP-Tree construction ──────────────────────────────────────────────────────COMMENT
MEDIUM⚡core/ASSOCIATION_RULE_MINING.md431// ── Frequent item sets ────────────────────────────────────────────────────────COMMENT
MEDIUM⚡core/ASSOCIATION_RULE_MINING.md439// ── Association rules ─────────────────────────────────────────────────────────COMMENT
MEDIUMcore/ANOMALY_DETECTION.md522// ── IsolationForest ──────────────────────────────────────────────────────────COMMENT
MEDIUMcore/ANOMALY_DETECTION.md546// ── SVM (One-Class) ──────────────────────────────────────────────────────────COMMENT
MEDIUMcore/ANOMALY_DETECTION.md565// ── LOF (Local Outlier Factor) ───────────────────────────────────────────────COMMENT
MEDIUM…rc/test/java/smile/classification/ClassLabelsTest.java28 // ── fit(int[]) ─────────────────────────────────────────────────────────────COMMENT
MEDIUM…rc/test/java/smile/classification/ClassLabelsTest.java78 // ── priori ────────────────────────────────────────────────────────────────COMMENT
MEDIUM…rc/test/java/smile/classification/ClassLabelsTest.java101 // ── ni (per-class count) ───────────────────────────────────────────────────COMMENT
MEDIUM…rc/test/java/smile/classification/ClassLabelsTest.java113 // ── indexOf ───────────────────────────────────────────────────────────────COMMENT
MEDIUM…rc/test/java/smile/classification/ClassLabelsTest.java127 // ── scale ─────────────────────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/classification/DiscreteNaiveBayesTest.java381 // ── predict(int[]) correctness — bug fix: must return original label ────────COMMENT
MEDIUM…/java/smile/classification/DiscreteNaiveBayesTest.java417 // ── isSoft / isOnline ─────────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/classification/DiscreteNaiveBayesTest.java438 // ── all model variants accept non-contiguous labels ───────────────────────COMMENT
MEDIUM…/java/smile/classification/DiscreteNaiveBayesTest.java456 // ── TWCNB batch with non-contiguous labels ────────────────────────────────COMMENT
MEDIUM…/java/smile/classification/DiscreteNaiveBayesTest.java485 // ── constructor validation ─────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/classification/DiscreteNaiveBayesTest.java518 // ── empty instance ────────────────────────────────────────────────────────COMMENT
MEDIUM…/test/java/smile/classification/OneVersusRestTest.java39 // ── isSoft consistency (bug fix: was always true) ──────────────────────────COMMENT
MEDIUM…/test/java/smile/classification/OneVersusRestTest.java79 // ── basic fit and predict ─────────────────────────────────────────────────COMMENT
MEDIUM…c/test/java/smile/classification/OneVersusOneTest.java38 // ── isSoft consistency (bug fix: was always true) ──────────────────────────COMMENT
MEDIUM…c/test/java/smile/classification/OneVersusOneTest.java71 // ── hard predict (voting) works regardless of Platt ──────────────────────COMMENT
MEDIUM…c/test/java/smile/classification/OneVersusOneTest.java88 // ── soft predict ─────────────────────────────────────────────────────────COMMENT
MEDIUM…c/test/java/smile/classification/OneVersusOneTest.java118 // ── basic fit validation ──────────────────────────────────────────────────COMMENT
MEDIUM…c/test/java/smile/classification/PlattScalingTest.java27 // ── scale (constructor) ────────────────────────────────────────────────────COMMENT
MEDIUM…c/test/java/smile/classification/PlattScalingTest.java62 // ── fit(scores, y) ─────────────────────────────────────────────────────────COMMENT
MEDIUM…va/smile/classification/resampling/SMOTETomekTest.java58 // ─── Options tests ────────────────────────────────────────────────────────COMMENT
MEDIUM…va/smile/classification/resampling/SMOTETomekTest.java121 // ─── fit() tests ─────────────────────────────────────────────────────────COMMENT
MEDIUM…java/smile/classification/resampling/SVMSMOTETest.java57 // ─── Options tests ────────────────────────────────────────────────────────COMMENT
MEDIUM…java/smile/classification/resampling/SVMSMOTETest.java130 // ─── fit() tests ─────────────────────────────────────────────────────────COMMENT
MEDIUM…va/smile/classification/resampling/TomekLinksTest.java34 // ─── Options tests ────────────────────────────────────────────────────────COMMENT
MEDIUM…va/smile/classification/resampling/TomekLinksTest.java86 // ─── fit() tests ─────────────────────────────────────────────────────────COMMENT
MEDIUM…test/java/smile/classification/resampling/BSOTest.java59 // ─── Options tests ────────────────────────────────────────────────────────COMMENT
MEDIUM…test/java/smile/classification/resampling/BSOTest.java175 // ─── fit() tests ─────────────────────────────────────────────────────────COMMENT
MEDIUM…t/java/smile/classification/resampling/ADASYNTest.java54 // ─── Options tests ────────────────────────────────────────────────────────COMMENT
MEDIUM…t/java/smile/classification/resampling/ADASYNTest.java125 // ─── fit() tests ─────────────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/clustering/HierarchicalClusteringTest.java182 // ── partition(int k) ──────────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/clustering/HierarchicalClusteringTest.java210 // ── partition(double h) ───────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/clustering/HierarchicalClusteringTest.java243 // ── Linkage consistency ───────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/clustering/DBSCANTest.java85 // ── Parameter validation ───────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/clustering/DBSCANTest.java111 // ── predict ───────────────────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/clustering/DBSCANTest.java148 // ── Edge cases ────────────────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/clustering/DENCLUETest.java85 // ── Options round-trip ────────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/clustering/DENCLUETest.java125 // ── Options validation ─────────────────────────────────────────────────────COMMENT
MEDIUM…src/test/java/smile/clustering/ClusteringUnitTest.java33 // ── Clustering.run ────────────────────────────────────────────────────────COMMENT
MEDIUM…src/test/java/smile/clustering/ClusteringUnitTest.java68 // ── Clustering.Options validation ─────────────────────────────────────────COMMENT
MEDIUM…src/test/java/smile/clustering/ClusteringUnitTest.java94 // ── Clustering.Options round-trip ─────────────────────────────────────────COMMENT
MEDIUM…/java/smile/clustering/DeterministicAnnealingTest.java102 // ── fit produces finite, valid result ─────────────────────────────────────COMMENT
MEDIUM…/java/smile/clustering/DeterministicAnnealingTest.java136 // ── Options validation ─────────────────────────────────────────────────────COMMENT
MEDIUM…/java/smile/clustering/DeterministicAnnealingTest.java174 // ── Options round-trip ────────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/regression/GLMTest.java142 // ── GLM.Options round-trip ─────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/regression/GLMTest.java176 // ── Binomial logLikelihood fix ─────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/regression/GLMTest.java263 // ── GLM Bernoulli fit — deviance and logLikelihood are consistent ──────────COMMENT
MEDIUMcore/src/test/java/smile/regression/GLMTest.java298 // ── GLM Binomial fit — logLikelihood is finite and non-positive ───────────COMMENT
MEDIUM…t/java/smile/regression/BinarySparseLinearSVMTest.java62 // ── predict returns continuous value (bug fix) ─────────────────────────────COMMENT
MEDIUM…t/java/smile/regression/BinarySparseLinearSVMTest.java92 // ── weights and intercept accessors ───────────────────────────────────────COMMENT
MEDIUM…t/java/smile/regression/BinarySparseLinearSVMTest.java115 // ── SVM.fit factory consistency ───────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/regression/SVMTest.java123 // ── constructor validation ─────────────────────────────────────────────────COMMENT
MEDIUMcore/src/test/java/smile/regression/SVMTest.java176 // ── Properties round-trip ─────────────────────────────────────────────────COMMENT
MEDIUM…src/main/java/smile/classification/resampling/BSO.java307 // ── Step 2: classify each minority sample ───────────────────────────COMMENT
MEDIUM…src/main/java/smile/classification/resampling/BSO.java359 // ── Step 3: build indexes needed for synthesis ───────────────────────COMMENT
184 more matches not shown…
Hallucination Indicators25 hits · 270 pts
SeverityFileLineSnippetContext
CRITICAL…dio/src/main/java/smile/studio/kernel/ScalaKernel.java99 new dotty.tools.dotc.core.Contexts.ContextBase().initialCtx();CODE
CRITICAL…mile/llm/model/qwen/QwenVerifyGraphRaggedCudaTest.java122 int capturesBefore = smile.llm.engine.VerifyCudaGraphSession.CAPTURES.get();CODE
CRITICAL…mile/llm/model/qwen/QwenVerifyGraphRaggedCudaTest.java200 assertEquals(3, smile.llm.engine.VerifyCudaGraphSession.CAPTURES.get() - capturesBefore,CODE
CRITICAL…llm/model/qwen/QwenVerifyGraphMultiBucketCudaTest.java118 int capturesBefore = smile.llm.engine.VerifyCudaGraphSession.CAPTURES.get();CODE
CRITICAL…llm/model/qwen/QwenVerifyGraphMultiBucketCudaTest.java194 assertEquals(1, smile.llm.engine.VerifyCudaGraphSession.CAPTURES.get() - capturesBefore,CODE
CRITICALdeep/src/test/java/smile/deep/layer/LayerTest.java89 org.junit.jupiter.api.Assumptions.assumeTrue(CODE
CRITICAL…p/src/test/java/smile/deep/tensor/SafeTensorsTest.java390 @org.junit.jupiter.api.condition.EnabledIfSystemProperty(CODE
CRITICAL⚡deep/src/main/java/smile/llm/model/qwen/QwenModel.java1749 smile.llm.engine.VerifyCudaGraphSession.RESETS.get(),CODE
CRITICAL⚡deep/src/main/java/smile/llm/model/qwen/QwenModel.java1750 smile.llm.engine.VerifyCudaGraphSession.WARMUPS.get(),CODE
CRITICAL⚡deep/src/main/java/smile/llm/model/qwen/QwenModel.java1751 smile.llm.engine.VerifyCudaGraphSession.CAPTURES.get(),CODE
CRITICAL⚡deep/src/main/java/smile/llm/model/qwen/QwenModel.java1752 smile.llm.engine.VerifyCudaGraphSession.CLOSES.get());CODE
CRITICALdeep/src/main/java/smile/llm/model/qwen/Tokenizer.java332 tokenizer.setChatTemplate(smile.llm.template.Qwen3ChatTemplate.Variant.detect(jinja));CODE
CRITICALscala/src/main/scala-2.13/smile/plot/RenderMacro.scala35 compile(q"""(spec: VegaLite) => { println(org.apache.zeppelin.spark.utils.DisplayUtils.html(spec.iframe())) }""") CODE
CRITICALscala/src/main/scala-2.13/smile/plot/RenderMacro.scala47 compile(q"""(canvas: Canvas) => { println(org.apache.zeppelin.spark.utils.DisplayUtils.html(smile.plot.swing.Html.CODE
CRITICALscala/src/main/scala-2.13/smile/plot/RenderMacro.scala59 compile(q"""(grid: MultiFigurePane) => { println(org.apache.zeppelin.spark.utils.DisplayUtils.html(smile.plot.swinCODE
CRITICAL…rve/src/main/java/smile/chat/ConversationResource.java280 return ConversationItem.find("conversationId", io.quarkus.panache.common.Sort.by("createdAt"),CODE
CRITICAL…rve/src/main/java/smile/chat/ConversationResource.java282 .page(io.quarkus.panache.common.Page.of(pageIndex, pageSize))CODE
CRITICALbase/src/main/java/smile/io/Arrow.java1324 return new org.apache.arrow.vector.types.pojo.Schema(fields, null);CODE
CRITICALspark/src/test/java/smile/spark/DataTypeUtilsTest.java76 org.apache.spark.sql.types.StructType sparkSchema = new org.apache.spark.sql.types.StructType(new StructField[]{CODE
CRITICAL…src/test/java/smile/spark/DataFrameConversionTest.java54 org.apache.spark.sql.types.StructType schema = new org.apache.spark.sql.types.StructType(new StructField[]{CODE
CRITICAL…src/test/java/smile/spark/DataFrameConversionTest.java93 org.apache.spark.sql.types.StructType schema = new org.apache.spark.sql.types.StructType(new StructField[]{CODE
CRITICALspark/src/main/java/smile/spark/DataTypeUtils.java142 return new org.apache.spark.sql.types.StructType(fields);CODE
CRITICALspark/src/main/java/smile/spark/DataTypeUtils.java157 return new org.apache.spark.sql.types.StructField(CODE
CRITICALspark/src/main/java/smile/spark/DataTypeUtils.java181 case Decimal -> org.apache.spark.sql.types.DataTypes.createDecimalType();CODE
CRITICALspark/src/main/java/smile/spark/DataTypeUtils.java189 yield org.apache.spark.sql.types.DataTypes.createArrayType(toSparkType(arr.getComponentType()), true);CODE
Structural Annotation Overuse17 hits · 32 pts
SeverityFileLineSnippetContext
LOW…/main/java/smile/classification/resampling/ADASYN.java242 // Step 1: for each minority sample, count majority neighbors in k-NN of full data.COMMENT
LOW⚡…/main/java/smile/classification/resampling/ADASYN.java261 // Step 2: normalize r̂ so it sums to 1.COMMENT
LOW⚡…/main/java/smile/classification/resampling/ADASYN.java271 // Step 3: compute per-sample generation count g_i = round(r̂_i * G).COMMENT
LOW…/main/java/smile/classification/resampling/ADASYN.java282 // Step 4: for each minority sample, generate g_i synthetic samples usingCOMMENT
LOW⚡core/src/main/java/smile/anomaly/LOF.java251 // Step 1: find k nearest neighbors and k-distance for each observationCOMMENT
LOW⚡core/src/main/java/smile/anomaly/LOF.java258 // Step 2: compute local reachability density (lrd) for each observationCOMMENT
LOWcore/src/main/java/smile/anomaly/LOF.java270 // Step 3: compute LOF scoresCOMMENT
LOW⚡base/DATA_TRANSFORMATION.md416 // Step 1: fit imputer on raw training dataCOMMENT
LOW⚡base/DATA_TRANSFORMATION.md419 // Step 2: fit scaler on imputed training dataCOMMENT
LOW⚡base/DATA_TRANSFORMATION.md422 // Step 3: fit standardiser on scaled+imputed training dataCOMMENT
LOW…/src/test/java/smile/data/transform/TransformTest.java156 // Step 1: 1 * 2 = 2; Step 2 applied to transformed data: 2 + 1 = 3COMMENT
LOW⚡base/src/main/java/smile/graph/Graph.java1184 // Step 1: Find a Minimum Spanning Tree (MST)COMMENT
LOW⚡base/src/main/java/smile/graph/Graph.java1188 // Step 2: Find vertices with odd degree in MSTCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1202 // Step 3: Perform Minimum Weight Perfect Matching on odd-degree verticesCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1230 // Step 4: Combine MST edges and matching edges to form a multigraphCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1243 // Step 5: Find an Eulerian CircuitCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1269 // Step 6: Shortcut the Eulerian Circuit to form a Hamiltonian PathCOMMENT
Over-Commented Block31 hits · 30 pts
SeverityFileLineSnippetContext
LOWstudio/src/universal/conf/smile.ini1### Setting -X directly (-J is stripped)COMMENT
LOWstudio/src/universal/conf/smile.ini21COMMENT
LOWstudio/src/universal/conf/smile.ini41# UseCompressedOop is on by default for up to 32GB heap.COMMENT
LOWcore/src/test/java/smile/model/cart/LossTest.java141 assertEquals(-1.0, response[0], 1E-12);COMMENT
LOWplot/src/main/java/smile/plot/swing/Canvas.java681 propertyTable.setAutoResizeMode(JTable.AUTO_RESIZE_OFF);COMMENT
LOWbin/gpu-test-and-build.sh1#!/bin/bashCOMMENT
LOW…st/java/smile/llm/model/qwen/QwenWindowVerifyTest.java301 // row in the batch was a partial accept. A fully-accepted row (r == n)COMMENT
LOW…st/java/smile/llm/model/qwen/QwenWindowVerifyTest.java401 // (testGivenSamePositionBatchedCohortWhenSpeculateBatchThenMatches...,COMMENT
LOW…st/java/smile/llm/model/qwen/QwenWindowVerifyTest.java601COMMENT
LOW…lm/model/qwen/QwenVerifyGraphFullModelCaptureTest.java141 Math.max(2, args.maxBatchSize()), device, ScalarType.Float);COMMENT
LOW…lm/model/qwen/QwenVerifyGraphFullModelCaptureTest.java181 // otherwise mirrors): with random, untrained weights and aCOMMENT
LOWdeep/src/test/java/smile/deep/metric/MetricTest.java541COMMENT
LOWdeep/src/main/cpp/CMakeLists.txt1# =============================================================================COMMENT
LOWdeep/src/main/cpp/CMakeLists.txt121message(STATUS "Torch version : ${Torch_VERSION}")COMMENT
LOWdeep/src/main/cpp/smile_cuda_graph.cpp1/*COMMENT
LOWdeep/src/main/cpp/smile_torch.cpp21 * All C handles are thin heap wrappers around the corresponding libtorchCOMMENT
LOWdeep/src/main/cpp/smile_torch.cpp41#include <cstring>COMMENT
LOWdeep/src/main/cpp/smile_torch.cpp61# include <ATen/BlasBackend.h>COMMENT
LOWdeep/src/main/cpp/smile_flashinfer.cpp1/*COMMENT
LOW…/main/cpp/third_party/vllm_marlin/core/scalar_type.hpp1#pragma onceCOMMENT
LOW…arty/vllm_marlin/quantization/marlin/marlin_template.h241 int max_shared_mem) {COMMENT
LOW…arty/vllm_marlin/quantization/marlin/marlin_template.h661 // when the batchsize is not a multiple of 16.COMMENT
LOW…rty/vllm_marlin/moe/marlin_moe_wna16/marlin_template.h261 // 1 2 4COMMENT
LOW…n/cpp/third_party/flashinfer/include/flashinfer/fp16.h1// SPDX - FileCopyrightText : 2017 - 2024 Marat DukhanCOMMENT
LOW…ird_party/flashinfer/include/flashinfer/cubin_loader.h21// The python code is expected to call `FlashInferSetCubinCallback` whenCOMMENT
LOW.github/workflows/codeql.yml1# For most projects, this workflow file will not need changing; you simply needCOMMENT
LOW.github/workflows/smile-torch-build.yml1# =============================================================================COMMENT
LOWserve/src/test/docker/smoke-test.sh1#!/usr/bin/env bashCOMMENT
LOWserve/src/main/resources/smile/chat/olive_cli.py1# Copyright (c) 2010-2026 Haifeng Li. All rights reserved.COMMENT
LOWbase/DATASET.md701// -----------------------------------------------------------------COMMENT
LOWbase/src/main/java/smile/util/HuggingFaceHub.java421 // Check refs/ cache for a previously resolved commit hash.COMMENT
Verbosity Indicators14 hits · 26 pts
SeverityFileLineSnippetContext
LOW…/main/java/smile/classification/resampling/ADASYN.java242 // Step 1: for each minority sample, count majority neighbors in k-NN of full data.COMMENT
LOW⚡…/main/java/smile/classification/resampling/ADASYN.java261 // Step 2: normalize r̂ so it sums to 1.COMMENT
LOW⚡…/main/java/smile/classification/resampling/ADASYN.java271 // Step 3: compute per-sample generation count g_i = round(r̂_i * G).COMMENT
LOW…/main/java/smile/classification/resampling/ADASYN.java282 // Step 4: for each minority sample, generate g_i synthetic samples usingCOMMENT
LOW⚡core/src/main/java/smile/anomaly/LOF.java251 // Step 1: find k nearest neighbors and k-distance for each observationCOMMENT
LOW⚡core/src/main/java/smile/anomaly/LOF.java258 // Step 2: compute local reachability density (lrd) for each observationCOMMENT
LOWcore/src/main/java/smile/anomaly/LOF.java270 // Step 3: compute LOF scoresCOMMENT
LOW…/src/test/java/smile/data/transform/TransformTest.java156 // Step 1: 1 * 2 = 2; Step 2 applied to transformed data: 2 + 1 = 3COMMENT
LOW⚡base/src/main/java/smile/graph/Graph.java1184 // Step 1: Find a Minimum Spanning Tree (MST)COMMENT
LOW⚡base/src/main/java/smile/graph/Graph.java1188 // Step 2: Find vertices with odd degree in MSTCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1202 // Step 3: Perform Minimum Weight Perfect Matching on odd-degree verticesCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1230 // Step 4: Combine MST edges and matching edges to form a multigraphCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1243 // Step 5: Find an Eulerian CircuitCOMMENT
LOWbase/src/main/java/smile/graph/Graph.java1269 // Step 6: Shortcut the Eulerian Circuit to form a Hamiltonian PathCOMMENT
AI Slop Vocabulary7 hits · 20 pts
SeverityFileLineSnippetContext
MEDIUMcore/src/test/java/smile/association/ARMTest.java117 // leverage = 0.6 - 0.8 * 0.7 = 0.04COMMENT
MEDIUMcore/src/test/java/smile/association/ARMTest.java150 // Given — lift and leverage differ; equals/hashCode intentionally ignores themCOMMENT
MEDIUM…le/feature/transform/FeatureTransformEdgeCaseTest.java247 // Then – the bulk of data (first 5 rows) should be less spread by robustCOMMENT
MEDIUM…del/qwen/QwenVerifyGraphTensorParallelCaptureTest.java187 // real, robust correctness signal.COMMENT
MEDIUM…lm/model/qwen/QwenVerifyGraphFullModelCaptureTest.java187 // diff below is the real, robust correctness signal.COMMENT
MEDIUMserve/src/main/webui/package-lock.json3837 "resolved": "https://registry.npmjs.org/robust-predicates/-/robust-predicates-3.0.3.tgz",CODE
MEDIUMbase/src/test/java/smile/cs/CompressedSensingTest.java192 // Generous iteration budget for a robust testCOMMENT
Cross-File Repetition4 hits · 20 pts
SeverityFileLineSnippetContext
HIGHkotlin/src/main/kotlin/smile/regression.kt0able to handle both numerical and categorical data:STRING
HIGHkotlin/src/main/kotlin/smile/classification.kt0able to handle both numerical and categorical data:STRING
HIGHscala/src/main/scala/smile/classification/package.scala0able to handle both numerical and categorical data:STRING
HIGHscala/src/main/scala/smile/regression/package.scala0able to handle both numerical and categorical data:STRING
Magic Placeholder Names2 hits · 10 pts
SeverityFileLineSnippetContext
HIGHstudio/README.md836export SERPAPI_KEY="your_api_key"CODE
HIGHstudio/README.md839$env:SERPAPI_KEY = "your_api_key"CODE
Fake / Example Data4 hits · 4 pts
SeverityFileLineSnippetContext
LOWstudio/src/test/java/smile/studio/StatusBarTest.java89 "Acme Corp",CODE
LOWstudio/src/test/java/smile/studio/StatusBarTest.java104 assertTrue(statusBar.getLicenseBadgeText().contains("Acme Corp"));CODE
LOW…c/test/java/smile/studio/license/LicenseStoreTest.java258 {"ver":1,"id":"LIC-2026-0300","customer":"Acme Corp","tier":"STUDIO_TEAM","seats":5,"issuedAt":"2026-04-CODE
LOW…c/test/java/smile/studio/license/LicenseStoreTest.java284 {"ver":1,"id":"LIC-2026-0400","customer":"Acme Corp","tier":"ENTERPRISE","seats":25,"issuedAt":"2026-04-CODE
Slop Phrases1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUM.github/workflows/codeql.yml58 # If you are analyzing a compiled language, you can modify the 'build-mode' for that language to customize howCOMMENT
Self-Referential Comments1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUM.github/workflows/ci.yml51 # Create a symlink to the latest libonnxruntime.so in the capi directoryCOMMENT
Modern AI Meta-Vocabulary1 hit · 2 pts
SeverityFileLineSnippetContext
MEDIUMstudio/README.md3> **SMILE Studio** is an agentic IDE for data science using Python or [SMILE](https://www.aihalo.dev//) on JVM. It combiCODE
Redundant / Tautological Comments1 hit · 2 pts
SeverityFileLineSnippetContext
LOWbin/setup.sh11# Check if running inside a GitHub Actions runnerCOMMENT
Deep Nesting1 hit · 1 pts
SeverityFileLineSnippetContext
LOW…ty/vllm_marlin/quantization/marlin/generate_kernels.py103CODE
Hyper-Verbose Identifiers1 hit · 1 pts
SeverityFileLineSnippetContext
LOWserve/src/main/resources/smile/chat/olive_cli.py40 def maybe_register_ep_libraries(ep_paths: dict) -> None:CODE
Excessive Try-Catch Wrapping1 hit · 1 pts
SeverityFileLineSnippetContext
LOWserve/src/main/resources/smile/chat/olive_cli.py68 except Exception as exc: # noqa: BLE001 — skip broken optional EPsCODE
Unused Imports1 hit · 1 pts
SeverityFileLineSnippetContext
LOWserve/src/main/resources/smile/chat/olive_cli.py30CODE