{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2364NEY4EWO2RIGYAMEXJ6APZ2","short_pith_number":"pith:2364NEY4","schema_version":"1.0","canonical_sha256":"d6fdc6931c259da8a0d8030974f80fce854bf2be99941638136a9279dd1db7f6","source":{"kind":"arxiv","id":"2003.14366","version":1},"attestation_state":"computed","paper":{"title":"Second-Order Guarantees in Centralized, Federated and Decentralized Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.OC","stat.ML"],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Stefan Vlaski","submitted_at":"2020-03-31T16:54:22Z","abstract_excerpt":"Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the sense that even simply verifying that a given point is a local minimum can be NP-hard [1]. Still, some relatively simple algorithms have been shown to lead to surprisingly good empirical results in many contexts of interest. Perhaps the most prominent example is the success of the backpropagation algorithm for training neural networks. Several"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.14366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2020-03-31T16:54:22Z","cross_cats_sorted":["cs.LG","eess.SP","math.OC","stat.ML"],"title_canon_sha256":"f891d1ce7cf8091a62b289f67a9e628f4cf7974cf0514acf1b69287df32dcb6f","abstract_canon_sha256":"c9f5da74bd3eddda37030170897e8ea1374862f3e0e23164532221af4734af14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:49.799368Z","signature_b64":"fuHZeUCSqA63ZVleVr36gdRwH36rtagcHDz5p9uvqsv9AlcTcsRuuWCjmg/3kXM62tsKmPEIpq/FAnh3DIrNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6fdc6931c259da8a0d8030974f80fce854bf2be99941638136a9279dd1db7f6","last_reissued_at":"2026-07-05T00:51:49.798975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:49.798975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second-Order Guarantees in Centralized, Federated and Decentralized Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.OC","stat.ML"],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Stefan Vlaski","submitted_at":"2020-03-31T16:54:22Z","abstract_excerpt":"Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the sense that even simply verifying that a given point is a local minimum can be NP-hard [1]. Still, some relatively simple algorithms have been shown to lead to surprisingly good empirical results in many contexts of interest. Perhaps the most prominent example is the success of the backpropagation algorithm for training neural networks. Several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.14366","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.14366/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.14366","created_at":"2026-07-05T00:51:49.799031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.14366v1","created_at":"2026-07-05T00:51:49.799031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.14366","created_at":"2026-07-05T00:51:49.799031+00:00"},{"alias_kind":"pith_short_12","alias_value":"2364NEY4EWO2","created_at":"2026-07-05T00:51:49.799031+00:00"},{"alias_kind":"pith_short_16","alias_value":"2364NEY4EWO2RIGY","created_at":"2026-07-05T00:51:49.799031+00:00"},{"alias_kind":"pith_short_8","alias_value":"2364NEY4","created_at":"2026-07-05T00:51:49.799031+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2","json":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2.json","graph_json":"https://pith.science/api/pith-number/2364NEY4EWO2RIGYAMEXJ6APZ2/graph.json","events_json":"https://pith.science/api/pith-number/2364NEY4EWO2RIGYAMEXJ6APZ2/events.json","paper":"https://pith.science/paper/2364NEY4"},"agent_actions":{"view_html":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2","download_json":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2.json","view_paper":"https://pith.science/paper/2364NEY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.14366&json=true","fetch_graph":"https://pith.science/api/pith-number/2364NEY4EWO2RIGYAMEXJ6APZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/2364NEY4EWO2RIGYAMEXJ6APZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2/action/storage_attestation","attest_author":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2/action/author_attestation","sign_citation":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2/action/citation_signature","submit_replication":"https://pith.science/pith/2364NEY4EWO2RIGYAMEXJ6APZ2/action/replication_record"}},"created_at":"2026-07-05T00:51:49.799031+00:00","updated_at":"2026-07-05T00:51:49.799031+00:00"}