{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SYNELEYPMNCE3CFV6M3PQZNCUB","short_pith_number":"pith:SYNELEYP","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"},"canonical_sha256":"961a45930f63444d88b5f336f865a2a05c1a959837ffa0a9cbf755512c1ef487","source":{"kind":"arxiv","id":"1304.6514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6514","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6514v1","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6514","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"SYNELEYPMNCE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SYNELEYPMNCE3CFV","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SYNELEYP","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SYNELEYPMNCE3CFV6M3PQZNCUB","target":"record","payload":{"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"},"canonical_sha256":"961a45930f63444d88b5f336f865a2a05c1a959837ffa0a9cbf755512c1ef487","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"},"source_kind":"arxiv","source_id":"1304.6514","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-18T02:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwTML/drlyGrYvyTQ/A1ZZErtb1Y/JP47OTgeAQ+vC8L3R8fgZkG96p4pMlG3aAe7hMYrTHq5gtWgGRqgWJ4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:23:11.557514Z"},"content_sha256":"2e2330e99d61ad1453fc6219f9cce801b6cb4601148473b3ad4462ba3f360a7d","schema_version":"1.0","event_id":"sha256:2e2330e99d61ad1453fc6219f9cce801b6cb4601148473b3ad4462ba3f360a7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SYNELEYPMNCE3CFV6M3PQZNCUB","target":"graph","payload":{"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"},"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-18T02:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XccAAIQ7TUZSdkgNso8/k8vrCl4i2//TlvatAWrNUBIbryVr6EZ2y2xD6oV1aJAkXTVgx7RuwA6dETT+7sY0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:23:11.557873Z"},"content_sha256":"d30b4d0b76b1ee63a08d6bfb035bf4093d285cbbd2b141da98e893c8ab2d366e","schema_version":"1.0","event_id":"sha256:d30b4d0b76b1ee63a08d6bfb035bf4093d285cbbd2b141da98e893c8ab2d366e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/bundle.json","state_url":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/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-31T23:23:11Z","links":{"resolver":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB","bundle":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/bundle.json","state":"https://pith.science/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYNELEYPMNCE3CFV6M3PQZNCUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SYNELEYPMNCE3CFV6M3PQZNCUB","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":"9bba0b4f51a28a049bfe668430125139e406308fdc768f10fb63133185f8c7b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-24T08:51:55Z","title_canon_sha256":"e53660ee597802c7ac8756e6cfe1ee9dffade0a0538576c4cabc0ff3909f370a"},"schema_version":"1.0","source":{"id":"1304.6514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6514","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6514v1","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6514","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"SYNELEYPMNCE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SYNELEYPMNCE3CFV","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SYNELEYP","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:d30b4d0b76b1ee63a08d6bfb035bf4093d285cbbd2b141da98e893c8ab2d366e","target":"graph","created_at":"2026-05-18T02:04:00Z","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 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","authors_text":"Andrew T. Barker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-24T08:51:55Z","title":"A minimal communication approach to parallel time integration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6514","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:2e2330e99d61ad1453fc6219f9cce801b6cb4601148473b3ad4462ba3f360a7d","target":"record","created_at":"2026-05-18T02:04:00Z","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":"9bba0b4f51a28a049bfe668430125139e406308fdc768f10fb63133185f8c7b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-24T08:51:55Z","title_canon_sha256":"e53660ee597802c7ac8756e6cfe1ee9dffade0a0538576c4cabc0ff3909f370a"},"schema_version":"1.0","source":{"id":"1304.6514","kind":"arxiv","version":1}},"canonical_sha256":"961a45930f63444d88b5f336f865a2a05c1a959837ffa0a9cbf755512c1ef487","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"961a45930f63444d88b5f336f865a2a05c1a959837ffa0a9cbf755512c1ef487","first_computed_at":"2026-05-18T02:04:00.619699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:00.619699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d8bwIOtd2Rg0M1CtIUi+hdlCtQyfV8AQ4wt0z11aaTIJFDZRqJwtMIXo9XfzXCd7PhYpuD31XfKXeK+SQh2KAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:00.620483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e2330e99d61ad1453fc6219f9cce801b6cb4601148473b3ad4462ba3f360a7d","sha256:d30b4d0b76b1ee63a08d6bfb035bf4093d285cbbd2b141da98e893c8ab2d366e"],"state_sha256":"4bd34616786f40a17bcc6893364312f114191aa664f48659cf529ba8767429a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QN8Z3b/EvhvPfTbhLMJergDOvO0CJo+Q1Hf8lXuPucJQTDr6Ha9GnHxZkayLbEDgOYegQxotjy4yMwRYbUZMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:23:11.559946Z","bundle_sha256":"3d2154ab863f6e278ece76dc6189ea36d0f9a8a105db5043252e033a0667c78f"}}