{"as_of":"2026-08-08T11:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b5d74460bb5f0cad27725514219836f3e6f10f673a3b4f737ffae0889b43afeb","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T07:11:58.676768Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"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/2601.21166/citation-record","integrity":"/paper/2601.21166/integrity","json":"/paper/2601.21166/citation-record.json","paper":"/paper/2601.21166"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T07:11:57.630172Z","title":"Intrinsic dimensionality explains the effectiveness of language model fine-tuning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:57.630172Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:4f1e3f565ecbdc4078af64042e74d52d3d87c5de47a23a72dc90467a83d02843","observation_id":"9c3ffd8c-3b88-4635-b978-bf98774f5a79","resolution":{"observed_at":"2026-08-03T07:11:57.630172Z","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-03T07:11:57.695562Z","title":"Dueling optimization with a monotone adversary","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:57.695562Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:af3ad46c2cdf764a17277fb6c0fa7b3a64fef230418f30a81d2dbb7582178f63","observation_id":"fbdb719b-3428-4e1d-b5c7-a4d7305e8b9a","resolution":{"observed_at":"2026-08-03T07:11:57.695562Z","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-03T07:11:57.774325Z","title":"Deep reinforcement learning from human preferences.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:57.774325Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:c959ee8dd4189cf7d20f82fc4cc36a80c717d34357c47867ab8beb75bcda0ae4","observation_id":"3aeaad1b-4460-4ff1-81bf-0ab20d3e813b","resolution":{"observed_at":"2026-08-03T07:11:57.774325Z","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-03T07:11:57.874766Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming.SIAM journal on optimization, 23(4):2341–2368, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:57.874766Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:4a78cf4634203b21ec17ffd17ce5802178fec701a0f1a8eabdf48dfa8d09abab","observation_id":"e47ab520-b7a6-47bd-b25a-7e7a4e9ace00","resolution":{"observed_at":"2026-08-03T07:11:57.874766Z","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-03T07:11:57.986738Z","title":"Gradientless descent: High-dimensional zeroth-order optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:57.986738Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:622bdf257ffda5372bb925af56ffb4b22139da6744e1b4d561a4450710634b37","observation_id":"f70b1d62-8b91-4852-a744-523671dd9f24","resolution":{"observed_at":"2026-08-03T07:11:57.986738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04792","last_updated":"2024-02-29T20:59:17Z","snapshot_observed_at":"2026-08-07T05:40:44.041304Z","submitted_at":"2024-02-07T12:31:13Z","title":"Direct Language Model Alignment from Online AI Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04792","snapshot_observed_at":"2026-08-03T07:11:58.083080Z","title":"Direct language model alignment from online ai feedback.arXiv preprint arXiv:2402.04792, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.083080Z"},"links":{"cited_paper":"/paper/2402.04792","citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:be6b145ebaff8c97693bde63e80143be7d28c03cca8682c299f752a1a8a5cec2","observation_id":"2215a8c4-a41f-4730-822e-34c9055982d1","resolution":{"observed_at":"2026-08-03T07:11:58.083080Z","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-03T07:11:58.197013Z","title":"Query complexity of derivative-free optimization.Advances in Neural Information Processing Systems, 25, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.197013Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:eef51bdb21ac5d836e548ccf378d798b279198d99839f1fdc255af7e83127118","observation_id":"7142b751-a8f5-436c-8c1c-eb93eae4b4be","resolution":{"observed_at":"2026-08-03T07:11:58.197013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03145","last_updated":"2025-06-28T08:52:35Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T04:56:11Z","title":"Margin Matching Preference Optimization: Enhanced Model Alignment with Granular Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03145","snapshot_observed_at":"2026-08-03T07:11:58.335445Z","title":"Margin matching preference optimization: Enhanced model alignment with granular feedback.arXiv preprint arXiv:2410.03145, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.335445Z"},"links":{"cited_paper":"/paper/2410.03145","citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:565136ec70a4c26ddb900bea16173a45a99d9beea60e78d3def04c76914e3cf4","observation_id":"e6fa90af-812f-4a2d-b450-88956982a40f","resolution":{"observed_at":"2026-08-03T07:11:58.335445Z","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-03T07:11:58.452006Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.452006Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:352dbdb542ca387c1b29089dee3db0b41e04577ad6387c93bf936eebe6ef6823","observation_id":"5360cff0-c01d-4d58-b899-19885cb69788","resolution":{"observed_at":"2026-08-03T07:11:58.452006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.03026","last_updated":"2021-11-04T17:32:06Z","snapshot_observed_at":"2026-07-06T12:05:32.449744Z","submitted_at":"2021-11-04T17:32:06Z","title":"B-Pref: Benchmarking Preference-Based Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.03026","snapshot_observed_at":"2026-08-03T07:11:58.497511Z","title":"B-pref: Benchmarking preference- based reinforcement learning.arXiv preprint arXiv:2111.03026, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.497511Z"},"links":{"cited_paper":"/paper/2111.03026","citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:c5060efbf07067a3967ba4113bba82dd365486ab854c43e3696d802bb4a17652","observation_id":"5ce0f7eb-0a35-4037-804f-b2735b8bd671","resolution":{"observed_at":"2026-08-03T07:11:58.497511Z","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-03T07:11:58.593716Z","title":"Fine-tuning language models with just forward passes.Advances in Neural Information Processing Systems, 36:53038–53075, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.593716Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:fdf161a8e00177746abe8fe34f6816cd37fdeb076880b9471f87cfb35427b157","observation_id":"09f65eaa-d310-4caf-97e8-3c1ab4ed03ad","resolution":{"observed_at":"2026-08-03T07:11:58.593716Z","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-03T07:11:58.626778Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.626778Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:6d7a80eab3b44e989fdd0377d6f872c410e0474c9e482caad6d8becc902fe4aa","observation_id":"1954e64b-cf8a-4e3b-ab37-82c6f5d2ee12","resolution":{"observed_at":"2026-08-03T07:11:58.626778Z","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-03T07:11:58.630005Z","title":"Dueling convex optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.630005Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:46a364b824d1190a7909c90db4a9b1331501d0f508b082c3cd5ae27cce8c3c73","observation_id":"3f91c854-1689-4b08-a4c8-3dbbea6c612f","resolution":{"observed_at":"2026-08-03T07:11:58.630005Z","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-03T07:11:58.633063Z","title":"Faster convergence with multiway preferences","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.633063Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:fa1d0fd750a1f3baf55f4beac86a4878e35366c794fc3f6712ee5fa2b1dce8a1","observation_id":"0e4cb0b4-a48d-4b85-94ae-302e293bb90d","resolution":{"observed_at":"2026-08-03T07:11:58.633063Z","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-03T07:11:58.635980Z","title":"Dueling convex optimization with general preferences","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.635980Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:08cd739c3c8fb79cbc305492e8c2a2289c43ddba848c6deaff701f4553a6b4b8","observation_id":"15c57a02-e22e-4500-94d4-0d41043b50b5","resolution":{"observed_at":"2026-08-03T07:11:58.635980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-03T07:11:58.638691Z","title":"Proximal policy optimization algorithms.arXiv preprint arXiv:1707.06347, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.638691Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:c8f08252146fc6d77f54cc6b87351d92be8eb475625662e7ca2fa28a18b7d698","observation_id":"04e8b6b9-bc9f-420c-8ca4-c8299d40a91c","resolution":{"observed_at":"2026-08-03T07:11:58.638691Z","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-03T07:11:58.641959Z","title":"Zeroth-order optimization meets human feedback: Provable learning via ranking oracles","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.641959Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:a53d14cbc9b77e69e9fcf8925b1514edc2dd4fee0d1a010af8bfd70380762b72","observation_id":"31ab50f8-9b02-4156-9653-22b5bb6901f1","resolution":{"observed_at":"2026-08-03T07:11:58.641959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00690","last_updated":"2018-01-02T15:48:14Z","snapshot_observed_at":"2026-08-01T20:24:08.300098Z","submitted_at":"2018-01-02T15:48:14Z","title":"DeepMind Control Suite","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00690","snapshot_observed_at":"2026-08-03T07:11:58.644939Z","title":"Deepmind control suite","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.644939Z"},"links":{"cited_paper":"/paper/1801.00690","citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:4915586ed450b7cdbc6f8acbb11077c1a70059319e9bf73883e0e28c9a159e00","observation_id":"0bd0164e-1b94-49c2-a136-424570e11ffc","resolution":{"observed_at":"2026-08-03T07:11:58.644939Z","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-03T07:11:58.648416Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.648416Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:28c707448b37a175de28e513745a53d91a062f0c4b9b3563c1fc83f3fcca95c3","observation_id":"f55198af-3de1-46f8-a403-eefd537d1f76","resolution":{"observed_at":"2026-08-03T07:11:58.648416Z","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-03T07:11:58.652135Z","title":"dm control: Software and tasks for continuous control.Software Impacts, 6:100022, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.652135Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:bd186634035ba851186566b1cab831e82eeaac94220a8ed8aeccdc11963dff8d","observation_id":"4640b07c-9732-4788-acc4-1b31dad8561b","resolution":{"observed_at":"2026-08-03T07:11:58.652135Z","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-03T07:11:58.655374Z","title":"GLUE: A multi-task benchmark and analysis platform for natural language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.655374Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:03c862f56ea25e4a15c5ec3ffeac78197e79ced0003b27fa6edc542e454a7ea8","observation_id":"3ea27a5b-2ec0-4052-9b0e-6d054629c94d","resolution":{"observed_at":"2026-08-03T07:11:58.655374Z","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-03T07:11:58.658497Z","title":"Preference-based optimization from noisy pairwise comparisons.arXiv preprint arXiv:2512.18511, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.658497Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:c2c3d9e06e914142225b79005fe3754bac08f45d7cf65d896dca7814ea8ca3a6","observation_id":"97ce5715-f3d6-46e2-8d80-7ec10955f120","resolution":{"observed_at":"2026-08-03T07:11:58.658497Z","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-03T07:11:58.661424Z","title":"Explicit and non-asymptotic query complexities of rank-based zeroth-order algorithms on smooth functions.arXiv preprint arXiv:2512.16200, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.661424Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:57eddee8212e54ce6b75ca9c36d88a390cbb05c48483eeee0969fce226240106","observation_id":"b81207c4-df77-456d-b1f4-76714464f5d0","resolution":{"observed_at":"2026-08-03T07:11:58.661424Z","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-03T07:11:58.664447Z","title":"Zeroth-order policy gradient for reinforcement learning from human feedback without reward inference","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.664447Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:1a5879418498e1f42c4eda9ee6ac23094b9b0bbe00bc1bffed4411571efa22e0","observation_id":"7e06272e-11cc-414c-9cf1-8a4536f706d1","resolution":{"observed_at":"2026-08-03T07:11:58.664447Z","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-03T07:11:58.667508Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.667508Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:73c05ce36556452eb67006367951e7833080a83c09525e4b6424d8a14b6962aa","observation_id":"a1d10550-ace1-4d52-a00d-1b1e8acbc446","resolution":{"observed_at":"2026-08-03T07:11:58.667508Z","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-03T07:11:58.670526Z","title":"(2) ⇒ (1).Let x∈R d","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.670526Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:26c269ff9acc6813eb3b05960a883931841fe5609e13e25eb7c14882d4a2f972","observation_id":"914a05ad-322c-46d3-ab6d-c02ca37d525a","resolution":{"observed_at":"2026-08-03T07:11:58.670526Z","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-03T07:11:58.673493Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.673493Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:665f6140ba927be081b43a2a120794347e92e986741d2fce3ff3b7881d070cfb","observation_id":"de3f8e73-4daa-4845-96c3-ae4b684aa4e5","resolution":{"observed_at":"2026-08-03T07:11:58.673493Z","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-03T07:11:58.676768Z","title":"prefer y over x","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:58.676768Z"},"links":{"citing_paper":"/paper/2601.21166"},"observation_digest":"sha256:f5059fcbf19de6fadf81c8c0e19f6e537fea2a7e885aea54b88baad26c12702a","observation_id":"70245975-7949-4aff-92b6-1fe50bc02ed5","resolution":{"observed_at":"2026-08-03T07:11:58.676768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.21166","last_updated":"2026-06-22T00:23:06Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T01:56:52.723455Z","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":28},"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 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2601.21166."}