{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N22E6TXZNJOVPRT3HY5SB7YDM4","short_pith_number":"pith:N22E6TXZ","schema_version":"1.0","canonical_sha256":"6eb44f4ef96a5d57c67b3e3b20ff03673d0be8c4c5279bcc4f42201a6c822b20","source":{"kind":"arxiv","id":"2501.17488","version":3},"attestation_state":"computed","paper":{"title":"Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chengchang Liu, Jingzhao Zhang, Lesi Chen, Luo Luo","submitted_at":"2025-01-29T08:57:02Z","abstract_excerpt":"Second-order optimization methods are computationally expensive for large-scale problems. Recently, Doikov, Chayti, and Jaggi (ICML 2023) proposed the LazyCRN method that reduces computation by studying the gradient complexity of second-order methods. Their method can achieve a gradient complexity of $\\mathcal{O}( \\bar d + \\bar d^{1/2} \\epsilon^{-3/2})$ and $\\mathcal{O}( \\bar d + \\bar d^{1/2} \\epsilon^{-1/2})$ for nonconvex and convex optimization, respectively, where $\\bar d$ is the effective dimension and $\\epsilon$ is the target precision. Very recently, Adil, Bullins, Sidford, and Zhang (N"},"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":"2501.17488","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T08:57:02Z","cross_cats_sorted":[],"title_canon_sha256":"c1817af45eb62476ace440d747f51b1dfc148f1a589cf39b9fe651240ada419b","abstract_canon_sha256":"b5055039f3e4004d0c3cbc4b00dcbcb2d96474d60d09cef301dfe1acf28c9624"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:58.855719Z","signature_b64":"1er2RPCy/xSuaNwtpN1d7rLBYRNu5f/sd5JCCR6PQe9zcwZ2nG3w9BuZaddab9Z60lffqO76FQ86ZU98sAHNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb44f4ef96a5d57c67b3e3b20ff03673d0be8c4c5279bcc4f42201a6c822b20","last_reissued_at":"2026-07-14T01:21:58.854732Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:58.854732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chengchang Liu, Jingzhao Zhang, Lesi Chen, Luo Luo","submitted_at":"2025-01-29T08:57:02Z","abstract_excerpt":"Second-order optimization methods are computationally expensive for large-scale problems. Recently, Doikov, Chayti, and Jaggi (ICML 2023) proposed the LazyCRN method that reduces computation by studying the gradient complexity of second-order methods. Their method can achieve a gradient complexity of $\\mathcal{O}( \\bar d + \\bar d^{1/2} \\epsilon^{-3/2})$ and $\\mathcal{O}( \\bar d + \\bar d^{1/2} \\epsilon^{-1/2})$ for nonconvex and convex optimization, respectively, where $\\bar d$ is the effective dimension and $\\epsilon$ is the target precision. Very recently, Adil, Bullins, Sidford, and Zhang (N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17488","kind":"arxiv","version":3},"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/2501.17488/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":"2501.17488","created_at":"2026-07-14T01:21:58.855176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17488v3","created_at":"2026-07-14T01:21:58.855176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17488","created_at":"2026-07-14T01:21:58.855176+00:00"},{"alias_kind":"pith_short_12","alias_value":"N22E6TXZNJOV","created_at":"2026-07-14T01:21:58.855176+00:00"},{"alias_kind":"pith_short_16","alias_value":"N22E6TXZNJOVPRT3","created_at":"2026-07-14T01:21:58.855176+00:00"},{"alias_kind":"pith_short_8","alias_value":"N22E6TXZ","created_at":"2026-07-14T01:21:58.855176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08362","citing_title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4","json":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4.json","graph_json":"https://pith.science/api/pith-number/N22E6TXZNJOVPRT3HY5SB7YDM4/graph.json","events_json":"https://pith.science/api/pith-number/N22E6TXZNJOVPRT3HY5SB7YDM4/events.json","paper":"https://pith.science/paper/N22E6TXZ"},"agent_actions":{"view_html":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4","download_json":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4.json","view_paper":"https://pith.science/paper/N22E6TXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17488&json=true","fetch_graph":"https://pith.science/api/pith-number/N22E6TXZNJOVPRT3HY5SB7YDM4/graph.json","fetch_events":"https://pith.science/api/pith-number/N22E6TXZNJOVPRT3HY5SB7YDM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/action/storage_attestation","attest_author":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/action/author_attestation","sign_citation":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/action/citation_signature","submit_replication":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/action/replication_record"}},"created_at":"2026-07-14T01:21:58.855176+00:00","updated_at":"2026-07-14T01:21:58.855176+00:00"}