{"as_of":"2026-08-06T04:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:880ab298136e3f69f49be4c898a7df1337cc0b1b35cf75f7fa5d41acce843687","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T15:39:56.255871Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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-25T05:22:08.579832Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-25T05:25:23.754981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"cited_work":{"arxiv_id":"2605.15513","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.15513","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","venue":"cs.AI","work_id":"bfd1a1d2-6b14-4c13-aba3-49e35d8f4165","year":2026},"citing_paper":{"arxiv_id":"2605.23074","last_updated":"2026-05-21T22:13:20Z","snapshot_observed_at":"2026-07-06T23:33:19.375527Z","submitted_at":"2026-05-21T22:13:20Z","title":"PathCal: State-Aware Reflection-Marker Calibration for Efficient Reasoning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-25T05:22:08.579832Z"},"links":{"cited_paper":"/paper/2605.15513","citing_paper":"/paper/2605.23074"},"observation_digest":"sha256:2c244dcda6c6b56214f5a7a903aadd052ba8082d6d235592c9124c78d64b072f","observation_id":"cdb90d30-a46f-4d18-adfe-a14eb2094a58","resolution":{"observed_at":"2026-05-25T05:25:23.758338Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.15513/citation-record","integrity":"/paper/2605.15513/integrity","json":"/paper/2605.15513/citation-record.json","paper":"/paper/2605.15513"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.10925","last_updated":"2025-08-08T19:24:38Z","snapshot_observed_at":"2026-08-01T16:27:35.664983Z","submitted_at":"2025-08-08T19:24:38Z","title":"gpt-oss-120b & gpt-oss-20b Model Card","version":1},"cited_work":{"arxiv_id":"2508.10925","doi":"10.3115/1073083.1073135","metadata_source":"pith","pith_arxiv_id":"2508.10925","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"gpt-oss-120b & gpt-oss-20b Model Card","venue":"cs.CL","work_id":"178c1f7e-4f19-4392-a45d-45a6dfa88ead","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2508.10925","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:ad8cda7d9e5e0c7e2e72a02682409c76942f764f3f08119bae95c5c227b01ef6","observation_id":"1eb71c8a-7d52-4250-8277-abe382d24153","resolution":{"observed_at":"2026-05-19T15:42:38.341519Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:19:47.962081+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:19:47.962081+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23281","last_updated":"2026-01-14T21:39:58Z","snapshot_observed_at":"2026-08-02T10:05:44.330694Z","submitted_at":"2025-05-29T09:28:06Z","title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","version":3},"cited_work":{"arxiv_id":"2505.23281","doi":"10.48550/arxiv.2505.23281","metadata_source":"pith","pith_arxiv_id":"2505.23281","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","venue":"cs.AI","work_id":"61e8d872-ccc7-46b8-8ec1-94008704c941","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2505.23281","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:04354dd581bd1a973a2b5883d31cedae5dbf346c4f23529ad073e10a73145969","observation_id":"96ee4303-fd23-44f6-9695-1aee14042484","resolution":{"observed_at":"2026-05-19T15:42:38.415297Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:19:19.286508+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:19:19.286508+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":"2407.21787","doi":"10.48550/arxiv.2407.21787","metadata_source":"pith","pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","venue":"cs.LG","work_id":"b124064d-5a56-42ad-86f5-3cc349b86a3a","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:23953422c123cf2b3b5a5353e6c3c406cce9984d734ed6da880a0cbcae6d59c3","observation_id":"4eeb0a46-cbde-4f77-99dd-cbf06aae68a2","resolution":{"observed_at":"2026-05-19T15:42:38.368488Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T02:20:41.492703+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T02:20:41.492703+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":"2107.03374","doi":"10.48550/arxiv.2107.03374","metadata_source":"pith","pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating Large Language Models Trained on Code","venue":"cs.LG","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":2021},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:5033864c321e6d1c24297c61668dbc59426d7bbebe71ef69450eac971533d472","observation_id":"3f75f0cf-f310-4c48-b544-16faeaa51c4e","resolution":{"observed_at":"2026-05-19T15:42:38.392239Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17311","last_updated":"2023-11-29T02:07:09Z","snapshot_observed_at":"2026-07-06T16:54:10.590804Z","submitted_at":"2023-11-29T02:07:09Z","title":"Universal Self-Consistency for Large Language Model Generation","version":1},"cited_work":{"arxiv_id":"2311.17311","doi":"10.48550/arxiv.2311.17311","metadata_source":"pith","pith_arxiv_id":"2311.17311","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Transactions on Intelligent Systems and Technology, 15(3)","venue":"cs.CL","work_id":"9d1484c2-6ca2-4421-8b90-995b3adbc93c","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2311.17311","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:63beb473bc445f1b7cc330a2128726b79b7d0ae5538e9216188bca84ecb812c7","observation_id":"4c805022-4e65-40c5-ad22-6a935ee52b59","resolution":{"observed_at":"2026-05-19T15:42:38.382324Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-23T16:25:44.09333+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T16:25:44.09333+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2412.15287","doi":"10.48550/arxiv.2412.15287","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Inference-aware fine-tuning for best-of-n sampling in large language models","venue":"arXiv (Cornell University)","work_id":"827ca722-7f31-4433-8fa9-e3b1596372cb","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:2b23670fde419a8d1743429ba833d3b4d85b333f3d0b8dde6484275332fb9f90","observation_id":"2ffad926-8692-4999-8ea9-0080d1242d02","resolution":{"observed_at":"2026-05-19T15:42:38.337992Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-04T15:46:25.710484Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":"2110.14168","doi":"10.1002/j.1545-","metadata_source":"pith","pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Verifiers to Solve Math Word Problems","venue":"cs.LG","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:28cc6ebda09e45a2d4c17115701f23df24fe710ee58de0db13b4c25731d083fa","observation_id":"9fa375d0-4260-40dd-89f4-aa3194515f00","resolution":{"observed_at":"2026-05-19T15:42:38.418741Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"On the ranking of a swiss system chess team tournament.Annals of Operations Research, 254(1):17–36","venue":null,"work_id":"380cfb30-7343-48c8-a018-f26f699785f2","year":2017},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:54172fb3a99e6f608cd3c0ee67ee49228fd5f02d4429432904447184990542f9","observation_id":"f4b882d6-c714-4437-82b9-84c226f216d9","resolution":{"observed_at":"2026-05-19T15:43:07.552985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17211","last_updated":"2025-04-20T19:49:45Z","snapshot_observed_at":"2026-07-06T20:56:44.975733Z","submitted_at":"2025-03-21T15:20:28Z","title":"A Language Anchor-Guided Method for Robust Noisy Domain Generalization","version":2},"cited_work":{"arxiv_id":"2503.17211","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.17211","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A language anchor-guided method for robust noisy domain generalization","venue":null,"work_id":"14df36d8-a0f8-4239-8fb8-fe9f19dd86e0","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2503.17211","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:5050ab42a610ccc131a90668fd4fab42993bdd4b092af0fe1bf8ae2f1767e331","observation_id":"ee8418cd-4f8e-4634-bf8c-ff5e6dc5716f","resolution":{"observed_at":"2026-05-19T15:42:38.425943Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Round robin classification.Journal of Machine Learning Research, 2(Mar):721–747","venue":null,"work_id":"713801f5-8f24-4069-94b4-0373e0d523eb","year":2002},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:32dfe5ff10af6b5c4cfd3013a8ae967ecce8754b0d3e88bcfa2d56d85d227fe6","observation_id":"86432e77-df7a-46a8-a997-8f3a71195491","resolution":{"observed_at":"2026-05-19T15:42:39.825242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-08T09:34:48.453851Z","title":"Large language models can self-improve","venue":null,"work_id":"fa198dcd-a398-4e3c-b517-b6c07473ba09","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:7449c0f6dcb4a9ddd798b05dc40a1ed441430c86853b8d3db6f45550b9897ffe","observation_id":"a99cbff5-7058-49ac-9e78-6de0b4d37827","resolution":{"observed_at":"2026-05-19T15:42:39.827533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Mm algorithms for generalized bradley-terry models.The annals of statistics, 32(1):384–406","venue":null,"work_id":"b58754ea-ef79-4613-94d7-0070588002bf","year":2004},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:148138c71b15649d742ea174e601b75a1b989725c899929f8cc8e6fd712bced6","observation_id":"5f7166cb-13c1-40e7-b801-f540974aebfb","resolution":{"observed_at":"2026-05-19T15:42:39.829865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":"2412.16720","doi":"10.48550/arxiv.2412.16720","metadata_source":"pith","pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"OpenAI o1 System Card","venue":"cs.AI","work_id":"68d3c334-0fc9-49e3-b7b0-a69afae933e2","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:bd35a0fcf75f4d61098a1ae71747dbf1a5ca5cbd7d48669136ffd3bbc5c9f31d","observation_id":"0f5efef9-90eb-46b1-a8dc-d0174a59273a","resolution":{"observed_at":"2026-05-19T15:42:38.371593Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-06T02:11:23.670680Z","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":"2403.07974","doi":"10.1109/icsme52107.2021.00025","metadata_source":"pith","pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","venue":"cs.SE","work_id":"ea9e51ce-1e75-4182-92d8-4d25f70d2ee4","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:faceffeaefbb4248876b2a6627a445cd11844e4b27dc5a6bca6d488b715e85d2","observation_id":"154fc566-c4c3-4777-b169-6d25b332f2c9","resolution":{"observed_at":"2026-05-19T15:42:38.345374Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01575","last_updated":"2026-04-22T04:43:19Z","snapshot_observed_at":"2026-08-03T00:15:02.300580Z","submitted_at":"2025-08-03T04:03:13Z","title":"KANMixer: a minimal KAN-centered mixer for long-term time series forecasting","version":2},"cited_work":{"arxiv_id":"2508.01575","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.01575","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"KANMixer: a minimal KAN-centered mixer for long-term time series forecasting","venue":"cs.LG","work_id":"8b75712d-5246-4bc1-9ec8-91c8a866cad7","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2508.01575","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:f120939b2dff8cec938b851cb2aa5f046184404453a24450b51c444fe3dd8337","observation_id":"e32921b6-e66c-47a4-84ec-29ba20ccd1af","resolution":{"observed_at":"2026-05-19T15:42:38.334039Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.18539","last_updated":"2026-04-23T05:21:00Z","snapshot_observed_at":"2026-08-01T01:15:05.827466Z","submitted_at":"2025-11-23T17:10:07Z","title":"TimePre: Bridging Accuracy, Efficiency, and Stability in Probabilistic Time-Series Forecasting","version":2},"cited_work":{"arxiv_id":"2511.18539","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.18539","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"TimePre: Bridging Accuracy, Efficiency, and Stability in Probabilistic Time-Series Forecasting","venue":"cs.LG","work_id":"6d660278-9732-41f4-936e-28a1a8eff99d","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2511.18539","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:ee4a71b5ab022d43eeb6fc3577bb5553fdc1c9b460c6ece83888cea29c4f375e","observation_id":"ecdd23a2-9614-4b16-ade9-09a473db7d90","resolution":{"observed_at":"2026-05-19T15:42:38.329816Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-08T17:35:10.030675Z","title":"Large language models are zero-shot reasoners.Advances in neural information processing systems, 35:22199–22213","venue":null,"work_id":"4e01a1de-c54d-4105-8a25-d2d9c98bbc5a","year":2022},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:9919096ef5c303871c638f6a28424e0818b1af8706d6595cfced32c860650c5a","observation_id":"8e17066c-d579-4776-b504-0c096efc8139","resolution":{"observed_at":"2026-05-19T15:42:39.819575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-06T09:02:13.068592Z","title":"Efficient memory management for large language model serving with pagedattention","venue":null,"work_id":"55d06a5a-70ca-433f-966a-21dd9d276d2b","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:4735156516d550df0c1b615fedc16fc620a6d81fa59e1a13aa3a72b29e0a3ef1","observation_id":"300e6dc6-08ea-4bee-93c0-592638b76711","resolution":{"observed_at":"2026-05-19T15:42:39.822464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.29045","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Let the abyss stare back adaptive falsification for autonomous scientific discovery","venue":null,"work_id":"cb273039-9b42-413d-a215-e6d89f5f9495","year":2026},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:d8a8f479802a0bcd8b24f5b9e41fc867c1b33f46b8e98b4e865816f2d87562cf","observation_id":"2aeeb558-1555-4111-862b-1d1998f66a4a","resolution":{"observed_at":"2026-05-19T15:42:38.395360Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.16993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bibagent: An agentic framework for traceable miscitation detection in scientific literature","venue":null,"work_id":"9685241c-795d-42d8-b2e3-a5a0311fedbf","year":2026},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:f0a2377c9a87e54bf50e89cdbf83012ec2d75dafa1ff025e240f91edf31cfe93","observation_id":"75d33f02-9ac2-4b1b-81b0-51126c487371","resolution":{"observed_at":"2026-05-19T15:42:38.348938Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.05517","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Traversal-as-policy: Log-distilled gated behavior trees as externalized, verifiable policies for safe, robust, and efficient agents","venue":null,"work_id":"755856d4-83b2-4e8c-8c30-c0d85b6deee0","year":2026},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:6568df80ceb55fd113b4b74c7bba6c4174ec42292c257897b6810c25485d75bb","observation_id":"032fd534-c96a-46b3-8454-b9b722a6b2af","resolution":{"observed_at":"2026-05-19T15:42:38.430391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Competition-level code generation with alphacode.Science, 378(6624):1092–1097","venue":null,"work_id":"bec1f55b-a9cb-4aa6-bcad-cc59083b9ba6","year":2022},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:348c98a6f2822401cec3197cb2381e9f3d2bb57e0d6f27c4dbaf2f0d03a9550b","observation_id":"4ef1db73-0fea-4ce4-bf67-6909d44640e4","resolution":{"observed_at":"2026-05-19T15:43:07.560350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-09T22:26:37.560761Z","title":"Let’s verify step by step","venue":null,"work_id":"1e1d0751-e17d-4e3e-aa61-95245c4f49c8","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:3b5dcd5702fae7b36959bfc861721f15393cc128890afe3616befdfdd86ff574","observation_id":"4a6bf2a5-b63c-45d5-90bd-5e64d7887a74","resolution":{"observed_at":"2026-05-19T15:43:07.545650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.00854","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Position: Human-centric ai requires a minimum viable level of human understanding","venue":null,"work_id":"81f5cfa1-f168-4be1-9943-20cb51a2a7ac","year":2026},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:5eb1d3ace6380c7bf9b870cdff25ed330be094d5bf61d818fd6663ea1bdf708a","observation_id":"d87ee676-81a1-4843-bffe-1e1384e6fdbe","resolution":{"observed_at":"2026-05-19T15:42:38.375201Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03925","last_updated":"2026-04-05T01:35:50Z","snapshot_observed_at":"2026-07-13T11:59:06.496284Z","submitted_at":"2026-04-05T01:35:50Z","title":"AdaptFuse: Training-Free Sequential Preference Learning via Externalized Bayesian Inference","version":1},"cited_work":{"arxiv_id":"2604.03925","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.03925","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"AdaptFuse: Training-Free Sequential Preference Learning via Externalized Bayesian Inference","venue":"cs.CL","work_id":"a9e6c1e8-de0d-4df3-9e98-d632da1bac2d","year":2026},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2604.03925","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:a112bead53036e63427df76ae65bbf4ddf5af057d1afce5532a72907b6e0cd94","observation_id":"bf4b793b-175b-4eb2-8b28-442b76cf5648","resolution":{"observed_at":"2026-05-19T15:42:38.378288Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Pairwise rm: Perform best-of-n sampling with knockout tournament.arXiv e-prints, pages arXiv–2501","venue":null,"work_id":"1875ee4d-3503-4b31-ba62-721ab0f33229","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:35a30d36486dedf120f75f5565471c6a047f81bee7fb78d7672a6cc08309f637","observation_id":"aea55a23-5241-4602-b0fc-8f8e644cc3a6","resolution":{"observed_at":"2026-05-19T15:43:07.534219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-05T07:00:49.874298Z","title":"Self-refine: Iterative refinement with self-feedback.Advances in neural information processing systems, 36:46534–46594","venue":null,"work_id":"afd94357-8ff7-4466-b128-67d9e0c18b93","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:f43825589263b886bf388b9b303abc8231848738d21a43c6e19533484971ecb2","observation_id":"f4170a36-c4fa-4d42-b30f-a16d22cc42aa","resolution":{"observed_at":"2026-05-19T15:43:07.550281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.01123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T01:06:25.081278Z","title":"Rethinking thinking tokens: Llms as improvement operators","venue":null,"work_id":"08b4ab68-efe5-41d3-9b7b-d0fa9f9e551f","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:0634c97f23ec155417d7c71b17de60b2e6ee9d24ef85a0659b53e9495d2bbdf5","observation_id":"6b65c137-4863-40b7-b9bf-572cae8a9c62","resolution":{"observed_at":"2026-05-19T15:42:38.422525Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15466","last_updated":"2025-08-17T18:23:42Z","snapshot_observed_at":"2026-08-01T19:32:09.217382Z","submitted_at":"2025-04-21T22:29:02Z","title":"Learning Adaptive Parallel Reasoning with Language Models","version":2},"cited_work":{"arxiv_id":"2504.15466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.15466","snapshot_observed_at":"2026-07-04T06:29:38.199469Z","title":"Learning adaptive parallel reasoning with language models","venue":null,"work_id":"ad598725-b9f6-4cff-9608-69d7db174183","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2504.15466","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:ac37bca234efc6e682fe0d507e7796e76476e1b22d706d2706a99dd3fbbe27d5","observation_id":"f2cfce90-932c-4a10-b0c4-b9e8114656d6","resolution":{"observed_at":"2026-05-19T15:42:38.398701Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Plum: Prompt learning using metaheuristics","venue":null,"work_id":"9fd9089b-14ff-4c6d-8732-708547ff4d26","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:7314d3e2b9e70ef59b4a0542c9bb32646cecc138a5c63ba14e3952851627b776","observation_id":"694c9af6-bf8e-4b7b-8660-faa362e31ad5","resolution":{"observed_at":"2026-05-19T15:43:07.537982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Llm evaluators recognize and favor their own generations.Advances in Neural Information Processing Systems, 37:68772–68802","venue":null,"work_id":"df567434-4e14-483d-a781-e2f414348532","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:4942d8f619b06129b09f918043ab3acd7d66d90a4138dd7205367dff86ff75fa","observation_id":"e125b2d2-f407-4243-97bf-ab7108c38be8","resolution":{"observed_at":"2026-05-19T15:43:07.557588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Recursive introspection: Teaching language model agents how to self-improve.Advances in Neural Information Processing Systems, 37:55249–55285","venue":null,"work_id":"b490242a-ebae-4db4-8929-fc1d16c4cb14","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:8b030480e05de4bbcde1e4b7703d7b4bce231d842ea19c7f3e3f3cfa6b60658f","observation_id":"103f9fc4-1b25-4e65-b479-aa23688e752d","resolution":{"observed_at":"2026-05-19T15:42:39.878468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12118","last_updated":"2025-02-18T18:54:12Z","snapshot_observed_at":"2026-08-03T17:17:48.809885Z","submitted_at":"2025-02-17T18:43:24Z","title":"Scaling Test-Time Compute Without Verification or RL is Suboptimal","version":2},"cited_work":{"arxiv_id":"2502.12118","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12118","snapshot_observed_at":"2026-07-03T20:38:56.081466Z","title":"Scalingtest-timecomputewithout verification or rl is suboptimal","venue":null,"work_id":"f01d383c-eb52-4fe5-8e17-9f763cf82d39","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2502.12118","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:344cbb1a27eb9ef1f68bbce829f7e5a62fac75a335e2037d35251df1da00c97e","observation_id":"deee3ea0-b457-41b0-a510-eddef6dc0fa7","resolution":{"observed_at":"2026-05-19T15:42:38.364806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Efficient fair queuing using deficit round-robin","venue":null,"work_id":"2629fc4a-c16f-42fe-aa1c-bde60b3632a8","year":1996},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:0c3a87a14f825428b64a06777c583df0a2cfabeb7fad5a40a60294ec10be333a","observation_id":"651544c4-ca88-4f76-88e1-be8513094a7f","resolution":{"observed_at":"2026-05-19T15:42:39.881113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.04304","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T12:53:50.245781Z","title":"v 1: Unifying generation and self-verification for parallel reasoners.arXiv preprint arXiv:2603.04304, 2026a","venue":null,"work_id":"7bbcc938-b7ac-4ba5-83f9-e8f0a7be8bb3","year":2026},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:a44d59d565f38035aa7029762b32a6911b25765f53ae1c25cbbb9d7675772049","observation_id":"6eaa6886-03bf-4cb9-b5b8-c15c2ca2908c","resolution":{"observed_at":"2026-05-19T15:42:38.357344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":"2408.03314","doi":"10.18653/v1/2025.acl-long.1486","metadata_source":"pith","pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","venue":"cs.LG","work_id":"a8d50b24-bdf5-46ed-bc4f-2927dfd81f1d","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:77678b217245a43d20645c11851fc8bccc6bed4adc1fc1f73405077608b28512","observation_id":"289f6a6f-d337-4fc4-8ea0-96fd883701ec","resolution":{"observed_at":"2026-05-19T15:42:38.407525Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-07T18:04:01.366465Z","title":"Scaling llm test-time compute optimally can be more effective than scaling parameters for reasoning","venue":null,"work_id":"61688fd4-0ab0-4753-9921-d4d8956d032a","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:677c5dcc0f29b2a05217b840f4b581a972ee22d6f512d42ef3cf2b12195c1038","observation_id":"1493670d-30ec-415b-a9a7-5357677bc7d7","resolution":{"observed_at":"2026-05-19T15:42:39.873770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08115","last_updated":"2024-08-03T21:25:31Z","snapshot_observed_at":"2026-08-03T17:28:12.454636Z","submitted_at":"2024-02-12T23:11:01Z","title":"On the Self-Verification Limitations of Large Language Models on Reasoning and Planning Tasks","version":2},"cited_work":{"arxiv_id":"2402.08115","doi":"10.48550/arxiv.2402.08115","metadata_source":"pith","pith_arxiv_id":"2402.08115","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the self-verification limitations of large language models on reasoning and planning tasks","venue":"cs.AI","work_id":"0e539fa7-dc00-479f-bafa-8bda539f2f5d","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2402.08115","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:1e9346672fbc0760c94bbcd2893b7241dbedf0c253611a5c60baa185444a62d1","observation_id":"1399ebdf-195a-4e6b-ab93-4042b552bfd4","resolution":{"observed_at":"2026-05-19T15:42:38.402487Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"The efficacy of tournament designs.Computers & Operations Research, 144:105821","venue":null,"work_id":"8aa8f668-1d26-4399-81ef-a532194f4d9b","year":2022},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:fcb01d2e7cb5463216f6062a03cd349e4331e362fe9d296c9c92549b2b07a2e4","observation_id":"e98b908a-50c5-496a-951d-1c9a00dbbf4d","resolution":{"observed_at":"2026-05-19T15:42:39.876099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-07T18:04:01.349057Z","title":"Confidence improves self-consistency in llms","venue":null,"work_id":"3ac0e6fb-a0e9-4c9e-b1cb-84a766eb1233","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:786fe0c478e40ab03ea53917e30b18a422f27e6cf75d40b16a6ee1fbcafb6dac","observation_id":"347f7aa4-c6aa-4cce-8228-39a3749dfb2f","resolution":{"observed_at":"2026-05-19T15:43:07.557255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"On the use of random set theory to bracket the results of monte carlo simulations","venue":null,"work_id":"5206a12c-6b46-4cf8-86d1-99370d27bc2f","year":2004},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:62f689c72e6ac287ca620de8670d2a8a4c71ef4d7ab0e7ebe1183ed5cefe8d28","observation_id":"3432ccdc-4713-4a6e-98ff-e6f5d9f3b323","resolution":{"observed_at":"2026-05-19T15:43:07.560918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.26626","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T18:40:03.218392Z","title":"Re- cursive self-aggregation unlocks deep thinking in large language models","venue":null,"work_id":"5123bb2d-e37e-459d-a784-23fdd36e2dec","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:03af392b4abf8fbea5eff1f8392dca0e3565294333da27d5fef2ae501f488de9","observation_id":"36b5875c-5f39-4192-8ee4-99c172f0f72f","resolution":{"observed_at":"2026-05-19T15:42:38.353346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Make every penny count: Difficulty-adaptive self-consistency for cost-efficient reasoning","venue":null,"work_id":"d439adc9-8957-40a8-9221-9ca71d8011ec","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:cc2211d1bd77284bc2c8620cdaa11d0e943d691e4842b0588dd6d8c675a13532","observation_id":"c437c75d-d445-4b78-835e-3e4720bff355","resolution":{"observed_at":"2026-05-19T15:42:39.868797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"2203.11171","doi":"10.1101/2025.04.03.646459","metadata_source":"pith","pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","venue":"cs.CL","work_id":"8c6d5a6b-b5cc-4105-9c84-9c34bb9375bb","year":2022},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:0b55674474be71e39d6af7287555eb358ea59c328341531bee5bfdaedbef7435","observation_id":"26385e8b-1693-4718-8671-3140b758cc8c","resolution":{"observed_at":"2026-05-19T15:42:38.389212Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-21T18:52:42.88633+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T18:52:42.88633+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f7ecbc43-a900-4857-8b24-66324a89724c","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:14156d667544676c3bfc348cfc4808071c83d5d0d32b8d96ba4c65c21b901551","observation_id":"7f6cb71a-6a0d-422f-b359-96ca8fd63673","resolution":{"observed_at":"2026-05-19T15:42:39.864867Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.12164","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on parallel reasoning","venue":null,"work_id":"2eed5e60-2e3e-4460-ab37-0e46a2cd58d5","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:7f2569499ad9acecf7b225c30854c7f48d42e7ddcf144c978c6af0f343d2ee10","observation_id":"990bad04-8580-4bec-a231-929e4518d6e8","resolution":{"observed_at":"2026-05-19T15:42:38.361092Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-10T02:06:42.595164Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"a3ac3b4d-8c58-4772-ad55-18e8fb162bd1","year":2022},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:6b73a685dc5f287d48589c0f2b9e11558e7e86bf2dc3258442bdba3eae8c2254","observation_id":"4694e64d-e672-431b-ba0f-5f397337bfd4","resolution":{"observed_at":"2026-05-19T15:42:39.858271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Large language models are better reasoners with self-verification","venue":null,"work_id":"ab92aeb1-d6ef-4259-977d-3c88448e343b","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:a8921b2c792ce4e292dcca9adfe0eb0031263e92b7c574cc7e0d2fe7dcea7236","observation_id":"46fcddee-092f-4f21-a6f2-438c2f6079bd","resolution":{"observed_at":"2026-05-19T15:42:39.860495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:5cd50077663c1977ef8b5f3f604d6f3981d4fef2a6be5b82b04faa55c19c0b01","observation_id":"97f1957b-79d9-49c5-b7f0-b4d169ac2ff1","resolution":{"observed_at":"2026-05-19T15:42:38.411088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Understanding hyperbolic metric learning through hard negative sampling","venue":null,"work_id":"28efe3e9-6172-4307-88a6-d2a6fcfffc82","year":1903},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:e4121d637b2b285d01726435a6f0f65fb7a39b51c5372bedc515667d102c0106","observation_id":"cac742cd-469c-47b2-a504-8205647d3b64","resolution":{"observed_at":"2026-05-19T15:42:39.855890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"334941b3-acdc-470e-96bb-d1ea19446e10","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:cb8187e4f87d0ce80ce40f9b450cf6593ce6ef1b03b658cd5c24fe127808977a","observation_id":"8a9186cd-9a8d-42a7-8e73-4ce853045742","resolution":{"observed_at":"2026-05-19T15:42:39.862778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Chain of preference optimization: Improving chain-of-thought reasoning in llms.Advances in Neural Information Processing Systems, 37:333–356","venue":null,"work_id":"75ff5d34-a607-4589-a342-13614d10b125","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:687fc1d8300bbcc4e013698b8f0acb13d5a44a83dd10e5624a8d2d69175d44a4","observation_id":"1f60f9de-6bc3-4f36-b67d-41c0d0755c84","resolution":{"observed_at":"2026-05-19T15:42:39.871217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-05T01:40:35.465462Z","title":"Chain of agents: Large language models collaborating on long-context tasks.Advances in Neural Information Processing Systems, 37:132208–132237","venue":null,"work_id":"b2cab323-96b6-4d5f-9233-9f62a768e60f","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:c46e9626a12624506a5913d0b248050d362e64cf16fb0325b620004618f8f717","observation_id":"7fa28a9d-7c3c-40da-b762-e9841fc629c7","resolution":{"observed_at":"2026-05-19T15:42:39.846417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Gps: A probabilistic distributional similarity with gumbel priors for set-to-set matching","venue":null,"work_id":"31342e14-d319-4c88-9e08-db12e465ccd0","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:5d55b329ea688adad79aaa233ce05bd0f452dd62f7d885bd3c3e8eedf4f106c1","observation_id":"75b67d5d-beea-4607-9a64-cb2efc107a7b","resolution":{"observed_at":"2026-05-19T15:42:39.843975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Deep loss convexification for learning iterative models.IEEE Transactions on Pattern Analysis and Machine Intelligence, 47(3):1501–1513","venue":null,"work_id":"0806e2de-ef2e-4e70-b6ed-fad2b6c632c3","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:c1cb3ec7684ce3e33f5c1e6963589c3d1a2675f2704461ac9c84cad4aec83ad3","observation_id":"3d47ab05-1e8f-451b-a8d3-fdf83c7f6485","resolution":{"observed_at":"2026-05-19T15:42:39.841677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.06870","last_updated":"2025-09-08T16:39:38Z","snapshot_observed_at":"2026-08-04T23:02:26.154530Z","submitted_at":"2025-09-08T16:39:38Z","title":"The Majority is not always right: RL training for solution aggregation","version":1},"cited_work":{"arxiv_id":"2509.06870","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.06870","snapshot_observed_at":"2026-07-04T20:40:08.281402Z","title":"The majority is not always right: Rl training for solution aggregation","venue":null,"work_id":"fff415c1-d63b-4ecc-868b-e956a6b87ed0","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"cited_paper":"/paper/2509.06870","citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:97534849932cf26f6a5ec3a7e3b6606c591544dfc48e85047278f5fcfbbab410","observation_id":"7732f651-d6c9-4533-94a3-a5e0a393515b","resolution":{"observed_at":"2026-05-19T15:42:38.386015Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-09T14:56:18.729506Z","title":"Judging llm-as-a-judge with mt-bench and chatbot arena.Advances in neural information processing systems, 36:46595–46623","venue":null,"work_id":"b509e457-b4ed-40f1-a7f4-893bc84cf1f1","year":2023},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:06f130aeca923649ba5a351654da4f1c3464dba84318eb3876ed31b27f434149","observation_id":"f8356305-ac91-4d80-88ff-7bcd25456e17","resolution":{"observed_at":"2026-05-19T15:42:39.849053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"A setwise approach for effective and highly efficient zero-shot ranking with large language models","venue":null,"work_id":"891bc54d-a459-4c55-80f5-5cc519e1fc9b","year":2024},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:520e1e747fe55c6b99b31c7da1e1b378099226bbe543947ea461a0ea7fd84a2e","observation_id":"e603ae6d-8eef-4e69-af48-65a8e3110ab1","resolution":{"observed_at":"2026-05-19T15:42:39.851441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7b3276f7-1a96-403a-8097-320eaeb605ef","year":null},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:a9156aabf56ecf14b7f9a6a9bb11b50c9ed17a10b768eddfff3c28d7a160c614","observation_id":"1d8753f3-6544-4a82-a04d-5bba90c54f01","resolution":{"observed_at":"2026-05-19T15:42:39.839081Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"26bb9cde-9088-4ff4-9955-35c7f5d51e97","year":null},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:2993c53d70dc5a3e7ad681d576e03455e9a1ffc06accb0a0c6177002e7fe2b3f","observation_id":"8806f012-7a32-4639-9cdb-bbb9cdb94568","resolution":{"observed_at":"2026-05-19T15:42:39.832007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0eb6c2ef-74bb-4477-a4f7-23f2d8f03d08","year":null},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:b399dc4970b3ff908978cabab1b138f00ff849d966c0e082fddb2fca8aa9e074","observation_id":"169c5629-a45f-4e1c-95bf-605e4d07efef","resolution":{"observed_at":"2026-05-19T15:42:39.834400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"af9d482d-4d6d-47bf-bdca-972a8b1b9b24","year":null},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:54565e789550cf5a44bbf8d5cbd1dc795a870cc29d6e9dd77bdf4386ed7b415e","observation_id":"853eb29d-7c30-44d9-83c4-2847ef54399c","resolution":{"observed_at":"2026-05-19T15:42:39.836922Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"21f83403-8e89-4374-aa59-7eaf430e5644","year":null},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:445200f6b3d8fe8217e81fdf8ba19c6534c245b9dead3c26c8146e9be64481e7","observation_id":"8b58fe8e-0066-47b5-8a33-295dd0b5db13","resolution":{"observed_at":"2026-05-19T15:42:39.853641Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1d82d279-566e-443d-b8c7-b2086a113b37","year":null},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:0f24ae4614a1aeeba8a1870e85d560ed50414f39345c4b206fe220223f484244","observation_id":"178254bf-73e8-4951-93bf-be5c514b5308","resolution":{"observed_at":"2026-05-19T15:42:39.866780Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1da19f65-7292-4ace-9092-6878eef0c5e7","year":2025},"citing_paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-19T15:39:56.255871Z"},"links":{"citing_paper":"/paper/2605.15513"},"observation_digest":"sha256:7c2cba4754f6b4d43806437b79276d630a6433548b091e046e60c95c416fbe9d","observation_id":"fb0d82a8-3545-42fb-8e7a-0d07b9628736","resolution":{"observed_at":"2026-05-19T15:43:07.540558Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.15513","last_updated":"2026-05-15T01:16:12Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-01T17:14:08.866403Z","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":9,"verified_exact":27,"verified_fuzzy":28},"total_outbound_references":65},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 1 inbound Pith citation observation for arXiv:2605.15513."}