{"as_of":"2026-08-15T04:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52842da48266d1b498d974ead6e1db28db890a72b6ae7cf19bd87da0fa7d36c1","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:51:26.594720Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T06:20:16.941026Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T06:20:58.254035Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"cited_work":{"arxiv_id":"2507.17797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.17797","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed H","venue":null,"work_id":"1214a301-ea5a-4213-be65-6d7f00a54d60","year":null},"citing_paper":{"arxiv_id":"2510.14232","last_updated":"2026-04-14T23:27:33Z","snapshot_observed_at":"2026-08-13T18:09:06.571988Z","submitted_at":"2025-10-16T02:19:25Z","title":"Scaling Test-Time Compute to Achieve IOI Gold Medal with Open-Weight Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T06:20:16.941026Z"},"links":{"cited_paper":"/paper/2507.17797","citing_paper":"/paper/2510.14232"},"observation_digest":"sha256:30146551aaebe0fcaca0e208c4d64d3f72c44d526dd4ba5d106cd3d40fbe2d7d","observation_id":"a92556f3-b0fe-46c3-ad62-edeaba6cecb8","resolution":{"observed_at":"2026-05-18T06:20:58.256592Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"cited_work":{"arxiv_id":"2507.17797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.17797","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed H","venue":null,"work_id":"1214a301-ea5a-4213-be65-6d7f00a54d60","year":null},"citing_paper":{"arxiv_id":"2605.01194","last_updated":"2026-05-02T02:13:11Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T02:13:11Z","title":"VLA-ATTC: Adaptive Test-Time Compute for VLA Models with Relative Action Critic Model","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-09T15:10:16.533927Z"},"links":{"cited_paper":"/paper/2507.17797","citing_paper":"/paper/2605.01194"},"observation_digest":"sha256:7e4073f5315ed07ded82b8d47343130f067a39e7c1d7f3c693fedd83ac462fad","observation_id":"791dec5f-00a1-4ba9-9350-32848c0e55cd","resolution":{"observed_at":"2026-05-11T16:46:06.336042Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.17797/citation-record","integrity":"/paper/2507.17797/integrity","json":"/paper/2507.17797/citation-record.json","paper":"/paper/2507.17797"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-13T15:58:13.809876Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-06T14:51:26.522290Z","title":"Guo, J., Chi, Z., Dong, L., Dong, Q., Wu, X., Huang, S., and Wei, F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.522290Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:aed52f957012d0ad779b629ed9e84e967e91c32d63017070a3efb37cd8253bb4","observation_id":"5c1b8058-fc4e-4285-87fa-215bd6c98e2a","resolution":{"observed_at":"2026-08-06T14:51:26.522290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14674","last_updated":"2025-05-20T17:58:03Z","snapshot_observed_at":"2026-08-14T12:09:02.921463Z","submitted_at":"2025-05-20T17:58:03Z","title":"Reward Reasoning Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14674","snapshot_observed_at":"2026-08-06T14:51:26.527647Z","title":"Hassid, M., Synnaeve, G., Adi, Y ., and Schwartz, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.527647Z"},"links":{"cited_paper":"/paper/2505.14674","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:ff38b50e2fa627e159e3e85366cad30c41b3746c6e4f0f7b84f95bbe4e685b12","observation_id":"a2818eef-f5ce-4311-b868-782e9556d367","resolution":{"observed_at":"2026-08-06T14:51:26.527647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:51:26.537150Z","title":"Jiang, D., Ren, X., and Lin, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.537150Z"},"links":{"citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:373072e629e157a42430565dea173be72001a8d8a347936deff9ba529c71da14","observation_id":"8d773f8f-2a6d-4243-bf97-eb763321e385","resolution":{"observed_at":"2026-08-06T14:51:26.537150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12832","last_updated":"2024-10-02T17:58:39Z","snapshot_observed_at":"2026-08-12T22:32:17.121578Z","submitted_at":"2024-10-02T17:58:39Z","title":"Generative Reward Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12832","snapshot_observed_at":"2026-08-06T14:51:26.563079Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.563079Z"},"links":{"cited_paper":"/paper/2410.12832","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:3cbc8ad008afbd142c4a072366ffb73cec727723a98b27c392c3f19a460c199f","observation_id":"4e91a6d9-ecb2-4e7c-8340-904dadebe7c5","resolution":{"observed_at":"2026-08-06T14:51:26.563079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-06T14:51:26.571542Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.571542Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:b6f523fc10e7b096cd13937076284313c7afa42069b2d7ce11e908652c39b44a","observation_id":"394c8192-cda7-4406-b260-68e0f310c6a6","resolution":{"observed_at":"2026-08-06T14:51:26.571542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10337","last_updated":"2025-04-16T14:58:26Z","snapshot_observed_at":"2026-08-07T16:05:50.114818Z","submitted_at":"2025-04-14T15:46:33Z","title":"Heimdall: test-time scaling on the generative verification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10337","snapshot_observed_at":"2026-08-06T14:51:26.576723Z","title":"org/abs/2504.10337","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.576723Z"},"links":{"cited_paper":"/paper/2504.10337","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:49b2e1dd2a2fbc398585b2d81c4b29cfb4bfccad87cdbd431cb9aa3cedf7e5bc","observation_id":"d62aeb44-c678-4170-9ecc-cb8cc39f8524","resolution":{"observed_at":"2026-08-06T14:51:26.576723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00724","last_updated":"2025-03-03T07:53:32Z","snapshot_observed_at":"2026-08-13T03:06:10.986532Z","submitted_at":"2024-08-01T17:16:04Z","title":"Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00724","snapshot_observed_at":"2026-08-06T14:51:26.583183Z","title":"Yang, A., Zhang, B., Hui, B., Gao, B., Yu, B., Li, C., Liu, D., Tu, J., Zhou, J., Lin, J., Lu, K., Xue, M., Lin, R., Liu, T., Ren, X., and Zhang, Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.583183Z"},"links":{"cited_paper":"/paper/2408.00724","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:81fae1e8622228406646ffddb1438ec09141173bd59751413351d9583cd836dc","observation_id":"191e0959-1609-4868-986e-3520c0c6e27d","resolution":{"observed_at":"2026-08-06T14:51:26.583183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12122","last_updated":"2024-09-18T16:45:37Z","snapshot_observed_at":"2026-08-14T16:00:41.902820Z","submitted_at":"2024-09-18T16:45:37Z","title":"Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12122","snapshot_observed_at":"2026-08-06T14:51:26.588375Z","title":"Zhang, L., Hosseini, A., Bansal, H., Kazemi, M., Kumar, A., and Agarwal, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.588375Z"},"links":{"cited_paper":"/paper/2409.12122","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:e80c8a28d1113cf8cf908fc20504f4ef625874ee642a8180b992c802c52530e6","observation_id":"95fe9ea6-4c03-438d-859d-819add20418f","resolution":{"observed_at":"2026-08-06T14:51:26.588375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01839","last_updated":"2025-02-20T18:52:18Z","snapshot_observed_at":"2026-08-09T14:15:28.910131Z","submitted_at":"2025-02-03T21:31:07Z","title":"Sample, Scrutinize and Scale: Effective Inference-Time Search by Scaling Verification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01839","snapshot_observed_at":"2026-08-06T14:51:26.594720Z","title":"org/abs/2502.01839","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.594720Z"},"links":{"cited_paper":"/paper/2502.01839","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:52aa47b727852aa7497afa36e5dc1107ec5cb83543177e08d8f0b0be8ddc4242","observation_id":"76b2cbda-88cb-43c8-824d-8139488bb4c5","resolution":{"observed_at":"2026-08-06T14:51:26.594720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-06T14:51:26.516660Z","title":"DeepSeek-AI","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.516660Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:a2a60e48166404bf58692991df344c39cd7e75f67949d5a762be3c242fb6d155","observation_id":"d53cfc76-6fa2-464f-a762-4cbce13431f9","resolution":{"observed_at":"2026-08-06T14:51:26.516660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-11T17:22:43.545531Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-06T14:51:26.545213Z","title":"Liu, Y ., Zhou, H., Guo, Z., Shareghi, E., Vulic, I., Korhonen, A., and Collier, N","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.545213Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:2f4dc1273314129f8986ce8551ef6b70774bc8b770645864ff0bc780f4b1242c","observation_id":"9c7e6d2f-b88e-4a21-8de1-b38e997c672a","resolution":{"observed_at":"2026-08-06T14:51:26.545213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13007","last_updated":"2025-02-19T13:35:48Z","snapshot_observed_at":"2026-08-14T12:08:21.203849Z","submitted_at":"2025-01-22T16:49:37Z","title":"PairJudge RM: Perform Best-of-N Sampling with Knockout Tournament","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13007","snapshot_observed_at":"2026-08-06T14:51:26.554656Z","title":"Pair- Judge RM: Perform Best-of-N Sampling with Knockout 7 GenSelect: A Generative Approach to Best-of-N Tournament, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.554656Z"},"links":{"cited_paper":"/paper/2501.13007","citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:26c40537d304a9dd77287efa46459c103b138a3703a20ec74dbd480ff2fd87d4","observation_id":"39cb97ea-c5d5-4a47-9540-7ebb56d44c11","resolution":{"observed_at":"2026-08-06T14:51:26.554656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:51:26.510732Z","title":"Cobbe, K., Kosaraju, V ., Bavarian, M., Chen, M., Jun, H., Kaiser, L., Plappert, M., Tworek, J., Hilton, J., Nakano, R., Hesse, C., and Schulman, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:26.510732Z"},"links":{"citing_paper":"/paper/2507.17797"},"observation_digest":"sha256:651634d849a8c6c3876b64a6c05bab2d3df11e3d2fa3e3cb2d6e895eb5808371","observation_id":"732a5f61-ff23-41e4-a775-8cd2f0d6fa3d","resolution":{"observed_at":"2026-08-06T14:51:26.510732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.17797","last_updated":"2025-07-23T15:22:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T12:09:05.988886Z","submitted_at":"2025-07-23T15:22:51Z","title":"GenSelect: A Generative Approach to Best-of-N"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 2 inbound Pith citation observations for arXiv:2507.17797."}