{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z32HTXVCTGCKICI5UGFHDQQ5L2","short_pith_number":"pith:Z32HTXVC","canonical_record":{"source":{"id":"1109.5913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-09-27T14:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"dfc4d3df47dee5d81600eb7048f9c9e57e6c6ee8ef8680e42e2762827cf93599","abstract_canon_sha256":"d263ed78b0a62570eb27bca0416f084d4cb09be37573f374e4a2c3bad010dbd0"},"schema_version":"1.0"},"canonical_sha256":"cef479dea29984a4091da18a71c21d5e8dcc01724b755878535fa1b2b8c35796","source":{"kind":"arxiv","id":"1109.5913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5913","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5913v1","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5913","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"Z32HTXVCTGCK","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z32HTXVCTGCKICI5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z32HTXVC","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z32HTXVCTGCKICI5UGFHDQQ5L2","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-09-27T14:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"dfc4d3df47dee5d81600eb7048f9c9e57e6c6ee8ef8680e42e2762827cf93599","abstract_canon_sha256":"d263ed78b0a62570eb27bca0416f084d4cb09be37573f374e4a2c3bad010dbd0"},"schema_version":"1.0"},"canonical_sha256":"cef479dea29984a4091da18a71c21d5e8dcc01724b755878535fa1b2b8c35796","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:11.022642Z","signature_b64":"Uzqhu+JMT8sMCnDaU7KPBgRdJiljzG8qRHDumZrqls0MElSUAyjbW5KLz35xxPjz6UDGtB72pUGHmU6AE2QcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cef479dea29984a4091da18a71c21d5e8dcc01724b755878535fa1b2b8c35796","last_reissued_at":"2026-05-18T04:12:11.022120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:11.022120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5913","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-18T04:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMJStFWYXfZqDONvtjHO3hj6J58aWYkUmuwE8U/Afs60c6nYUx5KQZzVEygOPuhTi1rqcjBMU9Exc2u1A6oiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:49:06.095540Z"},"content_sha256":"c454ad76ad23b213677639e1fd26fea030adc999f20333dcc2686da8a7cd7f12","schema_version":"1.0","event_id":"sha256:c454ad76ad23b213677639e1fd26fea030adc999f20333dcc2686da8a7cd7f12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z32HTXVCTGCKICI5UGFHDQQ5L2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the control of the load increments for a proper description of multiple delamination in a domain decomposition framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Olivier Allix (LMT), Pierre Gosselet (LMT), Pierre Kerfriden (LMT)","submitted_at":"2011-09-27T14:47:03Z","abstract_excerpt":"In quasi-static nonlinear time-dependent analysis, the choice of the time discretization is a complex issue. The most basic strategy consists in determining a value of the load increment that ensures the convergence of the solution with respect to time on the base of preliminary simulations. In more advanced applications, the load increments can be controlled for instance by prescribing the number of iterations of the nonlinear resolution procedure, or by using an arc-length algorithm. These techniques usually introduce a parameter whose correct value is not easy to obtain. In this paper, an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5913","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-18T04:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8ILujx8pS2E5Ldpcui96yuYr5qvJFbbsoHP/hQlE9slsH9YSqzeHS1QtsucH/SVw7i712v88bGvACj+NT+SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:49:06.095894Z"},"content_sha256":"605093d67939fd970b804cfc5c74458446ddd4b197d5275e1d339714f29ddba7","schema_version":"1.0","event_id":"sha256:605093d67939fd970b804cfc5c74458446ddd4b197d5275e1d339714f29ddba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2/bundle.json","state_url":"https://pith.science/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2/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-20T04:49:06Z","links":{"resolver":"https://pith.science/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2","bundle":"https://pith.science/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2/bundle.json","state":"https://pith.science/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z32HTXVCTGCKICI5UGFHDQQ5L2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z32HTXVCTGCKICI5UGFHDQQ5L2","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":"d263ed78b0a62570eb27bca0416f084d4cb09be37573f374e4a2c3bad010dbd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-09-27T14:47:03Z","title_canon_sha256":"dfc4d3df47dee5d81600eb7048f9c9e57e6c6ee8ef8680e42e2762827cf93599"},"schema_version":"1.0","source":{"id":"1109.5913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5913","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5913v1","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5913","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"Z32HTXVCTGCK","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z32HTXVCTGCKICI5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z32HTXVC","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:605093d67939fd970b804cfc5c74458446ddd4b197d5275e1d339714f29ddba7","target":"graph","created_at":"2026-05-18T04:12:11Z","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 quasi-static nonlinear time-dependent analysis, the choice of the time discretization is a complex issue. The most basic strategy consists in determining a value of the load increment that ensures the convergence of the solution with respect to time on the base of preliminary simulations. In more advanced applications, the load increments can be controlled for instance by prescribing the number of iterations of the nonlinear resolution procedure, or by using an arc-length algorithm. These techniques usually introduce a parameter whose correct value is not easy to obtain. In this paper, an a","authors_text":"Olivier Allix (LMT), Pierre Gosselet (LMT), Pierre Kerfriden (LMT)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-09-27T14:47:03Z","title":"On the control of the load increments for a proper description of multiple delamination in a domain decomposition framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5913","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:c454ad76ad23b213677639e1fd26fea030adc999f20333dcc2686da8a7cd7f12","target":"record","created_at":"2026-05-18T04:12:11Z","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":"d263ed78b0a62570eb27bca0416f084d4cb09be37573f374e4a2c3bad010dbd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-09-27T14:47:03Z","title_canon_sha256":"dfc4d3df47dee5d81600eb7048f9c9e57e6c6ee8ef8680e42e2762827cf93599"},"schema_version":"1.0","source":{"id":"1109.5913","kind":"arxiv","version":1}},"canonical_sha256":"cef479dea29984a4091da18a71c21d5e8dcc01724b755878535fa1b2b8c35796","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cef479dea29984a4091da18a71c21d5e8dcc01724b755878535fa1b2b8c35796","first_computed_at":"2026-05-18T04:12:11.022120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:11.022120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uzqhu+JMT8sMCnDaU7KPBgRdJiljzG8qRHDumZrqls0MElSUAyjbW5KLz35xxPjz6UDGtB72pUGHmU6AE2QcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:11.022642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c454ad76ad23b213677639e1fd26fea030adc999f20333dcc2686da8a7cd7f12","sha256:605093d67939fd970b804cfc5c74458446ddd4b197d5275e1d339714f29ddba7"],"state_sha256":"f96dd479b35866a78d3c9b3685f8617ec34bfb4d4ccb7709891cd9231710b184"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOW1lGXKGIqBWd8fETiZy4TqmDrHjyX9vpcyaRZeI5ncqUjyCRfW2n2ZI2gofFQlF+kY7QNQK+UP1ydCovveBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:49:06.097946Z","bundle_sha256":"671f647dc11fe9e5d5222d565ac63631a2ce316c512e89964d08ee1d28c99e6e"}}