Pith. Sign in

RECORD

Scattering entropies of quantum graphs with several channels

Quantum Physics · Submitted 17 Nov 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In particular, we think the results may be used as quantifiers in models related to the transport in quantum graphs.

how it is stated · hedged possibility 0.92 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2211.09693 (version 4)
Pith IDPEV4WIXG, Pith's permanent record of this paper and its review
CitationAlison A. Silva, D. Bazeia, Fabiano M. Andrade. "Scattering entropies of quantum graphs with several channels." arXiv:2211.09693 (2022). https://pith.science/paper/PEV4WIXG
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,549 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.07 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.07 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v4. Results and the main claim are underlined; .

This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct quantitative behavior such as entanglement and nonextensive behavior, respectively. We describe many results associated with different types of quantum graphs in the presence of several vertices, edges, and leads. In particular, we think the results may be used as quantifiers in models related to the transport in quantum graphs.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 This work deals with the scattering entropy of quantum graphs in many different circumstances. contribution 0.77 0.67 0.06 asserted 0.90
s1 We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct quantitative behavior such as entanglement and nonextensive behavior, respectively. contribution 0.69 0.51 0.08 asserted 0.98
s2 We describe many results associated with different types of quantum graphs in the presence of several vertices, edges, and leads. contribution 0.93 0.81 0.09 asserted 0.98
s3 In particular, we think the results may be used as quantifiers in models related to the transport in quantum graphs. interpretation 0.89 0.18 0.32 hedged possibility 0.92

What kind of paper the classifier reports this is: theoretical result 0.58 · evidence from proof or derivation 0.72.

What was examined, and what was not

sources read
  • arXiv listing abstract v4
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct quantitative behavior such as entanglement and nonextensive behavior, respectively. We describe many results associated with different types of quantum graphs in the presence of several vertices, edges, and leads. In particular, we think the results may be used as quantifiers in models related to the transport in quantum graphs.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.