{"as_of":"2026-08-21T03:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0c92160ff9b7ff6b862089b04b57de24e214dd0309fced5be8044b0a10fc615","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:30:23.372029Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.13337/citation-record","integrity":"/paper/2507.13337/integrity","json":"/paper/2507.13337/citation-record.json","paper":"/paper/2507.13337"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-06T16:30:20.692387Z","title":"Program synthesis with large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:20.692387Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:70b8222c8cf38527b2768ed014579489fac9b51a70c2e56c17961a7572a54d2b","observation_id":"e8b3772e-27c4-409b-b25f-5883f0f1d801","resolution":{"observed_at":"2026-08-06T16:30:20.692387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.086323Z","title":"On non-serial dynamic programming","venue":null,"work_id":"4179aa7e-0da7-4f31-be1d-827b2dc81dc7","year":1973},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:20.757601Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:01333d2e005dfb738e0bebe59e3345471230c7208a7feee40fb5fa233e489c89","observation_id":"41698ff9-91c7-468e-859c-d1bd7128cb2b","resolution":{"observed_at":"2026-08-06T16:30:28.089396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.078450Z","title":"Rankings of graphs","venue":null,"work_id":"f6b7df4a-9791-4602-8feb-120dd00def3c","year":1998},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:20.853161Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:c88fcaeb8a18b50da423a3760a418dbe20cb399340fb59a2cbe5dd79311886ce","observation_id":"c17c8043-d12c-4b83-a9e9-b84b06ea9132","resolution":{"observed_at":"2026-08-06T16:30:28.081002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:20.954241Z","title":"Dynamic programming on graphs with bounded treewidth","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:20.954241Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:1b61c339027c1695022c0cd0585b400821b4003d98117471cf1d5662c7edb481","observation_id":"aff151b1-8522-4206-b9c7-5f8fe302df56","resolution":{"observed_at":"2026-08-06T16:30:20.954241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:21.051557Z","title":"A linear time algorithm for finding tree-decompositions of small treewidth","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.051557Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:a526561ff59e671dffc0ff59650bf558259e6fb9e38a67151130e2dfa76bc61e","observation_id":"be38b3df-9a8c-4f75-890a-76cd31f43ee6","resolution":{"observed_at":"2026-08-06T16:30:21.051557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.059817Z","title":"Handle-rewriting hypergraph grammars","venue":null,"work_id":"b6ea9a57-8ba8-4b12-a8b8-e00be85355f7","year":1993},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.152654Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:dc20a8f4bcb60a0d70e80b5b4080a9c0733c217a4e62a6ef5178e9f80f7a468c","observation_id":"70606835-0436-49b7-935d-2f53db18e67c","resolution":{"observed_at":"2026-08-06T16:30:28.063013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.052037Z","title":"Lower bounds based on the exponential-time hypothesis","venue":null,"work_id":"b8b63561-ca23-4b2e-9163-69c0e02ec8a2","year":2015},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.241717Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:eafb06a8d1de496033da947aa82316d9a7b7571b22107ceae07834413e520a22","observation_id":"7f38aaa7-b8f2-484c-80c2-ffe2a0425109","resolution":{"observed_at":"2026-08-06T16:30:28.054769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.044285Z","title":"On the measure of intelligence","venue":null,"work_id":"5e9f1500-858d-410d-a603-fd4130f7aea0","year":2019},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.337019Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:933406d2c102e66d8f8a236709f3208a4988317a643c51f643bf72caf8bc6af0","observation_id":"04b8439b-06c0-43c0-9816-0800549e736f","resolution":{"observed_at":"2026-08-06T16:30:28.047038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.036789Z","title":"The complexity of satisfiability of small depth circuits","venue":null,"work_id":"c14e23ff-f189-4fab-9e33-74fb47418b0a","year":2009},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.422612Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:2fc3f0628c00dae7d0da7e15889ec085a910ff0010153610f9d6bc2ae44c46df","observation_id":"8828a22a-571e-4d54-bc00-265b63fd8fb6","resolution":{"observed_at":"2026-08-06T16:30:28.039441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.028850Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":"ed64464e-8679-435b-99bd-69899ef9ee34","year":2021},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.526899Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:131bd62b8c1bc6529cf61231322a593c34f91e795865a51838932dcdeff2c0fd","observation_id":"504170f8-5bd1-42b7-8b56-5960c15d3bbb","resolution":{"observed_at":"2026-08-06T16:30:28.031514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11831","last_updated":"2026-01-15T23:30:35Z","snapshot_observed_at":"2026-08-17T15:02:18.805323Z","submitted_at":"2025-05-17T04:34:48Z","title":"ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11831","snapshot_observed_at":"2026-08-06T16:30:21.635235Z","title":"Arc-agi-2: A new challenge for frontier ai reasoning systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.635235Z"},"links":{"cited_paper":"/paper/2505.11831","citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:930c8969e4d3cf49682a9db909e60b802e84d3f50c22c7cc839c8fce5afa7fec","observation_id":"9d3181e5-f689-4480-925d-a7ac712874ed","resolution":{"observed_at":"2026-08-06T16:30:21.635235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04604","last_updated":"2025-01-08T05:24:50Z","snapshot_observed_at":"2026-08-16T13:00:34.704005Z","submitted_at":"2024-12-05T20:40:28Z","title":"ARC Prize 2024: Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04604","snapshot_observed_at":"2026-08-06T16:30:21.727113Z","title":"Arc prize 2024: Technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.727113Z"},"links":{"cited_paper":"/paper/2412.04604","citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:f3f92434b7a22d83e99318f2c59896199dbb11375267fa7a464b1541b93a6217","observation_id":"1b356961-c5ac-45b9-8a8c-9350decc1e12","resolution":{"observed_at":"2026-08-06T16:30:21.727113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:28.021032Z","title":"The monadic second-order logic of graphs","venue":null,"work_id":"cee11599-7f58-42f7-90cd-775b5bc12255","year":1990},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.803081Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:0e8c3496c4659c5ee627bdc9df7675d8b06081ddff653733c9c4009202cf9cc0","observation_id":"bf4d5263-46f3-428b-bb9e-186ab79a048b","resolution":{"observed_at":"2026-08-06T16:30:28.023782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:27.937078Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":"71e63fb2-900e-4834-acf7-61da65b85da7","year":2025},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.897034Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:b8abe83bb1bcef28d277d8371338dda4b4d25b0f89cd98f40e43054faa7a0c71","observation_id":"20e6e2b1-d61a-4fb0-ae1d-002fc93aa028","resolution":{"observed_at":"2026-08-06T16:30:28.015396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:27.753216Z","title":"Ruiz, Julian Schrittwieser, Grzegorz Swirszcz, et al","venue":null,"work_id":"f4256d35-6a60-42fd-bf7e-519f0a231283","year":2022},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:21.988371Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:b8008e3d7acbc28fb92144b13b74c8c0f862c6781f61fb90775ceff10c9d7959","observation_id":"905b998f-e3af-40ab-a4d7-e3a5fd5a28db","resolution":{"observed_at":"2026-08-06T16:30:27.827109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:27.505859Z","title":"Dynasp2.5: Dynamic programming on tree decompositions in action","venue":null,"work_id":"d9571151-b8ae-48f7-9f04-5456a0949b03","year":2021},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.048348Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:ad9ec0c9478ca716d2e5b05bf2c995b4044d9ef071e2a292d1186b82c8b629a8","observation_id":"aff5e515-5e0c-4a5d-9202-4f4de3787abe","resolution":{"observed_at":"2026-08-06T16:30:27.610754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:27.260806Z","title":"Faster algorithms for finding and counting subgraphs","venue":null,"work_id":"7bf9b0a4-5214-44b1-8379-29a805ef06ce","year":2012},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.150817Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:ff77b8f3d155fc5da8550aa604548795246d50afff1f45636b57234fd83aee46","observation_id":"07e106a5-77da-43ff-aa41-ef22b915db79","resolution":{"observed_at":"2026-08-06T16:30:27.362818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04872","last_updated":"2025-12-23T02:23:47Z","snapshot_observed_at":"2026-08-13T13:45:44.430193Z","submitted_at":"2024-11-07T17:07:35Z","title":"FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04872","snapshot_observed_at":"2026-08-06T16:30:22.229875Z","title":"Frontiermath: A benchmark for evaluating advanced mathematical reasoning in ai","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.229875Z"},"links":{"cited_paper":"/paper/2411.04872","citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:814a31f408ff25d2b0975d3c25639f4ce8d2eddb61dff40eff5711f28a9f6e70","observation_id":"4a329d34-b70a-4bae-9e30-03f4eb0d9059","resolution":{"observed_at":"2026-08-06T16:30:22.229875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:26.985607Z","title":"S-functions for graphs","venue":null,"work_id":"ec2f84c4-5222-4751-8bdc-49c0193570b7","year":1976},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.319622Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:20eb3cf8e0d6592482799fd674791937692f603c57668327c77f46690530984a","observation_id":"2fcea47f-5d78-4a33-a75b-7c65c75d5b1d","resolution":{"observed_at":"2026-08-06T16:30:27.140372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:26.722482Z","title":null,"venue":null,"work_id":"c0327e3e-6f82-46db-b8c2-391a9de2f3b5","year":1969},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.405249Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:859538d09f478db279a90de7cd14b4ddefa716f131b2f8f8c5d59cd5773ad355","observation_id":"a7af5e64-ca57-4133-892d-606584adbdce","resolution":{"observed_at":"2026-08-06T16:30:26.825764Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:26.498610Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":"ab6fff2e-8e56-4339-9ed8-85190d2036f6","year":2021},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.471017Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:e03ac7b5cbe2ebb470e36d5f41653172e1454b96cae39b62e1eb9faffbdb54d5","observation_id":"761b9581-d997-42d6-84b6-948454dd1290","resolution":{"observed_at":"2026-08-06T16:30:26.603552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:26.210035Z","title":"Ale-bench: A benchmark for long-horizon objective-driven algorithm engineering","venue":null,"work_id":"2c833b0c-3472-4ca1-a7ad-999473fe54f6","year":2025},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.540238Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:0ec87527aaa4715c5475d2837f82625f1f5628df246c884daacccd749a69c4f2","observation_id":"41a82c3b-96ba-4759-969b-26e3ac4468a3","resolution":{"observed_at":"2026-08-06T16:30:26.337383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:25.955157Z","title":"Livecodebench: Holistic and contamination free evaluation of large language models for code","venue":null,"work_id":"1f02eba7-dab6-4359-80d6-db01bcb82964","year":2024},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.630101Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:f765f9bac5300fc53feba7ce12f07fe97a638d5e9bab481ea1eb426e247aa5c3","observation_id":"267aa3dc-95bf-4c30-8413-92a32eb9a459","resolution":{"observed_at":"2026-08-06T16:30:26.076264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:25.605946Z","title":"Enumeration of minimal hitting sets parameterized by treewidth","venue":null,"work_id":"2acf7ae9-10e5-4d94-a518-42096e41a6cb","year":2024},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.642880Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:4edb8d2826d1ce73debd01a885e20e33da09c3419a7f4bb2d8b217a8b787dfd1","observation_id":"9ea1247a-38bd-4959-b905-62145d06225b","resolution":{"observed_at":"2026-08-06T16:30:25.795429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:25.349231Z","title":"Known algorithms on graphs of bounded treewidth are probably optimal","venue":null,"work_id":"7c8f6694-2785-4f0a-9e08-9e80ea2fbdc0","year":2011},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.696873Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:bd9728007d71046bf78493d085c91da0f5e5438ce23d29dbe1e85b4d11a03672","observation_id":"ea0679ec-e3d9-4d1e-aac0-358af5c7ac91","resolution":{"observed_at":"2026-08-06T16:30:25.480519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:25.018800Z","title":"Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, Cosmin Paduraru, Edouard Leurent, Shariq Iqbal, Jean-Baptiste Lespiau, Alex Ahern, et al","venue":null,"work_id":"1249ab80-e57a-46ae-b671-7998a013d4ff","year":2023},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.767614Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:8f82124abcfbe5ca86f2128d8513e15cb6a489e3f08cf73c6f288cce91d21bdb","observation_id":"97d48100-81f0-45ae-b865-4c0dba789ba3","resolution":{"observed_at":"2026-08-06T16:30:25.191545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:24.713777Z","title":"Ruiz, Abbas Mehrabian, M","venue":null,"work_id":"f29c049d-fa77-401e-9a3b-16eb4327e371","year":2025},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.863267Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:75628ea6b7ff901e26fd034477565b0243e034dcfbc32f919a99184bbcf0aa0b","observation_id":"2a93bf67-e8e8-4560-ad39-f41d9bcb3912","resolution":{"observed_at":"2026-08-06T16:30:24.837387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:24.441275Z","title":"Humanity's last exam","venue":null,"work_id":"c63ed8c4-e7a7-48a1-90de-16d15a77f3f4","year":2025},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:22.963663Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:3f7e08e1c48895485958faa990dbbef3b4ad6ed10f0d990bd306d8aeb928071f","observation_id":"436a5e23-7ea5-4d6f-a583-86c7dea084fa","resolution":{"observed_at":"2026-08-06T16:30:24.555344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:24.163051Z","title":"Codeelo: Benchmarking competition-level code generation of llms with human-comparable elo ratings","venue":null,"work_id":"0ef3f1d1-a8ed-4f80-97a0-eca5563fc69d","year":2025},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:23.014099Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:266605b5088900177332ba774dc47ebd61ca5de5db1f183817c8c7ed49c2c4ce","observation_id":"c045c71b-f110-484f-98c5-a86542e146d1","resolution":{"observed_at":"2026-08-06T16:30:24.317007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:23.902096Z","title":"Graph minors","venue":null,"work_id":"dd683f9c-0089-4965-a9dc-abf04ca8585f","year":1983},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:23.140386Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:3c559e08005a68ef742318b947e0efe006f73f991cf81f78d69080736eaab7ea","observation_id":"20415e82-ec68-4ae2-9f23-2c11143a90df","resolution":{"observed_at":"2026-08-06T16:30:24.025165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:23.237936Z","title":"Graph minors","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:23.237936Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:aeabb36ae816afe7d129ea2bfeb1d8a9b3d16781b8a68c3d7c323ac6582b3be5","observation_id":"f410a3bd-6923-4117-a1a9-696719f08fbd","resolution":{"observed_at":"2026-08-06T16:30:23.237936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:23.603530Z","title":"k-nlc graphs and polynomial algorithms","venue":null,"work_id":"86e56129-8bf2-4cab-915f-290c9bd8ddc2","year":1994},"citing_paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:23.372029Z"},"links":{"citing_paper":"/paper/2507.13337"},"observation_digest":"sha256:7bedd8018537e4f94e4d25dcd34132bf1f391736256abd2771e27c0f667dc27e","observation_id":"ffe69223-d087-4b88-a0f1-52bccc51c8de","resolution":{"observed_at":"2026-08-06T16:30:23.678791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.13337","last_updated":"2025-07-17T17:53:55Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T08:23:59.857182Z","submitted_at":"2025-07-17T17:53:55Z","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":24},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"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."}