{"as_of":"2026-08-24T03:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d516a8ce7b715016d2345441a7538c62bbc22ed0b7f981570e95b4b160a66ec","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:32:33.789759Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T17:01:14.378405Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11887","last_updated":"2020-04-01T00:35:05Z","snapshot_observed_at":"2026-08-22T03:47:25.609699Z","submitted_at":"2020-02-27T02:49:10Z","title":"Using a thousand optimization tasks to learn hyperparameter search strategies","version":3},"cited_work":{"arxiv_id":"2002.11887","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.11887","snapshot_observed_at":"2026-08-10T17:01:14.378405Z","title":"Using a thousand optimization tasks to learn hyperparameter search strategies","venue":"cs.LG","work_id":"a36aff06-0cce-4b1f-b64a-6e412e62853a","year":2020},"citing_paper":{"arxiv_id":"2501.12670","last_updated":"2025-06-19T15:01:04Z","snapshot_observed_at":"2026-08-17T22:51:52.134879Z","submitted_at":"2025-01-22T06:10:27Z","title":"Celo: Training Versatile Learned Optimizers on a Compute Diet","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T17:01:13.975323Z"},"links":{"cited_paper":"/paper/2002.11887","citing_paper":"/paper/2501.12670"},"observation_digest":"sha256:eb6fa63c8d1850e1df18b43b1f0f5c2d1c25b946251075eedc1d6d495b94524f","observation_id":"fc2d163e-c3ec-43e7-bbb7-738eb536b38e","resolution":{"observed_at":"2026-08-10T17:01:14.385479Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11887","last_updated":"2020-04-01T00:35:05Z","snapshot_observed_at":"2026-08-22T03:47:25.609699Z","submitted_at":"2020-02-27T02:49:10Z","title":"Using a thousand optimization tasks to learn hyperparameter search strategies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11887","snapshot_observed_at":"2026-08-16T04:32:33.789759Z","title":"D., Poole, B., and Sohl-Dickstein, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.01468","last_updated":"2025-05-02T05:59:21Z","snapshot_observed_at":"2026-08-18T03:07:11.064552Z","submitted_at":"2025-05-02T05:59:21Z","title":"One Search Fits All: Pareto-Optimal Eco-Friendly Model Selection","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T04:32:33.789759Z"},"links":{"cited_paper":"/paper/2002.11887","citing_paper":"/paper/2505.01468"},"observation_digest":"sha256:65eb8b99c3dc2f1ec57ac4e1f49909cd4f0608f50d89e203e98cf5f4a91b8492","observation_id":"999cb8da-92d5-4b92-a1a0-7e5ee3d61cc6","resolution":{"observed_at":"2026-08-16T04:32:33.789759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11887","last_updated":"2020-04-01T00:35:05Z","snapshot_observed_at":"2026-08-22T03:47:25.609699Z","submitted_at":"2020-02-27T02:49:10Z","title":"Using a thousand optimization tasks to learn hyperparameter search strategies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11887","snapshot_observed_at":"2026-07-14T15:55:25.318583Z","title":"arXiv preprint arXiv:2002.11887 , year=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.09776","last_updated":"2026-07-15T15:49:55Z","snapshot_observed_at":"2026-08-15T04:30:16.722908Z","submitted_at":"2026-07-08T03:03:38Z","title":"HELP: Human-Efficient Large-Scale Robot Post-Training with Rollout Segmentation","version":1},"reference_index":147,"source":"arxiv_source","source_observed_at":"2026-07-14T15:55:25.318583Z"},"links":{"cited_paper":"/paper/2002.11887","citing_paper":"/paper/2607.09776"},"observation_digest":"sha256:4f317c273321554505bfb065e2c0d74ec0c9b8675492b650f0aa4129467fdbf7","observation_id":"84dccd47-dacf-4620-9836-d9d57c33cb4e","resolution":{"observed_at":"2026-07-14T15:55:25.318583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11887","last_updated":"2020-04-01T00:35:05Z","snapshot_observed_at":"2026-08-22T03:47:25.609699Z","submitted_at":"2020-02-27T02:49:10Z","title":"Using a thousand optimization tasks to learn hyperparameter search strategies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11887","snapshot_observed_at":"2026-08-02T08:13:18.318958Z","title":"arXiv preprint arXiv:2002.11887 , year=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.09776","last_updated":"2026-07-15T15:49:55Z","snapshot_observed_at":"2026-08-15T04:30:16.722908Z","submitted_at":"2026-07-08T03:03:38Z","title":"HELP: Human-Efficient Large-Scale Robot Post-Training with Rollout Segmentation","version":2},"reference_index":147,"source":"arxiv_source","source_observed_at":"2026-08-02T08:13:18.318958Z"},"links":{"cited_paper":"/paper/2002.11887","citing_paper":"/paper/2607.09776"},"observation_digest":"sha256:fd94aeac9239070926d34656089f46884ffbb0af6cd3002d225da9fe8003aab6","observation_id":"84f030fe-37fa-40a3-b21e-b2881b639901","resolution":{"observed_at":"2026-08-02T08:13:18.318958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.11887/citation-record","integrity":"/paper/2002.11887/integrity","json":"/paper/2002.11887/citation-record.json","paper":"/paper/2002.11887"},"outbound":[],"paper":{"arxiv_id":"2002.11887","last_updated":"2020-04-01T00:35:05Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-22T03:47:25.609699Z","submitted_at":"2020-02-27T02:49:10Z","title":"Using a thousand optimization tasks to learn hyperparameter search strategies"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2002.11887."}