Pith. sign in

REVIEW 1 cited by

A Statistical Measure of Complexity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1009.1498 v1 pith:J26MZGGZ submitted 2010-09-08 nlin.AO cs.ITmath.ITphysics.data-an

Ricardo Lopez-Ruiz , Hector Mancini , Xavier Calbet This is my paper
classification nlin.AOcs.ITmath.ITphysics.data-an
keywords complexitymeasuresomestatisticalapplicationschapterdiscussedintroduced
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this chapter, a statistical measure of complexity is introduced and some of its properties are discussed. Also, some straightforward applications are shown.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Complexity-Based Approach to Quantum Observable Equilibration

    quant-ph 2025-06 conditional novelty 6.0 of 10

    The new Observable Equilibration Complexity Measure, entropy times L1 distance to the dephased equilibrium distribution, tracks equilibration and separates high- from low-effective-dimension dynamics.

Pith tools