{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YFBOLXDQJPLYAJNVNB7BVGQZXD","short_pith_number":"pith:YFBOLXDQ","schema_version":"1.0","canonical_sha256":"c142e5dc704bd78025b5687e1a9a19b8ffdb9792cb0208f361a6a37047b41264","source":{"kind":"arxiv","id":"2303.01075","version":2},"attestation_state":"computed","paper":{"title":"An Adaptive Parallel Arc-Length Method","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"H.M. Verhelst, J.H. Den Besten, M. M\\\"oller","submitted_at":"2023-03-02T08:57:26Z","abstract_excerpt":"Parallel computing is omnipresent in today's scientific computer landscape, starting at multicore processors in desktop computers up to massively parallel clusters. While domain decomposition methods have a long tradition in computational mechanics to decompose spatial problems into multiple subproblems that can be solved in parallel, advancing solution schemes for dynamics or quasi-statics are inherently serial processes. For quasi-static simulations, however, there is no accumulating 'time' discretization error, hence an alternative approach is required. In this paper, we present an Adaptive"},"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":"2303.01075","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-03-02T08:57:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7314d214bdb48bf3b8a22f993ef13cda41ccec5f6f5bcede8cecd2b1d56ee7c1","abstract_canon_sha256":"1dca4f3ba37d378f728332e65faaf3ede028853d58339098ae11ee6ff5eb7cf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:34:36.457103Z","signature_b64":"ADZo3ZDTdQy64yGwZtWwyK4Y0/mXpH7F4AlLhCgOkN8FboFvVdNObT/09axhz7d1n2az/Glt+9xkEmRrRmP3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c142e5dc704bd78025b5687e1a9a19b8ffdb9792cb0208f361a6a37047b41264","last_reissued_at":"2026-07-05T10:34:36.456005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:34:36.456005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Parallel Arc-Length Method","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"H.M. Verhelst, J.H. Den Besten, M. M\\\"oller","submitted_at":"2023-03-02T08:57:26Z","abstract_excerpt":"Parallel computing is omnipresent in today's scientific computer landscape, starting at multicore processors in desktop computers up to massively parallel clusters. While domain decomposition methods have a long tradition in computational mechanics to decompose spatial problems into multiple subproblems that can be solved in parallel, advancing solution schemes for dynamics or quasi-statics are inherently serial processes. For quasi-static simulations, however, there is no accumulating 'time' discretization error, hence an alternative approach is required. In this paper, we present an Adaptive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01075","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.01075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.01075","created_at":"2026-07-05T10:34:36.456145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.01075v2","created_at":"2026-07-05T10:34:36.456145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01075","created_at":"2026-07-05T10:34:36.456145+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFBOLXDQJPLY","created_at":"2026-07-05T10:34:36.456145+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFBOLXDQJPLYAJNV","created_at":"2026-07-05T10:34:36.456145+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFBOLXDQ","created_at":"2026-07-05T10:34:36.456145+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10648","citing_title":"Isogeometric multi-patch shell analysis using the Geometry + Simulation Modules","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD","json":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD.json","graph_json":"https://pith.science/api/pith-number/YFBOLXDQJPLYAJNVNB7BVGQZXD/graph.json","events_json":"https://pith.science/api/pith-number/YFBOLXDQJPLYAJNVNB7BVGQZXD/events.json","paper":"https://pith.science/paper/YFBOLXDQ"},"agent_actions":{"view_html":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD","download_json":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD.json","view_paper":"https://pith.science/paper/YFBOLXDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.01075&json=true","fetch_graph":"https://pith.science/api/pith-number/YFBOLXDQJPLYAJNVNB7BVGQZXD/graph.json","fetch_events":"https://pith.science/api/pith-number/YFBOLXDQJPLYAJNVNB7BVGQZXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/action/storage_attestation","attest_author":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/action/author_attestation","sign_citation":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/action/citation_signature","submit_replication":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/action/replication_record"}},"created_at":"2026-07-05T10:34:36.456145+00:00","updated_at":"2026-07-05T10:34:36.456145+00:00"}