{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QUPKMWXWZUIYOQYZM4ON47EWU5","short_pith_number":"pith:QUPKMWXW","canonical_record":{"source":{"id":"1705.09004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T00:17:47Z","cross_cats_sorted":[],"title_canon_sha256":"e2b9be61e10325bbb68c130a1bb72f97cf724a696e8c198a65b60957084096cb","abstract_canon_sha256":"fcad78e314bf206d10766139573bf1073d713e60d51770c6223bfcfbaad63770"},"schema_version":"1.0"},"canonical_sha256":"851ea65af6cd11874319671cde7c96a7670fca6fadc97420a3bf5b81399a0f73","source":{"kind":"arxiv","id":"1705.09004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09004","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09004v1","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09004","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"QUPKMWXWZUIY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUPKMWXWZUIYOQYZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUPKMWXW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QUPKMWXWZUIYOQYZM4ON47EWU5","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T00:17:47Z","cross_cats_sorted":[],"title_canon_sha256":"e2b9be61e10325bbb68c130a1bb72f97cf724a696e8c198a65b60957084096cb","abstract_canon_sha256":"fcad78e314bf206d10766139573bf1073d713e60d51770c6223bfcfbaad63770"},"schema_version":"1.0"},"canonical_sha256":"851ea65af6cd11874319671cde7c96a7670fca6fadc97420a3bf5b81399a0f73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:40.674519Z","signature_b64":"IS2tkx+G1rib4uBMiP+D6SPN8tQxTyvEJbe6GPLAe3k4E/ecJzgU8VOCKYqGfJxaD1EqwapOLpII0RNzu0CoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"851ea65af6cd11874319671cde7c96a7670fca6fadc97420a3bf5b81399a0f73","last_reissued_at":"2026-05-18T00:43:40.673828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:40.673828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09004","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:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbUPGoKBKawpffduGoNfh5ZTQUOhjExEucgjrQsIaIAbBIC6+IKy8C7YTwItae56UUyjNyumZP9AAn90QEiNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:07:02.862615Z"},"content_sha256":"648a2abdaa5718e1efae3c8dac1b87a53c3428578c4eb6c80a58c122945ffe3f","schema_version":"1.0","event_id":"sha256:648a2abdaa5718e1efae3c8dac1b87a53c3428578c4eb6c80a58c122945ffe3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QUPKMWXWZUIYOQYZM4ON47EWU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On overlapping domain decomposition methods for high-contrast multiscale problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eric Chung, Juan Galvis, Wing Tat Leung, Yalchin Efendiev","submitted_at":"2017-05-25T00:17:47Z","abstract_excerpt":"We review some important ideas in the design and analysis of robust overlapping domain decomposition algorithms for high-contrast multiscale problems and propose a domain decomposition method better performance in terms of the number of iterations. The main novelty of our approaches is the construction of coarse spaces, which are computed using spectral information of local bilinear forms. We present several approaches to incorporate the spectral information into the coarse problem in order to obtain minimal coarse space dimension. We show that using these coarse spaces, we can obtain a domain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09004","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:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMnEocxtrIpVUiV3hCphswHyKfiRrPVDGp4QbEOKeUa1XWiYJjSqG4xOq+aiYAiy7VOaB1dfe6Or941mf9zDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:07:02.863267Z"},"content_sha256":"4747a1c451bca97cae18af82939013c4873ca32f18374b22a51097e3f684319e","schema_version":"1.0","event_id":"sha256:4747a1c451bca97cae18af82939013c4873ca32f18374b22a51097e3f684319e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUPKMWXWZUIYOQYZM4ON47EWU5/bundle.json","state_url":"https://pith.science/pith/QUPKMWXWZUIYOQYZM4ON47EWU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUPKMWXWZUIYOQYZM4ON47EWU5/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-27T14:07:02Z","links":{"resolver":"https://pith.science/pith/QUPKMWXWZUIYOQYZM4ON47EWU5","bundle":"https://pith.science/pith/QUPKMWXWZUIYOQYZM4ON47EWU5/bundle.json","state":"https://pith.science/pith/QUPKMWXWZUIYOQYZM4ON47EWU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUPKMWXWZUIYOQYZM4ON47EWU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QUPKMWXWZUIYOQYZM4ON47EWU5","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":"fcad78e314bf206d10766139573bf1073d713e60d51770c6223bfcfbaad63770","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T00:17:47Z","title_canon_sha256":"e2b9be61e10325bbb68c130a1bb72f97cf724a696e8c198a65b60957084096cb"},"schema_version":"1.0","source":{"id":"1705.09004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09004","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09004v1","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09004","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"QUPKMWXWZUIY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUPKMWXWZUIYOQYZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUPKMWXW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:4747a1c451bca97cae18af82939013c4873ca32f18374b22a51097e3f684319e","target":"graph","created_at":"2026-05-18T00:43:40Z","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":"We review some important ideas in the design and analysis of robust overlapping domain decomposition algorithms for high-contrast multiscale problems and propose a domain decomposition method better performance in terms of the number of iterations. The main novelty of our approaches is the construction of coarse spaces, which are computed using spectral information of local bilinear forms. We present several approaches to incorporate the spectral information into the coarse problem in order to obtain minimal coarse space dimension. We show that using these coarse spaces, we can obtain a domain","authors_text":"Eric Chung, Juan Galvis, Wing Tat Leung, Yalchin Efendiev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T00:17:47Z","title":"On overlapping domain decomposition methods for high-contrast multiscale problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09004","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:648a2abdaa5718e1efae3c8dac1b87a53c3428578c4eb6c80a58c122945ffe3f","target":"record","created_at":"2026-05-18T00:43:40Z","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":"fcad78e314bf206d10766139573bf1073d713e60d51770c6223bfcfbaad63770","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T00:17:47Z","title_canon_sha256":"e2b9be61e10325bbb68c130a1bb72f97cf724a696e8c198a65b60957084096cb"},"schema_version":"1.0","source":{"id":"1705.09004","kind":"arxiv","version":1}},"canonical_sha256":"851ea65af6cd11874319671cde7c96a7670fca6fadc97420a3bf5b81399a0f73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"851ea65af6cd11874319671cde7c96a7670fca6fadc97420a3bf5b81399a0f73","first_computed_at":"2026-05-18T00:43:40.673828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:40.673828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IS2tkx+G1rib4uBMiP+D6SPN8tQxTyvEJbe6GPLAe3k4E/ecJzgU8VOCKYqGfJxaD1EqwapOLpII0RNzu0CoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:40.674519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:648a2abdaa5718e1efae3c8dac1b87a53c3428578c4eb6c80a58c122945ffe3f","sha256:4747a1c451bca97cae18af82939013c4873ca32f18374b22a51097e3f684319e"],"state_sha256":"4d980641ff9301c9617fbecfb92a45e5cad8f4fc182fa0904219a1b70a1d4c46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZqcG/s7wzwylEZlqaEWX3gyVG/XzqtytMc13GKJNYOfGUIRZUeT1YEc+Ke8raJXQWOC3+MsC+KjIcBaRuOQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:07:02.866782Z","bundle_sha256":"695d74d7c98a25fee76176972f6cf81117a20831b37c7e8684a26a3b79947af1"}}