0.7

Adjusted Signal

0.7

Raw Pattern Score

100%

Time Factor

—

Last Push

—

Stars

—

Language

66.9K

Lines of Code

576

Files

Pattern Hits

2026-10-31

Scan Date

0.00

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 3.6/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 0.0/100 · LOW

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

Agent Over-Engineering Ratio 2.1/100 · LOW

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

PR Review Velocity Impact 3.7/100 · LOW

Which changes need focused human review? 48 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 0HIGH 0MEDIUM 1LOW 47

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 48 distinct pattern matches across 3 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.

Hyper-Verbose Identifiers29 hits · 29 pts

Severity	File	Line	Snippet	Context
LOW	core/src/main/scala/scalaz/Either.scala	213	def getOrElse[BB >: B](x: => BB): BB =	CODE
LOW	core/src/main/scala/scalaz/LazyEitherT.scala	22	def getOrElse(default: => B)(implicit F: Functor[F]): F[B] =	CODE
LOW	core/src/main/scala/scalaz/LazyEitherT.scala	139	def getOrElse(default: => A)(implicit F: Functor[F]): F[A] =	CODE
LOW	core/src/main/scala/scalaz/Id.scala	65	override def getOrElse[A](a: Id[A])(d: => A): A = a	CODE
LOW	core/src/main/scala/scalaz/LazyOptionT.scala	18	def getOrElse(default: => A)(implicit F: Functor[F]): F[A] =	CODE
LOW	core/src/main/scala/scalaz/EitherT.scala	148	def getOrElse(default: => B)(implicit F: Functor[F]): F[B] =	CODE
LOW	core/src/main/scala/scalaz/TheseT.scala	48	def getOrElse(default: => B)(implicit F: Functor[F]): F[B]	CODE
LOW	core/src/main/scala/scalaz/OptionT.scala	73	def getOrElse(default: => A)(implicit F: Functor[F]): F[A] = mapO(_.getOrElse(default))	CODE
LOW	core/src/main/scala/scalaz/OptionT.scala	78	def getOrElseF(default: => F[A])(implicit F: Monad[F]): F[A] =	CODE
LOW	core/src/main/scala/scalaz/These.scala	208	def getOrElse[BB >: B](bb: => BB): BB =	CODE
LOW	core/src/main/scala/scalaz/Validation.scala	210	def getOrElse[AA >: A](x: => AA): AA =	CODE
LOW	core/src/main/scala/scalaz/Maybe.scala	32	final def getOrElse(a: => A): A =	CODE
LOW	core/src/main/scala/scalaz/Maybe.scala	88	final def getOrElseF[F[_]: Applicative](fa: => F[A]): F[A] =	CODE
LOW	core/src/main/scala/scalaz/PLens.scala	53	def getOrZ(a: A1)(implicit M: Monoid[B1]): B1 =	CODE
LOW	core/src/main/scala/scalaz/PLens.scala	65	def setOrZ(a: A1, b: B2)(implicit M: Monoid[A2]): A2 =	CODE
LOW	core/src/main/scala/scalaz/LazyOption.scala	25	def getOrElse[AA >: A](default: => AA): AA =	CODE
LOW	core/src/main/scala/scalaz/MaybeT.scala	63	def getOrElse(default: => A)(implicit F: Functor[F]): F[A] = mapO(_.getOrElse(default))	CODE
LOW	core/src/main/scala/scalaz/MaybeT.scala	69	def getOrElseF(default: => F[A])(implicit F: Monad[F]): F[A] =	CODE
LOW	core/src/main/scala/scalaz/LazyEither.scala	37	def getOrElse[BB >: B](default: => BB): BB =	CODE
LOW	core/src/main/scala/scalaz/LazyEither.scala	127	def getOrElse[AA >: A](default: => AA): AA =	CODE
LOW	core/src/main/scala/scalaz/Optional.scala	22	def getOrElse[A](fa: F[A])(default: => A): A = pextract(fa) \| default	CODE
LOW	core/src/main/scala/scalaz/std/SortedMap.scala	193	final def getOrAdd[F[_], K, A](m: SortedMap[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(SortedMap[K, A],	CODE
LOW	core/src/main/scala/scalaz/std/Option.scala	92	override def getOrElse[A](o: Option[A])(d: => A) = o getOrElse d	CODE
LOW	core/src/main/scala/scalaz/std/Option.scala	286	final def getOrElseF[A, F[_] : Applicative](oa: Option[A])(fa: => F[A]): F[A] = oa match {	CODE
LOW	core/src/main/scala/scalaz/std/Map.scala	190	final def getOrAdd[F[_], K, A](m: Map[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(Map[K, A], A)] =	CODE
LOW	core/src/main/scala/scalaz/syntax/OptionalSyntax.scala	14	def getOrElse(default: => A): A = F.getOrElse(self)(default)	CODE
LOW	core/src/main/scala/scalaz/syntax/std/MapOps.scala	14	final def getOrAdd[F[_]](k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(Map[K, A], A)] = dict.getOrAdd[F, K, A](se	CODE
LOW	core/src/main/scala/scalaz/syntax/std/OptionOps.scala	56	final def getOrElseF[F[_]: Applicative](fa: => F[A]): F[A] = o.getOrElseF[A, F](self)(fa)	CODE
LOW	…re/src/main/scala/scalaz/syntax/std/SortedMapOps.scala	30	def getOrAdd[F[_]](k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(SortedMap[K, A], A)] =	CODE

Over-Commented Block18 hits · 18 pts

Severity	File	Line	Snippet	Context
LOW	…ample/src/main/scala/scalaz/example/KleisliUsage.scala	41		COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	81		COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	101	xs.sorted(using Order.orderBy(f).toScalaOrdering)	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	161	// We can no longer use `schwartzian', though, because there is no	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	181	// existential, and the main feature of the	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	221	// type member is usually inferred as well as normal Scala types,	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	261		COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	281	// `[A, B](Order[A], Order[B]): Order[(A, B)]'.	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	341	// Induction steps	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	401	// (((Unit, String),	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	421	//	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	441	// `I', and that’s all you get. Nothing that actually knows how to	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	481	\|+\| b.describe \|+\| ">")	COMMENT
LOW	…/scala/scalaz/example/ContravariantCoyonedaUsage.scala	541	// willynilly for `Binfmt'. I have to prove at each step that *the	COMMENT
LOW	…ample/src/main/scala/scalaz/example/FunctorUsage.scala	41	assert(Functor[List].map(List("qwer", "adsfg"))(len) === List(4,5))	COMMENT
LOW	…ple/src/main/scala/scalaz/example/Foldable1Usage.scala	41	// create our above tree can create a right leaning, or a left	COMMENT
LOW	…mple/src/main/scala/scalaz/example/TraverseUsage.scala	21		COMMENT
LOW	tests/src/test/scala/scalaz/OptionalTest.scala	41	// """LazyEither instance tests""" in {	COMMENT

Slop Phrases1 hit · 2 pts

Severity	File	Line	Snippet	Context
MEDIUM	core/src/main/scala/scalaz/ISet.scala	443	-- It's worth noting that the size of the result may be smaller if,	CODE

scalaz/scalaz

Open-Source Code Quality, Security and Technical Debt Review