{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SYNELEYPMNCE3CFV6M3PQZNCUB","short_pith_number":"pith:SYNELEYP","schema_version":"1.0","canonical_sha256":"961a45930f63444d88b5f336f865a2a05c1a959837ffa0a9cbf755512c1ef487","source":{"kind":"arxiv","id":"1304.6514","version":1},"attestation_state":"computed","paper":{"title":"A minimal communication approach to parallel time integration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Andrew T. Barker","submitted_at":"2013-04-24T08:51:55Z","abstract_excerpt":"We explore an approach due to Nievergelt of decomposing a time-evolution equation along the time dimension and solving it in parallel with as little communication as possible between the processors. This method computes a map from initial conditions to final conditions locally on slices of the time domain, and then patches these operators together into a global solution using a single communication step. A basic error analysis is given, and some comparisons are made with other parallel in time methods. Based on the assumption that parallel computation is cheap but communication is very expensi"},"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":"1304.6514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-24T08:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"e53660ee597802c7ac8756e6cfe1ee9dffade0a0538576c4cabc0ff3909f370a","abstract_canon_sha256":"9bba0b4f51a28a049bfe668430125139e406308fdc768f10fb63133185f8c7b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:00.620483Z","signature_b64":"d8bwIOtd2Rg0M1CtIUi+hdlCtQyfV8AQ4wt0z11aaTIJFDZRqJwtMIXo9XfzXCd7PhYpuD31XfKXeK+SQh2KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961a45930f63444d88b5f336f865a2a05c1a959837ffa0a9cbf755512c1ef487","last_reissued_at":"2026-05-18T02:04:00.619699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:00.619699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A minimal communication approach to parallel time integration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Andrew T. Barker","submitted_at":"2013-04-24T08:51:55Z","abstract_excerpt":"We explore an approach due to Nievergelt of decomposing a time-evolution equation along the time dimension and solving it in parallel with as little communication as possible between the processors. This method computes a map from initial conditions to final conditions locally on slices of the time domain, and then patches these operators together into a global solution using a single communication step. A basic error analysis is given, and some comparisons are made with other parallel in time methods. Based on the assumption that parallel computation is cheap but communication is very expensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6514","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.6514","created_at":"2026-05-18T02:04:00.619824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6514v1","created_at":"2026-05-18T02:04:00.619824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6514","created_at":"2026-05-18T02:04:00.619824+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYNELEYPMNCE","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYNELEYPMNCE3CFV","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYNELEYP","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB","json":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB.json","graph_json":"https://pith.science/api/pith-number/SYNELEYPMNCE3CFV6M3PQZNCUB/graph.json","events_json":"https://pith.science/api/pith-number/SYNELEYPMNCE3CFV6M3PQZNCUB/events.json","paper":"https://pith.science/paper/SYNELEYP"},"agent_actions":{"view_html":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB","download_json":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB.json","view_paper":"https://pith.science/paper/SYNELEYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6514&json=true","fetch_graph":"https://pith.science/api/pith-number/SYNELEYPMNCE3CFV6M3PQZNCUB/graph.json","fetch_events":"https://pith.science/api/pith-number/SYNELEYPMNCE3CFV6M3PQZNCUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/action/storage_attestation","attest_author":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/action/author_attestation","sign_citation":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/action/citation_signature","submit_replication":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/action/replication_record"}},"created_at":"2026-05-18T02:04:00.619824+00:00","updated_at":"2026-05-18T02:04:00.619824+00:00"}