{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DBIZ4XD7RKIAM7XG6WWT56QQUH","short_pith_number":"pith:DBIZ4XD7","canonical_record":{"source":{"id":"1511.02681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-09T14:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"d05678d75ab2386cf577833835f08409893693fe045aaea9b52cb59281c4afa5","abstract_canon_sha256":"5a0265e746a0dc2b742c52bd690acf1ec7b3e42539c663b099b210203e43f5e1"},"schema_version":"1.0"},"canonical_sha256":"18519e5c7f8a90067ee6f5ad3efa10a1d15f5dff6237042f15cb2bd7dc7b6bf0","source":{"kind":"arxiv","id":"1511.02681","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02681","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02681v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02681","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"DBIZ4XD7RKIA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DBIZ4XD7RKIAM7XG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DBIZ4XD7","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DBIZ4XD7RKIAM7XG6WWT56QQUH","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-09T14:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"d05678d75ab2386cf577833835f08409893693fe045aaea9b52cb59281c4afa5","abstract_canon_sha256":"5a0265e746a0dc2b742c52bd690acf1ec7b3e42539c663b099b210203e43f5e1"},"schema_version":"1.0"},"canonical_sha256":"18519e5c7f8a90067ee6f5ad3efa10a1d15f5dff6237042f15cb2bd7dc7b6bf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.124515Z","signature_b64":"9b5yXZGcyzAXXt6/s5ExCCnBLf7ZWjWNz7S7tmV/T+VbZq3+0ZbRhP20F4aXabtOsW89YUe/6VF8fE4aq+9ICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18519e5c7f8a90067ee6f5ad3efa10a1d15f5dff6237042f15cb2bd7dc7b6bf0","last_reissued_at":"2026-05-18T00:26:47.123955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.123955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02681","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-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aEpyKk1+le8hBTVFCzPXgC6WwOA0iEUPQkNz9crPrm6B4ZccV41TE26pmx7FEdaaNK5sUDAjZxcda7AsA2fBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:28:05.321428Z"},"content_sha256":"09822481d50b20e998f8f6e627b8958fe3f17041eb3a7a3cee6f5d44058b3e35","schema_version":"1.0","event_id":"sha256:09822481d50b20e998f8f6e627b8958fe3f17041eb3a7a3cee6f5d44058b3e35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DBIZ4XD7RKIAM7XG6WWT56QQUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new incremental method of computing the limit load in deformation plasticity models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jaroslav Haslinger, Sergey Repin, Stanislav Sysala","submitted_at":"2015-11-09T14:01:31Z","abstract_excerpt":"The aim of this paper is to introduce a new incremental procedure that can be used for numerical evaluation of the limit load. Existing incremental type methods are based on parametrization of the energy by the loading parameter $\\zeta\\in[0,\\zeta_{lim})$, where $\\zeta_{lim}$ is generally unknown. In the new method, the incremental procedure is operated in terms of an inverse mapping and the respective parameter $\\alpha$ is changing in the interval $(0,+\\infty)$. Theoretically, in each step of this algorithm, we obtain a guaranteed lower bound of $\\zeta_{lim}$. Reduction of the problem to a fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02681","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-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSnNIAoEkzQXM/iy7uJcxMaL2euMjV+MdwCM53xv/31e+S6TIjJp4FKa2k8nbd6saetqEc4vgLJ3dibD3tJtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:28:05.322227Z"},"content_sha256":"5205f8835b02ae7eb752c8e82607e493b39024782cab5b6adda9b14a1c9045d6","schema_version":"1.0","event_id":"sha256:5205f8835b02ae7eb752c8e82607e493b39024782cab5b6adda9b14a1c9045d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/bundle.json","state_url":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/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-31T17:28:05Z","links":{"resolver":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH","bundle":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/bundle.json","state":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DBIZ4XD7RKIAM7XG6WWT56QQUH","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":"5a0265e746a0dc2b742c52bd690acf1ec7b3e42539c663b099b210203e43f5e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-09T14:01:31Z","title_canon_sha256":"d05678d75ab2386cf577833835f08409893693fe045aaea9b52cb59281c4afa5"},"schema_version":"1.0","source":{"id":"1511.02681","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02681","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02681v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02681","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"DBIZ4XD7RKIA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DBIZ4XD7RKIAM7XG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DBIZ4XD7","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:5205f8835b02ae7eb752c8e82607e493b39024782cab5b6adda9b14a1c9045d6","target":"graph","created_at":"2026-05-18T00:26:47Z","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":"The aim of this paper is to introduce a new incremental procedure that can be used for numerical evaluation of the limit load. Existing incremental type methods are based on parametrization of the energy by the loading parameter $\\zeta\\in[0,\\zeta_{lim})$, where $\\zeta_{lim}$ is generally unknown. In the new method, the incremental procedure is operated in terms of an inverse mapping and the respective parameter $\\alpha$ is changing in the interval $(0,+\\infty)$. Theoretically, in each step of this algorithm, we obtain a guaranteed lower bound of $\\zeta_{lim}$. Reduction of the problem to a fin","authors_text":"Jaroslav Haslinger, Sergey Repin, Stanislav Sysala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-09T14:01:31Z","title":"A new incremental method of computing the limit load in deformation plasticity models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02681","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:09822481d50b20e998f8f6e627b8958fe3f17041eb3a7a3cee6f5d44058b3e35","target":"record","created_at":"2026-05-18T00:26:47Z","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":"5a0265e746a0dc2b742c52bd690acf1ec7b3e42539c663b099b210203e43f5e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-09T14:01:31Z","title_canon_sha256":"d05678d75ab2386cf577833835f08409893693fe045aaea9b52cb59281c4afa5"},"schema_version":"1.0","source":{"id":"1511.02681","kind":"arxiv","version":1}},"canonical_sha256":"18519e5c7f8a90067ee6f5ad3efa10a1d15f5dff6237042f15cb2bd7dc7b6bf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18519e5c7f8a90067ee6f5ad3efa10a1d15f5dff6237042f15cb2bd7dc7b6bf0","first_computed_at":"2026-05-18T00:26:47.123955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:47.123955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9b5yXZGcyzAXXt6/s5ExCCnBLf7ZWjWNz7S7tmV/T+VbZq3+0ZbRhP20F4aXabtOsW89YUe/6VF8fE4aq+9ICg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:47.124515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02681","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09822481d50b20e998f8f6e627b8958fe3f17041eb3a7a3cee6f5d44058b3e35","sha256:5205f8835b02ae7eb752c8e82607e493b39024782cab5b6adda9b14a1c9045d6"],"state_sha256":"76f9492d23b7c4c7036b8bbaf77d1c970225cf64197bb3bc19001b51937ff061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X60/jSlpeHik91wr8NGfk8DaBZTe3z5cQzZGJ3J6Z5t955GFcGCiPrsjecsf6eaUJRFSZ6AiJWWWzn0HkXAwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:28:05.326915Z","bundle_sha256":"6a7c5c8cf08454b6a3af6705d0169bc928de94c30ce3faef441e47d56a1ae01c"}}