{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZDODU24RRQ4YPTL7XQLHCK4Q7T","short_pith_number":"pith:ZDODU24R","canonical_record":{"source":{"id":"1902.10767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-27T20:28:49Z","cross_cats_sorted":[],"title_canon_sha256":"ac0a954a27a789db444fb7026f27e78631e64fb5393ca5e77e6098e5067df2a2","abstract_canon_sha256":"6418a54fc49062acdea8c5c7b9dd26825e86a2cd738e6b7b1e25499eb328777c"},"schema_version":"1.0"},"canonical_sha256":"c8dc3a6b918c3987cd7fbc16712b90fcd99c54b5c505affcfcd6af707191122b","source":{"kind":"arxiv","id":"1902.10767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10767","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10767v1","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10767","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZDODU24RRQ4Y","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZDODU24RRQ4YPTL7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZDODU24R","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZDODU24RRQ4YPTL7XQLHCK4Q7T","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-27T20:28:49Z","cross_cats_sorted":[],"title_canon_sha256":"ac0a954a27a789db444fb7026f27e78631e64fb5393ca5e77e6098e5067df2a2","abstract_canon_sha256":"6418a54fc49062acdea8c5c7b9dd26825e86a2cd738e6b7b1e25499eb328777c"},"schema_version":"1.0"},"canonical_sha256":"c8dc3a6b918c3987cd7fbc16712b90fcd99c54b5c505affcfcd6af707191122b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.776387Z","signature_b64":"cX8UtREDA8L7wrvlrT+mZ3gXISP2+Z3g2VOy12PDZ2X9ZBs68ojBukAAKN+R2e1oHs21nP7yNFMZBYSwb7hCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8dc3a6b918c3987cd7fbc16712b90fcd99c54b5c505affcfcd6af707191122b","last_reissued_at":"2026-05-17T23:52:29.775895Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.775895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10767","source_version":1,"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-05-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljo169rCbu8BtmW8Lh70yIg3UU6+u7iuOMA0dEJOSitPyvZrb4zM4oGdyrKVdBOekxTykCUgmruj/5WEwpWYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:25:44.911715Z"},"content_sha256":"4e60398d0263a2cd318e64c5a586cf7fe4018670256f57089d2f711c1c1a1906","schema_version":"1.0","event_id":"sha256:4e60398d0263a2cd318e64c5a586cf7fe4018670256f57089d2f711c1c1a1906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZDODU24RRQ4YPTL7XQLHCK4Q7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ph. L. Toint, X. Chen","submitted_at":"2019-02-27T20:28:49Z","abstract_excerpt":"This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive regularization algorithm using a $p$-th order Taylor model and show that the algorithm can produce an (epsilon,delta)-approximate q-th-order stationary point in at most O(epsilon^{-(p+1)/(p-q+1)}) evaluations of the objective function and its first p derivatives (whenever they exist). Our model uses the underlying rotational symmetry of the Euclidean norm functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10767","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":""},"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-05-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hV0k+MwaCibfrEC23Ta+uvaG5zq6jMfsitY3TXJwbcgw+ZzsfI3oko51a4V+qtJ4W/OMAEOtY92sGAGmwRGiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:25:44.912353Z"},"content_sha256":"eb411391d1ba8cfc7ae6de09ba291de40b682ce8ff9d8a2e623ecf5fd7f2dd78","schema_version":"1.0","event_id":"sha256:eb411391d1ba8cfc7ae6de09ba291de40b682ce8ff9d8a2e623ecf5fd7f2dd78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T/bundle.json","state_url":"https://pith.science/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T/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-05-30T00:25:44Z","links":{"resolver":"https://pith.science/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T","bundle":"https://pith.science/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T/bundle.json","state":"https://pith.science/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDODU24RRQ4YPTL7XQLHCK4Q7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZDODU24RRQ4YPTL7XQLHCK4Q7T","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":"6418a54fc49062acdea8c5c7b9dd26825e86a2cd738e6b7b1e25499eb328777c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-27T20:28:49Z","title_canon_sha256":"ac0a954a27a789db444fb7026f27e78631e64fb5393ca5e77e6098e5067df2a2"},"schema_version":"1.0","source":{"id":"1902.10767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10767","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10767v1","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10767","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZDODU24RRQ4Y","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZDODU24RRQ4YPTL7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZDODU24R","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:eb411391d1ba8cfc7ae6de09ba291de40b682ce8ff9d8a2e623ecf5fd7f2dd78","target":"graph","created_at":"2026-05-17T23:52:29Z","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"},"paper":{"abstract_excerpt":"This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive regularization algorithm using a $p$-th order Taylor model and show that the algorithm can produce an (epsilon,delta)-approximate q-th-order stationary point in at most O(epsilon^{-(p+1)/(p-q+1)}) evaluations of the objective function and its first p derivatives (whenever they exist). Our model uses the underlying rotational symmetry of the Euclidean norm functio","authors_text":"Ph. L. Toint, X. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-27T20:28:49Z","title":"High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10767","kind":"arxiv","version":1},"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:4e60398d0263a2cd318e64c5a586cf7fe4018670256f57089d2f711c1c1a1906","target":"record","created_at":"2026-05-17T23:52:29Z","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":"6418a54fc49062acdea8c5c7b9dd26825e86a2cd738e6b7b1e25499eb328777c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-27T20:28:49Z","title_canon_sha256":"ac0a954a27a789db444fb7026f27e78631e64fb5393ca5e77e6098e5067df2a2"},"schema_version":"1.0","source":{"id":"1902.10767","kind":"arxiv","version":1}},"canonical_sha256":"c8dc3a6b918c3987cd7fbc16712b90fcd99c54b5c505affcfcd6af707191122b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8dc3a6b918c3987cd7fbc16712b90fcd99c54b5c505affcfcd6af707191122b","first_computed_at":"2026-05-17T23:52:29.775895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:29.775895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cX8UtREDA8L7wrvlrT+mZ3gXISP2+Z3g2VOy12PDZ2X9ZBs68ojBukAAKN+R2e1oHs21nP7yNFMZBYSwb7hCAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:29.776387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e60398d0263a2cd318e64c5a586cf7fe4018670256f57089d2f711c1c1a1906","sha256:eb411391d1ba8cfc7ae6de09ba291de40b682ce8ff9d8a2e623ecf5fd7f2dd78"],"state_sha256":"6f775f5af148b85998a463430f9b7701ef5a761dcb651c0144d1fe43b4485d10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZuNVnmQy+rRt5BUmXRHpnlRm5DOUwGRN5ky6mvQW3MK9klU+pLxOq0poeqrR4UflEZl+jjKPGykVeLhdji5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:25:44.916157Z","bundle_sha256":"c240eb9526698d9d38f660ca00b1e9686933afc374a9765975da10b397983c6d"}}