REVIEW 15 cited by
The Trigger Mechanism of Recurrent Solar Active Region Jets Revealed by the Magnetic Properties of a Coronal Geyser Site
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Solar active region jets are small-scale collimated plasma eruptions that are triggered from magnetic sites embedded in sunspot penumbral regions. Multiple trigger mechanisms for recurrent jets are under debate. Vector magnetic field data from SDO-HMI observations are used to analyze a prolific photospheric configuration, identified in extreme ultraviolet observations as a `Coronal Geyser', that triggered a set of at least 10 recurrent solar active region jets. We focus on interpreting the magnetic fields of small-scale flaring sites aiming to understand the processes that govern recurrent jet eruptions. We perform a custom reprocessing of the SDO-HMI products, including disambiguation and uncertainty estimation. We scrutinized the configuration and dynamics of the photospheric magnetic structures. The magnetic configuration is described via the analysis of the photospheric magnetic vertical fields, to identify the process is responsible for driving the jet eruptions. We report that the two widely debated magnetic trigger processes, namely magnetic flux cancellation and magnetic flux emergence, appear to be responsible on a case by case basis for generating each eruption in our set. We find that 4 of 10 jets were due to flux cancellation while the rest were clearly not, and were more likely due to flux emergence.
Forward citations
Cited by 15 Pith papers
-
The Contiguous Art Gallery Problem is in {\Theta}(n log n)
The Contiguous Art Gallery problem is solved in Θ(n log n) time in the real RAM model, improving the prior O(k n^5 log n) upper bound and proving an Ω(n log n) lower bound.
-
Decremental Greedy Polygons and Polyhedra Without Sharp Angles
A decremental greedy algorithm solves a general class of monotone bottleneck subset problems, giving O(n log n) and O(n^2) algorithms for max-min-angle polygons and polyhedra, and NP-hardness for simple 3D curves.
-
New Sufficient Algebraic Conditions for Local Consistency over Homogeneous Structures of Finite Duality
Chains of quasi Jónsson operations imply bounded width and polynomial-time solvability for CSPs over first-order expansions of k-neoliberal structures with finite duality.
-
Universal chain rules from entropic triangle inequalities
A universal chain rule for the smooth min-entropy and an unstructured approximate entropy accumulation theorem are proven.
-
METTLE: Efficient Streaming Erasure Code with Peeling Decodability
METTLE achieves streaming erasure decoding with near-RaptorQ efficiency and LT-like peeling speed by turning Walzer's spatially-coupled IBLT into a time-coupled code with multi-edge-type and touch-less leading edge.
-
Information-Theoretic Lower Bounds for Approximating Monomials via Optimal Quantum Tsallis Entropy Estimation
A quantum estimator achieves near-optimal query complexity for integer-order Tsallis entropy, and the same technique yields a new information-theoretic proof that approximating x^n needs polynomials of degree Ω(√n).
-
Pointer Chasing with Unlimited Interaction
With unlimited interaction, k-step pointer chasing still requires Ω(k log(n/k)) randomized communication (or Ω(k log log k) for zero error), so the trivial k-round protocol is near-optimal.
-
The Shared Discovery Paradox: How a One-Answer Rule Turns Better Information into Worse Search
A one-answer rule turns better pooled information into worse group discovery, and self-interested search only partially fixes it.
-
Authentication of Continuous-Variable Quantum Messages
A trap-based quantum message authentication protocol for continuous-variable states is shown to be eta-secure with eta=(n/(n+2z))^(t+1).
-
Query-Optimal and Sample-Optimal Quantum Algorithms for Estimating Fidelity to a Pure State
A quantum algorithm estimates the fidelity between a mixed state and a pure state to error ε with Θ(1/ε) queries to the state-preparation circuits.
-
Fast Geographic Routing in Fixed-Growth Graphs
Greedy routing and diameter bounds for small-world graphs are generalized from lattices to fixed-growth graphs of any dimensionality alpha, with an empirical application to U.S. road networks.
-
The Bakers and Millers Game with Restricted Locations
The Bakers and Millers Game with restricted baker locations always has a pure Nash equilibrium, computable in polynomial time, with tight bounds on how far equilibria are from optimal coverage.
-
The Unified Evaluation App for DNA Data Storage Codecs
Authors built and demonstrated an open-source benchmarking web app in which eight DNA storage codecs are compared on shared files under simulated degradation, finding that no codec wins on every metric.
-
A slightly improved upper bound for quantum statistical zero-knowledge
QSZK and its non-interactive variant NIQSZK stay inside QIP(2)∩co-QIP(2), now with an honest prover that runs in quantum linear space and single-exponential time.
-
Grover's search with an oracle distinguishing between solutions
With carefully chosen multi-phase oracles, a two-solution Grover search maintains high success probability over a wider range of iteration counts than the standard deterministic algorithm, according to simulations up ...
Discussion (0). Continue with ORCID to comment.