{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YGS6JLFG6IH6SNK6WJAVEIV7IF","short_pith_number":"pith:YGS6JLFG","schema_version":"1.0","canonical_sha256":"c1a5e4aca6f20fe9355eb2415222bf41728003998852c0d74f92c4aeda8c23c6","source":{"kind":"arxiv","id":"1602.07558","version":2},"attestation_state":"computed","paper":{"title":"The swept rule for breaking the latency barrier in time advancing two-dimensional PDEs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"John Williams, Maitham Makki Alhubail, Qiqi Wang","submitted_at":"2016-02-23T17:42:36Z","abstract_excerpt":"This article describes a method to accelerate parallel, explicit time integration of two-dimensional unsteady PDEs. The method is motivated by our observation that latency, not bandwidth, often limits how fast PDEs can be solved in parallel. The method is called the swept rule of space-time domain decomposition. Compared to conventional, space-only domain decomposition, it communicates similar amount of data, but in fewer messages. The swept rule achieves this by decomposing space and time among computing nodes in ways that exploit the domains of influence and the domain of dependency, making "},"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":"1602.07558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-23T17:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"06359f4997d9684494dfbed7c85b01ea9c1748a249e0726a6c94dc3d6216d992","abstract_canon_sha256":"252b20afc25b27bf1ea4e731b6ce1f4911f73908fd6ed6a0b15671b091e4e9b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:03.208660Z","signature_b64":"jk2Q/DnuW1ziMu/e4C8DuEjlTVp9lVw+rzGgeBA2s7T3blGMMvdCOiDcTX95we48DFHon7pfTyp6cjRXvafyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a5e4aca6f20fe9355eb2415222bf41728003998852c0d74f92c4aeda8c23c6","last_reissued_at":"2026-05-18T01:00:03.208080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:03.208080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The swept rule for breaking the latency barrier in time advancing two-dimensional PDEs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"John Williams, Maitham Makki Alhubail, Qiqi Wang","submitted_at":"2016-02-23T17:42:36Z","abstract_excerpt":"This article describes a method to accelerate parallel, explicit time integration of two-dimensional unsteady PDEs. The method is motivated by our observation that latency, not bandwidth, often limits how fast PDEs can be solved in parallel. The method is called the swept rule of space-time domain decomposition. Compared to conventional, space-only domain decomposition, it communicates similar amount of data, but in fewer messages. The swept rule achieves this by decomposing space and time among computing nodes in ways that exploit the domains of influence and the domain of dependency, making "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07558","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07558","created_at":"2026-05-18T01:00:03.208175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07558v2","created_at":"2026-05-18T01:00:03.208175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07558","created_at":"2026-05-18T01:00:03.208175+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGS6JLFG6IH6","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGS6JLFG6IH6SNK6","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGS6JLFG","created_at":"2026-05-18T12:30:53.716459+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/YGS6JLFG6IH6SNK6WJAVEIV7IF","json":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF.json","graph_json":"https://pith.science/api/pith-number/YGS6JLFG6IH6SNK6WJAVEIV7IF/graph.json","events_json":"https://pith.science/api/pith-number/YGS6JLFG6IH6SNK6WJAVEIV7IF/events.json","paper":"https://pith.science/paper/YGS6JLFG"},"agent_actions":{"view_html":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF","download_json":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF.json","view_paper":"https://pith.science/paper/YGS6JLFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07558&json=true","fetch_graph":"https://pith.science/api/pith-number/YGS6JLFG6IH6SNK6WJAVEIV7IF/graph.json","fetch_events":"https://pith.science/api/pith-number/YGS6JLFG6IH6SNK6WJAVEIV7IF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF/action/storage_attestation","attest_author":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF/action/author_attestation","sign_citation":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF/action/citation_signature","submit_replication":"https://pith.science/pith/YGS6JLFG6IH6SNK6WJAVEIV7IF/action/replication_record"}},"created_at":"2026-05-18T01:00:03.208175+00:00","updated_at":"2026-05-18T01:00:03.208175+00:00"}