{"as_of":"2026-08-19T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7d0e723d1aa43e900a9a10040b48bca3118b0601a625926d036a1cb57e20556","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:52:08.047656Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2411.10378/citation-record","integrity":"/paper/2411.10378/integrity","json":"/paper/2411.10378/citation-record.json","paper":"/paper/2411.10378"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.881839Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.881839Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:45ffb80460b0db6f7b504aa4f339de4cf320f862417e9b2dabbda7e903f0c7be","observation_id":"7fe6007d-7948-45e4-a9e7-6fb62f70210c","resolution":{"observed_at":"2026-08-12T19:52:07.881839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.04639","last_updated":"2021-04-06T14:18:57Z","snapshot_observed_at":"2026-08-18T14:42:19.190318Z","submitted_at":"2020-05-10T12:31:00Z","title":"Adaptive Regularization for Nonconvex Optimization Using Inexact Function Values and Randomly Perturbed Derivatives","version":3},"cited_work":{"arxiv_id":"2005.04639","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.04639","snapshot_observed_at":"2026-08-12T19:52:08.123096Z","title":"Adaptive Regularization for Nonconvex Optimization Using Inexact Function Values and Randomly Perturbed Derivatives","venue":"math.OC","work_id":"6ec2a914-36be-477f-ac70-b8d2069e49e2","year":2020},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.885734Z"},"links":{"cited_paper":"/paper/2005.04639","citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:e3933c31599d8452957e7188844ca276f957a86b274c0bf4bd77f50b7640e873","observation_id":"785c1dfb-2c33-4206-84d9-14c356293878","resolution":{"observed_at":"2026-08-12T19:52:08.126539Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.536812Z","title":"Topology optimization: theory, methods, and applications","venue":null,"work_id":"b35f52fd-4cd7-4177-80b5-a8a94abd5728","year":2013},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.889529Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:12c06c0be12d768167f0611ecdc5988fdd99c4e7abf767fcbdab1ff47412de68","observation_id":"53df3a88-c450-4b58-ba12-bea600709ef7","resolution":{"observed_at":"2026-08-12T19:52:08.540039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.528261Z","title":"An investigation of newton-sketch and subsampled newton methods","venue":null,"work_id":"9ec342f6-0fe4-46b0-8ec5-ce9d8fdc5e45","year":2020},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.892769Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:a454cd60d054050adcababe70d74fcfc6a332219601a20fed8dd34bf22895483","observation_id":"8eef361d-3877-466b-8d10-cebb5112e9c7","resolution":{"observed_at":"2026-08-12T19:52:08.531395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.00712","last_updated":"2023-03-21T23:49:49Z","snapshot_observed_at":"2026-08-18T12:23:15.047121Z","submitted_at":"2022-06-01T18:49:50Z","title":"An Adaptive Sampling Sequential Quadratic Programming Method for Equality Constrained Stochastic Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00712","snapshot_observed_at":"2026-08-12T19:52:07.895951Z","title":"An adaptive sampling sequential quadratic programming method for equality constrained stochastic opti- mization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.895951Z"},"links":{"cited_paper":"/paper/2206.00712","citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:8d40357e03a799ea5eed2d7956b0afaf138df5cf984585b28e4751b31eb454e6","observation_id":"1fd10ce1-bbc0-46d0-ad0c-b2150ff7ba82","resolution":{"observed_at":"2026-08-12T19:52:07.895951Z","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-12T19:52:08.519335Z","title":"Global convergence rate anal- ysis of a generic line search algorithm with noise","venue":null,"work_id":"86087e4f-606f-48f6-a77f-3145ec19cb69","year":2021},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.899395Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:68591187d3fcd6cdb8d31b42bc075926106845b84ab9f2bd8acd1a14db2b03fe","observation_id":"208ba083-5ac9-48f0-a986-36d1737c0302","resolution":{"observed_at":"2026-08-12T19:52:08.522762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.510822Z","title":"Nonlinear programming","venue":null,"work_id":"92018bc7-d68f-4373-89ed-8020d312f823","year":1997},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.902748Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:d0b34b1761cb013c660792d3128eb6cb7e53b7d2f67666a7cad49dd657e07669","observation_id":"f0162246-dc16-4810-b472-9775b11436cd","resolution":{"observed_at":"2026-08-12T19:52:08.513863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.905752Z","title":"Nonlinear programming: concepts, algorithms, and applications to chemical processes","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.905752Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:df1df446e3c408dd18001395a98cc82a7c370f1cbb4f5d33691962d57febe346","observation_id":"8322f894-79a8-4fcd-b30e-68b48282a65b","resolution":{"observed_at":"2026-08-12T19:52:07.905752Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.908674Z","title":"Adaptive sampling strategies for stochastic optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.908674Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:b0ff13a19fca6221ad7cd766d4e4dcc59044690ce8780b357f99401f121e379b","observation_id":"c7e5f58c-661c-44e7-a92d-aec3d6907993","resolution":{"observed_at":"2026-08-12T19:52:07.908674Z","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-12T19:52:08.492116Z","title":"Exact and inexact subsam- pled newton methods for optimization.IMA Journal of Numerical Analysis, 39(2):545– 578, 2019","venue":null,"work_id":"1aafe8a5-d195-4267-8ce8-68fc4d292fb8","year":2019},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.911545Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:a474d0bde76a3b0c54a0cbf6becf0e924c3dcf6a6bb43444b2f370d9edde8179","observation_id":"49d9e9ca-8871-4a76-b6ce-15535da4fc5d","resolution":{"observed_at":"2026-08-12T19:52:08.495423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.482303Z","title":"A progressive batching l-bfgs method for machine learning","venue":null,"work_id":"0cab44c0-c788-4c13-80e7-6992a7b9f489","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.914544Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:a98b081e5e2357bee6fb59dbfdfb6f2d2819e5d03828cb6abf734bf37a22aa13","observation_id":"eaa9d7d1-6e2c-4349-b060-924a8b364ab4","resolution":{"observed_at":"2026-08-12T19:52:08.485726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.473023Z","title":"Optimization methods for large- scale machine learning","venue":null,"work_id":"b332c34e-d6a6-443a-bbb7-94402c1c4c0d","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.917416Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:1c29f679286fa9bc61463a82338fd99072a8288ba78d4a7baf66772b20ce4227","observation_id":"c2b3f5bc-cb91-44e1-8a23-0fd7d8f2e0a5","resolution":{"observed_at":"2026-08-12T19:52:08.476238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.464060Z","title":"On the use of stochastic hessian information in unconstrained optimization","venue":null,"work_id":"df1d9ec4-3fba-466d-8f32-d20422031f7b","year":2011},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.920170Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:54fca0ca474f2b552c0968346439630f8caf41707ccfb57d27c0a47ef1995eaf","observation_id":"a623a31a-df1e-42af-9ffc-8591966bac7e","resolution":{"observed_at":"2026-08-12T19:52:08.467412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.454899Z","title":"Sample size se- lection in optimization methods for machine learning","venue":null,"work_id":"c25ffa25-c88d-4acb-9a31-2016f8e57946","year":2012},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.922939Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:bb81605d4c21d471e90ff74cd6351a81a82014a17b74ffdb7916c2a776b3ba27","observation_id":"007c77d4-dab4-4315-b4fe-63263b1c6ea6","resolution":{"observed_at":"2026-08-12T19:52:08.458125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.445976Z","title":"First-and second-order high probability complexity bounds for trust-region methods with noisy oracles","venue":null,"work_id":"a4e7cedd-99a7-4bc4-9378-91f6c72e0f34","year":2024},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.925751Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:dfb247079fa3eb6fb78f3c3bc18a20c476fb30fe35f3693d81c19d7cecdca5fd","observation_id":"7451ba61-cc45-42c5-86e5-6db66d2d7769","resolution":{"observed_at":"2026-08-12T19:52:08.449243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.437179Z","title":"Accelerated methods for nonconvex optimization","venue":null,"work_id":"ed37e0fb-9f0d-465d-a67a-24ac613d8b5c","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.928570Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:771198bf5aa3c895c5e90276cb16d73594e5dbbc6c15f01cb42457cc93d11b7c","observation_id":"69a2a0cc-b8b6-44a8-8e60-d629fbd2f5ed","resolution":{"observed_at":"2026-08-12T19:52:08.440392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.931340Z","title":"On the global convergence of trust region algorithms using inexact gradient information","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.931340Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:c136f7aa91f70b4084563be040e25d498009f52932c451800c424f654fce8a90","observation_id":"152fe554-8b13-43db-ba29-9dc345d01e88","resolution":{"observed_at":"2026-08-12T19:52:07.931340Z","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-12T19:52:08.423682Z","title":"Global convergence rate analysis of uncon- strained optimization methods based on probabilistic models","venue":null,"work_id":"3e9436a1-8466-4a0f-a5f3-51a1b2baf5a8","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.934217Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:3a91a699b8ae34b2f82101ee8e9e0356ebc11c780de43cd01e359053c6071048","observation_id":"c11c496e-0c69-4e38-b132-4413ccf472ef","resolution":{"observed_at":"2026-08-12T19:52:08.426875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.414837Z","title":"A nonlinear conjugate gradi- ent method with complexity guarantees and its application to nonconvex regression","venue":null,"work_id":"341bfd5b-e061-4d54-a235-2bda08c0805f","year":2022},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.936977Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:240fc291d9638b42cbaa911ab280c3303320e5cd66747f23a7e3ab8379274dfd","observation_id":"8bb13ff6-20ac-4435-9724-79c26cf942b4","resolution":{"observed_at":"2026-08-12T19:52:08.418149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.940048Z","title":"Libsvm: a library for support vector machines","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.940048Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:25aedde0251e2cf14198cea9cc192e16dd36089fef9d625667741ee0e211f604","observation_id":"5c69443f-074d-4249-bc98-df16b9f14fc8","resolution":{"observed_at":"2026-08-12T19:52:07.940048Z","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-12T19:52:08.400858Z","title":"Exploiting negative curvature in deterministic and stochastic optimization","venue":null,"work_id":"c2d529da-872e-4d22-adc2-f72ce6576062","year":2019},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.942900Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:2783dbee63b17dbb3d48bc7b1e9746ea6787544b5724eae14ba11b1207c9f4e7","observation_id":"01a04d45-829c-414c-987c-248c691df74d","resolution":{"observed_at":"2026-08-12T19:52:08.404130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.392366Z","title":"Trust- region newton-cg with strong second-order complexity guarantees for nonconvex opti- mization","venue":null,"work_id":"8eb8eb4f-bd09-458e-8a42-c019d8cb1267","year":2021},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.945683Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:488d255dece160f72b5a6ec7e6d9357f9414b131bdc5c034badb1cdc2b6914f3","observation_id":"ca3cd264-db3e-4742-8f00-805c728891a3","resolution":{"observed_at":"2026-08-12T19:52:08.395497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.383275Z","title":"Optimization of energy systems","venue":null,"work_id":"de06f02b-47f6-4c36-a8c4-c925aec6b939","year":2017},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.948527Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:45d2de8785ae7911439ce3ee1172c26a2c08c90e3ce020b4232385f551ea8516","observation_id":"d9aaa223-8ff6-4f8d-bd7a-c9d5a7c9391e","resolution":{"observed_at":"2026-08-12T19:52:08.386535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.374215Z","title":"Gradient descent can take exponential time to escape saddle points","venue":null,"work_id":"ff336488-0f96-4809-b1d9-c4140cdabb59","year":2017},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.951288Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:b6303408e34042c9c467c9210981efdb86bd5eddd412fedf4f0742a385a4717e","observation_id":"0d5efc26-79d0-4d96-bb2d-24e5c1abb511","resolution":{"observed_at":"2026-08-12T19:52:08.377445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.365386Z","title":"A modified newton method for mini- mization","venue":null,"work_id":"d4aa11e3-887b-4a3c-970d-0b6f9642fa4f","year":1977},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.954294Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:fae20206c37619a84aaf77dd919c3dfb58b7ecfe2beea7396cfcebd04063e163","observation_id":"ed09a974-aa52-4fd8-85b4-b6027c06a9b4","resolution":{"observed_at":"2026-08-12T19:52:08.368650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.356324Z","title":"Computing modified newton di- rections using a partial cholesky factorization","venue":null,"work_id":"0884e2b7-7f47-4564-8fc5-5cb4b3933a90","year":1995},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.957131Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:bb65d2d92cba1b2257e473e4ea880e256525bdbbbf942af418ea773cdf26aa5b","observation_id":"aa05c96e-eff8-4018-8b61-adafde6c8fd5","resolution":{"observed_at":"2026-08-12T19:52:08.359721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.347646Z","title":"Hybrid deterministic-stochastic methods for data fitting","venue":null,"work_id":"fa10f2a1-08e9-4ad3-bbb1-28cbad0b1635","year":2012},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.960204Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:dc79d5d055626dd3233de2d0c033dbd7271c18bd79575a06e311033a630b2da8","observation_id":"1126a774-1072-49d8-9aed-854f7dd8d512","resolution":{"observed_at":"2026-08-12T19:52:08.350826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.338347Z","title":"Curvilinear path steplength algorithms for minimization which use directions of negative curvature","venue":null,"work_id":"209c3ea1-286c-4190-864a-1045a95a4a1e","year":1980},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.963042Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:fa6c400db9cc47f2fc6d53bd7c8c270732c52501a8e8479fc4160f96b2c7c28d","observation_id":"105223b2-0798-49e0-af66-ea87b1ed2b6b","resolution":{"observed_at":"2026-08-12T19:52:08.341922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.965830Z","title":"Deep learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.965830Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:a3387227c3f16887eb436571d5316b48f101458ae6e2ff8882c453b5729fb9d3","observation_id":"a7de8ae0-ca88-4666-a400-d29a4ce7b759","resolution":{"observed_at":"2026-08-12T19:52:07.965830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20116","last_updated":"2025-03-01T14:11:25Z","snapshot_observed_at":"2026-08-17T14:27:29.249091Z","submitted_at":"2024-05-30T14:52:14Z","title":"Complexity of Zeroth- and First-order Stochastic Trust-Region Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20116","snapshot_observed_at":"2026-08-12T19:52:07.968917Z","title":"Complexity of zeroth-and first- order stochastic trust-region algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.968917Z"},"links":{"cited_paper":"/paper/2405.20116","citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:1131873ebe0c5df5dbdbf959bee2084ddbb0d3d94ecc9d489aae852d441abc95","observation_id":"929bf0c9-0368-4d48-9bc3-9c5badc170fe","resolution":{"observed_at":"2026-08-12T19:52:07.968917Z","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-12T19:52:08.324642Z","title":"Adaptive filter theory","venue":null,"work_id":"5412373a-3d43-48d2-aca1-a78502e0729a","year":2002},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.972043Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:959f27b7eb3cbcc64c34870b526b72e443384f876674576f91f0fd3eebf2615b","observation_id":"680baafa-ff5d-4a0f-9c1e-ebbce17c3fa1","resolution":{"observed_at":"2026-08-12T19:52:08.327977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.974870Z","title":"Methods of conjugate gradients for solving linear systems , volume 49","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.974870Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:d192b3250d22ff3f26a84ff64b705706c37dbab5f5f9dda4a2a3599126dbc67f","observation_id":"18b15d41-c383-47d7-9aee-5f9b3ec62991","resolution":{"observed_at":"2026-08-12T19:52:07.974870Z","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-12T19:52:08.310391Z","title":"How to escape saddle points efficiently","venue":null,"work_id":"4b3b2211-4096-4a89-8f4e-495e0c4e26b8","year":2017},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.977704Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:c3c2c658ba2f61c581b47be7544cfaa6fdb9cc07af97640c4565604f778e09db","observation_id":"0a693abb-c7da-44b5-ab4c-86761406607c","resolution":{"observed_at":"2026-08-12T19:52:08.313637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:07.980574Z","title":"Principal component analysis for special types of data","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.980574Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:31223cd63c40c70917ba00c7dd1af3e73e46d5372498f790aabd69ac38349d82","observation_id":"9389f009-a46f-47ee-a0bd-f03101e44420","resolution":{"observed_at":"2026-08-12T19:52:07.980574Z","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-12T19:52:08.296236Z","title":"An iteration method for the solution of the eigenvalue problem of linear differential and integral operators","venue":null,"work_id":"e0002c8c-c27e-4c04-bb58-ff28c1a90d34","year":1950},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.983470Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:494baddcd8701cf9848802bf0f94c80f354be780d951219989db1549f8b537af","observation_id":"90e35f29-6573-4f0a-bc64-db8801663742","resolution":{"observed_at":"2026-08-12T19:52:08.299458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.287653Z","title":"Planning algorithms","venue":null,"work_id":"c089d6d4-d17e-4199-9405-021a050fd20d","year":2006},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.986329Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:9b80941fe0c160d72dc34eed4e2916c3c61a06b9d548dbdf6bd4f86905bf818b","observation_id":"1e127900-8a89-4fdd-8c63-4f4b9cb8e417","resolution":{"observed_at":"2026-08-12T19:52:08.290697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.277430Z","title":"Gen- eration of whole-body optimal dynamic multi-contact motions","venue":null,"work_id":"11ce705c-e315-45f6-bae4-a7ba4a69519b","year":2013},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.989109Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:5bc054c79c1238529fefd558b60ab2ce42972c47130196cd03af8aab510351ab","observation_id":"e39a1d1b-241f-41ba-8048-44cfe81b75f1","resolution":{"observed_at":"2026-08-12T19:52:08.281884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18841","last_updated":"2024-03-26T17:39:30Z","snapshot_observed_at":"2026-08-16T14:47:58.120163Z","submitted_at":"2023-10-28T22:57:56Z","title":"A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees","version":2},"cited_work":{"arxiv_id":"2310.18841","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.18841","snapshot_observed_at":"2026-08-12T19:52:08.096051Z","title":"A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees","venue":"math.OC","work_id":"6e7d3c82-eda4-476c-9682-3f951707f376","year":2023},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.991908Z"},"links":{"cited_paper":"/paper/2310.18841","citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:0133044b53161afea571ef9288db2d88706e9d3b97b26dd06f2ccf53fa8ceea0","observation_id":"3901c0f3-2cf7-4aee-8099-eaccebb02618","resolution":{"observed_at":"2026-08-12T19:52:08.099544Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.267983Z","title":"Adaptive negative curvature descent with applications in non-convex optimization","venue":null,"work_id":"55fa52d6-430f-4cbe-b719-c9c7f25f34a9","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.995030Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:4cc69474f2eaf7be4a6ef92006aa9160989878eb7e9521d4f9f62cf8da684040","observation_id":"28be3808-26ec-4959-8e28-9af5431414d5","resolution":{"observed_at":"2026-08-12T19:52:08.271251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.08571","last_updated":"2017-10-01T20:47:53Z","snapshot_observed_at":"2026-08-14T20:29:55.954864Z","submitted_at":"2017-09-25T16:19:37Z","title":"On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization","version":2},"cited_work":{"arxiv_id":"1709.08571","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.08571","snapshot_observed_at":"2026-08-12T19:52:08.082009Z","title":"On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization","venue":"math.OC","work_id":"eb1f7e0a-aab3-4455-b917-1d4162200756","year":2017},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:07.997833Z"},"links":{"cited_paper":"/paper/1709.08571","citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:844efeeb2fbacbf304af49603fb72d30d7c190b6e7e31e22053c922439993369","observation_id":"2b14d727-50d4-4823-8e7f-c0a5d59ea2ed","resolution":{"observed_at":"2026-08-12T19:52:08.087320Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.259013Z","title":"Statistical consistency and asymptotic normality for high-dimensional robust m-estimators","venue":null,"work_id":"ee0793d0-42e9-4651-af8b-1c611f23a0ee","year":2017},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.001106Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:5b455e1eca1843201e0881bbe8c38c0a46e138f3dae6b54d7b0ccf8489354121","observation_id":"8fd0d2d4-11a1-49a9-977c-6c7421eb5a5f","resolution":{"observed_at":"2026-08-12T19:52:08.262268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.249652Z","title":"Deep learning via hessian-free optimization","venue":null,"work_id":"e9189cc0-e640-4a3a-a3f1-d5c2824d6d4a","year":2010},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.003987Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:3b1ec514f6f9f9cf493222d58e24c03d845acc88b05c94b38a40dbbbc5804f5c","observation_id":"f83015f6-578e-4f48-a745-7dee15efea33","resolution":{"observed_at":"2026-08-12T19:52:08.253330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.240703Z","title":"On the use of directions of negative curvature in a modified newton method","venue":null,"work_id":"753e9465-6a31-483a-9491-a66227856f7c","year":1979},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.008118Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:5232f5831d6faa80ca98ec34f43dfb1e0b8307f9f26ea45cea7faab2b316d89c","observation_id":"b25a5947-e9a6-447f-bc43-7fe4fc490b22","resolution":{"observed_at":"2026-08-12T19:52:08.244045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.231699Z","title":"Some np-complete problems in quadratic and nonlinear programming","venue":null,"work_id":"e8155fe1-aa4a-4270-b46b-84c63a171910","year":1987},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.011164Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:1e11236c5a092106bbfe7e1f111ecceaa2710889b5ff12d52acd772d54ea5e06","observation_id":"1c4d120e-d611-4d47-a72a-343514dfcf02","resolution":{"observed_at":"2026-08-12T19:52:08.235108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.013958Z","title":"Numerical optimization","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.013958Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:3a03eedb23861b0a30be3cd868a7e5f7f6b0626e5a79ce5f4a1bb48f52f5d6c0","observation_id":"bc304d36-cc7c-4710-9d4a-2433ce20275a","resolution":{"observed_at":"2026-08-12T19:52:08.013958Z","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-12T19:52:08.216842Z","title":"Quadratic programming with one negative eigenvalue is np-hard","venue":null,"work_id":"ebf5e495-94b9-4f25-9ab7-e0edf673aec9","year":1991},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.016806Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:446ecb2511a5725cceef5ca5feb89ccdfc8e50dd0d0b1ad6715cc743fefcd934","observation_id":"37e2405a-4894-41e3-b598-137a1184ef04","resolution":{"observed_at":"2026-08-12T19:52:08.220068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.019668Z","title":"Digital signal processing: principles, algorithms, and applications, 4/E","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.019668Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:b4daaf3759e535bfc107135ac43929f69b8b0c919b096c56eed2e07b84317405","observation_id":"eca33d95-639b-4c1f-85f4-6f419c8a01f3","resolution":{"observed_at":"2026-08-12T19:52:08.019668Z","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-12T19:52:08.201787Z","title":"Engineering optimization: theory and practice","venue":null,"work_id":"5e109867-68c3-46d8-9311-87499e83e7b2","year":2019},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.022532Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:ea784cf20fa1cc21c734117de095d560ec442efe36dcfba8ff8c2e4f958f5477","observation_id":"bd5b340f-0e1e-471d-90aa-86bb4062af7e","resolution":{"observed_at":"2026-08-12T19:52:08.206009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.192793Z","title":"A generic approach for escaping saddle points","venue":null,"work_id":"efa80f18-64b5-4e19-9db6-147c5db494dd","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.025347Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:c448b62ae97710ec07c0429d025eaf44494bfe483fc9523748276985abf292ef","observation_id":"c372cc29-5499-48bd-ac90-866536fc9910","resolution":{"observed_at":"2026-08-12T19:52:08.196085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.028173Z","title":"A newton-cg algorithm with complexity guarantees for smooth unconstrained optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.028173Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:7bec1e95f9ebf125d5578c10cf88036e7b7347782e3fd168766dcaa0e577f8b2","observation_id":"7efa281e-15a5-40d2-86f8-f5a86c0ccc0a","resolution":{"observed_at":"2026-08-12T19:52:08.028173Z","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-12T19:52:08.178674Z","title":"Complexity analysis of second-order line- search algorithms for smooth nonconvex optimization.SIAM Journal on Optimization, 28(2):1448–1477, 2018","venue":null,"work_id":"e83c4427-765c-4927-bd50-b9c95f6bd0ff","year":2018},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.031120Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:729a4f712b0d438453bec8b33ae1d4cbc9578db2a9c403dedcd72aded52a0fe9","observation_id":"898ce850-43d8-4568-bd42-0936abeca0ff","resolution":{"observed_at":"2026-08-12T19:52:08.182227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.169046Z","title":"Chemical process: design and integration","venue":null,"work_id":"e60926b0-f2a4-4853-bde8-2164c3fa983b","year":2005},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.033872Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:c395cf1749501357b6d9d2d271d1cb3d1ed4e838f502006e99d848ca8f159aae","observation_id":"75380be6-f679-452b-a729-5eb80b2f117a","resolution":{"observed_at":"2026-08-12T19:52:08.172877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.159619Z","title":"The conjugate gradient method and trust regions in large scale optimization","venue":null,"work_id":"b0ec53fb-db13-49b8-9ac4-a764c60f56ed","year":1983},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.036643Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:3e907490a330531500f0c78810687c34bbce267a4f9c15e4305aa558b63179fb","observation_id":"59c9c5d4-cc85-46ce-875a-b5bf98ee7ac2","resolution":{"observed_at":"2026-08-12T19:52:08.163285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.150961Z","title":"John Wiley & Sons, 2013","venue":null,"work_id":"095ae9b9-e6ed-4394-b2c3-b3604091d16e","year":2013},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.039422Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:a59fc5b2b751c2b354216dc39f91b2cdddfe015979ade36a9e8e595aaf537f6e","observation_id":"c587241e-a537-4ea6-bd56-e5ab9e460b9e","resolution":{"observed_at":"2026-08-12T19:52:08.153910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.141354Z","title":"Newton-type methods for non- convex optimization under inexact Hessian information","venue":null,"work_id":"e4036540-9016-4a8a-8c25-528fb2659586","year":2020},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.042218Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:a4e0495366d16a17426d2b659f28da07e8ddbbd8fe35019c7cb6c65c6103a6a8","observation_id":"8f862df7-ca79-46d6-8eaa-a4170582987f","resolution":{"observed_at":"2026-08-12T19:52:08.144599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:52:08.132339Z","title":"Robust linear regression: A review and comparison","venue":null,"work_id":"ab4db9b3-3711-4f73-ad2b-37e947fd29c0","year":2017},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.044974Z"},"links":{"citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:7ce18467e461db6078dd86137a9ab2ef9cd85a2cc88c0ed69757b919c875f4a0","observation_id":"7e853053-115a-4cde-9b60-5ce0e43d013c","resolution":{"observed_at":"2026-08-12T19:52:08.135606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.06753","last_updated":"2022-07-08T18:57:15Z","snapshot_observed_at":"2026-08-17T22:56:00.263638Z","submitted_at":"2020-07-14T01:19:15Z","title":"From Symmetry to Geometry: Tractable Nonconvex Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.06753","snapshot_observed_at":"2026-08-12T19:52:08.047656Z","title":"From symmetry to geometry: Tractable nonconvex problems","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T19:52:08.047656Z"},"links":{"cited_paper":"/paper/2007.06753","citing_paper":"/paper/2411.10378"},"observation_digest":"sha256:6d4a0ab0673639e865a43e561e6fcfbf23ff2062f587c6efc61a9c18e5f8bf34","observation_id":"41ed7f94-500b-4966-b6b4-0f4928b94d7d","resolution":{"observed_at":"2026-08-12T19:52:08.047656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.10378","last_updated":"2024-11-15T17:33:33Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T21:38:59.652924Z","submitted_at":"2024-11-15T17:33:33Z","title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":3,"verified_fuzzy":40},"total_outbound_references":57},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2411.10378."}