Datasets:
Download metadata/research-msc.json from FlippyDora/OpenFrontiers: direct link, hf CLI and curl.
- Browser
- Download file 57.2 kB
-
https://huggingface.co/datasets/FlippyDora/OpenFrontiers/resolve/main/metadata/research-msc.json
- Command line
-
hf download hf://datasets/FlippyDora/OpenFrontiers/metadata/research-msc.json
-
curl -L -o research-msc.json https://huggingface.co/datasets/FlippyDora/OpenFrontiers/resolve/main/metadata/research-msc.json
57.2 kB
{
"tianyuan-logic-1-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Combining chains of random Turing degrees — Problem 1.1. https://arxiv.org/html/2608.26628v2#S1.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-1-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Full-measure sets and random degree chains — Problem 1.2. https://arxiv.org/html/2608.26628v2#S1.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-1-3": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Chains of 2-random reals without a single generator — Problem 1.3. https://arxiv.org/html/2608.26628v2#S1.Thmproblem3 Not an author-supplied code."
}
],
"tianyuan-logic-1-4": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Jumps and complexity within 2-random chains — Problem 1.4. https://arxiv.org/html/2608.26628v2#S1.Thmproblem4 Not an author-supplied code."
}
],
"tianyuan-logic-1-5": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Injective randomness-preserving one-way functions — Problem 1.5. https://arxiv.org/html/2608.26628v2#S1.Thmproblem5 Not an author-supplied code."
}
],
"tianyuan-logic-2-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Outer automorphisms of oligomorphic groups — Problem 2.1. https://arxiv.org/html/2608.26628v2#S2.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-2-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Strong jump traceability versus LR reducibility — Problem 2.2. https://arxiv.org/html/2608.26628v2#S2.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-2-3": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Recursive maximal almost disjoint families in a closed class — Problem 2.3. https://arxiv.org/html/2608.26628v2#S2.Thmproblem3 Not an author-supplied code."
}
],
"tianyuan-logic-3-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Fourth-level quantifier-pattern degrees — Problem 3.1. https://arxiv.org/html/2608.26628v2#S3.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-3-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Deciding reducibility of quantifier patterns — Problem 3.2. https://arxiv.org/html/2608.26628v2#S3.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-4-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Kakeya sets whose points compute the halting problem — Problem 4.1. https://arxiv.org/html/2608.26628v2#S4.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-4-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Minimal subsets of Borel Kakeya sets — Problem 4.2. https://arxiv.org/html/2608.26628v2#S4.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-5-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Borel two-point sets — Problem 5.1. https://arxiv.org/html/2608.26628v2#S5.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-5-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Algebraic closures of Borel fields — Problem 5.2. https://arxiv.org/html/2608.26628v2#S5.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-6-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Choice needed for bases over a fixed field — Problem 6.1. https://arxiv.org/html/2608.26628v2#S6.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-7-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A Davies example provable in ZFC — Problem 7.1. https://arxiv.org/html/2608.26628v2#S7.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-8-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Forcing models satisfying the genericity property — Problem 8.1. https://arxiv.org/html/2608.26628v2#S8.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-8-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Hyperfiniteness of the forcing equivalence relation — Problem 8.2. https://arxiv.org/html/2608.26628v2#S8.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-8-3": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Large-cardinal strength of the genericity property — Problem 8.3. https://arxiv.org/html/2608.26628v2#S8.Thmproblem3 Not an author-supplied code."
}
],
"tianyuan-logic-9-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Extending the random-degree result to LR degrees — Problem 9.1. https://arxiv.org/html/2608.26628v2#S9.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-10-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Monotone induction and strong nesting — Problem 10.1. https://arxiv.org/html/2608.26628v2#S10.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-11-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A first-order theory with intermediate isomorphism complexity — Problem 11.1. https://arxiv.org/html/2608.26628v2#S11.Thmproblem1 Not an author-supplied code."
}
],
"queueing-predictions-s2-i1-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Realistic prediction-error models for queues. https://arxiv.org/html/2503.07545v1#S2.I1.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Realistic prediction-error models for queues. https://arxiv.org/html/2503.07545v1#S2.I1.i1 Not an author-supplied code."
}
],
"queueing-predictions-s2-i1-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Numerical analysis tools for prediction-aware M/G/1 queues. https://arxiv.org/html/2503.07545v1#S2.I1.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Numerical analysis tools for prediction-aware M/G/1 queues. https://arxiv.org/html/2503.07545v1#S2.I1.i2 Not an author-supplied code."
}
],
"queueing-predictions-s2-i1-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Queue analysis with selectively available predictions. https://arxiv.org/html/2503.07545v1#S2.I1.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Queue analysis with selectively available predictions. https://arxiv.org/html/2503.07545v1#S2.I1.i3 Not an author-supplied code."
}
],
"queueing-predictions-s2-i1-i4": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Implementable Gittins policies with predicted sizes. https://arxiv.org/html/2503.07545v1#S2.I1.i4 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Implementable Gittins policies with predicted sizes. https://arxiv.org/html/2503.07545v1#S2.I1.i4 Not an author-supplied code."
}
],
"queueing-predictions-s2-i1-i5": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling with distribution-valued job-size predictions. https://arxiv.org/html/2503.07545v1#S2.I1.i5 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling with distribution-valued job-size predictions. https://arxiv.org/html/2503.07545v1#S2.I1.i5 Not an author-supplied code."
}
],
"queueing-predictions-s2-i1-i6": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Monitoring and disabling degraded job-size predictors. https://arxiv.org/html/2503.07545v1#S2.I1.i6 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Monitoring and disabling degraded job-size predictors. https://arxiv.org/html/2503.07545v1#S2.I1.i6 Not an author-supplied code."
}
],
"queueing-predictions-s2-i2-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Error models for one-bit job-size predictions. https://arxiv.org/html/2503.07545v1#S2.I2.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Error models for one-bit job-size predictions. https://arxiv.org/html/2503.07545v1#S2.I2.i1 Not an author-supplied code."
}
],
"queueing-predictions-s2-i2-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Training predictors for a chosen scheduling policy. https://arxiv.org/html/2503.07545v1#S2.I2.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Training predictors for a chosen scheduling policy. https://arxiv.org/html/2503.07545v1#S2.I2.i2 Not an author-supplied code."
}
],
"queueing-predictions-s2-i2-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Response-time tradeoffs with multi-bit predictions. https://arxiv.org/html/2503.07545v1#S2.I2.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Response-time tradeoffs with multi-bit predictions. https://arxiv.org/html/2503.07545v1#S2.I2.i3 Not an author-supplied code."
}
],
"queueing-predictions-s2-i5-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Sharper graceful-degradation constants in queue scheduling. https://arxiv.org/html/2503.07545v1#S2.I5.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Sharper graceful-degradation constants in queue scheduling. https://arxiv.org/html/2503.07545v1#S2.I5.i1 Not an author-supplied code."
}
],
"queueing-predictions-s2-i5-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling guarantees beyond rank-based policies. https://arxiv.org/html/2503.07545v1#S2.I5.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling guarantees beyond rank-based policies. https://arxiv.org/html/2503.07545v1#S2.I5.i2 Not an author-supplied code."
}
],
"queueing-predictions-s2-i5-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Prediction-aware queue performance beyond mean response time. https://arxiv.org/html/2503.07545v1#S2.I5.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Prediction-aware queue performance beyond mean response time. https://arxiv.org/html/2503.07545v1#S2.I5.i3 Not an author-supplied code."
}
],
"queueing-predictions-s2-i6-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Models for the cost of acquiring job-size predictions. https://arxiv.org/html/2503.07545v1#S2.I6.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Models for the cost of acquiring job-size predictions. https://arxiv.org/html/2503.07545v1#S2.I6.i1 Not an author-supplied code."
}
],
"queueing-predictions-s2-i6-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Load-dependent decisions to obtain predictions. https://arxiv.org/html/2503.07545v1#S2.I6.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Load-dependent decisions to obtain predictions. https://arxiv.org/html/2503.07545v1#S2.I6.i2 Not an author-supplied code."
}
],
"queueing-predictions-s2-i6-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Selective prediction with FIFO for unpredicted jobs. https://arxiv.org/html/2503.07545v1#S2.I6.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Selective prediction with FIFO for unpredicted jobs. https://arxiv.org/html/2503.07545v1#S2.I6.i3 Not an author-supplied code."
}
],
"queueing-predictions-s2-i6-i4": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Effective dedicated prediction servers. https://arxiv.org/html/2503.07545v1#S2.I6.i4 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Effective dedicated prediction servers. https://arxiv.org/html/2503.07545v1#S2.I6.i4 Not an author-supplied code."
}
],
"queueing-predictions-s2-i6-i5": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Economic incentives for job-size prediction. https://arxiv.org/html/2503.07545v1#S2.I6.i5 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Economic incentives for job-size prediction. https://arxiv.org/html/2503.07545v1#S2.I6.i5 Not an author-supplied code."
}
],
"queueing-predictions-s2-i7-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Multi-server queueing theory with predictions. https://arxiv.org/html/2503.07545v1#S2.I7.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Multi-server queueing theory with predictions. https://arxiv.org/html/2503.07545v1#S2.I7.i1 Not an author-supplied code."
}
],
"queueing-predictions-s2-i7-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Fluid limits for power-of-two routing with richer predictions. https://arxiv.org/html/2503.07545v1#S2.I7.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Fluid limits for power-of-two routing with richer predictions. https://arxiv.org/html/2503.07545v1#S2.I7.i2 Not an author-supplied code."
}
],
"queueing-predictions-s2-i7-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling jobs with predicted speedups across server counts. https://arxiv.org/html/2503.07545v1#S2.I7.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling jobs with predicted speedups across server counts. https://arxiv.org/html/2503.07545v1#S2.I7.i3 Not an author-supplied code."
}
],
"queueing-predictions-s4-i1-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Ranking LLM requests across prefill and decode. https://arxiv.org/html/2503.07545v1#S4.I1.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Ranking LLM requests across prefill and decode. https://arxiv.org/html/2503.07545v1#S4.I1.i1 Not an author-supplied code."
}
],
"queueing-predictions-s4-i1-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Adaptive thresholds for costly LLM preemption. https://arxiv.org/html/2503.07545v1#S4.I1.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Adaptive thresholds for costly LLM preemption. https://arxiv.org/html/2503.07545v1#S4.I1.i2 Not an author-supplied code."
}
],
"queueing-predictions-s4-i1-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Limited-preemption SPRPT and response-time tails. https://arxiv.org/html/2503.07545v1#S4.I1.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Limited-preemption SPRPT and response-time tails. https://arxiv.org/html/2503.07545v1#S4.I1.i3 Not an author-supplied code."
}
],
"queueing-predictions-s4-i2-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Cost and latency targets in adaptive LLM scheduling. https://arxiv.org/html/2503.07545v1#S4.I2.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Cost and latency targets in adaptive LLM scheduling. https://arxiv.org/html/2503.07545v1#S4.I2.i1 Not an author-supplied code."
}
],
"queueing-predictions-s4-i2-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Joint scheduling of interactive and background requests. https://arxiv.org/html/2503.07545v1#S4.I2.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Joint scheduling of interactive and background requests. https://arxiv.org/html/2503.07545v1#S4.I2.i2 Not an author-supplied code."
}
],
"queueing-predictions-s4-i2-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Prompt sharing without delaying small standalone requests. https://arxiv.org/html/2503.07545v1#S4.I2.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Prompt sharing without delaying small standalone requests. https://arxiv.org/html/2503.07545v1#S4.I2.i3 Not an author-supplied code."
}
],
"queueing-predictions-s4-i3-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Combining pooled and dedicated GPU allocation. https://arxiv.org/html/2503.07545v1#S4.I3.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Combining pooled and dedicated GPU allocation. https://arxiv.org/html/2503.07545v1#S4.I3.i1 Not an author-supplied code."
}
],
"queueing-predictions-s4-i3-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Heterogeneous GPUs across prefill and decode. https://arxiv.org/html/2503.07545v1#S4.I3.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Heterogeneous GPUs across prefill and decode. https://arxiv.org/html/2503.07545v1#S4.I3.i2 Not an author-supplied code."
}
],
"queueing-predictions-s4-i3-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Tandem queue analysis of split-phase LLM serving. https://arxiv.org/html/2503.07545v1#S4.I3.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Tandem queue analysis of split-phase LLM serving. https://arxiv.org/html/2503.07545v1#S4.I3.i3 Not an author-supplied code."
}
],
"queueing-predictions-s4-i3-i4": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of When many smaller GPUs outperform one larger GPU. https://arxiv.org/html/2503.07545v1#S4.I3.i4 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of When many smaller GPUs outperform one larger GPU. https://arxiv.org/html/2503.07545v1#S4.I3.i4 Not an author-supplied code."
}
],
"queueing-predictions-s4-i3-i5": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Adapting allocation to the bottleneck LLM phase. https://arxiv.org/html/2503.07545v1#S4.I3.i5 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Adapting allocation to the bottleneck LLM phase. https://arxiv.org/html/2503.07545v1#S4.I3.i5 Not an author-supplied code."
}
],
"queueing-predictions-s5-i2-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling guarantees for API-augmented LLM requests. https://arxiv.org/html/2503.07545v1#S5.I2.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling guarantees for API-augmented LLM requests. https://arxiv.org/html/2503.07545v1#S5.I2.i1 Not an author-supplied code."
}
],
"queueing-predictions-s5-i2-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Load balancing API-augmented inference with quality tradeoffs. https://arxiv.org/html/2503.07545v1#S5.I2.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Load balancing API-augmented inference with quality tradeoffs. https://arxiv.org/html/2503.07545v1#S5.I2.i2 Not an author-supplied code."
}
],
"queueing-predictions-s5-i3-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Tandem queue models of speculative decoding. https://arxiv.org/html/2503.07545v1#S5.I3.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Tandem queue models of speculative decoding. https://arxiv.org/html/2503.07545v1#S5.I3.i1 Not an author-supplied code."
}
],
"queueing-predictions-s5-i3-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Routing requests among LLMs under cost and latency limits. https://arxiv.org/html/2503.07545v1#S5.I3.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Routing requests among LLMs under cost and latency limits. https://arxiv.org/html/2503.07545v1#S5.I3.i2 Not an author-supplied code."
}
],
"queueing-predictions-s5-i3-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Reconciling predictions with live inference feedback. https://arxiv.org/html/2503.07545v1#S5.I3.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Reconciling predictions with live inference feedback. https://arxiv.org/html/2503.07545v1#S5.I3.i3 Not an author-supplied code."
}
],
"queueing-predictions-s5-i3-i4": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Queueing tradeoffs between LLM accuracy and time. https://arxiv.org/html/2503.07545v1#S5.I3.i4 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Queueing tradeoffs between LLM accuracy and time. https://arxiv.org/html/2503.07545v1#S5.I3.i4 Not an author-supplied code."
}
],
"queueing-predictions-s5-i4-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling parallel and dependent multi-LLM tasks. https://arxiv.org/html/2503.07545v1#S5.I4.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling parallel and dependent multi-LLM tasks. https://arxiv.org/html/2503.07545v1#S5.I4.i1 Not an author-supplied code."
}
],
"queueing-predictions-s5-i4-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Queueing and job-shop models for multi-stage LLM inference. https://arxiv.org/html/2503.07545v1#S5.I4.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Queueing and job-shop models for multi-stage LLM inference. https://arxiv.org/html/2503.07545v1#S5.I4.i2 Not an author-supplied code."
}
],
"queueing-predictions-s6-i1-i1": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling expansion and aggregation in LLM reasoning. https://arxiv.org/html/2503.07545v1#S6.I1.i1 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling expansion and aggregation in LLM reasoning. https://arxiv.org/html/2503.07545v1#S6.I1.i1 Not an author-supplied code."
}
],
"queueing-predictions-s6-i1-i2": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Sharing KV caches across reasoning paths. https://arxiv.org/html/2503.07545v1#S6.I1.i2 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Sharing KV caches across reasoning paths. https://arxiv.org/html/2503.07545v1#S6.I1.i2 Not an author-supplied code."
}
],
"queueing-predictions-s6-i1-i3": [
{
"code": "60K25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling with predicted reasoning depth. https://arxiv.org/html/2503.07545v1#S6.I1.i3 Not an author-supplied code."
},
{
"code": "68M20",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Scheduling with predicted reasoning depth. https://arxiv.org/html/2503.07545v1#S6.I1.i3 Not an author-supplied code."
}
],
"petrunin-geometry-1": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Two-convexity and plane sections. https://arxiv.org/pdf/2510.11908v2#page=1 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Two-convexity and plane sections. https://arxiv.org/pdf/2510.11908v2#page=1 Not an author-supplied code."
}
],
"petrunin-geometry-2": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of CAT(0) geometry of braid space. https://arxiv.org/pdf/2510.11908v2#page=2 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of CAT(0) geometry of braid space. https://arxiv.org/pdf/2510.11908v2#page=2 Not an author-supplied code."
}
],
"petrunin-geometry-3": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Hilbert-space quotients and Riemannian biquotients. https://arxiv.org/pdf/2510.11908v2#page=3 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Hilbert-space quotients and Riemannian biquotients. https://arxiv.org/pdf/2510.11908v2#page=3 Not an author-supplied code."
}
],
"petrunin-geometry-4": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Metrics of nested convex surfaces. https://arxiv.org/pdf/2510.11908v2#page=4 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Metrics of nested convex surfaces. https://arxiv.org/pdf/2510.11908v2#page=4 Not an author-supplied code."
}
],
"petrunin-geometry-5": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Maximal finite subgroups of Euclidean isometry groups. https://arxiv.org/pdf/2510.11908v2#page=4 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Maximal finite subgroups of Euclidean isometry groups. https://arxiv.org/pdf/2510.11908v2#page=4 Not an author-supplied code."
}
],
"petrunin-geometry-6": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Connecting points of a compact continuum with little outside length. https://arxiv.org/pdf/2510.11908v2#page=5 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Connecting points of a compact continuum with little outside length. https://arxiv.org/pdf/2510.11908v2#page=5 Not an author-supplied code."
}
],
"petrunin-geometry-7": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Length of a geodesic fixed by an involution. https://arxiv.org/pdf/2510.11908v2#page=6 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Length of a geodesic fixed by an involution. https://arxiv.org/pdf/2510.11908v2#page=6 Not an author-supplied code."
}
],
"petrunin-geometry-8": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Nonnegative polyhedral approximation of complex projective space. https://arxiv.org/pdf/2510.11908v2#page=6 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Nonnegative polyhedral approximation of complex projective space. https://arxiv.org/pdf/2510.11908v2#page=6 Not an author-supplied code."
}
],
"petrunin-geometry-10": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Cocompact hyperbolic actions generated by finite-order elements. https://arxiv.org/pdf/2510.11908v2#page=7 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Cocompact hyperbolic actions generated by finite-order elements. https://arxiv.org/pdf/2510.11908v2#page=7 Not an author-supplied code."
}
],
"petrunin-geometry-12": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Compactness of convex hulls in complete CAT(0) spaces. https://arxiv.org/pdf/2510.11908v2#page=8 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Compactness of convex hulls in complete CAT(0) spaces. https://arxiv.org/pdf/2510.11908v2#page=8 Not an author-supplied code."
}
],
"petrunin-geometry-14": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Embedding a closed four-ball with open projection. https://arxiv.org/pdf/2510.11908v2#page=9 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Embedding a closed four-ball with open projection. https://arxiv.org/pdf/2510.11908v2#page=9 Not an author-supplied code."
}
],
"petrunin-geometry-15": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Almost every geodesic encounters negative curvature. https://arxiv.org/pdf/2510.11908v2#page=9 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Almost every geodesic encounters negative curvature. https://arxiv.org/pdf/2510.11908v2#page=9 Not an author-supplied code."
}
],
"petrunin-geometry-16": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Reconstructing a pointed manifold from its exponential pullback. https://arxiv.org/pdf/2510.11908v2#page=10 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Reconstructing a pointed manifold from its exponential pullback. https://arxiv.org/pdf/2510.11908v2#page=10 Not an author-supplied code."
}
],
"petrunin-geometry-17": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Smooth optical fibers: orthogonal slices and noncongruent ends. https://arxiv.org/pdf/2510.11908v2#page=10 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Smooth optical fibers: orthogonal slices and noncongruent ends. https://arxiv.org/pdf/2510.11908v2#page=10 Not an author-supplied code."
}
],
"petrunin-geometry-18": [
{
"code": "53C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Guth’s sponge embedding problem. https://arxiv.org/pdf/2510.11908v2#page=11 Not an author-supplied code."
},
{
"code": "51F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Guth’s sponge embedding problem. https://arxiv.org/pdf/2510.11908v2#page=11 Not an author-supplied code."
}
],
"axial-algebras-s3-thmthm24": [
{
"code": "17",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Growth dimensions of axial algebras. https://arxiv.org/html/2606.30048v1#S3.Thmthm24 Not an author-supplied code."
}
],
"axial-algebras-s4-thmthm9": [
{
"code": "17",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Finite dimension for finitely generated Jordan-type algebras. https://arxiv.org/html/2606.30048v1#S4.Thmthm9 Not an author-supplied code."
}
],
"simons-linear-s2-thmproblem1": [
{
"code": "65F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Reproducible parameterized linear-system benchmarks. https://arxiv.org/html/2602.05394v3#S2.Thmproblem1 Not an author-supplied code."
}
],
"simons-linear-s2-thmproblem2": [
{
"code": "65F",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Algorithms for analyzable linear-system benchmark families. https://arxiv.org/html/2602.05394v3#S2.Thmproblem2 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-1": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Edge-edit radius for sidestepping Hamiltonicity. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=11 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Edge-edit radius for sidestepping Hamiltonicity. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=11 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-3": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Atoms versus nonsimplicial connected graphs. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=12 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Atoms versus nonsimplicial connected graphs. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=12 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-4": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Subquadratic-exponent counting of graphs with small vertex cover. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=13 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Subquadratic-exponent counting of graphs with small vertex cover. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=13 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-5": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Directed cycles above the minimum indegree. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=13 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Directed cycles above the minimum indegree. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=13 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-6": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Single-exponential algorithms parameterized by clique-width. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=14 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Single-exponential algorithms parameterized by clique-width. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=14 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-7": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Induced Disjoint Paths without an H3 subgraph. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=14 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Induced Disjoint Paths without an H3 subgraph. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=14 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-8": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of CMSO2 optimization in bipartite graphs with no long induced path. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=15 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of CMSO2 optimization in bipartite graphs with no long induced path. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=15 Not an author-supplied code."
}
],
"dagstuhl-graphs-pdf-4-9": [
{
"code": "05C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Recognizing a complete graph minus an edge as an induced minor. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=15 Not an author-supplied code."
},
{
"code": "68Q25",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Recognizing a complete graph minus an edge as an induced minor. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue01/25041/DagRep.15.1.105/DagRep.15.1.105.pdf#page=15 Not an author-supplied code."
}
],
"dagstuhl-semirings-pdf-4-1": [
{
"code": "16Y60",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Circuit size for path provenance over absorptive semirings. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=17 Not an author-supplied code."
},
{
"code": "68P15",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Circuit size for path provenance over absorptive semirings. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=17 Not an author-supplied code."
}
],
"dagstuhl-semirings-pdf-4-3": [
{
"code": "16Y60",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Which semirings embed in semirings with monus?. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=18 Not an author-supplied code."
},
{
"code": "68P15",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Which semirings embed in semirings with monus?. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=18 Not an author-supplied code."
}
],
"dagstuhl-semirings-pdf-4-4": [
{
"code": "16Y60",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Weighted star-free expressions and temporal logic. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=18 Not an author-supplied code."
},
{
"code": "68P15",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Weighted star-free expressions and temporal logic. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=18 Not an author-supplied code."
}
],
"dagstuhl-semirings-pdf-4-5": [
{
"code": "16Y60",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Decidability of conjunctive-query containment under bag semantics. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=19 Not an author-supplied code."
},
{
"code": "68P15",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Decidability of conjunctive-query containment under bag semantics. https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume15/issue02/25081/DagRep.15.2.89/DagRep.15.2.89.pdf#page=19 Not an author-supplied code."
}
],
"mfo-number-theory-assing": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A short Fourier-coefficient bound for Petersson norm. https://ems.press/content/serial-article-files/52435#page=56 Not an author-supplied code."
}
],
"mfo-number-theory-bernert-arala": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Differences of signed representatives of the first n integers. https://ems.press/content/serial-article-files/52435#page=56 Not an author-supplied code."
}
],
"mfo-number-theory-brandes-1": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Counting palindromic squares. https://ems.press/content/serial-article-files/52435#page=57 Not an author-supplied code."
}
],
"mfo-number-theory-browning": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A cubic surface with two leading counting contributions. https://ems.press/content/serial-article-files/52435#page=57 Not an author-supplied code."
}
],
"mfo-number-theory-brudern": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Geometric zero-sum criteria in finite-field vector spaces. https://ems.press/content/serial-article-files/52435#page=57 Not an author-supplied code."
}
],
"mfo-number-theory-conrey": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A primitive degree-three L-function with infinitely many critical-line zeros. https://ems.press/content/serial-article-files/52435#page=58 Not an author-supplied code."
}
],
"mfo-number-theory-koukoulopoulos-1": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of The asymmetric multiplication table with seven or more factors. https://ems.press/content/serial-article-files/52435#page=58 Not an author-supplied code."
}
],
"mfo-number-theory-kowalski-1": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Elliptic-curve Frobenius traces as primitive roots. https://ems.press/content/serial-article-files/52435#page=58 Not an author-supplied code."
}
],
"mfo-number-theory-merikoski-1": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A divisor sum over a cubic polynomial in two variables. https://ems.press/content/serial-article-files/52435#page=59 Not an author-supplied code."
}
],
"mfo-number-theory-merikoski-2": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Divisors of sums of two prime squares. https://ems.press/content/serial-article-files/52435#page=59 Not an author-supplied code."
}
],
"mfo-number-theory-pilatte": [
{
"code": "11",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Bounded exponential sums and eventual periodicity. https://ems.press/content/serial-article-files/52435#page=60 Not an author-supplied code."
}
],
"jmlr-meta-learning-7": [
{
"code": "68T05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Fast meta-learning rates with variational task posteriors. https://jmlr.org/papers/volume26/23-025/23-025.pdf#page=19 Not an author-supplied code."
},
{
"code": "62C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Fast meta-learning rates with variational task posteriors. https://jmlr.org/papers/volume26/23-025/23-025.pdf#page=19 Not an author-supplied code."
}
],
"jmlr-hyperbo-posterior": [
{
"code": "62L05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Posterior error bounds for pre-trained Gaussian processes. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=49 Not an author-supplied code."
},
{
"code": "68T05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Posterior error bounds for pre-trained Gaussian processes. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=49 Not an author-supplied code."
}
],
"jmlr-hyperbo-necessary": [
{
"code": "62L05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Necessary conditions for bounded HyperBO regret. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=49 Not an author-supplied code."
},
{
"code": "68T05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Necessary conditions for bounded HyperBO regret. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=49 Not an author-supplied code."
}
],
"jmlr-hyperbo-continuous": [
{
"code": "62L05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of HyperBO regret beyond finite-dimensional GP assumptions. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=49 Not an author-supplied code."
},
{
"code": "68T05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of HyperBO regret beyond finite-dimensional GP assumptions. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=49 Not an author-supplied code."
}
],
"jmlr-hyperbo-failures": [
{
"code": "62L05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Bayesian optimization with failed function evaluations. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=50 Not an author-supplied code."
},
{
"code": "68T05",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Bayesian optimization with failed function evaluations. https://jmlr.org/papers/volume25/23-0269/23-0269.pdf#page=50 Not an author-supplied code."
}
],
"information-geometry-3": [
{
"code": "53B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A joint information geometry for stochastic dynamics. https://arxiv.org/html/2509.06989v1#S3 Not an author-supplied code."
},
{
"code": "62B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A joint information geometry for stochastic dynamics. https://arxiv.org/html/2509.06989v1#S3 Not an author-supplied code."
}
],
"information-geometry-4": [
{
"code": "53B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A divergence minimized by the operator Sinkhorn algorithm. https://arxiv.org/html/2509.06989v1#S4 Not an author-supplied code."
},
{
"code": "62B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A divergence minimized by the operator Sinkhorn algorithm. https://arxiv.org/html/2509.06989v1#S4 Not an author-supplied code."
}
],
"information-geometry-5": [
{
"code": "53B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Bi-orthogonal coordinates without assumed dual connections. https://arxiv.org/html/2509.06989v1#S5 Not an author-supplied code."
},
{
"code": "62B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Bi-orthogonal coordinates without assumed dual connections. https://arxiv.org/html/2509.06989v1#S5 Not an author-supplied code."
}
],
"siam-optimization-3-1-memory": [
{
"code": "90C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Simple subgradient methods between two oracle-complexity regimes. https://siagoptimization.github.io/assets/views/ViewsAndNews-33-1.pdf#page=3 Not an author-supplied code."
}
],
"siam-optimization-3-1-parallel": [
{
"code": "90C",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Parallel simple solvers with near-optimal optimization depth. https://siagoptimization.github.io/assets/views/ViewsAndNews-33-1.pdf#page=4 Not an author-supplied code."
}
],
"computable-dynamics-1": [
{
"code": "37",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Topological invariants of computational complexity. https://arxiv.org/html/2507.10725v1#S6 Not an author-supplied code."
},
{
"code": "03D",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Topological invariants of computational complexity. https://arxiv.org/html/2507.10725v1#S6 Not an author-supplied code."
}
],
"computable-dynamics-2": [
{
"code": "37",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A dynamical operation characterizing Turing universality. https://arxiv.org/html/2507.10725v1#S6 Not an author-supplied code."
},
{
"code": "03D",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A dynamical operation characterizing Turing universality. https://arxiv.org/html/2507.10725v1#S6 Not an author-supplied code."
}
],
"computable-dynamics-6": [
{
"code": "37",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Turing universality in celestial mechanics. https://arxiv.org/html/2507.10725v1#S6 Not an author-supplied code."
},
{
"code": "03D",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Turing universality in celestial mechanics. https://arxiv.org/html/2507.10725v1#S6 Not an author-supplied code."
}
],
"mathematical-biology-2": [
{
"code": "92B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Identifiability and uncertainty in large biological models. https://arxiv.org/html/2206.09516v1#S3.SS2 Not an author-supplied code."
}
],
"mathematical-biology-3": [
{
"code": "92B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Reliable selection across biological model families. https://arxiv.org/html/2206.09516v1#S3.SS3 Not an author-supplied code."
}
],
"mathematical-biology-4": [
{
"code": "92B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Finding design principles across biological modelling formalisms. https://arxiv.org/html/2206.09516v1#S3.SS4 Not an author-supplied code."
}
],
"mathematical-biology-5": [
{
"code": "92B",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Automated development of mechanistic biological models. https://arxiv.org/html/2206.09516v1#S3.SS5 Not an author-supplied code."
}
],
"liouville-gravity-1": [
{
"code": "81T40",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of SLE and LQG constructions for minimal string theory. https://arxiv.org/html/2510.16431v1#S5.SS1 Not an author-supplied code."
},
{
"code": "60J67",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of SLE and LQG constructions for minimal string theory. https://arxiv.org/html/2510.16431v1#S5.SS1 Not an author-supplied code."
}
],
"liouville-gravity-2": [
{
"code": "81T40",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A complete conformal field theory of critical percolation. https://arxiv.org/html/2510.16431v1#S5.SS2 Not an author-supplied code."
},
{
"code": "60J67",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of A complete conformal field theory of critical percolation. https://arxiv.org/html/2510.16431v1#S5.SS2 Not an author-supplied code."
}
],
"liouville-gravity-3": [
{
"code": "81T40",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Continuum random surfaces from Yang–Mills expansions. https://arxiv.org/html/2510.16431v1#S5.SS3 Not an author-supplied code."
},
{
"code": "60J67",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Continuum random surfaces from Yang–Mills expansions. https://arxiv.org/html/2510.16431v1#S5.SS3 Not an author-supplied code."
}
]
}
{
"tianyuan-logic-1-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Combining chains of random Turing degrees — Problem 1.1. https://arxiv.org/html/2608.26628v2#S1.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-1-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Full-measure sets and random degree chains — Problem 1.2. https://arxiv.org/html/2608.26628v2#S1.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-1-3": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Chains of 2-random reals without a single generator — Problem 1.3. https://arxiv.org/html/2608.26628v2#S1.Thmproblem3 Not an author-supplied code."
}
],
"tianyuan-logic-1-4": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Jumps and complexity within 2-random chains — Problem 1.4. https://arxiv.org/html/2608.26628v2#S1.Thmproblem4 Not an author-supplied code."
}
],
"tianyuan-logic-1-5": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Injective randomness-preserving one-way functions — Problem 1.5. https://arxiv.org/html/2608.26628v2#S1.Thmproblem5 Not an author-supplied code."
}
],
"tianyuan-logic-2-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Outer automorphisms of oligomorphic groups — Problem 2.1. https://arxiv.org/html/2608.26628v2#S2.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-2-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Strong jump traceability versus LR reducibility — Problem 2.2. https://arxiv.org/html/2608.26628v2#S2.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-2-3": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Recursive maximal almost disjoint families in a closed class — Problem 2.3. https://arxiv.org/html/2608.26628v2#S2.Thmproblem3 Not an author-supplied code."
}
],
"tianyuan-logic-3-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Fourth-level quantifier-pattern degrees — Problem 3.1. https://arxiv.org/html/2608.26628v2#S3.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-3-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Deciding reducibility of quantifier patterns — Problem 3.2. https://arxiv.org/html/2608.26628v2#S3.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-4-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Kakeya sets whose points compute the halting problem — Problem 4.1. https://arxiv.org/html/2608.26628v2#S4.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-4-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Minimal subsets of Borel Kakeya sets — Problem 4.2. https://arxiv.org/html/2608.26628v2#S4.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-5-1": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Borel two-point sets — Problem 5.1. https://arxiv.org/html/2608.26628v2#S5.Thmproblem1 Not an author-supplied code."
}
],
"tianyuan-logic-5-2": [
{
"code": "03",
"basis": "source-map",
"evidence": "Editorial MSC2020 mapping of Algebraic closures of Borel fields — Problem 5.2. https://arxiv.org/html/2608.26628v2#S5.Thmproblem2 Not an author-supplied code."
}
],
"tianyuan-logic-6-1": [