{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N22E6TXZNJOVPRT3HY5SB7YDM4","short_pith_number":"pith:N22E6TXZ","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"},"canonical_sha256":"6eb44f4ef96a5d57c67b3e3b20ff03673d0be8c4c5279bcc4f42201a6c822b20","source":{"kind":"arxiv","id":"2501.17488","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17488","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17488v3","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17488","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_12","alias_value":"N22E6TXZNJOV","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_16","alias_value":"N22E6TXZNJOVPRT3","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_8","alias_value":"N22E6TXZ","created_at":"2026-07-14T01:21:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N22E6TXZNJOVPRT3HY5SB7YDM4","target":"record","payload":{"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"},"canonical_sha256":"6eb44f4ef96a5d57c67b3e3b20ff03673d0be8c4c5279bcc4f42201a6c822b20","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"},"source_kind":"arxiv","source_id":"2501.17488","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:21:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"549DDt19yraCQgSA2Rid+5ZyTSmFe/Ys3NEaLCNFq9Dz36hxbLhFy0LD8Tn+hZg7X7UdKlbuRYdKnQ6jqpkpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:14:21.462338Z"},"content_sha256":"f6649c27fa97f2c25d652417ffba1787836e13789237c532ccc19f72d4f9a28b","schema_version":"1.0","event_id":"sha256:f6649c27fa97f2c25d652417ffba1787836e13789237c532ccc19f72d4f9a28b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N22E6TXZNJOVPRT3HY5SB7YDM4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:21:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bo0oVojJHJp0Be8rFscL4N9xkxnvs+izsvQjg7QBflL3gvd+5lJnrqDmSn8H+xcbo/MBgT7u3Vqr1+64yywqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:14:21.462865Z"},"content_sha256":"360e7209d6b66b40e549bf791df2d0cb73e567107354da845c45925c885076cd","schema_version":"1.0","event_id":"sha256:360e7209d6b66b40e549bf791df2d0cb73e567107354da845c45925c885076cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/bundle.json","state_url":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T13:14:21Z","links":{"resolver":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4","bundle":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/bundle.json","state":"https://pith.science/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N22E6TXZNJOVPRT3HY5SB7YDM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N22E6TXZNJOVPRT3HY5SB7YDM4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5055039f3e4004d0c3cbc4b00dcbcb2d96474d60d09cef301dfe1acf28c9624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T08:57:02Z","title_canon_sha256":"c1817af45eb62476ace440d747f51b1dfc148f1a589cf39b9fe651240ada419b"},"schema_version":"1.0","source":{"id":"2501.17488","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17488","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17488v3","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17488","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_12","alias_value":"N22E6TXZNJOV","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_16","alias_value":"N22E6TXZNJOVPRT3","created_at":"2026-07-14T01:21:58Z"},{"alias_kind":"pith_short_8","alias_value":"N22E6TXZ","created_at":"2026-07-14T01:21:58Z"}],"graph_snapshots":[{"event_id":"sha256:360e7209d6b66b40e549bf791df2d0cb73e567107354da845c45925c885076cd","target":"graph","created_at":"2026-07-14T01:21:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.17488/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chengchang Liu, Jingzhao Zhang, Lesi Chen, Luo Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T08:57:02Z","title":"Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17488","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6649c27fa97f2c25d652417ffba1787836e13789237c532ccc19f72d4f9a28b","target":"record","created_at":"2026-07-14T01:21:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5055039f3e4004d0c3cbc4b00dcbcb2d96474d60d09cef301dfe1acf28c9624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T08:57:02Z","title_canon_sha256":"c1817af45eb62476ace440d747f51b1dfc148f1a589cf39b9fe651240ada419b"},"schema_version":"1.0","source":{"id":"2501.17488","kind":"arxiv","version":3}},"canonical_sha256":"6eb44f4ef96a5d57c67b3e3b20ff03673d0be8c4c5279bcc4f42201a6c822b20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb44f4ef96a5d57c67b3e3b20ff03673d0be8c4c5279bcc4f42201a6c822b20","first_computed_at":"2026-07-14T01:21:58.854732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:21:58.854732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1er2RPCy/xSuaNwtpN1d7rLBYRNu5f/sd5JCCR6PQe9zcwZ2nG3w9BuZaddab9Z60lffqO76FQ86ZU98sAHNBg==","signature_status":"signed_v1","signed_at":"2026-07-14T01:21:58.855719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.17488","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6649c27fa97f2c25d652417ffba1787836e13789237c532ccc19f72d4f9a28b","sha256:360e7209d6b66b40e549bf791df2d0cb73e567107354da845c45925c885076cd"],"state_sha256":"05978d87f8f3e596851786bc501aa8c61df25dbb55d4b4bfca08134b59601c3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oIB8Hc1drHdy45tkUCqwNBgaGFxY3PWtYERpTjZyPupiMGjXSyHT6pqwF9DRI5matbGSgiFoquSXuN2pFztCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:14:21.466412Z","bundle_sha256":"6a69b741820041800fc84175c15c86f670f5551a468763c575d88ed2076af4a6"}}