{"as_of":"2026-08-10T09:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e14c9f72adfb8d9c08df692cc14bca7c0a377ad2506953fec0734de934c1b9c","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-10T06:31:04.303077+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-09T04:11:15.390246Z","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-08T11:34:10.567415Z","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-09T05:48:34.061324Z","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:8fa3fda7b3d14134f852acbbb5e381e5e409afc2184e4515af277695dbb3d05a","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-08T11:34:10.567415Z","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-08T22:31:25.803100Z","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:a40e31867357ab78a080925d04f69fbb2a049ec0257e6d5d86adc253d37f2fbb","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-08T11:34:10.567415Z","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-01T13:20:46.705139Z","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:4f9476bcfb6d7cc24f6f8bfaee34919660bf6e5b0202eb208786c6a5d6cdae35","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-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/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-08T11:34:10.567415Z","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-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 3 inbound Pith citation observations for arXiv:2208.07095."}