{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VHZV4F4YBL6N66JAVL265WRZTD","short_pith_number":"pith:VHZV4F4Y","schema_version":"1.0","canonical_sha256":"a9f35e17980afcdf7920aaf5eeda3998c23da00d78d1032e202af27a7dd7d2db","source":{"kind":"arxiv","id":"1207.6720","version":3},"attestation_state":"computed","paper":{"title":"A low memory, highly concurrent multigrid algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Mark F. Adams","submitted_at":"2012-07-28T19:01:06Z","abstract_excerpt":"We examine what is an efficient and scalable nonlinear solver, with low work and memory complexity, for many classes of discretized partial differential equations (PDEs) - matrix-free Full multigrid (FMG) with a Full Approximation Storage (FAS) - in the context of current trends in computer architectures. Brandt proposed an extremely low memory FMG-FAS algorithm over 25 years ago that has several attractive properties for reducing costs on modern - memory centric -- machines and has not been developed to our knowledge. This method, segmental refinement (SR), has very low memory requirements be"},"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":"1207.6720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-07-28T19:01:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"f8d46aa00118b378d0388d66d7e762f446d31d66c540295d531f93893a46f0f7","abstract_canon_sha256":"5801dc7ab2332f2837d53ee76ec465da925f52b39fb3053130f37fa562fef377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:07:23.549804Z","signature_b64":"1cP9oh55kkDXb2pDVx1FQ1Vpo33NdI/AX6c2g4j8rQyu2L8uyK55mxpTQE/HV4gEus7l0nwnI6UTzhOh1WWrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f35e17980afcdf7920aaf5eeda3998c23da00d78d1032e202af27a7dd7d2db","last_reissued_at":"2026-06-03T23:07:23.549276Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:07:23.549276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A low memory, highly concurrent multigrid algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Mark F. Adams","submitted_at":"2012-07-28T19:01:06Z","abstract_excerpt":"We examine what is an efficient and scalable nonlinear solver, with low work and memory complexity, for many classes of discretized partial differential equations (PDEs) - matrix-free Full multigrid (FMG) with a Full Approximation Storage (FAS) - in the context of current trends in computer architectures. Brandt proposed an extremely low memory FMG-FAS algorithm over 25 years ago that has several attractive properties for reducing costs on modern - memory centric -- machines and has not been developed to our knowledge. This method, segmental refinement (SR), has very low memory requirements be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6720","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1207.6720/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":"1207.6720","created_at":"2026-06-03T23:07:23.549351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6720v3","created_at":"2026-06-03T23:07:23.549351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6720","created_at":"2026-06-03T23:07:23.549351+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHZV4F4YBL6N","created_at":"2026-06-03T23:07:23.549351+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHZV4F4YBL6N66JA","created_at":"2026-06-03T23:07:23.549351+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHZV4F4Y","created_at":"2026-06-03T23:07:23.549351+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/VHZV4F4YBL6N66JAVL265WRZTD","json":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD.json","graph_json":"https://pith.science/api/pith-number/VHZV4F4YBL6N66JAVL265WRZTD/graph.json","events_json":"https://pith.science/api/pith-number/VHZV4F4YBL6N66JAVL265WRZTD/events.json","paper":"https://pith.science/paper/VHZV4F4Y"},"agent_actions":{"view_html":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD","download_json":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD.json","view_paper":"https://pith.science/paper/VHZV4F4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6720&json=true","fetch_graph":"https://pith.science/api/pith-number/VHZV4F4YBL6N66JAVL265WRZTD/graph.json","fetch_events":"https://pith.science/api/pith-number/VHZV4F4YBL6N66JAVL265WRZTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD/action/storage_attestation","attest_author":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD/action/author_attestation","sign_citation":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD/action/citation_signature","submit_replication":"https://pith.science/pith/VHZV4F4YBL6N66JAVL265WRZTD/action/replication_record"}},"created_at":"2026-06-03T23:07:23.549351+00:00","updated_at":"2026-06-03T23:07:23.549351+00:00"}