On the time dependence of holographic complexity
Bibliographic record
Abstract
Abstract We evaluate the full time dependence of holographic complexity in various eternal black hole backgrounds using both the complexity=action (CA) and the complexity=volume (CV) conjectures. We conclude using the CV conjecture that the rate of change of complexity is a monotonically increasing function of time, which saturates from below to a positive constant in the late time limit. Using the CA conjecture for uncharged black holes, the holographic complexity remains constant for an initial period, then briefly decreases but quickly begins to increase. As observed previously, at late times, the rate of growth of the complexity approaches a constant, which may be associated with Lloyd’s bound on the rate of computation. However, we find that this late time limit is approached from above, thus violating the bound. For either conjecture, we find that the late time limit for the rate of change of complexity is saturated at times of the order of the inverse temperature. Adding a charge to the eternal black holes washes out the early time behaviour, i.e. complexity immediately begins increasing with sufficient charge, but the late time behaviour is essentially the same as in the neutral case. We also evaluate the complexity of formation for charged black holes and find that it is divergent for extremal black holes, implying that the states at finite chemical potential and zero temperature are infinitely more complex than their finite temperature counterparts.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.009 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".