{"as_of":"2026-08-15T16:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d40d931ecc296c8098c372329e2ed3f395889dc2ab318fb34cc1b717203d43d9","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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-10T22:41:42.388251Z","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-21T19:10:30.817625Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.13391","last_updated":"2023-04-12T04:55:01Z","snapshot_observed_at":"2026-08-13T18:03:57.140688Z","submitted_at":"2021-09-27T23:22:47Z","title":"Curvature-Aware Derivative-Free Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.13391","snapshot_observed_at":"2026-08-10T22:41:42.388251Z","title":"Curvature- aware derivative-free optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.01045","last_updated":"2025-06-06T07:00:41Z","snapshot_observed_at":"2026-08-15T11:20:39.857239Z","submitted_at":"2025-01-02T04:10:17Z","title":"ZeroFlow: Overcoming Catastrophic Forgetting is Easier than You Think","version":4},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:42.388251Z"},"links":{"cited_paper":"/paper/2109.13391","citing_paper":"/paper/2501.01045"},"observation_digest":"sha256:dd3c6952c824981c7811db5b205c0cd6d5fb1409520a4eb98cc9e4f5737568ca","observation_id":"9bde1f35-590f-436f-a559-51aa75044f46","resolution":{"observed_at":"2026-08-10T22:41:42.388251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.13391","last_updated":"2023-04-12T04:55:01Z","snapshot_observed_at":"2026-08-13T18:03:57.140688Z","submitted_at":"2021-09-27T23:22:47Z","title":"Curvature-Aware Derivative-Free Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.13391","snapshot_observed_at":"2026-08-10T18:14:14.250571Z","title":"arXiv preprint arXiv:2109.13391 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11616","last_updated":"2025-07-14T21:39:17Z","snapshot_observed_at":"2026-08-15T07:16:41.371269Z","submitted_at":"2025-01-20T17:27:03Z","title":"Fully Adaptive Zeroth-Order Method for Minimizing Functions with Compressible Gradients","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:14.250571Z"},"links":{"cited_paper":"/paper/2109.13391","citing_paper":"/paper/2501.11616"},"observation_digest":"sha256:9c41737b91828fe9e3746d753464c9cb258a67779b0e9b8db7884043c640554c","observation_id":"c9948751-067a-4767-80eb-5cef4d5b433e","resolution":{"observed_at":"2026-08-10T18:14:14.250571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.13391","last_updated":"2023-04-12T04:55:01Z","snapshot_observed_at":"2026-08-13T18:03:57.140688Z","submitted_at":"2021-09-27T23:22:47Z","title":"Curvature-Aware Derivative-Free Optimization","version":2},"cited_work":{"arxiv_id":"2109.13391","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.13391","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Curvature-aware derivative-free optimization","venue":null,"work_id":"d685496f-b651-4a3d-9437-c8aa487a71a4","year":2021},"citing_paper":{"arxiv_id":"2511.01126","last_updated":"2026-05-19T10:24:36Z","snapshot_observed_at":"2026-07-06T22:34:43.577332Z","submitted_at":"2025-11-03T00:29:36Z","title":"Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimization","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-21T19:07:11.343101Z"},"links":{"cited_paper":"/paper/2109.13391","citing_paper":"/paper/2511.01126"},"observation_digest":"sha256:ef4c3b7a0f83cafa2e3eb3a1fee710a879aab28d6e6a366030434b08c7efb59b","observation_id":"fbd59844-0d08-4dd9-ae8b-787a90717172","resolution":{"observed_at":"2026-05-21T19:10:30.820090Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.13391/citation-record","integrity":"/paper/2109.13391/integrity","json":"/paper/2109.13391/citation-record.json","paper":"/paper/2109.13391"},"outbound":[],"paper":{"arxiv_id":"2109.13391","last_updated":"2023-04-12T04:55:01Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T18:03:57.140688Z","submitted_at":"2021-09-27T23:22:47Z","title":"Curvature-Aware Derivative-Free 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2109.13391."}