{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DBIZ4XD7RKIAM7XG6WWT56QQUH","short_pith_number":"pith:DBIZ4XD7","schema_version":"1.0","canonical_sha256":"18519e5c7f8a90067ee6f5ad3efa10a1d15f5dff6237042f15cb2bd7dc7b6bf0","source":{"kind":"arxiv","id":"1511.02681","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02681","created_at":"2026-05-18T00:26:47.124045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02681v1","created_at":"2026-05-18T00:26:47.124045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02681","created_at":"2026-05-18T00:26:47.124045+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBIZ4XD7RKIA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBIZ4XD7RKIAM7XG","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBIZ4XD7","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH","json":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH.json","graph_json":"https://pith.science/api/pith-number/DBIZ4XD7RKIAM7XG6WWT56QQUH/graph.json","events_json":"https://pith.science/api/pith-number/DBIZ4XD7RKIAM7XG6WWT56QQUH/events.json","paper":"https://pith.science/paper/DBIZ4XD7"},"agent_actions":{"view_html":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH","download_json":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH.json","view_paper":"https://pith.science/paper/DBIZ4XD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02681&json=true","fetch_graph":"https://pith.science/api/pith-number/DBIZ4XD7RKIAM7XG6WWT56QQUH/graph.json","fetch_events":"https://pith.science/api/pith-number/DBIZ4XD7RKIAM7XG6WWT56QQUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/action/storage_attestation","attest_author":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/action/author_attestation","sign_citation":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/action/citation_signature","submit_replication":"https://pith.science/pith/DBIZ4XD7RKIAM7XG6WWT56QQUH/action/replication_record"}},"created_at":"2026-05-18T00:26:47.124045+00:00","updated_at":"2026-05-18T00:26:47.124045+00:00"}