MétaCan
Menu
Back to cohort
Record W4375957433 · doi:10.48550/arxiv.2305.03887

Ring wormholes and time machines

2023· preprint· en· W4375957433 on OpenAlexfundno aff
Valeri P. Frolov, Pavel Krtouš, Andrei Zelnikov

Bibliographic record

VenuearXiv (Cornell University) · 2023
Typepreprint
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaKillam TrustsGrantová Agentura České Republiky
KeywordsWormholeRing (chemistry)Computer sciencePhysicsChemistryTheoretical physics

Abstract

fetched live from OpenAlex

In the present paper we discuss properties of a model of a ring wormhole, recently proposed by Gibbons and Volkov. Such a wormhole connects two flat spacetimes which are glued through discs of the radius $a$ bounded by the string with negative angle deficit $-2π$. The presence of the string's matter violating null energy condition makes the wormhole static and traversable. We study gravitational field of static sources in such a spacetime in the weak field approximation. In particular, we discuss how a field of an oblate thin massive shell surrounding one of the wormhole's mouth is modified by its presence. We also obtain a solution of a similar problem when both mouths of the wormhole are located in the same space. This approximate solution if found for the case when the distance $L$ between these mouths is much larger than the radius $a$ of the ring. We demonstrate that the corresponding locally static gravitational field in such a multiply connected space is non-potential. As a result of this, the proper time gap for the clock's synchronization linearly grows with time and closed timelike curves are formed. This process inevitably transforms such a traversable ring wormhole into a time machine. We estimate the time scale of this process.

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.000
metaresearch head score (Gemma)0.002
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0010.004
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.000

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.077
GPT teacher head0.188
Teacher spread0.111 · 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
GenreEmpirical

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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicComputability, Logic, AI AlgorithmsFrench-language works237,207