{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R72IAWKLKSV54HYQYVTPQMO7NP","short_pith_number":"pith:R72IAWKL","canonical_record":{"source":{"id":"1812.11508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T10:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"9e0fa84b1ff30706053ae4ae32818ce8daedd50551aefb94b4af08c30c28f01a","abstract_canon_sha256":"b56b19b9864ca1c9fdd1b04a92641dae360cb3349cb60c82eeefc294543c326a"},"schema_version":"1.0"},"canonical_sha256":"8ff480594b54abde1f10c566f831df6bde12dbb3159fa232311daa07794c6b79","source":{"kind":"arxiv","id":"1812.11508","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11508","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11508v2","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11508","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"pith_short_12","alias_value":"R72IAWKLKSV5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R72IAWKLKSV54HYQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R72IAWKL","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R72IAWKLKSV54HYQYVTPQMO7NP","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T10:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"9e0fa84b1ff30706053ae4ae32818ce8daedd50551aefb94b4af08c30c28f01a","abstract_canon_sha256":"b56b19b9864ca1c9fdd1b04a92641dae360cb3349cb60c82eeefc294543c326a"},"schema_version":"1.0"},"canonical_sha256":"8ff480594b54abde1f10c566f831df6bde12dbb3159fa232311daa07794c6b79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:21.926026Z","signature_b64":"ApAGNMzVNNnPYgPrNqnZhw4lndvpND700BwncNp1sNhx+tbZzobEkMENHqFaQa1GRbKLKcjgk1jomXYFMHXnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff480594b54abde1f10c566f831df6bde12dbb3159fa232311daa07794c6b79","last_reissued_at":"2026-05-17T23:44:21.925334Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:21.925334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11508","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-05-17T23:44:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNaqWFrY1MvUtH5QCMBwMcINgXw5j7FGHT+oZGYKSosoHi6atYwinLReCz2vHIFAxikEydHSTRe7GbWR3nuMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:56:32.525797Z"},"content_sha256":"098451c7f01b8cd2ffdb0666bc901b66362bd2b017470c8e2ebef2925a155808","schema_version":"1.0","event_id":"sha256:098451c7f01b8cd2ffdb0666bc901b66362bd2b017470c8e2ebef2925a155808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R72IAWKLKSV54HYQYVTPQMO7NP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilevel convergence analysis of multigrid-reduction-in-time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Andreas Hessenthaler, Ben S. Southworth, David Nordsletten, Jacob B. Schroder, Oliver R\\\"ohrle, Robert D. Falgout","submitted_at":"2018-12-30T10:50:50Z","abstract_excerpt":"This paper presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time stepping operator, analyzed directly and bounded in norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11508","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":""},"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-17T23:44:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"izbIBtzDK1+guUzPnTMzSDOKxJwVSwP0RZ0S2xOqz+ojxHfEI6j/Z0L/zDnqS1x2j/darZEHWidLq6u466KCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:56:32.526256Z"},"content_sha256":"a85eed251ee457ef85986045c14a5dd4edf0d1fed1966245e89d365d578b1e73","schema_version":"1.0","event_id":"sha256:a85eed251ee457ef85986045c14a5dd4edf0d1fed1966245e89d365d578b1e73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R72IAWKLKSV54HYQYVTPQMO7NP/bundle.json","state_url":"https://pith.science/pith/R72IAWKLKSV54HYQYVTPQMO7NP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R72IAWKLKSV54HYQYVTPQMO7NP/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-27T16:56:32Z","links":{"resolver":"https://pith.science/pith/R72IAWKLKSV54HYQYVTPQMO7NP","bundle":"https://pith.science/pith/R72IAWKLKSV54HYQYVTPQMO7NP/bundle.json","state":"https://pith.science/pith/R72IAWKLKSV54HYQYVTPQMO7NP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R72IAWKLKSV54HYQYVTPQMO7NP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R72IAWKLKSV54HYQYVTPQMO7NP","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":"b56b19b9864ca1c9fdd1b04a92641dae360cb3349cb60c82eeefc294543c326a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T10:50:50Z","title_canon_sha256":"9e0fa84b1ff30706053ae4ae32818ce8daedd50551aefb94b4af08c30c28f01a"},"schema_version":"1.0","source":{"id":"1812.11508","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11508","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11508v2","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11508","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"pith_short_12","alias_value":"R72IAWKLKSV5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R72IAWKLKSV54HYQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R72IAWKL","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:a85eed251ee457ef85986045c14a5dd4edf0d1fed1966245e89d365d578b1e73","target":"graph","created_at":"2026-05-17T23:44:21Z","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 multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time stepping operator, analyzed directly and bounded in norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds a","authors_text":"Andreas Hessenthaler, Ben S. Southworth, David Nordsletten, Jacob B. Schroder, Oliver R\\\"ohrle, Robert D. Falgout","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T10:50:50Z","title":"Multilevel convergence analysis of multigrid-reduction-in-time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11508","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:098451c7f01b8cd2ffdb0666bc901b66362bd2b017470c8e2ebef2925a155808","target":"record","created_at":"2026-05-17T23:44:21Z","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":"b56b19b9864ca1c9fdd1b04a92641dae360cb3349cb60c82eeefc294543c326a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T10:50:50Z","title_canon_sha256":"9e0fa84b1ff30706053ae4ae32818ce8daedd50551aefb94b4af08c30c28f01a"},"schema_version":"1.0","source":{"id":"1812.11508","kind":"arxiv","version":2}},"canonical_sha256":"8ff480594b54abde1f10c566f831df6bde12dbb3159fa232311daa07794c6b79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff480594b54abde1f10c566f831df6bde12dbb3159fa232311daa07794c6b79","first_computed_at":"2026-05-17T23:44:21.925334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:21.925334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ApAGNMzVNNnPYgPrNqnZhw4lndvpND700BwncNp1sNhx+tbZzobEkMENHqFaQa1GRbKLKcjgk1jomXYFMHXnBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:21.926026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11508","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:098451c7f01b8cd2ffdb0666bc901b66362bd2b017470c8e2ebef2925a155808","sha256:a85eed251ee457ef85986045c14a5dd4edf0d1fed1966245e89d365d578b1e73"],"state_sha256":"680620f44e536151a9b2d96b9c11b305cff11729e2b0e96c294a4dbb60e6cff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBYf66PD+Xrj7GTB7frfM3agTCzQZCP6fGmtfhzra8kFeiP3N7rzyy2D0r8ZJI5rua/gocwAYU3CupX3VWPlCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:56:32.529685Z","bundle_sha256":"00bb52825657676448d5963f42686b22e8c23ed9ab7c9aab5ad740bd84e784c2"}}