{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZDSZ4K4H65SKSMO2ZFBN6HLRFF","short_pith_number":"pith:ZDSZ4K4H","canonical_record":{"source":{"id":"1208.6387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-31T06:30:11Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"2ff3a25be2d94f257f077570d05fec37d7d132f4bfd04a817a6d22705d3006d0","abstract_canon_sha256":"5430156c242926e1ab8ebcd394d6fe2c6bfbf5e84979bb9ebfe374278edec09b"},"schema_version":"1.0"},"canonical_sha256":"c8e59e2b87f764a931dac942df1d7129577c98b75ca51c0c19ebac9adff4d7a7","source":{"kind":"arxiv","id":"1208.6387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.6387","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.6387v1","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6387","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZDSZ4K4H65SK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZDSZ4K4H65SKSMO2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZDSZ4K4H","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZDSZ4K4H65SKSMO2ZFBN6HLRFF","target":"record","payload":{"canonical_record":{"source":{"id":"1208.6387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-31T06:30:11Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"2ff3a25be2d94f257f077570d05fec37d7d132f4bfd04a817a6d22705d3006d0","abstract_canon_sha256":"5430156c242926e1ab8ebcd394d6fe2c6bfbf5e84979bb9ebfe374278edec09b"},"schema_version":"1.0"},"canonical_sha256":"c8e59e2b87f764a931dac942df1d7129577c98b75ca51c0c19ebac9adff4d7a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:33.372837Z","signature_b64":"OkGsiVm/4ISPqfresDf8rhIYLe2amL4KnL6HVXFML7iJo3is+xBWxkU1PeGc+ZPMoIO+9patPqrFAW7gNgnqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8e59e2b87f764a931dac942df1d7129577c98b75ca51c0c19ebac9adff4d7a7","last_reissued_at":"2026-05-18T03:46:33.372039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:33.372039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.6387","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-18T03:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syzIsPZCASTSwygv1yxoD3vvRBR0yszy9u7h/hW3q0NLZYqfcm51nGbK7bN/Awu9mC/g3v3B1Hi73Qk6gNfsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:04:26.434391Z"},"content_sha256":"1eaeefad1d22f6d748948486a29e9a48deb1e4820fe59dc3d951482d3c7e5c32","schema_version":"1.0","event_id":"sha256:1eaeefad1d22f6d748948486a29e9a48deb1e4820fe59dc3d951482d3c7e5c32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZDSZ4K4H65SKSMO2ZFBN6HLRFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A domain decomposition strategy to efficiently solve structures containing repeated patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"math.NA","authors_text":"Christian Rey (LMT), Daniel J. Rixen (T.U. Delft), Pierre Gosselet (LMT)","submitted_at":"2012-08-31T06:30:11Z","abstract_excerpt":"This paper presents a strategy for the computation of structures with repeated patterns based on domain decomposition and block Krylov solvers. It can be seen as a special variant of the FETI method. We propose using the presence of repeated domains in the problem to compute the solution by minimizing the interface error on several directions simultaneously. The method not only drastically decreases the size of the problems to solve but also accelerates the convergence of interface problem for nearly no additional computational cost and minimizes expensive memory accesses. The numerical perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6387","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-18T03:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+Kv0qecdT4KRZ6NcPMXd5dxHOZRlRYpSo90tCmDwGRdljIfll7rfkTykgVexeLe4la4yKX9SMaY5byjUTzSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:04:26.434731Z"},"content_sha256":"24b18518c422e846ffa21db2db7d7c336f800a97c2e8ff5cfae6d8b94a05ea58","schema_version":"1.0","event_id":"sha256:24b18518c422e846ffa21db2db7d7c336f800a97c2e8ff5cfae6d8b94a05ea58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF/bundle.json","state_url":"https://pith.science/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF/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-20T15:04:26Z","links":{"resolver":"https://pith.science/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF","bundle":"https://pith.science/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF/bundle.json","state":"https://pith.science/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDSZ4K4H65SKSMO2ZFBN6HLRFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZDSZ4K4H65SKSMO2ZFBN6HLRFF","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":"5430156c242926e1ab8ebcd394d6fe2c6bfbf5e84979bb9ebfe374278edec09b","cross_cats_sorted":["physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-31T06:30:11Z","title_canon_sha256":"2ff3a25be2d94f257f077570d05fec37d7d132f4bfd04a817a6d22705d3006d0"},"schema_version":"1.0","source":{"id":"1208.6387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.6387","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.6387v1","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6387","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZDSZ4K4H65SK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZDSZ4K4H65SKSMO2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZDSZ4K4H","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:24b18518c422e846ffa21db2db7d7c336f800a97c2e8ff5cfae6d8b94a05ea58","target":"graph","created_at":"2026-05-18T03:46:33Z","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":"This paper presents a strategy for the computation of structures with repeated patterns based on domain decomposition and block Krylov solvers. It can be seen as a special variant of the FETI method. We propose using the presence of repeated domains in the problem to compute the solution by minimizing the interface error on several directions simultaneously. The method not only drastically decreases the size of the problems to solve but also accelerates the convergence of interface problem for nearly no additional computational cost and minimizes expensive memory accesses. The numerical perfor","authors_text":"Christian Rey (LMT), Daniel J. Rixen (T.U. Delft), Pierre Gosselet (LMT)","cross_cats":["physics.comp-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-31T06:30:11Z","title":"A domain decomposition strategy to efficiently solve structures containing repeated patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6387","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:1eaeefad1d22f6d748948486a29e9a48deb1e4820fe59dc3d951482d3c7e5c32","target":"record","created_at":"2026-05-18T03:46:33Z","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":"5430156c242926e1ab8ebcd394d6fe2c6bfbf5e84979bb9ebfe374278edec09b","cross_cats_sorted":["physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-31T06:30:11Z","title_canon_sha256":"2ff3a25be2d94f257f077570d05fec37d7d132f4bfd04a817a6d22705d3006d0"},"schema_version":"1.0","source":{"id":"1208.6387","kind":"arxiv","version":1}},"canonical_sha256":"c8e59e2b87f764a931dac942df1d7129577c98b75ca51c0c19ebac9adff4d7a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8e59e2b87f764a931dac942df1d7129577c98b75ca51c0c19ebac9adff4d7a7","first_computed_at":"2026-05-18T03:46:33.372039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:33.372039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OkGsiVm/4ISPqfresDf8rhIYLe2amL4KnL6HVXFML7iJo3is+xBWxkU1PeGc+ZPMoIO+9patPqrFAW7gNgnqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:33.372837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.6387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eaeefad1d22f6d748948486a29e9a48deb1e4820fe59dc3d951482d3c7e5c32","sha256:24b18518c422e846ffa21db2db7d7c336f800a97c2e8ff5cfae6d8b94a05ea58"],"state_sha256":"9227134ea5c3672d2436649a0c55b4b60a6d1aed66e24e224f1c2a24ea216472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7c20SE/ewqeuGtv84TEQcxiMhefl2VMp27j9fXELxqABqSUByNA4MHALqc3TYhdRTOI5kyAWDT39uSu6QhEnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:04:26.436587Z","bundle_sha256":"9dba5db100892a8f5c1075ae187ee28318683476ac5716ca2b366a772893e786"}}