MétaCan
Menu
Back to cohort
Record W2131418935

Topological methods in quantum gravity

2005· dissertation· en· W2131418935 on OpenAlexfundno aff
Artem Starodubtsev

Bibliographic record

VenueUWSpace (University of Waterloo) · 2005
Typedissertation
Languageen
FieldPhysics and Astronomy
TopicNoncommutative and Quantum Gravity Theories
Canadian institutionsnot available
FundersInstitut Périmètre de physique théorique
KeywordsQuantum gravityQuantumPhysicsTheoretical physicsTopology (electrical circuits)Quantum mechanicsMathematicsCombinatorics
DOInot available

Abstract

fetched live from OpenAlex

The main technical problem with background independent approaches to quantum gravity is inapplicability of standard quantum field theory methods. New methods are needed which would be adapted to the basic principles of General Relativity. Topological field theory is a model which provides natural tools for background independent quantum gravity. It is exactly soluble and, at the same time, diffeomorphism invariant. Applications of topological field theory to quantum gravity include description of boundary states of quantum General Relativity, formulation of quantum gravity as a constrained topological field theory, and a new perturbation theory which uses topological field theory as a starting point. The later is the central theme of the thesis. Unlike the traditional perturbation theory it does not require splitting metric into a background and fluctuations, it is exactly diffeomorphism invariant order by order, and the coupling constant of this theory is dimensionless. We describe the basic ideas and techniques of this perturbation theory as well as inclusion of matter particles, boundary states, and other necessary tools for studying scattering problem in background independent quantum gravity.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0020.002
Science and technology studies0.0010.007
Scholarly communication0.0020.005
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.016
GPT teacher head0.294
Teacher spread0.278 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreOther

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueUWSpace (University of Waterloo)Same topicNoncommutative and Quantum Gravity TheoriesFrench-language works237,207