{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YMLSXBDVM3CBHBHUBX2A5CWWCZ","short_pith_number":"pith:YMLSXBDV","schema_version":"1.0","canonical_sha256":"c3172b847566c41384f40df40e8ad6164b03a040684ebf048a3b29a447a6a587","source":{"kind":"arxiv","id":"2008.00927","version":1},"attestation_state":"computed","paper":{"title":"A parameter-dependent smoother for the multigrid method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Christian L\\\"obbert, Lars Grasedyck, Maren Klever, Tim A. Werthmann","submitted_at":"2020-08-03T15:03:17Z","abstract_excerpt":"The solution of parameter-dependent linear systems, by classical methods, leads to an arithmetic effort that grows exponentially in the number of parameters. This renders the multigrid method, which has a well understood convergence theory, infeasible. A parameter-dependent representation, e.g., a low-rank tensor format, can avoid this exponential dependence, but in these it is unknown how to calculate the inverse directly within the representation. The combination of these representations with the multigrid method requires a parameter-dependent version of the classical multigrid theory and a "},"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":"2008.00927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-08-03T15:03:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d5f63f6097dfcf06b47683f721775793f4e4822aa5ab470db346af9450c2c752","abstract_canon_sha256":"15207fb995eb7e3e77fc1ca8cb86d5f815cd2d38dd9c27f201101eeb26085f95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:24:12.415669Z","signature_b64":"VAYBme7cHRkqM9A1vrpTHt3VCcQN5JfelWzQqYBFM2RNejY0jTK1NF0f0ktY/nBxHt8c3tlKN79mLNOiXIs0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3172b847566c41384f40df40e8ad6164b03a040684ebf048a3b29a447a6a587","last_reissued_at":"2026-07-05T01:24:12.415191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:24:12.415191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A parameter-dependent smoother for the multigrid method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Christian L\\\"obbert, Lars Grasedyck, Maren Klever, Tim A. Werthmann","submitted_at":"2020-08-03T15:03:17Z","abstract_excerpt":"The solution of parameter-dependent linear systems, by classical methods, leads to an arithmetic effort that grows exponentially in the number of parameters. This renders the multigrid method, which has a well understood convergence theory, infeasible. A parameter-dependent representation, e.g., a low-rank tensor format, can avoid this exponential dependence, but in these it is unknown how to calculate the inverse directly within the representation. The combination of these representations with the multigrid method requires a parameter-dependent version of the classical multigrid theory and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00927","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/2008.00927/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":"2008.00927","created_at":"2026-07-05T01:24:12.415252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.00927v1","created_at":"2026-07-05T01:24:12.415252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00927","created_at":"2026-07-05T01:24:12.415252+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMLSXBDVM3CB","created_at":"2026-07-05T01:24:12.415252+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMLSXBDVM3CBHBHU","created_at":"2026-07-05T01:24:12.415252+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMLSXBDV","created_at":"2026-07-05T01:24:12.415252+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21750","citing_title":"Multilevel Adaptive-Rank Methods for Linear and Nonlinear Systems in the Hierarchical Tucker Format","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ","json":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ.json","graph_json":"https://pith.science/api/pith-number/YMLSXBDVM3CBHBHUBX2A5CWWCZ/graph.json","events_json":"https://pith.science/api/pith-number/YMLSXBDVM3CBHBHUBX2A5CWWCZ/events.json","paper":"https://pith.science/paper/YMLSXBDV"},"agent_actions":{"view_html":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ","download_json":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ.json","view_paper":"https://pith.science/paper/YMLSXBDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.00927&json=true","fetch_graph":"https://pith.science/api/pith-number/YMLSXBDVM3CBHBHUBX2A5CWWCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YMLSXBDVM3CBHBHUBX2A5CWWCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ/action/storage_attestation","attest_author":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ/action/author_attestation","sign_citation":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ/action/citation_signature","submit_replication":"https://pith.science/pith/YMLSXBDVM3CBHBHUBX2A5CWWCZ/action/replication_record"}},"created_at":"2026-07-05T01:24:12.415252+00:00","updated_at":"2026-07-05T01:24:12.415252+00:00"}