Pith. Sign in

RECORD

An Algorithm of Constructing Cohomological Series Solutions of Holonomic Systems

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Nobuki Takayama

Algebraic Geometry · Submitted 23 Sep 2003

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

The authors' main claim We present an algorithm to construct a basis of k-th extension group of a D-module M in ring of the formal power series Ext_D^k(M,O).

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDmath/0309378 (version 2)
Pith IDCQC756K7, Pith's permanent record of this paper and its review
CitationNobuki Takayama. "An Algorithm of Constructing Cohomological Series Solutions of Holonomic Systems." arXiv:math/0309378 (2003). https://pith.science/paper/CQC756K7
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, 1,611 input tokens.

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

The abstract, sentence by sentence

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

We present an algorithm to construct a basis of k-th extension group of a D-module M in ring of the formal power series Ext_D^k(M,O).

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 We present an algorithm to construct a basis of k-th extension group of a D-module M in ring of the formal power series Ext_D^k(M,O). contribution 0.99 0.94 0.78 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
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

We present an algorithm to construct a basis of k-th extension group of a D-module M in ring of the formal power series Ext_D^k(M,O).

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

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