{"as_of":"2026-08-22T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a870deded371f13c52e6712b4d4d125051d89f41d206da9759aa1c4614d4c434","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:14:53.476868Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.01753/citation-record","integrity":"/paper/1908.01753/integrity","json":"/paper/1908.01753/citation-record.json","paper":"/paper/1908.01753"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.854992Z","title":"Convergence of the iterates of descent methods for analytic cost functions","venue":null,"work_id":"c7799bc8-5538-46da-846b-dcb972257cd5","year":2005},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.357347Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:28e34721d574fd2f5314236903bb43bafd231e3698e8c2c33a2c42ec2cdb7517","observation_id":"29ae7032-b00a-4d10-8842-0a386eb62ffa","resolution":{"observed_at":"2026-08-14T15:14:53.859374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.842541Z","title":"Efficient approaches f or escaping higher order saddle points in non-convex optimization","venue":null,"work_id":"474846b6-e5e0-46b4-ad21-6892b9413a4d","year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.361900Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:fd190a901882626d307380b50830834fa49828687dd6f0c03b2262b915e544dd","observation_id":"d0179db1-fe1d-4f32-8038-69751b073bbd","resolution":{"observed_at":"2026-08-14T15:14:53.847173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.829804Z","title":"Global optimality of local search for low rank matrix recovery","venue":null,"work_id":"739b4ebd-13fc-4808-8ebd-a244ffe7a79d","year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.366139Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:17184188a546500ad02cbf6f390edfe141d7839fabdf0f7a00cbb16b655bfa00","observation_id":"7c0557ab-f4cf-4651-8ec9-c4982dbce18e","resolution":{"observed_at":"2026-08-14T15:14:53.834224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.817644Z","title":"Accelerated methods for nonconvex optimization","venue":null,"work_id":"5e326c60-c3cb-45ea-a9c6-12e7bc5921d4","year":2018},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.370257Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:0dde4a97833a1eb4692fd437c37b707411006ca46366fa66012a62e18f45280b","observation_id":"638e688a-abe4-4302-8976-d22c94fefdef","resolution":{"observed_at":"2026-08-14T15:14:53.821794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.806025Z","title":null,"venue":null,"work_id":"e0fd8dd3-cbc1-49f9-8cb6-9a0cda161dfc","year":2000},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.374357Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:91fa45c7611cd53faaa81b339599fd0e9362d08c0951e0e45cbf1cad78012a42","observation_id":"aabc920b-e4f1-4f99-94fd-24139aee4d49","resolution":{"observed_at":"2026-08-14T15:14:53.809646Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.794212Z","title":"Identifying and attacking the saddle point p roblem in high-dimensional non- convex optimization","venue":null,"work_id":"a721cf80-b6fb-48b7-8db3-d461656428af","year":2014},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.378311Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:5a8fd9b0cdb1fd18918cc847755c7a6715b579cd283e90da0f814ebe21cc260c","observation_id":"cea6893c-5bbe-4052-95c5-81bdb7284e4d","resolution":{"observed_at":"2026-08-14T15:14:53.798609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.782192Z","title":"Gradient descent can take exponential time to escape saddle points","venue":null,"work_id":"35206f57-d4b9-4102-a960-68e362560c5f","year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.383035Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:12b2c871346ae198eb0588e3a0789d27667cc29cd4d209662b0fd0c2871e335e","observation_id":"b6312465-f5fa-4758-8d42-bd82c5a27abd","resolution":{"observed_at":"2026-08-14T15:14:53.786108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.771001Z","title":"Escaping fr om saddle points–online stochas- tic gradient for tensor decomposition","venue":null,"work_id":"3944da5e-7611-4e6d-b0f0-17ee6fbc8062","year":2015},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.387041Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:659c576e4cd0bbdaf214622f50b91e0a2a8c025349286912d63826f1271c59fc","observation_id":"1a0d68a8-f4f1-45ed-ba10-def9cf9ba760","resolution":{"observed_at":"2026-08-14T15:14:53.774992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.758284Z","title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","venue":null,"work_id":"381cbeec-837b-4c24-be69-fbeb1edd86ba","year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.390844Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:4b28ed3ce84439a2217e3190683431797c63604d9d334927ec118f574ae6a2a2","observation_id":"7ad297b2-54b5-452e-a441-dc9c098fb7ab","resolution":{"observed_at":"2026-08-14T15:14:53.763085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.744532Z","title":"Matrix completion ha s no spurious local minimum","venue":null,"work_id":"e7559684-d252-4a8c-847b-214ea01284a1","year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.394213Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:789e905168730a70b24673fc5b340e0234713b6e342f5e1444b5e14315a666de","observation_id":"8ee16840-204f-4d18-9d3f-45277d82b851","resolution":{"observed_at":"2026-08-14T15:14:53.749640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.731376Z","title":"Newton-type methods fo r unconstrained and linearly con- strained optimization","venue":null,"work_id":"6a8bf539-9d52-4ca7-990f-1c3802290b33","year":1974},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.398608Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:9d8cd7e0d761206690f94920f66fb4d9ff1608a44ee7e55624591e103db7a5ba","observation_id":"fecb838c-37ba-4ed4-8a0b-a4c20a571273","resolution":{"observed_at":"2026-08-14T15:14:53.735525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.718919Z","title":"How to escape saddle points efficiently","venue":null,"work_id":"7108acf4-65fd-4158-b0ab-8b9fa1e51b3f","year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.402411Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:2da29e0cf6722dfe5b995199ae75aa96dcb0d16f90a446c5afbec2651e739db4","observation_id":"41668baf-312f-4e18-ad8f-189f381f8d68","resolution":{"observed_at":"2026-08-14T15:14:53.723144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04836","last_updated":"2017-02-09T20:38:16Z","snapshot_observed_at":"2026-08-15T20:45:29.277746Z","submitted_at":"2016-09-15T20:03:06Z","title":"On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04836","snapshot_observed_at":"2026-08-14T15:14:53.407170Z","title":"On large-batch training for deep learning: G eneralization gap and sharp minima","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.407170Z"},"links":{"cited_paper":"/paper/1609.04836","citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:6efab7a83d9160ecc769d6291f256e676f20f6d420970fd0be4cb48385fbe1bb","observation_id":"7ebca6af-14f5-4c01-97d9-b30cd4af1701","resolution":{"observed_at":"2026-08-14T15:14:53.407170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.07406","last_updated":"2017-10-20T03:34:56Z","snapshot_observed_at":"2026-08-19T18:08:12.593080Z","submitted_at":"2017-10-20T03:34:56Z","title":"First-order Methods Almost Always Avoid Saddle Points","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.07406","snapshot_observed_at":"2026-08-14T15:14:53.411614Z","title":"First-order methods almost always avoid sa ddle points","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.411614Z"},"links":{"cited_paper":"/paper/1710.07406","citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:77428b9c4a254b73243d7a373f469859bfb9349497fc2bbf0b7f82f956e2495c","observation_id":"50aaf26f-96d6-42ba-a530-eb26bbd29da0","resolution":{"observed_at":"2026-08-14T15:14:53.411614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.705584Z","title":"Gradient descent only converges to minimizers","venue":null,"work_id":"75b9fcba-3035-496e-b155-ea55f3281c45","year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.416660Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:0118b67c8544b6622c9cc6cc9c292afc7bca3feddb7b3319dc354c7afed158cd","observation_id":"d24a5c19-d881-4ccb-aa6f-f20cd63c5b88","resolution":{"observed_at":"2026-08-14T15:14:53.711069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.04831","last_updated":"2016-11-15T13:56:24Z","snapshot_observed_at":"2026-08-14T21:30:21.103327Z","submitted_at":"2016-11-15T13:56:24Z","title":"The Power of Normalization: Faster Evasion of Saddle Points","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.04831","snapshot_observed_at":"2026-08-14T15:14:53.420939Z","title":"The power of normalization: Faster evasion o f saddle points","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.420939Z"},"links":{"cited_paper":"/paper/1611.04831","citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:d4b480d5b16337d1687799eb21b7056b6acae47af4b0159ddbcc05d4ca88ef6d","observation_id":"e3cb2e78-9597-4f99-a721-0464f3c2609e","resolution":{"observed_at":"2026-08-14T15:14:53.420939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.693733Z","title":"On the use of directio ns of negative curvature in a modified newton method","venue":null,"work_id":"c2772012-a22e-48cd-a35a-956cc1147efd","year":1979},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.425935Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:c57c3399d9c7dc1265e4bc3838c8dfcf96e806488b4d01c89b63f18fc3546d3d","observation_id":"7f9cfa09-fa42-493c-a8f5-5ffb0a984ca9","resolution":{"observed_at":"2026-08-14T15:14:53.697355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.681721Z","title":"Introductory lectures on convex optimization: A basic cours e, volume 87","venue":null,"work_id":"19f8b878-f0b1-4644-aa97-6673cb31ae1f","year":2013},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.429969Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:120b41213b855e62acd41290957e48358bd0285563858f871576cea682c4f5b7","observation_id":"4d60a9c7-8c09-40bf-965e-92acdd564fce","resolution":{"observed_at":"2026-08-14T15:14:53.685525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.670669Z","title":"Cubic regularizatio n of newton method and its global performance","venue":null,"work_id":"edd03add-3ab2-41d3-82d6-ae577db4db68","year":2006},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.434489Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:384c33a21a17835dbe6e2c4b18a5dd44acd767c02e3f57af0f9205872bc08bda","observation_id":"b5daceb2-7715-4ee8-9139-f5f46630d2b3","resolution":{"observed_at":"2026-08-14T15:14:53.674255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.658794Z","title":"Behavior of accel erated gradient methods near critical points of nonconvex functions","venue":null,"work_id":"75a14143-725b-47a2-a46c-240b715ab5af","year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.438744Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:0c84a391f346a73e4c680945907ce517ae1d24bbe2e87fae6a365c15556eaf64","observation_id":"728e50bf-3ac5-4577-9107-dbef7f781751","resolution":{"observed_at":"2026-08-14T15:14:53.662985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.00405","last_updated":"2016-06-07T07:49:13Z","snapshot_observed_at":"2026-08-19T13:11:24.239530Z","submitted_at":"2016-05-02T09:34:19Z","title":"Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.00405","snapshot_observed_at":"2026-08-14T15:14:53.442432Z","title":"Gradient des cent only converges to minimizers: Non-isolated critical points and invariant regions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.442432Z"},"links":{"cited_paper":"/paper/1605.00405","citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:5f526e3238ff8622c046119dad6b00d1cbb4b5ecf8acf7501cffdf5527c402b6","observation_id":"b2a92c74-a9be-42bd-95d2-9c18102ac73a","resolution":{"observed_at":"2026-08-14T15:14:53.442432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4604","last_updated":"2014-05-28T03:05:00Z","snapshot_observed_at":"2026-08-14T23:33:35.475377Z","submitted_at":"2014-05-19T04:56:30Z","title":"On the saddle point problem for non-convex optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.4604","snapshot_observed_at":"2026-08-14T15:14:53.446649Z","title":"On the saddle point problem for non-convex optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.446649Z"},"links":{"cited_paper":"/paper/1405.4604","citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:e9d4033f6f2f0fe4c334142b79c491295823c2eb9cd478156ee3b5f137f3b683","observation_id":"829e4c88-3321-46df-815f-a0c66494a84d","resolution":{"observed_at":"2026-08-14T15:14:53.446649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.646047Z","title":"Nonconvergence to unstable points in u rn models and stochastic approxima- tions","venue":null,"work_id":"8f53e74c-0256-4966-9db1-4dd024cb4731","year":1990},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.450778Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:47b10c0f55ac03cd71932ec0930c2e5bb3e478c1dabae06a4c582b4d9e3c26d0","observation_id":"41c6ae05-3103-4ae4-b34c-a5f40de5349f","resolution":{"observed_at":"2026-08-14T15:14:53.650372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01434","last_updated":"2017-09-05T14:58:15Z","snapshot_observed_at":"2026-08-19T16:06:37.166660Z","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping Saddle points","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.01434","snapshot_observed_at":"2026-08-14T15:14:53.454597Z","title":"A generic approach for escapin g saddle points","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.454597Z"},"links":{"cited_paper":"/paper/1709.01434","citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:03dfff4356af9a4dd05d807324c460a78d2e79b3fe9a1d6a9d743bad44d45523","observation_id":"f8f7d45b-0dcc-40c5-bc77-328d6122ae86","resolution":{"observed_at":"2026-08-14T15:14:53.454597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.633352Z","title":"Complexity analy sis of second-order line-search algorithms for smooth nonconvex optimization","venue":null,"work_id":"9653db28-7fe1-4523-b9bf-95ca9ec5c22c","year":2018},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.458845Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:b9ceb6fac0ff9a452723b8e2f38afa2da47960c6f8663ccb7d01f5c84a071a29","observation_id":"d6c5486b-4f7c-4c47-a153-7dc1961f40a6","resolution":{"observed_at":"2026-08-14T15:14:53.637453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.462822Z","title":"Global stability of dynamical systems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.462822Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:32c8995521b1b85159fa41c056a63ba052b3326352630375763f9ae339f0aacb","observation_id":"725e6619-6743-4bc6-8d4e-9fb6928795bf","resolution":{"observed_at":"2026-08-14T15:14:53.462822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.613111Z","title":"Theoretical insights into the op- timization landscape of over-parameterized shallow neura l networks","venue":null,"work_id":"f0a8ca3a-adf5-461b-bf22-641b1192e137","year":2019},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.466378Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:492bdff7bcb7f1c421953e440aa6482b968420e2ceedb64e08d2e58cf2094b27","observation_id":"e61ee051-f4ae-49ff-bdfb-4bc0055a24c9","resolution":{"observed_at":"2026-08-14T15:14:53.617166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.600715Z","title":"Complete dictionary re covery over the sphere i: Overview and the geometric picture","venue":null,"work_id":"fe4c304f-5992-4c63-8623-b79b8f0a0e24","year":2016},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.469940Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:6d6dbb37024ffa97e577c00258f5a7ea9eb2f348d4040f99dc97e662b4e8b81d","observation_id":"1a9b39ce-c647-4dba-bfdb-f4bed8c074b3","resolution":{"observed_at":"2026-08-14T15:14:53.604849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.588257Z","title":"Complete dictionary re covery over the sphere ii: Recovery by riemannian trust-region method","venue":null,"work_id":"123d8401-3ab0-4d77-9849-af6cc0be9129","year":2017},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.473317Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:d15b41a57f6eea61d87e8ee622853af1f949071654c3bb659588e3fe9cff235b","observation_id":"5d0b4f4a-164b-46ca-aa34-f67e52621631","resolution":{"observed_at":"2026-08-14T15:14:53.592657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:53.573891Z","title":"A geometric analysis of phase retrieval","venue":null,"work_id":"c065e5c8-3637-402e-ba67-ef29571bcc1e","year":2018},"citing_paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:53.476868Z"},"links":{"citing_paper":"/paper/1908.01753"},"observation_digest":"sha256:ef21c961f4e820093a03e20d38f9ecd1e9189af6a476f10d95a15f3da62e0b19","observation_id":"d0edd064-e6bf-445c-9e08-2d5b4122a3d7","resolution":{"observed_at":"2026-08-14T15:14:53.579724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01753","last_updated":"2019-08-05T17:50:55Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-19T18:08:56.180365Z","submitted_at":"2019-08-05T17:50:55Z","title":"Extending the step-size restriction for gradient descent to avoid strict saddle points"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":30},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.01753."}