{"as_of":"2026-08-08T17:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:776b1a870f9fb51a94007a51b5275b51f65c120584e8a2b7ee058dc2895fc69a","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-08T06:32:00.761636+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-01T12:17:40.208101Z","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-04T13:09:51.340861Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.07180","last_updated":"2017-09-21T07:06:26Z","snapshot_observed_at":"2026-07-06T06:00:38.265995Z","submitted_at":"2017-09-21T07:06:26Z","title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization","version":1},"cited_work":{"arxiv_id":"1709.07180","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.07180","snapshot_observed_at":"2026-07-04T13:09:51.340861Z","title":"Birgin, J.L","venue":null,"work_id":"20357ed2-4c19-49f5-b27b-4688e27c5bf1","year":2017},"citing_paper":{"arxiv_id":"2606.05438","last_updated":"2026-06-03T21:01:21Z","snapshot_observed_at":"2026-08-08T08:09:48.747157Z","submitted_at":"2026-06-03T21:01:21Z","title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T06:50:05.151386Z"},"links":{"cited_paper":"/paper/1709.07180","citing_paper":"/paper/2606.05438"},"observation_digest":"sha256:994ed0558bbb2fabf570f735a2202daf8359c5fb2846ab6102e4aae05c4564f6","observation_id":"6051cb2d-570c-418b-9b8a-e278da8a760c","resolution":{"observed_at":"2026-07-02T07:36:45.171142Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.07180","last_updated":"2017-09-21T07:06:26Z","snapshot_observed_at":"2026-07-06T06:00:38.265995Z","submitted_at":"2017-09-21T07:06:26Z","title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization","version":1},"cited_work":{"arxiv_id":"1709.07180","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.07180","snapshot_observed_at":"2026-07-04T13:09:51.340861Z","title":"Birgin, J.L","venue":null,"work_id":"20357ed2-4c19-49f5-b27b-4688e27c5bf1","year":2017},"citing_paper":{"arxiv_id":"2606.27082","last_updated":"2026-06-25T14:20:03Z","snapshot_observed_at":"2026-08-07T21:42:58.159964Z","submitted_at":"2026-06-25T14:20:03Z","title":"Finding Stationary Points by Comparisons","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T05:26:07.720218Z"},"links":{"cited_paper":"/paper/1709.07180","citing_paper":"/paper/2606.27082"},"observation_digest":"sha256:26076f94bab4bbb04046c9baee4224a28be413dde2978b0b38cee8c21a4ee68c","observation_id":"24cad8e1-f6f5-43cf-aab9-d325425dddb4","resolution":{"observed_at":"2026-07-04T13:09:51.342070Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.07180","last_updated":"2017-09-21T07:06:26Z","snapshot_observed_at":"2026-07-06T06:00:38.265995Z","submitted_at":"2017-09-21T07:06:26Z","title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.07180","snapshot_observed_at":"2026-08-01T12:17:40.208101Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-07T12:20:17.801478Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.208101Z"},"links":{"cited_paper":"/paper/1709.07180","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:921fdf76f9960896f50c1042f2da632d387b5d005fae77efb7ded9fa2fae1ec7","observation_id":"548a188a-c952-4e32-90e5-9a33434942e3","resolution":{"observed_at":"2026-08-01T12:17:40.208101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1709.07180/citation-record","integrity":"/paper/1709.07180/integrity","json":"/paper/1709.07180/citation-record.json","paper":"/paper/1709.07180"},"outbound":[],"paper":{"arxiv_id":"1709.07180","last_updated":"2017-09-21T07:06:26Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T06:00:38.265995Z","submitted_at":"2017-09-21T07:06:26Z","title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1709.07180."}