{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GMU4ZFJSEVYG2GTC2MHHWRXROS","short_pith_number":"pith:GMU4ZFJS","canonical_record":{"source":{"id":"1904.04692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-09T14:16:50Z","cross_cats_sorted":[],"title_canon_sha256":"e55ff936cf5339ebe75382a7d7a6141738eede2404353256315d37f92ff53631","abstract_canon_sha256":"f556720bb6a1c1d5edd6873dcaba258bb3ad976cd72768560c49a8d2ba5df255"},"schema_version":"1.0"},"canonical_sha256":"3329cc953225706d1a62d30e7b46f17482c0e2543612177940c7060434cf623a","source":{"kind":"arxiv","id":"1904.04692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04692","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04692v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04692","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"GMU4ZFJSEVYG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GMU4ZFJSEVYG2GTC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GMU4ZFJS","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GMU4ZFJSEVYG2GTC2MHHWRXROS","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-09T14:16:50Z","cross_cats_sorted":[],"title_canon_sha256":"e55ff936cf5339ebe75382a7d7a6141738eede2404353256315d37f92ff53631","abstract_canon_sha256":"f556720bb6a1c1d5edd6873dcaba258bb3ad976cd72768560c49a8d2ba5df255"},"schema_version":"1.0"},"canonical_sha256":"3329cc953225706d1a62d30e7b46f17482c0e2543612177940c7060434cf623a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.404212Z","signature_b64":"7nYVn18N8krpGdQJ3n9pJdFBOXeK4cHZpNzootyP6K3KXVm54DOjV7lJBkOY7yu6c2LlfIl2+c4Xbaeu//koAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3329cc953225706d1a62d30e7b46f17482c0e2543612177940c7060434cf623a","last_reissued_at":"2026-05-17T23:48:58.403800Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.403800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04692","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:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXAKsWnDu9ttosxXzCdfn2I/gaZnvK1k0KE4xyzsVEIomtY9H/Rw/6aQrVsDxHlzyu0PfLmsNkQdo9ABIDobCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:27:58.155817Z"},"content_sha256":"3b0afceb0ff1d0ce285526eadd37ee557766812b7b94053b5909c1738a9c80fe","schema_version":"1.0","event_id":"sha256:3b0afceb0ff1d0ce285526eadd37ee557766812b7b94053b5909c1738a9c80fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GMU4ZFJSEVYG2GTC2MHHWRXROS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On high-order multilevel optimization strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Elisa Riccietti, Henri Calandra, Serge Gratton, Xavier Vasseur","submitted_at":"2019-04-09T14:16:50Z","abstract_excerpt":"We propose a new family of multilevel methods for unconstrained minimization. The resulting strategies are multilevel extensions of high-order optimization methods based on q-order Taylor models (with q >= 1) that have been recently proposed in the literature. The use of high-order models, while decreasing the worst-case complexity bound, makes these methods computationally more expensive. Hence, to counteract this effect, we propose a multilevel strategy that exploits a hierarchy of problems of decreasing dimension, still approximating the original one, to reduce the global cost of the step c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04692","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:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiYxB7RVVop53JeEgv3vv2CsJ1OXa0cUg7oj1LwjJ+HN6VV51Upc2yNi8Fjaayen5rmxgc4It9FriHF0qnHgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:27:58.156169Z"},"content_sha256":"c88d4135bff3093c6cf78f11c240b365bd69a7f6eee952b2eacdd0be1bf47050","schema_version":"1.0","event_id":"sha256:c88d4135bff3093c6cf78f11c240b365bd69a7f6eee952b2eacdd0be1bf47050"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS/bundle.json","state_url":"https://pith.science/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS/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-06-01T09:27:58Z","links":{"resolver":"https://pith.science/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS","bundle":"https://pith.science/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS/bundle.json","state":"https://pith.science/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMU4ZFJSEVYG2GTC2MHHWRXROS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GMU4ZFJSEVYG2GTC2MHHWRXROS","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":"f556720bb6a1c1d5edd6873dcaba258bb3ad976cd72768560c49a8d2ba5df255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-09T14:16:50Z","title_canon_sha256":"e55ff936cf5339ebe75382a7d7a6141738eede2404353256315d37f92ff53631"},"schema_version":"1.0","source":{"id":"1904.04692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04692","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04692v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04692","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"GMU4ZFJSEVYG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GMU4ZFJSEVYG2GTC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GMU4ZFJS","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:c88d4135bff3093c6cf78f11c240b365bd69a7f6eee952b2eacdd0be1bf47050","target":"graph","created_at":"2026-05-17T23:48: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"},"paper":{"abstract_excerpt":"We propose a new family of multilevel methods for unconstrained minimization. The resulting strategies are multilevel extensions of high-order optimization methods based on q-order Taylor models (with q >= 1) that have been recently proposed in the literature. The use of high-order models, while decreasing the worst-case complexity bound, makes these methods computationally more expensive. Hence, to counteract this effect, we propose a multilevel strategy that exploits a hierarchy of problems of decreasing dimension, still approximating the original one, to reduce the global cost of the step c","authors_text":"Elisa Riccietti, Henri Calandra, Serge Gratton, Xavier Vasseur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-09T14:16:50Z","title":"On high-order multilevel optimization strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04692","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:3b0afceb0ff1d0ce285526eadd37ee557766812b7b94053b5909c1738a9c80fe","target":"record","created_at":"2026-05-17T23:48: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":"f556720bb6a1c1d5edd6873dcaba258bb3ad976cd72768560c49a8d2ba5df255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-09T14:16:50Z","title_canon_sha256":"e55ff936cf5339ebe75382a7d7a6141738eede2404353256315d37f92ff53631"},"schema_version":"1.0","source":{"id":"1904.04692","kind":"arxiv","version":1}},"canonical_sha256":"3329cc953225706d1a62d30e7b46f17482c0e2543612177940c7060434cf623a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3329cc953225706d1a62d30e7b46f17482c0e2543612177940c7060434cf623a","first_computed_at":"2026-05-17T23:48:58.403800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:58.403800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7nYVn18N8krpGdQJ3n9pJdFBOXeK4cHZpNzootyP6K3KXVm54DOjV7lJBkOY7yu6c2LlfIl2+c4Xbaeu//koAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:58.404212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b0afceb0ff1d0ce285526eadd37ee557766812b7b94053b5909c1738a9c80fe","sha256:c88d4135bff3093c6cf78f11c240b365bd69a7f6eee952b2eacdd0be1bf47050"],"state_sha256":"bb5d48d447b282cd279f6ef23aa587d0190d8b0678cdd8ccbfce808de183ed0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPzNyeRyRN5iBlUmPYHbNOutqB4Ca2wzo5e6ugbG62uQNta/5n0o16DR1gMuEFe+ERtXH8QdcnVRPslI8stGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:27:58.158090Z","bundle_sha256":"851ac742d87942b16d93c2c743cb28bdf0ec6b21a4747440b1a40abb8711995d"}}