{"as_of":"2026-08-08T16:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:142baefe42b781fcf9f26d7012480d27dd928b60aec83c2b3041ae555db47e8c","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:17:24.655553Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2508.18841/citation-record","integrity":"/paper/2508.18841/integrity","json":"/paper/2508.18841/citation-record.json","paper":"/paper/2508.18841"},"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-05T16:17:24.910810Z","title":"Bobadilla, F","venue":null,"work_id":"67e6c786-f08d-4923-aaa4-aabd07f68a6a","year":2013},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.579363Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:ef74b78255bc7f9377bba5843d169f908a48783a179d9438b19c4a65710dbfb6","observation_id":"deb10099-30be-4481-b17f-e0f16015912f","resolution":{"observed_at":"2026-08-05T16:17:24.914981Z","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-05T16:17:24.900331Z","title":null,"venue":null,"work_id":"ac4c0e08-892f-4c95-abfe-db09b808cd35","year":2019},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.583953Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:e666d208dad5292f0e3287d5e50b7295a2cb92dbd240656193b2b12cafd3f64f","observation_id":"8100f5c3-6c9b-480c-a462-7aa1c1681faa","resolution":{"observed_at":"2026-08-05T16:17:24.904070Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T16:17:24.890327Z","title":"Optimal algorithms for stochastic contextual preference bandits","venue":null,"work_id":"74343ac6-a5da-4cf7-8203-c1054e265f88","year":2021},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.587512Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:99a33182f7389e306c16349bdbd39a36d3b713a9e3c95d2fec4696c12793ac4a","observation_id":"09a70205-ac5a-4e9e-a3cb-d9de36ca00ab","resolution":{"observed_at":"2026-08-05T16:17:24.893909Z","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-05T16:17:24.879246Z","title":"Stochastic contextual dueling bandits under linear stochastic transitivity models","venue":null,"work_id":"89dac816-9300-4b44-9290-ac8ea3b4160e","year":2022},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.590957Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:df3d96b38d165865d212e504e45e94301ac5902318ecbae4a35e15df7e32822f","observation_id":"db58b597-667c-4936-aa2b-f378471997c1","resolution":{"observed_at":"2026-08-05T16:17:24.883046Z","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-05T16:17:24.867973Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"5b2b03c3-e1be-4d25-8db3-01fe768fd9ce","year":2011},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.594429Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:fc8329d35fbd16fb3d03e599eeaed355718187bc1a42db6fe94bbbc9240871d7","observation_id":"3064635d-caee-49cb-9b88-e502a2ab6629","resolution":{"observed_at":"2026-08-05T16:17:24.871232Z","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-05T16:17:24.597623Z","title":"The k-armed dueling bandits problem","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.597623Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:e72322db3c72f1fc3db793f726e5735052e76442792e3af3ac078c19936badcb","observation_id":"9c5ec52d-fe85-4d37-93cb-cf3059bee5a7","resolution":{"observed_at":"2026-08-05T16:17:24.597623Z","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-05T16:17:24.601330Z","title":"Bandit algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.601330Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:ef43a447f031e831b7d2907b1a50fb3bfc93bbd02bba2cbc448022737c92ee43","observation_id":"4c16a021-d565-4c14-bd47-60667ab1722f","resolution":{"observed_at":"2026-08-05T16:17:24.601330Z","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-05T16:17:24.845092Z","title":"Preference- based online learning with dueling bandits: A survey","venue":null,"work_id":"dc764c9e-e164-4472-99d9-6ee3bb350872","year":2021},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.604639Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:9db9d73642e10f092333f9ded82c00e14a268e47643c70935766e29d13a8f88c","observation_id":"d7712e6c-6280-4d1c-ab3a-3bceeed09ffb","resolution":{"observed_at":"2026-08-05T16:17:24.849663Z","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-05T16:17:24.834830Z","title":"Provably optimal algorithms for generalized linear contextual bandits","venue":null,"work_id":"e224066b-1309-40b8-b83b-ee8de7c6fb5d","year":2017},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.608154Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:fccc6884122723a2420a7a2a61a50bf9a7670f0706fc1f3ee8bbf6c7fb63f8ff","observation_id":"774db49c-4d7a-48ab-b7c9-913c805142ca","resolution":{"observed_at":"2026-08-05T16:17:24.838329Z","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-05T16:17:24.824423Z","title":"Schapire, Aleksandrs Slivkins, and Masrour Zoghi","venue":null,"work_id":"df77b62b-b64b-4516-9c6e-97e9fef30f1f","year":2015},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.611354Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:6951ebfd9ae717f088e08e58a68a8a8069d6b5652ca74a5160b8d2ef9d303eff","observation_id":"bdedc48b-2b33-4354-be83-f7c904e592b1","resolution":{"observed_at":"2026-08-05T16:17:24.828391Z","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-05T16:17:24.814545Z","title":"Efficient and optimal algorithms for contextual dueling bandits under realizability","venue":null,"work_id":"1268dd64-ed0f-482b-83be-2ae655d01848","year":2022},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.614415Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:ff20200318b9e667e72deeb1f7c7434469c54f956ec8a2812849e02ac665ba78","observation_id":"81adce06-7c0c-45f5-8a1d-d660ef149bdf","resolution":{"observed_at":"2026-08-05T16:17:24.818111Z","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-05T16:17:24.804071Z","title":"Pereira, Alberto Ueda, Gustavo Penha, Rodrygo L","venue":null,"work_id":"189d10e3-6475-42ed-a7df-c557a9424d61","year":2019},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.617713Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:9fb77d009949e4b92ae2fff2e0c9f580232a7b1a1c6dcf9e4c614c5bd54ca98e","observation_id":"ed57c707-6b97-43ee-9567-6301802db26b","resolution":{"observed_at":"2026-08-05T16:17:24.807592Z","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-05T16:17:24.793057Z","title":"Carousel personalization in music streaming apps with contextual bandits","venue":null,"work_id":"1970c025-9c18-4369-8e3c-aeb00b3d3def","year":2020},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.621280Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:56e23c5815c1cb4046de250c268782f5130c3af1380aa6c4b9f1d58c617bdffe","observation_id":"bab352fb-d4be-4cac-b7f9-b30686e012b9","resolution":{"observed_at":"2026-08-05T16:17:24.796622Z","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-05T16:17:24.781717Z","title":"Contextual user browsing bandits for large-scale online mobile recommendation","venue":null,"work_id":"2bf56314-d6a3-4975-b61c-c8cc4e38dfb0","year":2020},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.624403Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:f9f7c7a9ca0adc733864cc3919399bde9697d954b7ee47c916016635491132a7","observation_id":"92dfc721-9466-4c9b-85a9-d75cdc85579d","resolution":{"observed_at":"2026-08-05T16:17:24.785654Z","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":"2406.09574","last_updated":"2025-05-16T04:56:04Z","snapshot_observed_at":"2026-07-06T18:30:41.802045Z","submitted_at":"2024-06-13T20:25:52Z","title":"Online Bandit Learning with Offline Preference Data for Improved RLHF","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09574","snapshot_observed_at":"2026-08-05T16:17:24.627733Z","title":"Online bandit learning with offline preference data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.627733Z"},"links":{"cited_paper":"/paper/2406.09574","citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:18bf273673f8af0ca4a9dc0ca27dfff8c71f9e4a7fea360b0f95f1d4ff4689c0","observation_id":"07d2f385-b721-4694-a546-bb97cddd2e63","resolution":{"observed_at":"2026-08-05T16:17:24.627733Z","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-05T16:17:24.771014Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":"6999b248-7bfd-49ea-90d0-7ee307a8b0a3","year":2022},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.631533Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:1f2eb682801e7a22b4cf58a9b1f00ce63cdcf3a936dc1a99cba5a005f31e4f00","observation_id":"2064b0ef-1a91-4180-be3f-c2769363c7a5","resolution":{"observed_at":"2026-08-05T16:17:24.774954Z","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-05T16:17:24.759570Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":"55ee9eff-9803-4814-8983-fc0aa38bac82","year":2023},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.634932Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:0fcd572f6a7308fa98073c7fd4eb5d2c6010ff84d54a480525d059387f9f975a","observation_id":"d81319d8-d7bb-4471-99f5-d443f080ab27","resolution":{"observed_at":"2026-08-05T16:17:24.763650Z","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-05T16:17:24.748707Z","title":"On the performance of thompson sampling on logistic bandits","venue":null,"work_id":"4e098994-626c-4209-8f72-9f17793e3b43","year":2019},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.638102Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:d517784fa68f3e4cb7f8c2a6ad292f8f2f52461ca2e1f1a27af724f99ece964e","observation_id":"e7c8b7cb-da0d-4f9f-9406-be1c08276e8b","resolution":{"observed_at":"2026-08-05T16:17:24.752558Z","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-05T16:17:24.737342Z","title":"Improved optimistic algorithms for logistic bandits","venue":null,"work_id":"bccc37c2-e6bd-454d-bfad-9f70c2bc5b16","year":2020},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.641538Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:8e853ab3788cd1aec0fd9299421d36e5df9fcf40a155f46433aea7c311fb470c","observation_id":"c0fd136d-5a8d-49e0-a1c2-2380eda2085f","resolution":{"observed_at":"2026-08-05T16:17:24.741288Z","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-05T16:17:24.726601Z","title":"Instance-wise minimax-optimal algo- rithms for logistic bandits","venue":null,"work_id":"dbb10166-f321-4a9e-b734-613c4c844b73","year":2021},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.644669Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:d177a94544eca2083a869be66306a0436a027f37d585a4deb567cb673b9724a6","observation_id":"bb9928d6-4dbd-4307-81cc-a7a24add1f68","resolution":{"observed_at":"2026-08-05T16:17:24.730180Z","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-05T16:17:24.716319Z","title":"Elimination by aspects: A theory of choice","venue":null,"work_id":"4dd1a355-d024-4d97-b3a7-cdc87b549b00","year":1972},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.648312Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:fa9ff494d7a56c7d8df0ebba30e354bee74f24304086fc991aa8c8205a5f17e2","observation_id":"4e2632d7-50b7-4e30-a58e-ff3604439a6e","resolution":{"observed_at":"2026-08-05T16:17:24.719787Z","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-05T16:17:24.705842Z","title":"Judgment under uncertainty: Heuristics and biases","venue":null,"work_id":"665f8918-e37d-4119-83c9-918b8369c410","year":1974},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.652130Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:1fcf05c62ccfa79ad3d8acbccf1fb6db43696ce63c1bdcfbc90b985766717ad7","observation_id":"0c5847ae-f3c6-4ec5-949e-4014f753644f","resolution":{"observed_at":"2026-08-05T16:17:24.709329Z","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-05T16:17:24.692338Z","title":"Introduction to the non-asymptotic analysis of random matrices","venue":null,"work_id":"3c221343-624b-4a5e-ab10-e9951748d51e","year":2012},"citing_paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:24.655553Z"},"links":{"citing_paper":"/paper/2508.18841"},"observation_digest":"sha256:caaa030b4cdc4fdf10daf3e68bc7aef45888fbdc2c39326c2c0bf1638308a022","observation_id":"4ddf7510-8eb2-4277-a864-2776f98d520b","resolution":{"observed_at":"2026-08-05T16:17:24.697878Z","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"}}],"paper":{"arxiv_id":"2508.18841","last_updated":"2025-08-26T09:18:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T09:45:09.523122Z","submitted_at":"2025-08-26T09:18:13Z","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2508.18841."}