{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YFBOLXDQJPLYAJNVNB7BVGQZXD","short_pith_number":"pith:YFBOLXDQ","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"},"canonical_sha256":"c142e5dc704bd78025b5687e1a9a19b8ffdb9792cb0208f361a6a37047b41264","source":{"kind":"arxiv","id":"2303.01075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01075","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01075v2","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01075","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"YFBOLXDQJPLY","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"YFBOLXDQJPLYAJNV","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"YFBOLXDQ","created_at":"2026-07-05T10:34:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YFBOLXDQJPLYAJNVNB7BVGQZXD","target":"record","payload":{"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"},"canonical_sha256":"c142e5dc704bd78025b5687e1a9a19b8ffdb9792cb0208f361a6a37047b41264","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"},"source_kind":"arxiv","source_id":"2303.01075","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-07-05T10:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swgaUoyyu2WLcBDEaRpSfgISngRxZ+GefwvkuyG1r5uXGar/nU3ZSMAaN/EyM3luhQjmr+8Zc/nJUq6G9p4QDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:37:27.596069Z"},"content_sha256":"77461a7ff571678fa5b1f7483c4d2c2e9330b6a942ba0a60c0b0f23b83d54c9a","schema_version":"1.0","event_id":"sha256:77461a7ff571678fa5b1f7483c4d2c2e9330b6a942ba0a60c0b0f23b83d54c9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YFBOLXDQJPLYAJNVNB7BVGQZXD","target":"graph","payload":{"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"},"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-07-05T10:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K93q/kNpYUDA/9NbGeug5vDClmyNZ72IcYRBY+wGmOf2K7LEaDx/NZahnqdyF5L16A/mkEUZ7qqqPkuCg8NpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:37:27.596560Z"},"content_sha256":"5a4190ec4cf5419dcc727190cbb0a18fc93103e6a2b3da879b283371e63e99a8","schema_version":"1.0","event_id":"sha256:5a4190ec4cf5419dcc727190cbb0a18fc93103e6a2b3da879b283371e63e99a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/bundle.json","state_url":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/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-08-07T11:37:27Z","links":{"resolver":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD","bundle":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/bundle.json","state":"https://pith.science/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFBOLXDQJPLYAJNVNB7BVGQZXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YFBOLXDQJPLYAJNVNB7BVGQZXD","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":"1dca4f3ba37d378f728332e65faaf3ede028853d58339098ae11ee6ff5eb7cf2","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-03-02T08:57:26Z","title_canon_sha256":"7314d214bdb48bf3b8a22f993ef13cda41ccec5f6f5bcede8cecd2b1d56ee7c1"},"schema_version":"1.0","source":{"id":"2303.01075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01075","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01075v2","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01075","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"YFBOLXDQJPLY","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"YFBOLXDQJPLYAJNV","created_at":"2026-07-05T10:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"YFBOLXDQ","created_at":"2026-07-05T10:34:36Z"}],"graph_snapshots":[{"event_id":"sha256:5a4190ec4cf5419dcc727190cbb0a18fc93103e6a2b3da879b283371e63e99a8","target":"graph","created_at":"2026-07-05T10:34:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.01075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"H.M. Verhelst, J.H. Den Besten, M. M\\\"oller","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-03-02T08:57:26Z","title":"An Adaptive Parallel Arc-Length Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01075","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:77461a7ff571678fa5b1f7483c4d2c2e9330b6a942ba0a60c0b0f23b83d54c9a","target":"record","created_at":"2026-07-05T10:34:36Z","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":"1dca4f3ba37d378f728332e65faaf3ede028853d58339098ae11ee6ff5eb7cf2","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-03-02T08:57:26Z","title_canon_sha256":"7314d214bdb48bf3b8a22f993ef13cda41ccec5f6f5bcede8cecd2b1d56ee7c1"},"schema_version":"1.0","source":{"id":"2303.01075","kind":"arxiv","version":2}},"canonical_sha256":"c142e5dc704bd78025b5687e1a9a19b8ffdb9792cb0208f361a6a37047b41264","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c142e5dc704bd78025b5687e1a9a19b8ffdb9792cb0208f361a6a37047b41264","first_computed_at":"2026-07-05T10:34:36.456005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:34:36.456005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADZo3ZDTdQy64yGwZtWwyK4Y0/mXpH7F4AlLhCgOkN8FboFvVdNObT/09axhz7d1n2az/Glt+9xkEmRrRmP3Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:34:36.457103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.01075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77461a7ff571678fa5b1f7483c4d2c2e9330b6a942ba0a60c0b0f23b83d54c9a","sha256:5a4190ec4cf5419dcc727190cbb0a18fc93103e6a2b3da879b283371e63e99a8"],"state_sha256":"e55ed5d3fa6a1a8d7cbab80920db165c3ceb5ccd33565e991e7334547f88195e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnI9RTLfGvZjkHJrFZCO/MJymyWZ/+18RSOpm5aiMYyFypcusJZ4eOq6HHXxKIMwMviD5sZDePDzGaV/SAQaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T11:37:27.605075Z","bundle_sha256":"b1b8f7dfc38699ffb7af427b53964a9233fb148f5a13d0df2559305d836dbded"}}