{"as_of":"2026-08-19T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c9e89c5e7915d0ba6d04941361497e47409b7c12019565f52c15f480060190b","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-19T06:32:44.657259+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:06:11.231512Z","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-19T21:12:47.240767Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.06642","last_updated":"2021-04-28T13:06:24Z","snapshot_observed_at":"2026-08-18T21:20:28.809610Z","submitted_at":"2020-10-13T19:18:15Z","title":"High-Order Oracle Complexity of Smooth and Strongly Convex Optimization","version":2},"cited_work":{"arxiv_id":"2010.06642","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.06642","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2010.06642 , year=","venue":null,"work_id":"6095a11f-7fbc-48b0-94c4-53bc447cf869","year":2010},"citing_paper":{"arxiv_id":"2605.06431","last_updated":"2026-05-07T15:35:15Z","snapshot_observed_at":"2026-08-18T16:51:32.605010Z","submitted_at":"2026-05-07T15:35:15Z","title":"Second-Order Bilevel Optimization with Accelerated Convergence Rates","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T08:08:45.069685Z"},"links":{"cited_paper":"/paper/2010.06642","citing_paper":"/paper/2605.06431"},"observation_digest":"sha256:3641d02df56e5fd3c103484c1acdad09ec2ec90bfb06eaf96a1afb5e048926c6","observation_id":"81c0964f-5de2-43d9-8587-3737eea5a9c0","resolution":{"observed_at":"2026-05-11T20:46:11.061567Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.06642","last_updated":"2021-04-28T13:06:24Z","snapshot_observed_at":"2026-08-18T21:20:28.809610Z","submitted_at":"2020-10-13T19:18:15Z","title":"High-Order Oracle Complexity of Smooth and Strongly Convex Optimization","version":2},"cited_work":{"arxiv_id":"2010.06642","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.06642","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2010.06642 , year=","venue":null,"work_id":"6095a11f-7fbc-48b0-94c4-53bc447cf869","year":2010},"citing_paper":{"arxiv_id":"2605.16875","last_updated":"2026-07-08T09:40:22Z","snapshot_observed_at":"2026-08-16T11:24:21.264600Z","submitted_at":"2026-05-16T08:36:29Z","title":"Stochastic Optimization and Data Science","version":1},"reference_index":129,"source":"arxiv_source","source_observed_at":"2026-05-19T21:08:29.524132Z"},"links":{"cited_paper":"/paper/2010.06642","citing_paper":"/paper/2605.16875"},"observation_digest":"sha256:c7caa8a26cf1be066ad87fe92eb22a5b2297348360235463eaa1ddbd65b92005","observation_id":"98b523f1-d318-47f9-a057-6ea1a9aab8ec","resolution":{"observed_at":"2026-05-19T21:12:47.242680Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.06642","last_updated":"2021-04-28T13:06:24Z","snapshot_observed_at":"2026-08-18T21:20:28.809610Z","submitted_at":"2020-10-13T19:18:15Z","title":"High-Order Oracle Complexity of Smooth and Strongly Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.06642","snapshot_observed_at":"2026-08-10T22:06:11.231512Z","title":"arXiv preprint arXiv:2010.06642 , year =","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.06719","last_updated":"2026-08-07T02:27:02Z","snapshot_observed_at":"2026-08-17T16:02:33.206017Z","submitted_at":"2026-08-07T02:27:02Z","title":"The Blessing and Curse of Curvature in Higher-Order Optimization: Horospherical versus Geodesic Convexity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T22:06:11.231512Z"},"links":{"cited_paper":"/paper/2010.06642","citing_paper":"/paper/2608.06719"},"observation_digest":"sha256:cec9153f1311003d37a44e6b37f3f3d23fb2bcba2ec2d48c131e5bc375ed0f04","observation_id":"7b5585a4-6109-4b88-8552-6e37b0f4b4d1","resolution":{"observed_at":"2026-08-10T22:06:11.231512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2010.06642/citation-record","integrity":"/paper/2010.06642/integrity","json":"/paper/2010.06642/citation-record.json","paper":"/paper/2010.06642"},"outbound":[],"paper":{"arxiv_id":"2010.06642","last_updated":"2021-04-28T13:06:24Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T21:20:28.809610Z","submitted_at":"2020-10-13T19:18:15Z","title":"High-Order Oracle Complexity of Smooth and Strongly Convex 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2010.06642."}