{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YDRDWY3WA3YTDTTRAX77MKMN3N","short_pith_number":"pith:YDRDWY3W","schema_version":"1.0","canonical_sha256":"c0e23b637606f131ce7105fff6298ddb611c90e5d12a17b08eaadbc0a2cdd58b","source":{"kind":"arxiv","id":"1704.06829","version":3},"attestation_state":"computed","paper":{"title":"Extreme-Scale Block-Structured Adaptive Mesh Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Florian Schornbaum, Ulrich R\\\"ude","submitted_at":"2017-04-22T18:21:36Z","abstract_excerpt":"In this article, we present a novel approach for block-structured adaptive mesh refinement (AMR) that is suitable for extreme-scale parallelism. All data structures are designed such that the size of the meta data in each distributed processor memory remains bounded independent of the processor number. In all stages of the AMR process, we use only distributed algorithms. No central resources such as a master process or replicated data are employed, so that an unlimited scalability can be achieved. For the dynamic load balancing in particular, we propose to exploit the hierarchical nature of th"},"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":"1704.06829","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-22T18:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"9a0efd0a658d915b5898836227168feccc94f976c0041c2a9c7a49781a43b1e4","abstract_canon_sha256":"940c60f4a46035c76bc05b6eeb317bfb65e31d3fc700c20ad808a570c050d238"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:13.774931Z","signature_b64":"1v8hBRMaK3PYcilokZYFk2h/EwHltw8CYzexo6QXR6gw2gtEAeH14ZRavQb3IDrw/ZxONaX3cKrJI8HtDFQ0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e23b637606f131ce7105fff6298ddb611c90e5d12a17b08eaadbc0a2cdd58b","last_reissued_at":"2026-05-18T00:10:13.774292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:13.774292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extreme-Scale Block-Structured Adaptive Mesh Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Florian Schornbaum, Ulrich R\\\"ude","submitted_at":"2017-04-22T18:21:36Z","abstract_excerpt":"In this article, we present a novel approach for block-structured adaptive mesh refinement (AMR) that is suitable for extreme-scale parallelism. All data structures are designed such that the size of the meta data in each distributed processor memory remains bounded independent of the processor number. In all stages of the AMR process, we use only distributed algorithms. No central resources such as a master process or replicated data are employed, so that an unlimited scalability can be achieved. For the dynamic load balancing in particular, we propose to exploit the hierarchical nature of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06829","kind":"arxiv","version":3},"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":"1704.06829","created_at":"2026-05-18T00:10:13.774407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06829v3","created_at":"2026-05-18T00:10:13.774407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06829","created_at":"2026-05-18T00:10:13.774407+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDRDWY3WA3YT","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDRDWY3WA3YTDTTR","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDRDWY3W","created_at":"2026-05-18T12:31:56.362134+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/YDRDWY3WA3YTDTTRAX77MKMN3N","json":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N.json","graph_json":"https://pith.science/api/pith-number/YDRDWY3WA3YTDTTRAX77MKMN3N/graph.json","events_json":"https://pith.science/api/pith-number/YDRDWY3WA3YTDTTRAX77MKMN3N/events.json","paper":"https://pith.science/paper/YDRDWY3W"},"agent_actions":{"view_html":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N","download_json":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N.json","view_paper":"https://pith.science/paper/YDRDWY3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06829&json=true","fetch_graph":"https://pith.science/api/pith-number/YDRDWY3WA3YTDTTRAX77MKMN3N/graph.json","fetch_events":"https://pith.science/api/pith-number/YDRDWY3WA3YTDTTRAX77MKMN3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N/action/storage_attestation","attest_author":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N/action/author_attestation","sign_citation":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N/action/citation_signature","submit_replication":"https://pith.science/pith/YDRDWY3WA3YTDTTRAX77MKMN3N/action/replication_record"}},"created_at":"2026-05-18T00:10:13.774407+00:00","updated_at":"2026-05-18T00:10:13.774407+00:00"}