{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QSSSIZBMFUV57ARNPB3YBY2I5U","short_pith_number":"pith:QSSSIZBM","schema_version":"1.0","canonical_sha256":"84a524642c2d2bdf822d787780e348ed37838095833772ccb773d6d9c55e5a7b","source":{"kind":"arxiv","id":"2403.07936","version":1},"attestation_state":"computed","paper":{"title":"Accelerating multigrid solver with generative super-resolution","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Francisco Holguin, Gavin Portwood, GS Sidharth","submitted_at":"2024-03-07T18:09:03Z","abstract_excerpt":"The geometric multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to iterative methods such as Gauss-Seidel. The prolongation or coarse-to-fine interpolation operator within the multigrid algorithm, lends itself to a data-driven treatment with deep learning super-resolution, commonly used to increase the resolution of images. We (i) propose the integration of a super-resolution generative adversarial network (GAN) model w"},"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":"2403.07936","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NA","submitted_at":"2024-03-07T18:09:03Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4754f03017ced4bb8a8e7fc2eded2a3a9f50bc3bb9efb528f2af77eec147f4cd","abstract_canon_sha256":"d1b58cc525e1729adc0d60ef1ad6da7597157372fc0b4accd1e141e05b0cd1d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:32.300293Z","signature_b64":"6370z6cPBSvaMtZnDabxomZbU1oJyUiXEa7P5wTAvHsGrxSUp/iphVnILM5wewj7BI+e1udZJ/g0uaZkcAXWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84a524642c2d2bdf822d787780e348ed37838095833772ccb773d6d9c55e5a7b","last_reissued_at":"2026-07-05T07:55:32.299837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:32.299837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating multigrid solver with generative super-resolution","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Francisco Holguin, Gavin Portwood, GS Sidharth","submitted_at":"2024-03-07T18:09:03Z","abstract_excerpt":"The geometric multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to iterative methods such as Gauss-Seidel. The prolongation or coarse-to-fine interpolation operator within the multigrid algorithm, lends itself to a data-driven treatment with deep learning super-resolution, commonly used to increase the resolution of images. We (i) propose the integration of a super-resolution generative adversarial network (GAN) model w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07936","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.07936/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.07936","created_at":"2026-07-05T07:55:32.299897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.07936v1","created_at":"2026-07-05T07:55:32.299897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07936","created_at":"2026-07-05T07:55:32.299897+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSSSIZBMFUV5","created_at":"2026-07-05T07:55:32.299897+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSSSIZBMFUV57ARN","created_at":"2026-07-05T07:55:32.299897+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSSSIZBM","created_at":"2026-07-05T07:55:32.299897+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.16598","citing_title":"A robust and stable hybrid neural network/finite element method for 2D flows that generalizes to different geometries","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U","json":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U.json","graph_json":"https://pith.science/api/pith-number/QSSSIZBMFUV57ARNPB3YBY2I5U/graph.json","events_json":"https://pith.science/api/pith-number/QSSSIZBMFUV57ARNPB3YBY2I5U/events.json","paper":"https://pith.science/paper/QSSSIZBM"},"agent_actions":{"view_html":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U","download_json":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U.json","view_paper":"https://pith.science/paper/QSSSIZBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.07936&json=true","fetch_graph":"https://pith.science/api/pith-number/QSSSIZBMFUV57ARNPB3YBY2I5U/graph.json","fetch_events":"https://pith.science/api/pith-number/QSSSIZBMFUV57ARNPB3YBY2I5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U/action/storage_attestation","attest_author":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U/action/author_attestation","sign_citation":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U/action/citation_signature","submit_replication":"https://pith.science/pith/QSSSIZBMFUV57ARNPB3YBY2I5U/action/replication_record"}},"created_at":"2026-07-05T07:55:32.299897+00:00","updated_at":"2026-07-05T07:55:32.299897+00:00"}