{"as_of":"2026-08-18T15:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed2451673f7682ce5223a09f4581c4af22a00a16a439bfc31ba47eadb6e962fd","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-18T06:34:40.430872+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-12T00:04:19.620060Z","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-21T03:19:29.055060Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.07095","last_updated":"2023-09-29T09:44:49Z","snapshot_observed_at":"2026-08-16T16:39:11.923904Z","submitted_at":"2022-08-15T09:53:58Z","title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.07095","snapshot_observed_at":"2026-08-12T00:04:19.620060Z","title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.02079","last_updated":"2025-08-26T01:33:52Z","snapshot_observed_at":"2026-08-11T23:48:49.222291Z","submitted_at":"2024-12-03T01:48:27Z","title":"A simple and practical adaptive trust-region method","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T00:04:19.620060Z"},"links":{"cited_paper":"/paper/2208.07095","citing_paper":"/paper/2412.02079"},"observation_digest":"sha256:fd409c8dec1a1eaa28eaaff9c831d9ea4a8cb5eb361217d5f5677f67b1a41b83","observation_id":"20cc988b-fc03-46fa-be98-80c9f03c0064","resolution":{"observed_at":"2026-08-12T00:04:19.620060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07095","last_updated":"2023-09-29T09:44:49Z","snapshot_observed_at":"2026-08-16T16:39:11.923904Z","submitted_at":"2022-08-15T09:53:58Z","title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.07095","snapshot_observed_at":"2026-08-09T04:11:15.390246Z","title":"and Roosta, F","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03701","last_updated":"2025-07-14T08:23:39Z","snapshot_observed_at":"2026-08-15T20:46:32.906627Z","submitted_at":"2025-02-06T01:22:23Z","title":"First-ish Order Methods: Hessian-aware Scalings of Gradient Descent","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T04:11:15.390246Z"},"links":{"cited_paper":"/paper/2208.07095","citing_paper":"/paper/2502.03701"},"observation_digest":"sha256:0c4c076f6cb65fdabd5118dfc2eab34abade07ba71d832e7c8f868305224e0a6","observation_id":"8a249761-49e7-4163-9b03-5fe38e8a97fb","resolution":{"observed_at":"2026-08-09T04:11:15.390246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07095","last_updated":"2023-09-29T09:44:49Z","snapshot_observed_at":"2026-08-16T16:39:11.923904Z","submitted_at":"2022-08-15T09:53:58Z","title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.07095","snapshot_observed_at":"2026-08-05T14:51:14.749690Z","title":"Liu and F","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.20967","last_updated":"2025-08-28T16:23:04Z","snapshot_observed_at":"2026-08-10T20:38:37.569572Z","submitted_at":"2025-08-28T16:23:04Z","title":"Active-set Newton-MR methods for nonconvex optimization problems with bound constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:51:14.749690Z"},"links":{"cited_paper":"/paper/2208.07095","citing_paper":"/paper/2508.20967"},"observation_digest":"sha256:a7630637f9efcffc2af0f9c772f2de3dc8aa58d82cd407364c818ebfdf306d38","observation_id":"c4dce74f-96a0-4799-aba9-420207725749","resolution":{"observed_at":"2026-08-05T14:51:14.749690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07095","last_updated":"2023-09-29T09:44:49Z","snapshot_observed_at":"2026-08-16T16:39:11.923904Z","submitted_at":"2022-08-15T09:53:58Z","title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","version":2},"cited_work":{"arxiv_id":"2208.07095","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.07095","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9c7623a8-53f6-401d-b622-f67039594e99","year":2023},"citing_paper":{"arxiv_id":"2605.21425","last_updated":"2026-05-20T17:17:57Z","snapshot_observed_at":"2026-08-12T19:11:08.828710Z","submitted_at":"2026-05-20T17:17:57Z","title":"Achieving Material Robustness via Symmetric Stress Finite Element Discretizations","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-21T03:14:29.220640Z"},"links":{"cited_paper":"/paper/2208.07095","citing_paper":"/paper/2605.21425"},"observation_digest":"sha256:49ded9e1fc741a046ca63c30dd74037a506685f6441d5b21bb4b7d3f12fcc7be","observation_id":"85aeebc0-7018-4902-97f7-7cbefc6493f7","resolution":{"observed_at":"2026-05-21T03:19:29.057386Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.07095/citation-record","integrity":"/paper/2208.07095/integrity","json":"/paper/2208.07095/citation-record.json","paper":"/paper/2208.07095"},"outbound":[],"paper":{"arxiv_id":"2208.07095","last_updated":"2023-09-29T09:44:49Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T16:39:11.923904Z","submitted_at":"2022-08-15T09:53:58Z","title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2208.07095."}