Paper Citation Record · LEDGER

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming

As of 21 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2507.13337.

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

pith.paper-citation-record.v1
2507.13337 v1

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:30:23.372029Z

measured 32 of 32 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+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

32 of 32 outbound references displayed

verified exact0
verified fuzzy24
unresolved8
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e8b3772e-27c4-409b-b25f-5883f0f1d801 · outbound

This paper cites Program Synthesis with Large Language Models.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Program Synthesis with Large Language Models

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:20.692387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41698ff9-91c7-468e-859c-d1bd7128cb2b · outbound

This paper cites On non-serial dynamic programming.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming On non-serial dynamic programming

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.089396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c17c8043-d12c-4b83-a9e9-b84b06ea9132 · outbound

This paper cites Rankings of graphs.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Rankings of graphs

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.081002Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aff151b1-8522-4206-b9c7-5f8fe302df56 · outbound

This paper cites Dynamic programming on graphs with bounded treewidth.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Dynamic programming on graphs with bounded treewidth

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:20.954241Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be38b3df-9a8c-4f75-890a-76cd31f43ee6 · outbound

This paper cites A linear time algorithm for finding tree-decompositions of small treewidth.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming A linear time algorithm for finding tree-decompositions of small treewidth

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:21.051557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70606835-0436-49b7-935d-2f53db18e67c · outbound

This paper cites Handle-rewriting hypergraph grammars.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Handle-rewriting hypergraph grammars

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.063013Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7f38aaa7-b8f2-484c-80c2-ffe2a0425109 · outbound

This paper cites Lower bounds based on the exponential-time hypothesis.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Lower bounds based on the exponential-time hypothesis

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.054769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 04b8439b-06c0-43c0-9816-0800549e736f · outbound

This paper cites On the measure of intelligence.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming On the measure of intelligence

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.047038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8828a22a-571e-4d54-bc00-265b63fd8fb6 · outbound

This paper cites The complexity of satisfiability of small depth circuits.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming The complexity of satisfiability of small depth circuits

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.039441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 504170f8-5bd1-42b7-8b56-5960c15d3bbb · outbound

This paper cites Training verifiers to solve math word problems.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Training verifiers to solve math word problems

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.031514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9d3181e5-f689-4480-925d-a7ac712874ed · outbound

This paper cites ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:21.635235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b356961-c5ac-45b9-8a8c-9350decc1e12 · outbound

This paper cites ARC Prize 2024: Technical Report.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming ARC Prize 2024: Technical Report

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:21.727113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf4d5263-46f3-428b-bb9e-186ab79a048b · outbound

This paper cites The monadic second-order logic of graphs.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming The monadic second-order logic of graphs

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.023782Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 20e6e2b1-d61a-4fb0-ae1d-002fc93aa028 · outbound

This paper cites Competitive programming with large reasoning models.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Competitive programming with large reasoning models

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:28.015396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 905b998f-e3af-40ab-a4d7-e3a5fd5a28db · outbound

This paper cites Ruiz, Julian Schrittwieser, Grzegorz Swirszcz, et al.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Ruiz, Julian Schrittwieser, Grzegorz Swirszcz, et al

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:27.827109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aff5e515-5e0c-4a5d-9202-4f4de3787abe · outbound

This paper cites Dynasp2.5: Dynamic programming on tree decompositions in action.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Dynasp2.5: Dynamic programming on tree decompositions in action

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:27.610754Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 07e106a5-77da-43ff-aa41-ef22b915db79 · outbound

This paper cites Faster algorithms for finding and counting subgraphs.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Faster algorithms for finding and counting subgraphs

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:27.362818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4a329d34-b70a-4bae-9e30-03f4eb0d9059 · outbound

This paper cites FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:22.229875Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2fcea47f-5d78-4a33-a75b-7c65c75d5b1d · outbound

This paper cites S-functions for graphs.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming S-functions for graphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:27.140372Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a7af5e64-ca57-4133-892d-606584adbdce · outbound

This paper cites an unresolved cited work.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Unresolved cited work

Reference 20

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:30:26.825764Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 761b9581-d997-42d6-84b6-948454dd1290 · outbound

This paper cites Measuring mathematical problem solving with the math dataset.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Measuring mathematical problem solving with the math dataset

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:26.603552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 41a82c3b-96ba-4759-969b-26e3ac4468a3 · outbound

This paper cites Ale-bench: A benchmark for long-horizon objective-driven algorithm engineering.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Ale-bench: A benchmark for long-horizon objective-driven algorithm engineering

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:26.337383Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 267aa3dc-95bf-4c30-8413-92a32eb9a459 · outbound

This paper cites Livecodebench: Holistic and contamination free evaluation of large language models for code.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Livecodebench: Holistic and contamination free evaluation of large language models for code

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:26.076264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9ea1247a-38bd-4959-b905-62145d06225b · outbound

This paper cites Enumeration of minimal hitting sets parameterized by treewidth.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Enumeration of minimal hitting sets parameterized by treewidth

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:25.795429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ea0679ec-e3d9-4d1e-aac0-358af5c7ac91 · outbound

This paper cites Known algorithms on graphs of bounded treewidth are probably optimal.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Known algorithms on graphs of bounded treewidth are probably optimal

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:25.480519Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 97d48100-81f0-45ae-b865-4c0dba789ba3 · outbound

This paper cites Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, Cosmin Paduraru, Edouard Leurent, Shariq Iqbal, Jean-Baptiste Lespiau, Alex Ahern, et al.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, Cosmin Paduraru, Edouard Leurent, Shariq Iqbal, Jean-Baptiste Lespiau, Alex Ahern, et al

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:25.191545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2a93bf67-e8e8-4560-ad39-f41d9bcb3912 · outbound

This paper cites Ruiz, Abbas Mehrabian, M.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Ruiz, Abbas Mehrabian, M

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:24.837387Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 436a5e23-7ea5-4d6f-a583-86c7dea084fa · outbound

This paper cites Humanity's last exam.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Humanity's last exam

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:24.555344Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c045c71b-f110-484f-98c5-a86542e146d1 · outbound

This paper cites Codeelo: Benchmarking competition-level code generation of llms with human-comparable elo ratings.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Codeelo: Benchmarking competition-level code generation of llms with human-comparable elo ratings

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:24.317007Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 20415e82-ec68-4ae2-9f23-2c11143a90df · outbound

This paper cites Graph minors.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Graph minors

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:24.025165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f410a3bd-6923-4117-a1a9-696719f08fbd · outbound

This paper cites Graph minors.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming Graph minors

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-06T16:30:23.237936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffe69223-d087-4b88-a0f1-52bccc51c8de · outbound

This paper cites k-nlc graphs and polynomial algorithms.

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming k-nlc graphs and polynomial algorithms

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:30:23.678791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.