{"as_of":"2026-08-15T14:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe2fe2d72cb2c0d497f9f12f067bc11feadb33d5f11c1c25f5d170b302776c6f","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-15T06:32:42.880941+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-15T06:35:42.224553Z","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:15e3347ccf06c17b86cd6ab50eb31c7c0eca5d47f74d8b36de000d689fb8d05c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:6706da9cfad842bb567dc579e73bd0c3bcc0fe2cc21a5b8e733790e56e9f99ed","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:03de96118e0ec490fdf90e26663a8f937d00ff0074cc492959b1f83795ded7ed","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:6c624873333e05663f59f644de6ceeac10ecc537f3b122e934a5628c35c519d1","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:4564b6f01ec503a062a3a4d1fc9412acf4ec115010f3329fb830b28cea2c78ff","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:0c91a51a4873a680e07d88e0f9ebd2c85156b2fcf54d6315874648baa8b1b3a5","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:71683abfe54b286e73f7a724045d9892ae81679c8626bf4b8cbd130c429eacf0","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:033078ef3f4e382b64885b88ef67b74d2bd497f0ba7f80ef33b8b3223853822f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:e15d65120c32a4e2cf87feb1f2acc5163268ddbd312c75fb66597001a5bf4069","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:fddf630f57aac3455413a88be100a037273827f48cc32d3f9f6925361542871f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:326f317a727b5ad94844e78a0bc2ae8b06536b2558d9f807dff1dd73c6a8a4e9","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:df389835288ee47472f0a889194a80171de8f717c439d67a6d0fff74800b8335","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-06T05:10:58.923264Z","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-15T06:35:42.224553Z","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:b579775fd190d3979e8528901b8b071aeceb3f34a2315007f1cda2709b9eda49","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-14T20:21:59.319940Z","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-15T06:35:42.224553Z","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:00452a940abe2284ee8432e1fc68fe227e55172fd1c75bbbc1c05d4abf915aa3","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-15T06:35:42.224553Z","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:f46d11d249edec467a8d3a78f7be40297f305cc25cf5d0bf1fe95d11ae177003","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:3b6d4f12d676bad705890022445f49067bde8cd795e34d1e883520ce9b024ea2","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-15T06:35:42.224553Z","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:6d76e3b8068403001f74f12c9dbe8ba48ebcdf0d3cc718551df81593810ed4b6","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:15d57cbf5143b7cb8d66de798fdec74bbdbec61a9d5c5f5adfe7f1d3057728ff","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:450728082cc5c94f8badfc2df7d2ffb9d845fe881d0edcbc1652ae126f933cbb","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:09ee751dd7ded5b9b5a288f5487e44cf3d60e0005f98eb81f5698d7a850e1f8e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T21:59:15.300669Z","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-15T06:35:42.224553Z","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:4530b8a0f73f84d31e8b2e114a7db0396406264df602f433f019ab6a04b3c3f2","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-15T06:35:42.224553Z","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:fd96f9eb11405a1b87a037625f4db8e0a801fcc7d2d596827c03980ba8b35c10","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-15T06:35:42.224553Z","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:a6c2294774a469a7d74065cd7cbc2127f6544a5742232c8c21760e90b46a27b6","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T20:36:00.152774Z","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-15T06:35:42.224553Z","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:dd3a1ba2fc7ff4c8cf8bf83a472f6417eb5b2f0452a66a82d86bd80f6a3a9adc","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-15T06:35:42.224553Z","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:342b5a369c77b360e48ea6b86a9ac83374807b9b7d185f48819f361ebc035a65","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:a110f10a4fff5bf6fc6b4884c3dc55cf2e009e6cc1c42421a950548e07e0a558","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-15T06:35:42.224553Z","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:9c184cfcd8190180bfb115c93dcc6c04d1810d8692b2653652a41e0fe0d157b4","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:3122de2bb43067a8b65f5503b9ab68bf4336addbf167e180dd0c264e1233fb86","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:f82d0b6b96e1539718cc956b061a13b717b7e4f7b4561bed6ef7aab079c72356","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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:7a66bb04b628841e62442f748d723bccca0707641020a55b79e6f00bc6a8f67f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:35:42.224553Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.01753."}