Pith. sign in

Paper Citation Record · LEDGER

Theoretical Foundations of $\max$@$k$ Reinforcement Learning

As of 16 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2607.17823.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.17823 v1

Coverage vector

measured 72 of 72 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T15:43:00.193690Z

measured 72 of 72 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

72 of 72 outbound references displayed

  • verified exact6
  • verified fuzzy32
  • unresolved34
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 625e53fa-f725-4c3a-a903-19d02bb5b830 · outbound

This paper cites Max k-armed bandit: On the extremehunter algorithm and beyond.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Max k-armed bandit: On the extremehunter algorithm and beyond

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.580651Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.853729Z digest=sha256:47508a7654ced73bfdb621481659e237315a94f2d78ca95610b4fde024b0a9aa

Observation 07c00da6-1cb9-440b-9610-ffd8202ec4ab · outbound

This paper cites Model-based reinforcement learning with a generative model is minimax optimal.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Model-based reinforcement learning with a generative model is minimax optimal

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.858827Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.858827Z digest=sha256:2e0bf4289e6cc895736c10b71c4321f9d84830ed1b86962659512e30da1d59d1

Observation 47162232-2a07-4dee-a51e-1d65eeabdc70 · outbound

This paper cites Rewarding behaviors.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Rewarding behaviors

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.555000Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.864050Z digest=sha256:0a188f97d9520847f3e199f368de62051f88798016befc36811a60e655d99969

Observation f49fc2c4-5a51-461c-98c8-991e1fc12ad8 · outbound

This paper cites The best of n worlds: Aligning reinforcement learning with best-of-n sampling via max@ k optimisation.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning The best of n worlds: Aligning reinforcement learning with best-of-n sampling via max@ k optimisation

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.868809Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.868809Z digest=sha256:d31fd13d799f73b34832c1a46988d523ea9c2f4ae2e2fa034975a4c066665754

Observation 8fd909a1-f7e5-4b00-84f3-c6bd2d5cb84b · outbound

This paper cites Optimal rates for feasible payoff set estimation in games.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Optimal rates for feasible payoff set estimation in games

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.538800Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.873641Z digest=sha256:287d1f33a262940359f6bf4fdbc938353c20629639696fbe08b9462d4fa2b6d2

Observation dc095108-3c1e-42c3-9fbc-567fd533d0f8 · outbound

This paper cites Regret bounds for risk-sensitive reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Regret bounds for risk-sensitive reinforcement learning

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.522317Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.878445Z digest=sha256:af2b42e5f39cb4ca8e1a1ce00a39ebea2b591cb458454d663bda50e24bb6c2ad

Observation 1b93c90e-f45a-484d-a499-3ff7ac0d225a · outbound

This paper cites Efficient Algorithms for Extreme Bandits.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Efficient Algorithms for Extreme Bandits

Reference 7

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:43:00.847060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.883304Z digest=sha256:ab4c16d08fb20d0848e40d4f8d5ca96f15975712b0cfb52d43092447f825463c

Observation 1eb87b60-46ee-479d-82c1-a39110c44967 · outbound

This paper cites A distributional perspective on reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning A distributional perspective on reinforcement learning

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.506394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.888682Z digest=sha256:a8f7dfefa2390d0373386931b3fa30df43f100185435a62affb601ddeb337a36

Observation 922f4659-6ee2-4e0e-beb0-e2f7211de686 · outbound

This paper cites Distributional reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Distributional reinforcement learning

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.893132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.893132Z digest=sha256:10accddb04c1bbc4f308289562ff8720cc68e61b7f68995dc3cc0934de356142

Observation 562fbd03-df68-4cdf-8a0e-3e55637ccec0 · outbound

This paper cites Graph of thoughts: Solving elaborate problems with large language models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Graph of thoughts: Solving elaborate problems with large language models

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.480410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.897682Z digest=sha256:7cd30a351e9564254231f737bad5169c522a6844ce37fc76562faa151b0efc80

Observation 76f0cb61-4bc6-43ed-8015-1a75c354c82b · outbound

This paper cites Concentration inequalities.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Concentration inequalities

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.464927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.902824Z digest=sha256:3045754333fb83ac32b8c540c1bb1954d4e50ca399a86f4e215577e1b72b4782

Observation bb58fe7f-850f-4322-bbcd-dc3597d8f089 · outbound

This paper cites Ltlf/ldlf non-markovian rewards.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Ltlf/ldlf non-markovian rewards

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.449399Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.907794Z digest=sha256:bf1ec209052ae5ca6b0971c8012fb8820e0f7c1ebdeee8ebb49f1943ab43e867

Observation 9fdfe351-46f4-495d-8ed8-4d466b2f21d0 · outbound

This paper cites Large Language Monkeys: Scaling Inference Compute with Repeated Sampling.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Large Language Monkeys: Scaling Inference Compute with Repeated Sampling

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.913259Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.913259Z digest=sha256:718d6f6e279e848651f2dd2afac25c0d76a1a82d54aa1e64f99d59b02192ee5d

Observation 0a285c5d-5d23-4918-b36b-cabf9dd18427 · outbound

This paper cites Extreme bandits.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Extreme bandits

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.432510Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.919440Z digest=sha256:76f20e680565df5dbc7229ad23971becffdb289f9118c6376d4091029babadd4

Observation bfeca6e3-9d90-4053-8ae5-038570ccd3c0 · outbound

This paper cites MaxProof: Scaling Mathematical Proof with Generative-Verifier RL and Population-Level Test-Time Scaling.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning MaxProof: Scaling Mathematical Proof with Generative-Verifier RL and Population-Level Test-Time Scaling

Reference 15

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:43:00.805866Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.924047Z digest=sha256:3ea5577a90d62ed22a714875514337027ce264cbe8766e53b5e442c7a90b22eb

Observation 40355f6a-ae50-479c-bbf6-c3036bc00e10 · outbound

This paper cites Evaluating Large Language Models Trained on Code.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Evaluating Large Language Models Trained on Code

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.928939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.928939Z digest=sha256:d56ecc89fb2a9d357c266116a55a9942c490a1822f488af7ca551ab928b78cfc

Observation 2671270e-a7bf-4526-b5e5-6280f75f798a · outbound

This paper cites Pass@k Training for Adaptively Balancing Exploration and Exploitation of Large Reasoning Models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Pass@k Training for Adaptively Balancing Exploration and Exploitation of Large Reasoning Models

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.933543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.933543Z digest=sha256:1d0f27bdd45c1c44941114a891fe262670e7a8a529376b9fe6f2bd4851936ed0

Observation 7b5455b1-d8ff-47a6-8215-6104926b509b · outbound

This paper cites Does reinforcement learning really incentivize reasoning capacity in llms beyond the base model? Advances in Neural Information Processing Systems, 38: 0 57654--57689, 2026 b.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Does reinforcement learning really incentivize reasoning capacity in llms beyond the base model? Advances in Neural Information Processing Systems, 38: 0 57654--57689, 2026 b

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.416408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.938646Z digest=sha256:10e8ad728fc7b31b009cad52fcb6f3219207c4269b65eede8bb008fdcb4521e8

Observation 8554e31f-2321-4536-b3c6-5be9d4c27a01 · outbound

This paper cites Robust reinforcement learning with general utility.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Robust reinforcement learning with general utility

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.396413Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.945161Z digest=sha256:12e855e8fd96bdf18d8f0d1a043677567800f60fc7b117afe64994edd5d29808

Observation a2533bf9-107f-4c86-9d69-6d7ce6a91b78 · outbound

This paper cites Algorithms for cvar optimization in mdps.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Algorithms for cvar optimization in mdps

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.381109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.950006Z digest=sha256:3f8489dd0330096e6ac314f6da30b138c09b47ebff60bcc6866cecbb1bbe4701

Observation aa071919-3714-43e4-b0ad-7743923b2799 · outbound

This paper cites Inference-aware fine-tuning for best-of-n sampling in large language models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Inference-aware fine-tuning for best-of-n sampling in large language models

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.364580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.954810Z digest=sha256:702b4a5d3842cb743f5ec4e4073336b822855e6bba9404eae29c0381b5650eb1

Observation 629f9abf-1e80-4559-8c7a-5bf323b82482 · outbound

This paper cites Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement

Reference 22

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:43:00.752025Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.959235Z digest=sha256:59fa350ecbbceafb6c6490c2c9f492d260fb1b8222dde7ff59ad255529773440

Observation 8c2f4e4c-eadd-4214-ace6-6e0ff1a60848 · outbound

This paper cites Training Verifiers to Solve Math Word Problems.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Training Verifiers to Solve Math Word Problems

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.964054Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.964054Z digest=sha256:58ba859933371a04f9948b44a3fbc75852f22b0ce2bf744f52e64b50e6d228bd

Observation e929eea7-8113-492b-9198-5cd1bc497a9d · outbound

This paper cites The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.969022Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.969022Z digest=sha256:7a5b8c30188b91f0c3b2fb49f9442bbd5373c4b55c2ea53494ee5454539fbe68

Observation a57f932b-0639-4867-bf20-391465791a64 · outbound

This paper cites Distributional reinforcement learning with quantile regression.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Distributional reinforcement learning with quantile regression

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.973762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.973762Z digest=sha256:c2425281b050888de6e9f336f448e6668de046730e2f2199bb019cdab37238c4

Observation 6c1b5b99-2c8c-4610-8596-d6b86f17a714 · outbound

This paper cites Sample complexity of episodic fixed-horizon reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Sample complexity of episodic fixed-horizon reinforcement learning

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.337404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.978206Z digest=sha256:8d9e79a070b47daff4a405582d0d414dd7c974fb477a943d371aef0e8587beef

Observation 71c59548-95e2-44ce-b301-6399e4e4a8ed · outbound

This paper cites Chain-of-verification reduces hallucination in large language models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Chain-of-verification reduces hallucination in large language models

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.321369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.982838Z digest=sha256:ccc573566021cc298c4bbc9a61679580c650387b404a38a1b1b538ff242d3416

Observation 0b9aa258-404a-4eb5-9628-71baec40fa45 · outbound

This paper cites Episodic reinforcement learning in finite mdps: Minimax lower bounds revisited.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Episodic reinforcement learning in finite mdps: Minimax lower bounds revisited

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-15T15:42:59.987481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:42:59.987481Z digest=sha256:4c8f97d4459bd5499f0a93ce163762752401e696593e2a1bb5ae37e3736fa0b4

Observation a6cdc281-69f9-4117-b890-a96d3ca60546 · outbound

This paper cites Risk-sensitive reinforcement learning: Near-optimal risk-sample tradeoff in regret.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Risk-sensitive reinforcement learning: Near-optimal risk-sample tradeoff in regret

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.294545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.991888Z digest=sha256:b5ddcb591a194c24727be9620c5a40b2cc1cf6598feda3a6ff974c2afa76e648

Observation 59853193-3c51-4bf3-8d76-b54f8961256d · outbound

This paper cites Reinforcement learning with non-markovian rewards.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Reinforcement learning with non-markovian rewards

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.279736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:42:59.996244Z digest=sha256:91d32a62852a36505299a917f44e8bc6591edd8bc63b7b1d00b2be20df15b671

Observation 6f889ea7-c8bb-4e4e-9bbe-35fafa7a31b9 · outbound

This paper cites Explore first, exploit next: The true shape of regret in bandit problems.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Explore first, exploit next: The true shape of regret in bandit problems

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.264333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.000917Z digest=sha256:2b18786e8b154b4ebd824669464ba066bb8360ebf0448c485a2413bc4aa5f1ad

Observation 7c2ef413-981c-447a-876a-4ad6be31dd22 · outbound

This paper cites Minimax pac bounds on the sample complexity of reinforcement learning with a generative model.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Minimax pac bounds on the sample complexity of reinforcement learning with a generative model

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.006056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.006056Z digest=sha256:ac2608eb38173109783eae6e88997c9cc855622abb6a73b8440cc09efb675700

Observation 668552ad-4f7a-4bb7-9d75-c4183ec9e73e · outbound

This paper cites DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.011209Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.011209Z digest=sha256:41ac636177b2069e98e89f614a91e61d0843db1c1d35639154d54f50cec46d02

Observation 5f55e9cc-c7e8-479d-9d3d-9372759007d4 · outbound

This paper cites Provably efficient maximum entropy exploration.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Provably efficient maximum entropy exploration

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.238724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.016167Z digest=sha256:cd33e75b0891da7524d0f2a359154b06504141fb5160fdd7f0b6f7aabb97e643

Observation 17730fc1-6c16-4a39-a6f1-762ade99ac0d · outbound

This paper cites Reward machines: Exploiting reward function structure in reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Reward machines: Exploiting reward function structure in reinforcement learning

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.021277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.021277Z digest=sha256:e67e31272078cad17de5333c4555ee779a8d7a9d35e2ac374f4dab5ed5e0f1ca

Observation 06732d28-280b-4403-8bbe-0417d21f2aa0 · outbound

This paper cites Learning to Correct: Calibrated Reinforcement Learning for Multi-Attempt Chain-of-Thought.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Learning to Correct: Calibrated Reinforcement Learning for Multi-Attempt Chain-of-Thought

Reference 36

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:43:00.681559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.025992Z digest=sha256:8292853114f541697401018e8eb3b4056dce194ad8bb60b076fdbcd958b77e44

Observation ab01f87b-de69-421e-83cf-e32cf398b70b · outbound

This paper cites OpenAI o1 System Card.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning OpenAI o1 System Card

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.030970Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.030970Z digest=sha256:e74332194a2fdc60325753e89007721c9339c9014d7fdbb00422daf3b0806fe2

Observation 90a5d3d3-1c0b-4473-ac97-e58517198755 · outbound

This paper cites Planning in markov decision processes with gap-dependent sample complexity.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Planning in markov decision processes with gap-dependent sample complexity

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.035693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.035693Z digest=sha256:41e49205beb1a3226b14ce8dd4287d5bb6e7d8be1aa9a34e786942a4db876b12

Observation 22699b3b-7ddc-46f0-811d-a0fbd40a406e · outbound

This paper cites Policy Gradient for Reinforcement Learning with General Utilities.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Policy Gradient for Reinforcement Learning with General Utilities

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.040269Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.040269Z digest=sha256:1d02bdb685d9f41b32e7dfa5235ef2a592ae855bba4683d5ed7d5c1bfbcd22ed

Observation 5d3e3b1d-0be1-4559-81ea-8cd12651222c · outbound

This paper cites Tulu 3: Pushing Frontiers in Open Language Model Post-Training.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Tulu 3: Pushing Frontiers in Open Language Model Post-Training

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.045102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.045102Z digest=sha256:13924addca5f63dbd4b31d5a58ac9fb5acf361fdbf4a6ae47cf6805f7cb7feb2

Observation fcd66a85-f262-49b4-9429-9fe2ea430745 · outbound

This paper cites Breaking the sample size barrier in model-based reinforcement learning with a generative model.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Breaking the sample size barrier in model-based reinforcement learning with a generative model

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.200559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.049986Z digest=sha256:322a059c36097f6885fff09e31bd3d5a7fd08e75dbeb1cf72a8a572f9f661da4

Observation 81685593-ebe5-4b03-9595-da5efc84ff48 · outbound

This paper cites Competition-level code generation with alphacode.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Competition-level code generation with alphacode

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.054604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.054604Z digest=sha256:dded40a904b4536019faadba119667161ee8cac976bf4b667afe818dc25e59c8

Observation 91a9539b-b2f6-4ff7-a710-2cd01fbf50ff · outbound

This paper cites Let's verify step by step.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Let's verify step by step

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.170258Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.059527Z digest=sha256:d7d53dd992064eba0cd3021dc1c3afd56d872996b8a4615a6003b25765cdd1b6

Observation aeb5fe5c-079c-4c8b-92b6-50f6800bb1dc · outbound

This paper cites Self-refine: Iterative refinement with self-feedback.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Self-refine: Iterative refinement with self-feedback

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.152773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.064216Z digest=sha256:e1ec683e976c5fe814d81756101721c48f9101978745d7439af17ca499158a55

Observation 2ebbdfa3-1951-496a-8bc0-acc6d8412474 · outbound

This paper cites Challenging common assumptions in convex reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Challenging common assumptions in convex reinforcement learning

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.136470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.068710Z digest=sha256:d006a3f323f691ca785363c11054a1fc42cf6c0eac41c9bbc72de595d8283f42

Observation 8adae96a-6142-4b32-9a7b-1b874e16fdcb · outbound

This paper cites Convex reinforcement learning in finite trials.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Convex reinforcement learning in finite trials

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.120510Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.073411Z digest=sha256:fcf07530fc8f96c1dab82647c1bdb0918c464303f6d2cf2429b8bb93c377b467

Observation be78362e-7f03-4f6c-b83f-723801e46e75 · outbound

This paper cites No regret bound for extreme bandits.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning No regret bound for extreme bandits

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.103499Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.078160Z digest=sha256:10686773cb2267cd018a46be032019c32ff2249af02b80f70a81b85962b55cd5

Observation 44e5bb33-067d-47de-b63c-0a47e274b126 · outbound

This paper cites Markov decision processes.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Markov decision processes

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.082947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.082947Z digest=sha256:3b370cdc857025e646dbe89b579bdbc3e384927a20e13cda29edec51fe5f52f1

Observation e77ccf59-7b37-4a5f-a864-b189e2736d86 · outbound

This paper cites Near-minimax-optimal distributional reinforcement learning with a generative model.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Near-minimax-optimal distributional reinforcement learning with a generative model

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.077284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.087694Z digest=sha256:17323dbcab1cd30c6b05d1d3b52a7c2a18bb0b48ac7899f749b53543bfa32cab

Observation 16e479be-4ba3-421e-9332-4a85203e27d8 · outbound

This paper cites Reflexion: Language agents with verbal reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Reflexion: Language agents with verbal reinforcement learning

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.092288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.092288Z digest=sha256:0105a5e302fb4e16506e8d5e7776592d43bdbce14684b4e9e8815d62f38e00a3

Observation cdf2dc89-efc2-4602-84db-0e7dfcdc4a67 · outbound

This paper cites Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.097139Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.097139Z digest=sha256:54cad03d6c689f15f2f0dba9f0c6815cfbd428c55bc56631aeb6f5763410870f

Observation 194ae738-564d-4436-b827-29d982c6e385 · outbound

This paper cites Scaling llm test-time compute optimally can be more effective than scaling parameters for reasoning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Scaling llm test-time compute optimally can be more effective than scaling parameters for reasoning

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.050398Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.102134Z digest=sha256:c512390dda8ef70996ed4961cbf73ed5c7c2940ec8f5603fcdddb5f64ace2352

Observation ce10b7e7-ec70-4dd4-b0da-719367611f40 · outbound

This paper cites On Advantage Estimates for Max@K Policy Gradients.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning On Advantage Estimates for Max@K Policy Gradients

Reference 53

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:43:00.594510Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.107012Z digest=sha256:75a422b519c1a89b79bc6048a15087698fa16b1c1ca2f42d4aef2858bf27d2b9

Observation 29b53253-1846-4525-9ed1-32863b156d96 · outbound

This paper cites Optimizing language models for inference time objectives using reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Optimizing language models for inference time objectives using reinforcement learning

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.034770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.111838Z digest=sha256:3efffefd7c44f32f2c40c64fbb113231683625fa18999898c850a44aaf010def

Observation 6c52c959-462b-42b7-8118-b8ff9fddab3f · outbound

This paper cites Finite-Time Regret Analysis of Retry-Aware Bandits.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Finite-Time Regret Analysis of Retry-Aware Bandits

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.116220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.116220Z digest=sha256:d0b3e992c5f3dcab1d5133f75199f5bd996d68a6e6590643bd65eccfb9b760c6

Observation a3287bdd-5ede-4ab7-bf89-b864090bc05b · outbound

This paper cites Model-Based Reinforcement Learning in Discrete-Action Non-Markovian Reward Decision Processes.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Model-Based Reinforcement Learning in Discrete-Action Non-Markovian Reward Decision Processes

Reference 56

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:43:00.554958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.121084Z digest=sha256:e46caad26b93f1e7c99244a7ed6443d08153ee9a6107888a964d86a00e1129a4

Observation f57f8433-a6f2-46bc-b670-d55b6d5b0f6f · outbound

This paper cites Advancing Mathematics Research with AI-Driven Formal Proof Search.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Advancing Mathematics Research with AI-Driven Formal Proof Search

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.125774Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.125774Z digest=sha256:19dc66ddef7737749dd84d4c8c082cbd1cc5b967a82dec3119e401f2685b3abc

Observation a5459578-ee59-4c28-bdca-e4a58431d1c1 · outbound

This paper cites Recursive self-aggregation unlocks deep thinking in large language models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Recursive self-aggregation unlocks deep thinking in large language models

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.130531Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.130531Z digest=sha256:7144aee57bf3c457a9fe54c0e4fb175dcbf8a1553463e0b3bbefb1782ea3a003

Observation 2d1235b0-03ef-4dcb-9484-78253068f15f · outbound

This paper cites Pass@ k policy optimization: Solving harder reinforcement learning problems.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Pass@ k policy optimization: Solving harder reinforcement learning problems

Reference 59

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.018740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.135225Z digest=sha256:238270ccc208a34b2016dc5a4177494e35e7d6e3c671150d0cfded47f9270781

Observation 1d36c955-e4b9-4b5a-8877-6cd7884a8c75 · outbound

This paper cites Sample-efficient reinforcement learning for linearly-parameterized mdps with a generative model.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Sample-efficient reinforcement learning for linearly-parameterized mdps with a generative model

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:01.002243Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.139501Z digest=sha256:fca4a4da0c6c58ebd90be98dca3d59775957672d5c7116fd18b6835a24669043

Observation 08746916-6130-4183-a306-b7442a7ecd6f · outbound

This paper cites Near-minimax-optimal risk-sensitive reinforcement learning with cvar.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Near-minimax-optimal risk-sensitive reinforcement learning with cvar

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.143775Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.143775Z digest=sha256:412de66152e346da729c22eb45172469987377f28f1ec89a2ad5c79ebf5d1514

Observation d44bf767-cedd-4e67-a821-4dd80d4ce061 · outbound

This paper cites Self-Consistency Improves Chain of Thought Reasoning in Language Models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Self-Consistency Improves Chain of Thought Reasoning in Language Models

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.148168Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.148168Z digest=sha256:4139e859902dc412aa9ee9c55cb1b228ae5ce993508febd215515f7dee3d2e72

Observation 0e438ab1-7139-48ec-891d-ff09a2f5fbb6 · outbound

This paper cites Risk-sensitive Markov Decision Process and Learning under General Utility Functions.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Risk-sensitive Markov Decision Process and Learning under General Utility Functions

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.152775Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.152775Z digest=sha256:47d621297c4ed4f623de8706d83ad8a6f3a11483a2edc7c32ea529351cda2421

Observation aaaaf2ff-7240-4b6f-b5d1-0bd167f1baa2 · outbound

This paper cites Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.157724Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.157724Z digest=sha256:259ef94411e3c8b17020a1617baddc8a804017f739e7835a4595ed458ab98560

Observation dedb8a22-c4de-48e0-a547-c5498c0a8718 · outbound

This paper cites DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.162507Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.162507Z digest=sha256:d2be04cb16f774fd9e293289bad569b4e0683411612e6c3faf820a390861ac5b

Observation 9fe2c7f4-2c1a-4375-91a7-89e3fa68afdd · outbound

This paper cites Tree of thoughts: Deliberate problem solving with large language models.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Tree of thoughts: Deliberate problem solving with large language models

Reference 66

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.167272Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.167272Z digest=sha256:6ce0d26fed439e1bfafae7d6ed082c8ce8743775baf334df546d096fd48d85f4

Observation b6238607-8f5f-46ca-8713-11438ee98bd0 · outbound

This paper cites Reward is enough for convex mdps.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Reward is enough for convex mdps

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:00.965177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.171999Z digest=sha256:7507d8e1278d87d59a84ce28df8493990681d026a0b7092307c5d558522e7db3

Observation 70cf53ee-3fe7-443e-bb61-d43a2682383d · outbound

This paper cites Star: Bootstrapping reasoning with reasoning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Star: Bootstrapping reasoning with reasoning

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.176430Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.176430Z digest=sha256:068abc0962499fe183a5f1dab9720a87f151af45ee12d61469f793b4b1799485

Observation 515c704c-2b96-4e6b-bef0-c23004832a7e · outbound

This paper cites Variational policy gradient method for reinforcement learning with general utilities.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Variational policy gradient method for reinforcement learning with general utilities

Reference 69

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.180627Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.180627Z digest=sha256:34749e0e3fa26b2bc0d2c0915cfdc527a0c6c9d091e7e9ae0e6814fa7a64a024

Observation c7d0718c-3cb6-4fc9-aea5-be94c0641cd8 · outbound

This paper cites Estimation and inference in distributional reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Estimation and inference in distributional reinforcement learning

Reference 70

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.184885Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.184885Z digest=sha256:a0d98ed00083389630968f4fd06397a144c4410369f8096e91147d5c4bd68838

Observation 9851e4c7-a1ef-4e60-8eaa-f776dfdf292e · outbound

This paper cites Beyond markovian: Reflective exploration via bayes-adaptive rl for llm reasoning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Beyond markovian: Reflective exploration via bayes-adaptive rl for llm reasoning

Reference 71

Resolution
unresolved
no resolver link, observed 2026-08-15T15:43:00.189171Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T15:43:00.189171Z digest=sha256:2f2890c9b402b42f45c03386a090cdb56c9c130934d0fc6c5e3feca66764bf9b

Observation 0534ec8d-deb2-4ca9-84d1-a6cf374ac558 · outbound

This paper cites Settling the sample complexity of online reinforcement learning.

Theoretical Foundations of $\max$@$k$ Reinforcement Learning Settling the sample complexity of online reinforcement learning

Reference 72

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T15:43:00.927032Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-08-15T15:43:00.193690Z digest=sha256:5fc79e495e8123f3a179198d42bf8ed0a3d243da580d5edcd986c85419bb837a

Pith citing papers

No inbound Pith citation observations are available.