{"as_of":"2026-08-10T02:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f6a120529bc75ea47e15399fc07267c146b32cf5eca4f9181c01c1b0b112a9d","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T15:56:23.031807Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-07-14T06:44:16.198117Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.27000","snapshot_observed_at":"2026-07-14T06:44:16.198117Z","title":"2605.27000 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11146","last_updated":"2026-07-13T06:37:42Z","snapshot_observed_at":"2026-08-04T11:23:41.061756Z","submitted_at":"2026-07-13T06:37:42Z","title":"Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-14T06:44:16.198117Z"},"links":{"cited_paper":"/paper/2605.27000","citing_paper":"/paper/2607.11146"},"observation_digest":"sha256:2a64d2098f7b172d0194c52b5fefecfded12ae92494a2480b798014c4aaaedb0","observation_id":"ed8d7280-4a59-4eba-95e4-82f389799c64","resolution":{"observed_at":"2026-07-14T06:44:16.198117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.27000/citation-record","integrity":"/paper/2605.27000/integrity","json":"/paper/2605.27000/citation-record.json","paper":"/paper/2605.27000"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","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-07-12T15:56:23.031807Z","title":"Google DeepMind","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:993003f44634a934f0726a082b80a57bd7551840d0454801dc7b2f02888c0019","observation_id":"3a6a14b2-68e6-424d-a72e-2dbd7a1b3645","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02534","last_updated":"2025-09-02T17:38:47Z","snapshot_observed_at":"2026-08-05T11:30:06.956863Z","submitted_at":"2025-09-02T17:38:47Z","title":"Jointly Reinforcing Diversity and Quality in Language Model Generations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02534","snapshot_observed_at":"2026-07-12T15:56:23.031807Z","title":"train + val","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"cited_paper":"/paper/2509.02534","citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:7ce164924ffadfe9287c9830ee40c7ba56e3abc7a9e6f227cb5a31b19dee01b6","observation_id":"c9ad50ca-f78f-4e37-93aa-d8f48db953a6","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:92f469caafe675cc8a357dfede3968776895ed2a73de15664e5d035c96067afb","observation_id":"3661cc4c-d131-438a-9e8b-1e9f18db1b6a","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:18a876deab021da9ff30b3549558f29810177467be176704e39110934421c288","observation_id":"c3744483-0792-4a88-83ed-60427d3bf381","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:ba1727a99568ab14a231d7309b91994f76d286d8ec00cc2ce36e194159aba950","observation_id":"1735f637-c33e-407c-90f5-6d8b9f44326d","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":"This comparison isolates the effect of adding a planning prompt before code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:4cddf5a3616a7d9b84d8a27281042ae9c9ff1416219cccc1e069280c3ecb7d4f","observation_id":"e28a69db-585f-4f33-b895-e998d5e718d0","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:b66ba8a2f97fa7e471f3c0654e3369156b68941c3656c0c18c5aa6c377104519","observation_id":"05eeadda-b477-4cd0-bbad-d4c21cd4169f","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:5d03bcbbe1262f24f3b7e7458cabd180ecc4d151b8cc9ad2d962407c2f644edc","observation_id":"ef00001e-aef3-4810-b189-60d311a09d9a","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:6a991754147e31341fcdbcb8403fd2d0d150de21b290ddf4225dd01fd79947f1","observation_id":"43f3f223-a095-4a56-97e5-03d2dddeb40d","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","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-07-12T15:56:23.031807Z","title":"This comparison isolates inference-time multi-plan search without planner training","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T15:56:23.031807Z"},"links":{"citing_paper":"/paper/2605.27000"},"observation_digest":"sha256:7c1543e869d2476eb85cc217271b7e574ba8eb7cce9a01530bd1ddcd2a9a2a77","observation_id":"4d4f5e79-42a2-44fc-a125-a0301cd00fe7","resolution":{"observed_at":"2026-07-12T15:56:23.031807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.27000","last_updated":"2026-07-08T03:26:35Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T15:49:25.689709Z","submitted_at":"2026-05-26T13:21:11Z","title":"Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":10},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 1 inbound Pith citation observation for arXiv:2605.27000."}