{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7MUEK4MYXOV4BNG4XDPW4U43DU","short_pith_number":"pith:7MUEK4MY","canonical_record":{"source":{"id":"1004.0095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-04-01T09:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"19cf20291d3a5585d4df8ffab4077d6e17f02783a3f0278503d9e4fddd1dbb6d","abstract_canon_sha256":"03afa8d6bb96ca61b61e0ce16f4ae0dc6ed3e78f25ce81f269a23461d16bb8d3"},"schema_version":"1.0"},"canonical_sha256":"fb28457198bbabc0b4dcb8df6e539b1d3206987df02decf0515cb11bbd4c13af","source":{"kind":"arxiv","id":"1004.0095","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0095","created_at":"2026-05-18T02:24:18Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0095v2","created_at":"2026-05-18T02:24:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0095","created_at":"2026-05-18T02:24:18Z"},{"alias_kind":"pith_short_12","alias_value":"7MUEK4MYXOV4","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MUEK4MYXOV4BNG4","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MUEK4MY","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7MUEK4MYXOV4BNG4XDPW4U43DU","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-04-01T09:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"19cf20291d3a5585d4df8ffab4077d6e17f02783a3f0278503d9e4fddd1dbb6d","abstract_canon_sha256":"03afa8d6bb96ca61b61e0ce16f4ae0dc6ed3e78f25ce81f269a23461d16bb8d3"},"schema_version":"1.0"},"canonical_sha256":"fb28457198bbabc0b4dcb8df6e539b1d3206987df02decf0515cb11bbd4c13af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:18.318478Z","signature_b64":"xF3AzvEijp5lQ6iFPpP9mNGjj9H3+PIYhzQsO8MmyZTcVnXTPIBjXlWyUmjDfYn+5CsB/ynGS1/DFH83Q+nlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb28457198bbabc0b4dcb8df6e539b1d3206987df02decf0515cb11bbd4c13af","last_reissued_at":"2026-05-18T02:24:18.317704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:18.317704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0095","source_version":2,"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-18T02:24:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mv2xpgPhFmG7TNQF7CsQePTi8dd3FfL+JAAKMjXp1UTdDepluas2i5rMOLe1CNT0GfRW1QTexD2PAQJW4YefBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:31:28.639426Z"},"content_sha256":"5db6df816a53863d0675e1b49462f9da65f94e0bb470f06c42b50499d1bc16c2","schema_version":"1.0","event_id":"sha256:5db6df816a53863d0675e1b49462f9da65f94e0bb470f06c42b50499d1bc16c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7MUEK4MYXOV4BNG4XDPW4U43DU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of a greedy algorithm for high-dimensional convex nonlinear problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Eric Cances, Tony Lelievre, Virginie Ehrlacher","submitted_at":"2010-04-01T09:49:58Z","abstract_excerpt":"In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of the energy is Lipschitz on bounded sets. The main interest of this method is that it can be used for high-dimensional nonlinear convex problems. We illustrate this method on a prototypical example for uncertainty propagation on the obstacle problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0095","kind":"arxiv","version":2},"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-18T02:24:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bd8UkfULbBBQrmPs4IGJ3Rjj0UEHHjmDH7o6n+dMVrxZnY0fLZ2a11gGlUPHiXoRxje7NLLkEGcy60/ccJRnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:31:28.640063Z"},"content_sha256":"d3ab8412bf22f7327e7017ae2887d71765ed9400f00d1bf5d8a7649aeb440821","schema_version":"1.0","event_id":"sha256:d3ab8412bf22f7327e7017ae2887d71765ed9400f00d1bf5d8a7649aeb440821"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MUEK4MYXOV4BNG4XDPW4U43DU/bundle.json","state_url":"https://pith.science/pith/7MUEK4MYXOV4BNG4XDPW4U43DU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MUEK4MYXOV4BNG4XDPW4U43DU/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-07T14:31:28Z","links":{"resolver":"https://pith.science/pith/7MUEK4MYXOV4BNG4XDPW4U43DU","bundle":"https://pith.science/pith/7MUEK4MYXOV4BNG4XDPW4U43DU/bundle.json","state":"https://pith.science/pith/7MUEK4MYXOV4BNG4XDPW4U43DU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MUEK4MYXOV4BNG4XDPW4U43DU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7MUEK4MYXOV4BNG4XDPW4U43DU","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":"03afa8d6bb96ca61b61e0ce16f4ae0dc6ed3e78f25ce81f269a23461d16bb8d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-04-01T09:49:58Z","title_canon_sha256":"19cf20291d3a5585d4df8ffab4077d6e17f02783a3f0278503d9e4fddd1dbb6d"},"schema_version":"1.0","source":{"id":"1004.0095","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0095","created_at":"2026-05-18T02:24:18Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0095v2","created_at":"2026-05-18T02:24:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0095","created_at":"2026-05-18T02:24:18Z"},{"alias_kind":"pith_short_12","alias_value":"7MUEK4MYXOV4","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MUEK4MYXOV4BNG4","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MUEK4MY","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:d3ab8412bf22f7327e7017ae2887d71765ed9400f00d1bf5d8a7649aeb440821","target":"graph","created_at":"2026-05-18T02:24:18Z","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":"In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of the energy is Lipschitz on bounded sets. The main interest of this method is that it can be used for high-dimensional nonlinear convex problems. We illustrate this method on a prototypical example for uncertainty propagation on the obstacle problem.","authors_text":"Eric Cances, Tony Lelievre, Virginie Ehrlacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-04-01T09:49:58Z","title":"Convergence of a greedy algorithm for high-dimensional convex nonlinear problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0095","kind":"arxiv","version":2},"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:5db6df816a53863d0675e1b49462f9da65f94e0bb470f06c42b50499d1bc16c2","target":"record","created_at":"2026-05-18T02:24:18Z","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":"03afa8d6bb96ca61b61e0ce16f4ae0dc6ed3e78f25ce81f269a23461d16bb8d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-04-01T09:49:58Z","title_canon_sha256":"19cf20291d3a5585d4df8ffab4077d6e17f02783a3f0278503d9e4fddd1dbb6d"},"schema_version":"1.0","source":{"id":"1004.0095","kind":"arxiv","version":2}},"canonical_sha256":"fb28457198bbabc0b4dcb8df6e539b1d3206987df02decf0515cb11bbd4c13af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb28457198bbabc0b4dcb8df6e539b1d3206987df02decf0515cb11bbd4c13af","first_computed_at":"2026-05-18T02:24:18.317704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:18.317704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xF3AzvEijp5lQ6iFPpP9mNGjj9H3+PIYhzQsO8MmyZTcVnXTPIBjXlWyUmjDfYn+5CsB/ynGS1/DFH83Q+nlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:18.318478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0095","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5db6df816a53863d0675e1b49462f9da65f94e0bb470f06c42b50499d1bc16c2","sha256:d3ab8412bf22f7327e7017ae2887d71765ed9400f00d1bf5d8a7649aeb440821"],"state_sha256":"b75c2f92e7a232b36d4b96f2e40d83ffece4ff044148ffe3282d90d703be95f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FefuXdv8M84aLgIzMihw4RaxXxyTjVXguX+7tt21uptBPX9VsO4HG5sEoHIX8Y6V7MWgL5pNpVUytdse6VP2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:31:28.643510Z","bundle_sha256":"15a16578ca8301400a34b38b0a8e2ca3f0d8265164ef9deb906477e596e64203"}}