{"as_of":"2026-08-08T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74d25abd9122ec1ea7e03735afcf858cbcf567cb43b7de5a2166bb4ce1a16c3f","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:55:49.233352Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T04:27:07.923007Z","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-18T21:31:51.579040Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"cited_work":{"arxiv_id":"2505.20316","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20316","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"430a263b-57d6-4695-b1dc-8ecf88fd185f","year":2025},"citing_paper":{"arxiv_id":"2508.18142","last_updated":"2026-04-17T09:19:23Z","snapshot_observed_at":"2026-08-08T18:20:02.044401Z","submitted_at":"2025-08-25T15:51:24Z","title":"Mirroring Users: Towards Building Preference-aligned User Simulator with User Feedback in Recommendation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T21:28:29.868292Z"},"links":{"cited_paper":"/paper/2505.20316","citing_paper":"/paper/2508.18142"},"observation_digest":"sha256:c4ec92ef94fd634eda6c2f85ab01677ea577b8d640f766083a6584285a247e5f","observation_id":"062f74ff-c5db-4046-844d-0f849a74c9dc","resolution":{"observed_at":"2026-05-18T21:31:51.582307Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20316","snapshot_observed_at":"2026-08-04T01:33:51.671261Z","title":"Soenksen, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00076","last_updated":"2026-08-04T08:25:13Z","snapshot_observed_at":"2026-08-07T23:09:40.857736Z","submitted_at":"2026-07-29T13:33:11Z","title":"Which Modality Decides? Counterfactual Modality Attribution for Multimodal LLMs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T01:33:51.671261Z"},"links":{"cited_paper":"/paper/2505.20316","citing_paper":"/paper/2608.00076"},"observation_digest":"sha256:5cdfe74b46be0ca4d230cbcbdf56c01ba496827badb3b66e2f0725af6b368090","observation_id":"d650411c-fd95-43c3-9f9a-5d520b0ad975","resolution":{"observed_at":"2026-08-04T01:33:51.671261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20316","snapshot_observed_at":"2026-08-05T04:27:07.923007Z","title":"Soenksen, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00076","last_updated":"2026-08-04T08:25:13Z","snapshot_observed_at":"2026-08-07T23:09:40.857736Z","submitted_at":"2026-07-29T13:33:11Z","title":"Which Modality Decides? Counterfactual Modality Attribution for Multimodal LLMs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T04:27:07.923007Z"},"links":{"cited_paper":"/paper/2505.20316","citing_paper":"/paper/2608.00076"},"observation_digest":"sha256:3ccf830ba149cae43dfa84b1bd1bf9285164f337505dc45e8da3dc4f390a54bf","observation_id":"157a78b3-e3a3-4441-80ae-23fa8c7516c5","resolution":{"observed_at":"2026-08-05T04:27:07.923007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.20316/citation-record","integrity":"/paper/2505.20316/integrity","json":"/paper/2505.20316/citation-record.json","paper":"/paper/2505.20316"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:54.155799Z","title":"Learning to rank using gradient descent","venue":null,"work_id":"0cb4dca1-e245-401e-a48d-1e7b80b2d1d3","year":2005},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.807473Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:eeaaf3ad5874aa95a7569c2e18f5a13e3f5c79435b1cd09da07af9faede05d6b","observation_id":"cd7e7623-affe-400e-af19-a87abb5b206a","resolution":{"observed_at":"2026-08-07T14:55:54.309735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.848005Z","title":"Medusa: Simple llm inference acceleration framework with multiple decoding heads","venue":null,"work_id":"853ba2bd-277a-4fa4-8222-a6287079d90b","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.877478Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:6294228e0511633f6f1d9df49b6df62e9549fc9b00979ccad051b3c0b9b6c3c9","observation_id":"ab55c311-ad0f-4d2c-b5fb-1c1d418b5ce9","resolution":{"observed_at":"2026-08-07T14:55:53.981128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01318","last_updated":"2023-02-02T18:44:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-02T18:44:11Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01318","snapshot_observed_at":"2026-08-07T14:55:45.008851Z","title":"Accelerating large language model decoding with speculative sampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.008851Z"},"links":{"cited_paper":"/paper/2302.01318","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:115371bcb45b8eb82f605f2ec9db5763f9b0c121f07e22db52a6f02e6fc09d0a","observation_id":"951aa2c4-3b1b-48ab-b8b1-b65e47ceea8b","resolution":{"observed_at":"2026-08-07T14:55:45.008851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12374","last_updated":"2025-07-05T03:31:01Z","snapshot_observed_at":"2026-08-08T08:32:41.951263Z","submitted_at":"2024-02-19T18:58:32Z","title":"Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12374","snapshot_observed_at":"2026-08-07T14:55:45.134263Z","title":"Sequoia: Scalable, robust, and hardware-aware speculative decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.134263Z"},"links":{"cited_paper":"/paper/2402.12374","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:c4defa32f3de77fee8519b1ce3960f2c5bd3e8ec741633fa4a55d11f6f84b4ec","observation_id":"5a260b83-81ef-4d10-b341-a15956c9039a","resolution":{"observed_at":"2026-08-07T14:55:45.134263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.584745Z","title":"Cascade speculative drafting for even faster llm inference","venue":null,"work_id":"6ab0b259-8e8c-42de-8ff4-5c3c44b3f73b","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.203410Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:ad62f4457cf4cf330b1454cb2cc93d19f69605deb9cc87d917e7b3d73a35185c","observation_id":"2cb6909c-ba71-4577-ab3a-5da3a457fc6e","resolution":{"observed_at":"2026-08-07T14:55:53.698037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.261344Z","title":"Glide with a cape: a low-hassle method to accelerate speculative decoding","venue":null,"work_id":"95b725ef-024c-4807-aaf8-b82c9ca690d7","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.309951Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:c7244907e13d898945b3eb74b5c14f87f61f277bf711fb29e34fd478c9033ed5","observation_id":"eda251c9-b5ff-435b-a963-e0037c362d03","resolution":{"observed_at":"2026-08-07T14:55:53.440746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.011632Z","title":"Quasi- metric learning for bilateral person-job fit","venue":null,"work_id":"d8fa3f47-f9da-43d8-9ce3-dbbddfe49289","year":2025},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.427835Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:257bc635a537296e446f754d1fdab70ad1b5d4b3adbd829d9095b17834a7a52f","observation_id":"cbc96cdc-c33b-471a-a449-d53158fdaa20","resolution":{"observed_at":"2026-08-07T14:55:53.165517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:45.509766Z","title":"Enhancing job recommendation through llm-based generative adversarial networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.509766Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:b74d00c00f08e5f68e3b749dfa6aec521fed653d10f7ec300e0d87a583f18410","observation_id":"b3089c53-0cf5-492e-abc7-86b4c6618674","resolution":{"observed_at":"2026-08-07T14:55:45.509766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.698674Z","title":"Active large language model-based knowledge distillation for session-based recommendation","venue":null,"work_id":"0d935e29-b8bd-4bae-9a96-75813d6a52f5","year":2025},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.595587Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:58eb3dd77e196f5cb46aa9e3309b23707858f6de5fe90cf8cccbf4f8b9b8ffe7","observation_id":"962a438b-8c4e-4740-a585-2a9b5cae7b62","resolution":{"observed_at":"2026-08-07T14:55:52.827209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.468515Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"2d9a139a-f5df-4731-b8d9-3e7c46239d54","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.690591Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:484f285dbd50c5b2fe1929985d6937fbe78bbfdcb2b9d142496417c2d5e925b6","observation_id":"89c8e272-d3ee-4f42-a0b5-8714d252db41","resolution":{"observed_at":"2026-08-07T14:55:52.580518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T14:55:45.758065Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.758065Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:ab53be0984b7bdbf85ff1cdcd7d43b5892d0f92b3a6166f9c642672ed4c6d684","observation_id":"1d7f1dd0-0f61-4d9a-b4ea-c07bfa6f41e0","resolution":{"observed_at":"2026-08-07T14:55:45.758065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.182212Z","title":"Rest: Retrieval-based speculative decoding","venue":null,"work_id":"eb965f05-2050-42c2-a13d-d91752b5a8ff","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.829002Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:bad3ffc7f1788780cdfb954237629bdc7df03619e6316030751d019eaad1d789","observation_id":"f9821ace-78b5-4ccb-ba83-2d9a3b682592","resolution":{"observed_at":"2026-08-07T14:55:52.343550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12072","last_updated":"2024-01-03T00:32:43Z","snapshot_observed_at":"2026-07-06T16:35:07.121479Z","submitted_at":"2023-10-18T16:07:01Z","title":"SPEED: Speculative Pipelined Execution for Efficient Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12072","snapshot_observed_at":"2026-08-07T14:55:45.915619Z","title":"Speed: Speculative pipelined execution for efficient decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.915619Z"},"links":{"cited_paper":"/paper/2310.12072","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:176cb1a73e8f24e8e74c13e7975bec1f6a036bb33836742150d5b52d0a3df295","observation_id":"df0725ad-3f72-4ec8-9388-84057782f793","resolution":{"observed_at":"2026-08-07T14:55:45.915619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.961843Z","title":"Large language models are zero-shot rankers for recommender systems","venue":null,"work_id":"7a06a8d1-0dc9-4f64-b45c-e64e434e812e","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.027434Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:464df8e5461221288cc5754d3e6f8d83a021e919c8d4ffbd0920cdf90253968d","observation_id":"a8fc6330-5401-4bd8-bdb5-520adafa04fd","resolution":{"observed_at":"2026-08-07T14:55:52.030308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:46.110093Z","title":"Neural input search for large scale recommendation models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.110093Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:e043273af1d6fbc6e35b6849a2756d51654db579f94a86b68754d0cb67523444","observation_id":"3b362025-19e4-4368-8fd2-366addca62b1","resolution":{"observed_at":"2026-08-07T14:55:46.110093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.763095Z","title":"Speculative decoding with big little decoder","venue":null,"work_id":"71f697fe-af6c-4401-a498-ba4f54b773a1","year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.201097Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:0274ff7e0f46feb75a14041995899b1253d3c6f6c0c2e2be7aa4f89e03669092","observation_id":"029d947d-c457-4564-b415-5c9a74fb6ac2","resolution":{"observed_at":"2026-08-07T14:55:51.858643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.530354Z","title":"Ancestral gumbel-top-k sampling for sampling without replacement","venue":null,"work_id":"58910961-04d6-4b26-8d66-449f5276515a","year":2020},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.305009Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:734f9109f129a9a65161562a3642b911320a84a95cd8b210058765d2d2477010","observation_id":"fb07fa24-a7b0-4a81-99f8-db0e151e757a","resolution":{"observed_at":"2026-08-07T14:55:51.645613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:46.374306Z","title":"Fast inference from transformers via speculative decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.374306Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:22560cb8aadcf8786a53c4c38a7e8355bcb0f68733e711bcb04721db067ed9f3","observation_id":"ac585f47-9ac5-4718-9f9b-35884071ad15","resolution":{"observed_at":"2026-08-07T14:55:46.374306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.300864Z","title":"Eagle: speculative sampling requires rethinking feature uncertainty","venue":null,"work_id":"1e9f0462-a87a-4e37-aba4-90b5309d9a5f","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.467020Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:2f7657960cc5960466e0c90cf962590fd9b0d695091fea8db4c969884e0c4b09","observation_id":"d596bb36-bcfc-407d-b4c4-dcb0513c0f27","resolution":{"observed_at":"2026-08-07T14:55:51.414693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.150934Z","title":"Generalized ambiguity decomposition for ranking ensemble learning","venue":null,"work_id":"87aa1de8-429b-4112-8d78-223c7a8591fb","year":2022},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.557451Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:3db4dc4759370d0337b2e7e7504e95bb4375ec416d76d90d3af9049bbc6302be","observation_id":"1184db20-b773-42a8-b66a-04d74ab532d8","resolution":{"observed_at":"2026-08-07T14:55:51.197273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.100443Z","title":"Online speculative decoding","venue":null,"work_id":"c4a72681-5d52-435b-9173-f87fddb14105","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.700635Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:2dd467eb2cb5945731fd96f64d2e31c47b4a17c5a78b39aef205bc00bd638e73","observation_id":"b8570d3b-64b3-491e-a9f2-9008463571c2","resolution":{"observed_at":"2026-08-07T14:55:51.105067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.961822Z","title":"Ranked list truncation for large language model-based re-ranking","venue":null,"work_id":"5d584dc6-3793-4e43-be2c-35d7c541ab76","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.802330Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:f44854487b376531bb4df27dbdeb4c291151861405de9c65d257a1ca424d6236","observation_id":"def8ea7e-72a2-4bd2-90f8-5d6597de3d3b","resolution":{"observed_at":"2026-08-07T14:55:51.010746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:46.907373Z","title":"Specinfer: Accelerating large language model serving with tree-based speculative inference and verification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.907373Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:4a19bbcbac017e17149314c438ee991061f5e1581b58eeafabe1a7ab98f37895","observation_id":"6f39294c-0397-4870-bea6-5bd41c1dca19","resolution":{"observed_at":"2026-08-07T14:55:46.907373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13581","last_updated":"2023-11-22T18:37:27Z","snapshot_observed_at":"2026-07-06T16:51:15.252642Z","submitted_at":"2023-11-22T18:37:27Z","title":"PaSS: Parallel Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13581","snapshot_observed_at":"2026-08-07T14:55:47.016746Z","title":"Pass: Parallel speculative sampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.016746Z"},"links":{"cited_paper":"/paper/2311.13581","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:a00610c9e565c1cc08864d2a4d1ebc1d700d5b8bb1e4ac898a8fd2cc781f08b0","observation_id":"1232ac43-92d0-4be4-bdf3-4324e91ad33f","resolution":{"observed_at":"2026-08-07T14:55:47.016746Z","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-07T14:55:47.125132Z","title":"Machine learning: a probabilistic perspective","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.125132Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:573d8827c8cd4ab809043b186a4d432d7baaf0342e0131238ffa89d97ef77213","observation_id":"0e1972d2-bad1-4713-adaf-c3c589e737b4","resolution":{"observed_at":"2026-08-07T14:55:47.125132Z","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-07T14:55:47.197655Z","title":"Ms marco: A human-generated machine reading comprehension dataset","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.197655Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:6b0b69d2093b74c9e1e2b8ee6ef686c23ce4fa5529bc32097797b7df1daa333f","observation_id":"1c218bff-cd9f-48df-b791-b8f3db60fdd4","resolution":{"observed_at":"2026-08-07T14:55:47.197655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-08-07T14:55:47.281945Z","title":"Top-down partitioning for efficient list-wise ranking","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.281945Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:5165b44754d35bb719bc6c7498da1e14b6dd9a296d33a10e70094de5bc271102","observation_id":"25477b58-b72e-4a56-ab7f-b3a4cbfee646","resolution":{"observed_at":"2026-08-07T14:55:47.281945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15088","last_updated":"2023-09-26T17:31:57Z","snapshot_observed_at":"2026-07-06T16:23:57.143116Z","submitted_at":"2023-09-26T17:31:57Z","title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15088","snapshot_observed_at":"2026-08-07T14:55:47.416667Z","title":"Rankvicuna: Zero-shot listwise document reranking with open-source large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.416667Z"},"links":{"cited_paper":"/paper/2309.15088","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:9088e426c3b91aa962df991e47b2455c9165dd67953eb24dcab28c96f6e4b05a","observation_id":"fab25013-0afa-47e8-b14f-6c6605413863","resolution":{"observed_at":"2026-08-07T14:55:47.416667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02724","last_updated":"2023-12-05T12:39:00Z","snapshot_observed_at":"2026-07-06T16:57:09.664139Z","submitted_at":"2023-12-05T12:39:00Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02724","snapshot_observed_at":"2026-08-07T14:55:47.543984Z","title":"Rankzephyr: Effective and robust zero-shot listwise reranking is a breeze! arXiv preprint arXiv:2312.02724, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.543984Z"},"links":{"cited_paper":"/paper/2312.02724","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:8206deaf04cbad864c7cf3d02aadfcae7660ede1583fa74a96bde3be785fcbc0","observation_id":"0fa9f67a-44a5-40cf-9f42-f42d2f6d5a56","resolution":{"observed_at":"2026-08-07T14:55:47.543984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.791131Z","title":"First: Faster improved listwise reranking with single token decoding","venue":null,"work_id":"3b8d379b-ae28-4c02-9d5c-ec11b503bd65","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.634430Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:d5a78b84806c2e6a0453dc5d517b6f484561c09e48e278181c520e8424ea8483","observation_id":"38eb7458-6e76-4f52-832a-668851e71c9a","resolution":{"observed_at":"2026-08-07T14:55:50.867711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.651600Z","title":"Accelerating transformer inference for translation via parallel decoding","venue":null,"work_id":"3d50565e-05c2-4bd2-a114-42a5357e06a9","year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.742704Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:63dfcb619a41baee819b65cd80e19850ec3762303ddd0b8a4f9ba1397e23a86d","observation_id":"e0ca8bed-2e0d-4556-94f1-52948ba962f0","resolution":{"observed_at":"2026-08-07T14:55:50.719645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-07T14:55:47.849400Z","title":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.849400Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:4e1974065dd35d7266a823e38ca5bcdc3f488a0fe786579522eca4cc8037fe19","observation_id":"c0831dec-029e-4720-a3f0-cd1b6d8bad79","resolution":{"observed_at":"2026-08-07T14:55:47.849400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.531232Z","title":"Accelerating llm inference with staged speculative decoding","venue":null,"work_id":"88089280-950e-4452-ae2e-81bc85360b7e","year":null},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.938052Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:a445a48496e071e03e76b1db2a7f9c2ddea7d40a11fee30d058a194d26fff9ba","observation_id":"42cb5e4f-6e07-47cf-aa8b-216da521f1e6","resolution":{"observed_at":"2026-08-07T14:55:50.581792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.038119Z","title":"Blockwise parallel decoding for deep autoregressive models","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.038119Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:b5d0cdbd93c3fc6eeb4c093c16ebecd2f93a3c3107110d515637f3209888fb06","observation_id":"2ed1d937-2e62-4e1d-b113-c74cc172ebed","resolution":{"observed_at":"2026-08-07T14:55:48.038119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.406587Z","title":"Spectr: Fast speculative decoding via optimal transport","venue":null,"work_id":"9b459bb1-ccb9-4b61-9b18-fbf585b61a55","year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.131007Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:c42fb676108e54973b807a8eeeca94a1c23dcafcde6fece51c7719dfc0d1ae92","observation_id":"e324952c-13fd-4ee5-b4b4-9cb1bb572cc4","resolution":{"observed_at":"2026-08-07T14:55:50.454616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T14:55:48.202843Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.202843Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:d28295acddbc14a4a4dbc29dfcd2f3fbaf697c7fd2112ad663148d2182850476","observation_id":"5543b4e6-97b7-44e7-8170-3a037c85c517","resolution":{"observed_at":"2026-08-07T14:55:48.202843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T14:55:48.302963Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.302963Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:d4217e506a57868d11e6469c91556c9dd9ec58f8f5f902bc311c279488828f99","observation_id":"00b9c292-7405-4106-9bae-a2ee1930512e","resolution":{"observed_at":"2026-08-07T14:55:48.302963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.272127Z","title":"Re2llm: Reflective reinforcement large language model for session-based recommendation","venue":null,"work_id":"7e117d1b-9879-46e3-a045-77584ef36a78","year":2025},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.394670Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:1e3b2683a6162a9b06604ef377ec4f6a42bd1bdd6a093ebfa25f96c55cbeff72","observation_id":"f4907a0b-19fb-42fd-ad14-e7c5143efc21","resolution":{"observed_at":"2026-08-07T14:55:50.328598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.475112Z","title":"A survey on large language models for recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.475112Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:cb49c657e4038e194215540a572e70de70eb31d298e0afffc9f99b07a748225a","observation_id":"982ed65e-76c0-47ae-823b-8ac58dcdb0ba","resolution":{"observed_at":"2026-08-07T14:55:48.475112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.134564Z","title":"Speculative decoding: Exploiting speculative execution for accelerating seq2seq generation","venue":null,"work_id":"2d02fef1-b24f-49c9-8087-1fe684694eb1","year":2023},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.534931Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:94b6db8dffe81438ae735bcf25211d6312ca4f28e1a934cb073db1db47cb4549","observation_id":"2d3dab59-36fc-4ffc-89d2-527ca833f50d","resolution":{"observed_at":"2026-08-07T14:55:50.195461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.970785Z","title":"Unlocking efficiency in large language model inference: A comprehensive survey of speculative decoding","venue":null,"work_id":"e0e54747-eebd-4aa1-ab74-5ad2f80f7a18","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.619763Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:919cd56a0cc4021de36c759546aaf7fc9c2e68bb3c6e9420c5a7c296afc4d903","observation_id":"d903e4ea-3fee-46b8-851d-eaddab119383","resolution":{"observed_at":"2026-08-07T14:55:50.041078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T14:55:48.710769Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.710769Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:b994d63e720388f0f9e8d8f2bf547e371136d6000f0e2fbd181dc568c2639f62","observation_id":"b00634c5-46fa-45d1-a089-0f120fd5358a","resolution":{"observed_at":"2026-08-07T14:55:48.710769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06706","last_updated":"2024-01-12T17:15:23Z","snapshot_observed_at":"2026-08-05T16:37:38.261153Z","submitted_at":"2024-01-12T17:15:23Z","title":"Multi-Candidate Speculative Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06706","snapshot_observed_at":"2026-08-07T14:55:48.798319Z","title":"Multi-candidate speculative decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.798319Z"},"links":{"cited_paper":"/paper/2401.06706","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:ea335843373364fb47e1b6495d6535c2e12422ec421bfdfbb6727db14996dd76","observation_id":"3fc18fa0-9614-42a1-bc6c-c6d1c1c68ba5","resolution":{"observed_at":"2026-08-07T14:55:48.798319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.873718Z","title":"Predictive pipelined decoding: A compute-latency trade-off for exact llm decoding.Transactions on Machine Learning Research","venue":null,"work_id":"fc62921a-4256-48c8-82fb-f603c3b51f31","year":null},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.853625Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:2cb3063aa867ac55814cecedd045257e0063e479301e17c95fb2416d89a180f4","observation_id":"d4381522-e859-41c0-8657-75ba81c155eb","resolution":{"observed_at":"2026-08-07T14:55:49.919724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.745945Z","title":"Draft& verify: Lossless large language model acceleration via self-speculative decoding","venue":null,"work_id":"864fba30-08b4-4f91-98b7-998754daa93a","year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:48.949300Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:90d9b67649937f4c616f66a11553f8fb6ef6ad7f3d6b4a87a8b9a8e2478dbed2","observation_id":"c469d7b3-9ec3-40ef-98dd-a34d89f5821d","resolution":{"observed_at":"2026-08-07T14:55:49.807720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-08-07T14:55:49.016380Z","title":"Opt: Open pre-trained transformer language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:49.016380Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:42eec740b2ef8a5ff741d2140190824067c8c041201ca26de45149d438b6a6ac","observation_id":"f2f37503-db68-4a1d-8215-f8a7edfcb869","resolution":{"observed_at":"2026-08-07T14:55:49.016380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.605343Z","title":"Distillspec: Improving speculative decoding via knowledge distillation","venue":null,"work_id":"e3667b1a-c55d-4136-921b-29da57bc0541","year":null},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:49.138610Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:192e87cc1292a2f8647a42ced4bef635c342d7a3c0677d9fcdaf825b0334d562","observation_id":"fb204efc-0b25-4d70-ae16-6aa166dcc0d1","resolution":{"observed_at":"2026-08-07T14:55:49.683573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.233352Z","title":"Large language models for information retrieval: A survey","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:49.233352Z"},"links":{"citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:4bb4ece5874a0637d25448367218920cf95ec03259303f17366fb325e2f2167b","observation_id":"a9040345-ff0a-4f93-975c-c3c4c446655a","resolution":{"observed_at":"2026-08-07T14:55:49.233352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":48},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 3 inbound Pith citation observations for arXiv:2505.20316."}