{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ULQE6HLFDBGOGMKEFNCTPJPHQW","short_pith_number":"pith:ULQE6HLF","canonical_record":{"source":{"id":"1603.02524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-03-08T14:04:58Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"46dbd8d7a39a58fdf522689fca1bbbcd8ebd9eb92761210bbf1173cad2ac499c","abstract_canon_sha256":"27edc4f9e4c7de12b095a077784eac2e0103f5ffa072a608fa674e8dca351943"},"schema_version":"1.0"},"canonical_sha256":"a2e04f1d65184ce331442b4537a5e785a7d46e2b3880d521752473f3a57ae8e0","source":{"kind":"arxiv","id":"1603.02524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02524","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02524v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02524","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"ULQE6HLFDBGO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"ULQE6HLFDBGOGMKE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"ULQE6HLF","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ULQE6HLFDBGOGMKEFNCTPJPHQW","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-03-08T14:04:58Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"46dbd8d7a39a58fdf522689fca1bbbcd8ebd9eb92761210bbf1173cad2ac499c","abstract_canon_sha256":"27edc4f9e4c7de12b095a077784eac2e0103f5ffa072a608fa674e8dca351943"},"schema_version":"1.0"},"canonical_sha256":"a2e04f1d65184ce331442b4537a5e785a7d46e2b3880d521752473f3a57ae8e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.772376Z","signature_b64":"fmoYIJNKwhxv7ge93324CFtJoQuYDj301ReBlM2SGjwYqzLevnDKRRLizZf735dE+nhtnjkNZ849GEm7uQghBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e04f1d65184ce331442b4537a5e785a7d46e2b3880d521752473f3a57ae8e0","last_reissued_at":"2026-05-18T00:54:15.771913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.771913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02524","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-18T00:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESX653OI7iFNsrIs4ugeb+xSG6GnfQjfJd0Die/WXULiVVHOiQKzpheqoOA6W3DNcu4Dn7PRne5MmV1P0Q+8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:44:32.456160Z"},"content_sha256":"4cd9852ab0738e08fe00921282717d306f3bd8d7c8b98cb56f8784d89dbec894","schema_version":"1.0","event_id":"sha256:4cd9852ab0738e08fe00921282717d306f3bd8d7c8b98cb56f8784d89dbec894"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ULQE6HLFDBGOGMKEFNCTPJPHQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust multigrid for high-order discontinuous Galerkin methods: A fast Poisson solver suitable for high-aspect ratio Cartesian grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CE","authors_text":"J\\\"org Stiller","submitted_at":"2016-03-08T14:04:58Z","abstract_excerpt":"We present a polynomial multigrid method for nodal interior penalty and local discontinuous Galerkin formulations of the Poisson equation on Cartesian grids. For smoothing we propose two classes of overlapping Schwarz methods. The first class comprises element-centered and the second face-centered methods. Within both classes we identify methods that achieve superior convergence rates, prove robust with respect to the mesh spacing and the polynomial order, at least up to ${P=32}$. Consequent structure exploitation yields a computational complexity of $O(PN)$, where $N$ is the number of unknown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02524","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-18T00:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIQw+PGvoCK01RJD77eBIkzD5SUYXcIFlJpBNcXKLUSbb+ayF7SwVYE9GAdicpvQXHcCwMWv8IssDoZkpDXyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:44:32.456531Z"},"content_sha256":"003c58a40190c5a2f3f19e7819db5dcb257ad21a08d0b2a4aeb502a96c803238","schema_version":"1.0","event_id":"sha256:003c58a40190c5a2f3f19e7819db5dcb257ad21a08d0b2a4aeb502a96c803238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW/bundle.json","state_url":"https://pith.science/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW/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-06-24T05:44:32Z","links":{"resolver":"https://pith.science/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW","bundle":"https://pith.science/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW/bundle.json","state":"https://pith.science/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULQE6HLFDBGOGMKEFNCTPJPHQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ULQE6HLFDBGOGMKEFNCTPJPHQW","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":"27edc4f9e4c7de12b095a077784eac2e0103f5ffa072a608fa674e8dca351943","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-03-08T14:04:58Z","title_canon_sha256":"46dbd8d7a39a58fdf522689fca1bbbcd8ebd9eb92761210bbf1173cad2ac499c"},"schema_version":"1.0","source":{"id":"1603.02524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02524","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02524v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02524","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"ULQE6HLFDBGO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"ULQE6HLFDBGOGMKE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"ULQE6HLF","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:003c58a40190c5a2f3f19e7819db5dcb257ad21a08d0b2a4aeb502a96c803238","target":"graph","created_at":"2026-05-18T00:54:15Z","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 present a polynomial multigrid method for nodal interior penalty and local discontinuous Galerkin formulations of the Poisson equation on Cartesian grids. For smoothing we propose two classes of overlapping Schwarz methods. The first class comprises element-centered and the second face-centered methods. Within both classes we identify methods that achieve superior convergence rates, prove robust with respect to the mesh spacing and the polynomial order, at least up to ${P=32}$. Consequent structure exploitation yields a computational complexity of $O(PN)$, where $N$ is the number of unknown","authors_text":"J\\\"org Stiller","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-03-08T14:04:58Z","title":"Robust multigrid for high-order discontinuous Galerkin methods: A fast Poisson solver suitable for high-aspect ratio Cartesian grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02524","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:4cd9852ab0738e08fe00921282717d306f3bd8d7c8b98cb56f8784d89dbec894","target":"record","created_at":"2026-05-18T00:54:15Z","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":"27edc4f9e4c7de12b095a077784eac2e0103f5ffa072a608fa674e8dca351943","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-03-08T14:04:58Z","title_canon_sha256":"46dbd8d7a39a58fdf522689fca1bbbcd8ebd9eb92761210bbf1173cad2ac499c"},"schema_version":"1.0","source":{"id":"1603.02524","kind":"arxiv","version":2}},"canonical_sha256":"a2e04f1d65184ce331442b4537a5e785a7d46e2b3880d521752473f3a57ae8e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e04f1d65184ce331442b4537a5e785a7d46e2b3880d521752473f3a57ae8e0","first_computed_at":"2026-05-18T00:54:15.771913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:15.771913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmoYIJNKwhxv7ge93324CFtJoQuYDj301ReBlM2SGjwYqzLevnDKRRLizZf735dE+nhtnjkNZ849GEm7uQghBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:15.772376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cd9852ab0738e08fe00921282717d306f3bd8d7c8b98cb56f8784d89dbec894","sha256:003c58a40190c5a2f3f19e7819db5dcb257ad21a08d0b2a4aeb502a96c803238"],"state_sha256":"c3036b187e788828fdc1cb822368d80e4442168dab6f17ecaeaadddefb42b213"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3vdeqGjJrq2D6LT28kLjyiaotX9uBKkxUR/tsDflVOhsuBSzCtrlhPQbCbdHsKD+RBZKx0DAKYw8TgLZo5CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:44:32.458564Z","bundle_sha256":"dd9fcc25239f51e6b96f2d8c41e6c6e47a6acce335155c0efaab64c409f7d9c8"}}