{"as_of":"2026-08-10T10:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d782b7f36430454bfdac18507ce06afc085dc96ea426fce3d2fde0b30d9a900","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:23.064115Z","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-07-03T17:08:43.681463Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.03126","last_updated":"2024-10-20T11:36:13Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T15:51:49Z","title":"How Free is Parameter-Free Stochastic Optimization?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03126","snapshot_observed_at":"2026-08-07T13:30:23.064115Z","title":"How free is parameter-free stochastic optimization? arXiv:2402.03126 , 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21651","last_updated":"2025-05-27T18:25:21Z","snapshot_observed_at":"2026-08-09T01:27:09.066156Z","submitted_at":"2025-05-27T18:25:21Z","title":"AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T13:30:23.064115Z"},"links":{"cited_paper":"/paper/2402.03126","citing_paper":"/paper/2505.21651"},"observation_digest":"sha256:44ad38895b306a15119ed46a7cc0b54cf079caffb68b7d9e8166feead91bc928","observation_id":"4ddf0f5f-4ee3-4ef8-8117-8dfa3e70f1be","resolution":{"observed_at":"2026-08-07T13:30:23.064115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03126","last_updated":"2024-10-20T11:36:13Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T15:51:49Z","title":"How Free is Parameter-Free Stochastic Optimization?","version":3},"cited_work":{"arxiv_id":"2402.03126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03126","snapshot_observed_at":"2026-07-03T17:08:43.681463Z","title":"How free is parameter-free stochastic optimization?arXiv preprint arXiv:2402.03126, 2024","venue":null,"work_id":"3a299127-979b-4665-8214-b1148718f8b1","year":2024},"citing_paper":{"arxiv_id":"2606.14970","last_updated":"2026-06-22T08:40:27Z","snapshot_observed_at":"2026-07-06T23:52:28.557859Z","submitted_at":"2026-06-12T21:46:54Z","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T04:33:10.554853Z"},"links":{"cited_paper":"/paper/2402.03126","citing_paper":"/paper/2606.14970"},"observation_digest":"sha256:0f7454ca79e2da062b1b41c48b40cf40aaefaf26aa4ffdc84ae911b3c5785427","observation_id":"ba602019-a0e1-44f4-990a-81ec68c90b27","resolution":{"observed_at":"2026-07-03T17:08:43.683014Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.03126/citation-record","integrity":"/paper/2402.03126/integrity","json":"/paper/2402.03126/citation-record.json","paper":"/paper/2402.03126"},"outbound":[],"paper":{"arxiv_id":"2402.03126","last_updated":"2024-10-20T11:36:13Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T15:51:49Z","title":"How Free is Parameter-Free Stochastic Optimization?"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.03126."}