{"as_of":"2026-08-12T06:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31a839210e114dfb5f25fc6b5c1b921e763c925110d722869724ec22c948c38e","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:02:49.136412Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T19:44:16.630377Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T19:45:04.026367Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"cited_work":{"arxiv_id":"2412.12544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.12544","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Seed-cts: Unleashing the power of tree search for superior performance in competitive coding tasks","venue":null,"work_id":"ed6cb2aa-993a-4dab-a5ad-dafea641d788","year":2024},"citing_paper":{"arxiv_id":"2504.12334","last_updated":"2026-05-10T17:20:39Z","snapshot_observed_at":"2026-07-30T01:17:05.243178Z","submitted_at":"2025-04-13T12:32:25Z","title":"QM-ToT: A Medical Tree of Thoughts Reasoning Framework for Quantized Model","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T19:44:16.630377Z"},"links":{"cited_paper":"/paper/2412.12544","citing_paper":"/paper/2504.12334"},"observation_digest":"sha256:d546e4f6aae9a362b46ffec8838fbb4c2ea4babf1b6b40c2c94bbafa262b67ef","observation_id":"6a345381-1630-4327-b8f6-f0051ca68f35","resolution":{"observed_at":"2026-05-22T19:45:04.028003Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.12544/citation-record","integrity":"/paper/2412.12544/integrity","json":"/paper/2412.12544/citation-record.json","paper":"/paper/2412.12544"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-11T14:02:49.003312Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.003312Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:0624afcde5f0cf1611ea8ff412e6540a10bc3b5c074706a768854dd1835f3298","observation_id":"a800bcb0-e18c-455f-a570-d9603dafaad3","resolution":{"observed_at":"2026-08-11T14:02:49.003312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-11T14:02:49.008959Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.008959Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:c0295aef453e54bb1d360d0ee03eae42446b2d1c18ed2427adb9020ad33c7b2c","observation_id":"e8e5b7a2-69cd-4459-bb23-2623ec7d1eb2","resolution":{"observed_at":"2026-08-11T14:02:49.008959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08568","last_updated":"2025-05-27T07:40:36Z","snapshot_observed_at":"2026-08-04T15:08:40.203853Z","submitted_at":"2023-06-14T15:18:48Z","title":"WizardCoder: Empowering Code Large Language Models with Evol-Instruct","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08568","snapshot_observed_at":"2026-08-11T14:02:49.013460Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.013460Z"},"links":{"cited_paper":"/paper/2306.08568","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:f96f1fc18056172dedd72a652ff3273fa8b8a3b307f5b653a0fdca4b2bdb89b4","observation_id":"eafca4c4-2ddb-41b9-b016-a2b9b02c81bd","resolution":{"observed_at":"2026-08-11T14:02:49.013460Z","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-11T14:02:49.602895Z","title":null,"venue":null,"work_id":"8ed1e8aa-f7fc-4a67-9405-09677402094c","year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.017647Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:12f5f58a2cda43621aa0d60613159977234d4a6f7e2d2816d24b044e5b505400","observation_id":"84eb2e20-63b9-4888-ba44-1e520a754765","resolution":{"observed_at":"2026-08-11T14:02:49.606443Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T14:02:49.592015Z","title":null,"venue":null,"work_id":"faaac371-7d2a-4b20-80af-05ae9bdb7e02","year":2022},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.021705Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:fc7b4ac3108fc35b3d41942ae38486c21225cb593786f1c3af090db15876dee7","observation_id":"028caa16-6a0b-4e03-9073-459b4299933b","resolution":{"observed_at":"2026-08-11T14:02:49.595703Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-08-06T22:40:28.707813Z","submitted_at":"2024-01-25T14:17:53Z","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14196","snapshot_observed_at":"2026-08-11T14:02:49.025518Z","title":"K., et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.025518Z"},"links":{"cited_paper":"/paper/2401.14196","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:c930a01b6807842fc3931fd6f6c719154968f7e7544ba6f3351850931c039986","observation_id":"68dd5b42-1b16-4b66-917d-05124ab2452c","resolution":{"observed_at":"2026-08-11T14:02:49.025518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-11T14:02:49.029757Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.029757Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:1d926634624bf997a6ca6e2a81381e08b2f0676acd062e39e2f83bcc6b8adb6a","observation_id":"a860e386-2c0d-4b84-9f49-597933e990fc","resolution":{"observed_at":"2026-08-11T14:02:49.029757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06161","last_updated":"2023-12-13T14:44:10Z","snapshot_observed_at":"2026-07-06T15:25:35.930688Z","submitted_at":"2023-05-09T08:16:42Z","title":"StarCoder: may the source be with you!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-11T14:02:49.033941Z","title":"B., Zi, Y., Muennighoff, N., Kocetkov, D., Mou, C., Marone, M., Akiki, C., Li, J., Chim, J., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.033941Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:71b162212d27c41e3b683d00628032cddd0c4cfa18b11be93b2d39eead253baf","observation_id":"5749040e-26bd-4c90-883b-c66d790b121d","resolution":{"observed_at":"2026-08-11T14:02:49.033941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-11T14:02:49.037793Z","title":"E., Adi, Y., Liu, J., Sauvestre, R., Remez, T., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.037793Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:1fd35784ed32953c4bb2c9a23d02580b1035a720743370b807a577e38ad7bd4c","observation_id":"25c821fc-ecf1-4faa-8077-3eafe5b9ab6a","resolution":{"observed_at":"2026-08-11T14:02:49.037793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-11T14:02:49.041752Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.041752Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:90cdf3c0962bff5a58b8f34819009dadaaa1e62baf5d691b022f71e2d40d7a34","observation_id":"4a1b28b5-3e89-467b-8ee3-bb02e40a2dde","resolution":{"observed_at":"2026-08-11T14:02:49.041752Z","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-11T14:02:49.581426Z","title":null,"venue":null,"work_id":"5e3033de-ea10-434f-929b-8c00a4eca5d4","year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.045210Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:5c4e0c4d21e7db0c43a7fe9fabf0443c307a36747b9159bb68cae808c0291f21","observation_id":"976db66b-1995-456b-bfb0-14b46c2c6800","resolution":{"observed_at":"2026-08-11T14:02:49.584955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-11T14:02:49.048665Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.048665Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:47386a679dd80f3ff3b416225e0cb5e212f9c1abd15b33b5a9edbcc9954ef8d2","observation_id":"756b6b2a-a7e6-43c6-8c63-4df42cf6339d","resolution":{"observed_at":"2026-08-11T14:02:49.048665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13010","last_updated":"2024-05-24T11:47:24Z","snapshot_observed_at":"2026-07-06T17:05:56.282078Z","submitted_at":"2023-12-20T13:22:41Z","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.13010","snapshot_observed_at":"2026-08-11T14:02:49.052231Z","title":"M., Luck, M., Cui, H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.052231Z"},"links":{"cited_paper":"/paper/2312.13010","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:cb9027b753bfb55fd7c540d3a75e677043455652d06a994695f17e7338778930","observation_id":"aef592b1-4747-4c16-b348-4316955ba746","resolution":{"observed_at":"2026-08-11T14:02:49.052231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00352","last_updated":"2024-11-01T14:36:52Z","snapshot_observed_at":"2026-07-06T16:01:07.532053Z","submitted_at":"2023-08-01T07:49:10Z","title":"MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00352","snapshot_observed_at":"2026-08-11T14:02:49.055354Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.055354Z"},"links":{"cited_paper":"/paper/2308.00352","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:09a1359e97d9bc5e9e01d8cb21a7a101609f9b20726f379886cff1a4ac4dca44","observation_id":"f1d687df-ea9b-4bff-9e70-53615bfc90f8","resolution":{"observed_at":"2026-08-11T14:02:49.055354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01030","last_updated":"2024-06-07T01:53:07Z","snapshot_observed_at":"2026-08-08T05:33:26.232678Z","submitted_at":"2024-02-01T21:38:58Z","title":"Executable Code Actions Elicit Better LLM Agents","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01030","snapshot_observed_at":"2026-08-11T14:02:49.058496Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.058496Z"},"links":{"cited_paper":"/paper/2402.01030","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:0fe0ed3ee30d3aa21466198baf57655633343ce9a0b9a7328e6a532572c4a22f","observation_id":"882e9d16-b692-4e46-bf7d-cebbfad13790","resolution":{"observed_at":"2026-08-11T14:02:49.058496Z","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-11T14:02:49.569490Z","title":null,"venue":null,"work_id":"f5406874-6f2b-48af-8ef4-938feda67461","year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.061585Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:94ca6fe3da77d79d81bc4b4da74dec57628ea55987683bb3729717195c23702d","observation_id":"2d9430e4-d8a3-40c7-94b6-815fed1744d5","resolution":{"observed_at":"2026-08-11T14:02:49.573366Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-08-09T16:16:46.530132Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-11T14:02:49.064787Z","title":"B., Gan, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.064787Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:dcbc3d0fb9fe1c6f2b7aaa7ce3489deaada242b7abe09cc80e6bdf7c428ed65a","observation_id":"728c057e-ebaa-4380-a05a-10f1fd42b6cc","resolution":{"observed_at":"2026-08-11T14:02:49.064787Z","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-11T14:02:49.558073Z","title":"V., Zhou, D., et al","venue":null,"work_id":"04a37060-12e0-431a-a19c-ee090f64e823","year":2022},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.068719Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:4b91fc08faadbf183fd17c6faec226a08951b04135fa0dc157094fbc221fcfcd","observation_id":"844f7d1d-d080-4b23-aadf-e78609501c64","resolution":{"observed_at":"2026-08-11T14:02:49.561732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-07-06T12:50:22.773056Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-11T14:02:49.071672Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.071672Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:438c22f66c04981ce91f56419a78b1b82d19ac874d3c282d5ed6f3143e89beaf","observation_id":"68077d9b-029e-468b-8bd2-5b4f4a4d152b","resolution":{"observed_at":"2026-08-11T14:02:49.071672Z","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-11T14:02:49.547328Z","title":null,"venue":null,"work_id":"71f11d4b-7f83-4eb1-81b0-cf6f20228a77","year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.075194Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:5befc0ed03151343d965b69397cda98f771b6dca3a8983fc6d93fbd7ed51805f","observation_id":"b7bea6a8-9cd1-4768-a02c-85d2dd1b0698","resolution":{"observed_at":"2026-08-11T14:02:49.551188Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14992","last_updated":"2023-10-23T07:24:28Z","snapshot_observed_at":"2026-07-06T15:32:25.931739Z","submitted_at":"2023-05-24T10:28:28Z","title":"Reasoning with Language Model is Planning with World Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14992","snapshot_observed_at":"2026-08-11T14:02:49.078904Z","title":"J., Wang, Z., Wang, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.078904Z"},"links":{"cited_paper":"/paper/2305.14992","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:32637ee3d790ad888c635c76bd5d868a4391688442a70d10959bbd13c1a8f0fa","observation_id":"b4f97cba-ca2a-46d0-9886-d5352627ab49","resolution":{"observed_at":"2026-08-11T14:02:49.078904Z","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-11T14:02:49.536336Z","title":null,"venue":null,"work_id":"73111a7f-1061-4dbf-9185-abf49fc88218","year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.082789Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:c1ff02b3538e8387903402ad48784a7a3513b350c26ee63c5e63e80986dfee32","observation_id":"e39c9dcf-ef21-4609-b9b1-3494c95ea924","resolution":{"observed_at":"2026-08-11T14:02:49.539911Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04406","last_updated":"2024-06-06T02:51:17Z","snapshot_observed_at":"2026-08-06T23:53:10.606737Z","submitted_at":"2023-10-06T17:55:11Z","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04406","snapshot_observed_at":"2026-08-11T14:02:49.086467Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.086467Z"},"links":{"cited_paper":"/paper/2310.04406","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:b6b714517a8cb3244f9d3a1a939cfdb6b89d3d60408da6874f5d4aa7e8e6e957","observation_id":"b74b7e13-73bc-4eb2-ae61-aec01aa25923","resolution":{"observed_at":"2026-08-11T14:02:49.086467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.05128","last_updated":"2023-10-05T09:12:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-04-11T10:43:43Z","title":"Teaching Large Language Models to Self-Debug","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.05128","snapshot_observed_at":"2026-08-11T14:02:49.090479Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.090479Z"},"links":{"cited_paper":"/paper/2304.05128","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:d036cb584a472a01f6e3a9a6939a68e9c1636d43cef0002005593e5bc908b845","observation_id":"9e949af3-ba39-4513-acb4-9d99c1ad41f9","resolution":{"observed_at":"2026-08-11T14:02:49.090479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08784","last_updated":"2024-02-23T04:56:37Z","snapshot_observed_at":"2026-08-04T06:36:18.617860Z","submitted_at":"2023-08-17T04:58:51Z","title":"CodeCoT: Tackling Code Syntax Errors in CoT Reasoning for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08784","snapshot_observed_at":"2026-08-11T14:02:49.094559Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.094559Z"},"links":{"cited_paper":"/paper/2308.08784","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:93391072d8fe6e7db8053038760a3cda3650bd33984379aea44758c124e7ee4c","observation_id":"b967d5dc-135c-4ad9-a075-962501b1dc42","resolution":{"observed_at":"2026-08-11T14:02:49.094559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03816","last_updated":"2024-11-18T05:36:16Z","snapshot_observed_at":"2026-08-04T20:04:21.125115Z","submitted_at":"2024-06-06T07:40:00Z","title":"ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03816","snapshot_observed_at":"2026-08-11T14:02:49.098915Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.098915Z"},"links":{"cited_paper":"/paper/2406.03816","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:c7bf72ba5eb1d68feb6ae2dcb2214d46b2e2bc172d79d8542ccab2a6fe8d8ba0","observation_id":"19a858cb-1c7b-49a1-bf42-23ffd7a464a8","resolution":{"observed_at":"2026-08-11T14:02:49.098915Z","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-11T14:02:49.103043Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.103043Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:e6e405b18581561f5cde5a30ec0a3233a2a832f0ef11674ab87fc67a0f0117a1","observation_id":"39c7da93-f167-43cf-bdf8-487a54bd114a","resolution":{"observed_at":"2026-08-11T14:02:49.103043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06195","last_updated":"2024-08-12T14:42:13Z","snapshot_observed_at":"2026-08-09T16:44:49.698332Z","submitted_at":"2024-08-12T14:42:13Z","title":"Mutual Reasoning Makes Smaller LLMs Stronger Problem-Solvers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06195","snapshot_observed_at":"2026-08-11T14:02:49.106710Z","title":"L., Yang, F., Yang, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.106710Z"},"links":{"cited_paper":"/paper/2408.06195","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:ceb6c5bc31d47819cdc154c306e2da0e423c16bbae0ce4657cafe455b22c68e0","observation_id":"f41ec7c6-88b6-4558-90ca-20026eee4a77","resolution":{"observed_at":"2026-08-11T14:02:49.106710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14283","last_updated":"2024-07-22T10:01:49Z","snapshot_observed_at":"2026-08-11T07:47:30.964824Z","submitted_at":"2024-06-20T13:08:09Z","title":"Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14283","snapshot_observed_at":"2026-08-11T14:02:49.111008Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.111008Z"},"links":{"cited_paper":"/paper/2406.14283","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:f7da5d6127b4c9177b07741e8529f6f1fbc03fc2a03f4421341086b1d23b6d59","observation_id":"01f808d6-80d3-43a4-a3c7-ebdc88bae46e","resolution":{"observed_at":"2026-08-11T14:02:49.111008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05449","last_updated":"2024-07-18T04:44:25Z","snapshot_observed_at":"2026-08-03T15:25:31.152922Z","submitted_at":"2024-04-08T12:31:23Z","title":"RoT: Enhancing Large Language Models with Reflection on Search Trees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05449","snapshot_observed_at":"2026-08-11T14:02:49.114922Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.114922Z"},"links":{"cited_paper":"/paper/2404.05449","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:1f27e2ab5258a81c09dd96c6c3849828a57643c5fbf2d9ed0a859ae6843b1efb","observation_id":"6b103385-4db8-455e-b481-c2aa4baab246","resolution":{"observed_at":"2026-08-11T14:02:49.114922Z","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-11T14:02:49.524985Z","title":null,"venue":null,"work_id":"ab42583e-3ebf-468d-bd9e-9d50999dc16a","year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.118853Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:157f50faa089e54ca5eb21c6ebbe0bc5ba47ae3cc1a52621b1057f4dae219031","observation_id":"a7f0c287-de79-44a2-8e54-1aab522b5804","resolution":{"observed_at":"2026-08-11T14:02:49.528673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03733","last_updated":"2024-10-18T23:53:07Z","snapshot_observed_at":"2026-07-06T19:11:09.921186Z","submitted_at":"2024-09-05T17:44:49Z","title":"Planning In Natural Language Improves LLM Search For Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.03733","snapshot_observed_at":"2026-08-11T14:02:49.122083Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.122083Z"},"links":{"cited_paper":"/paper/2409.03733","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:736c8139de4a010881c5d76ff21f740499db1b7573361851310e1fb7ab1ed5b8","observation_id":"727de6bb-f086-46e3-bada-a927fe679d04","resolution":{"observed_at":"2026-08-11T14:02:49.122083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01815","last_updated":"2017-12-05T18:45:38Z","snapshot_observed_at":"2026-08-02T00:39:04.960144Z","submitted_at":"2017-12-05T18:45:38Z","title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01815","snapshot_observed_at":"2026-08-11T14:02:49.125617Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.125617Z"},"links":{"cited_paper":"/paper/1712.01815","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:4a324bd17404de655f14deda6fa2d1855f564da6369b7ef3bb73386524033eb1","observation_id":"7dcbdc2d-a295-438d-ad05-1702f5c610a1","resolution":{"observed_at":"2026-08-11T14:02:49.125617Z","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-11T14:02:49.511763Z","title":"J., Guez, A., Sifre, L., Van Den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al","venue":null,"work_id":"b02ac085-8fbf-4380-9778-66b03b1c81ea","year":2016},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.129177Z"},"links":{"citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:18385d85464ac6f165225a718ff0db9ba951730d769e5eac2ca979ac2c0b6076","observation_id":"b37dd8a9-307f-4f24-be64-53af32354db0","resolution":{"observed_at":"2026-08-11T14:02:49.516842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-10T03:07:35.408836Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-11T14:02:49.132747Z","title":"H., Gu, A., Li, W.-D., Yan, F., Zhang, T., Wang, S., Solar-Lezama, A., Sen, K., Stoica, I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.132747Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:6e7b8ac51a8632e73c4f3be9fcba9c995c06d8fdabdf3072f064ecb917ec45b6","observation_id":"f42dcbdf-0388-49bd-a5a7-14853d61b7a5","resolution":{"observed_at":"2026-08-11T14:02:49.132747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11366","last_updated":"2023-10-10T05:21:45Z","snapshot_observed_at":"2026-08-10T17:44:16.302071Z","submitted_at":"2023-03-20T18:08:50Z","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11366","snapshot_observed_at":"2026-08-11T14:02:49.136412Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T14:02:49.136412Z"},"links":{"cited_paper":"/paper/2303.11366","citing_paper":"/paper/2412.12544"},"observation_digest":"sha256:5af8b176bbf001ff8f27b0e9409ec61cae28024178b0dce6775ecbac8ed4936f","observation_id":"85d4573e-c06a-4442-9b5a-4d9f38ae1723","resolution":{"observed_at":"2026-08-11T14:02:49.136412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.12544","last_updated":"2024-12-28T02:30:02Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-11T13:56:28.774062Z","submitted_at":"2024-12-17T05:10:21Z","title":"Seed-CTS: Unleashing the Power of Tree Search for Superior Performance in Competitive Coding Tasks"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":36},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 1 inbound Pith citation observation for arXiv:2412.12544."}