{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VO6MRFLOMUBF6LHHKIAI2G622D","short_pith_number":"pith:VO6MRFLO","schema_version":"1.0","canonical_sha256":"abbcc8956e65025f2ce752008d1bdad0cc126c7ce18b9ab9c2a9b4c5391d63cf","source":{"kind":"arxiv","id":"1711.03825","version":1},"attestation_state":"computed","paper":{"title":"Deep Multigrid: learning prolongation and restriction matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexandr Katrutsa, Ivan Oseledets, Talgat Daulbaev","submitted_at":"2017-11-10T14:10:40Z","abstract_excerpt":"This paper proposes the method to optimize restriction and prolongation operators in the two-grid method. The proposed method is straightforwardly extended to the geometric multigrid method (GMM). GMM is used in solving discretized partial differential equation (PDE) and based on the restriction and prolongation operators. The operators are crucial for fast convergence of GMM, but they are unknown. To find them we propose a reformulation of the two-grid method in terms of a deep neural network with a specific architecture. This architecture is based on the idea that every operation in the two-"},"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":"1711.03825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-10T14:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"1d8f6740762b86e087bc200b134d48bc4b95d65c6159d392288e0b6286923609","abstract_canon_sha256":"66a53ce35c901db171ebfd2551c793a7b9b6c14366e2accb85e954eb13c4f54e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:10.809114Z","signature_b64":"LuIZECg8rPuBy5509HRHFC9b+zC4tdCP37s6qLO1xJLe07c5JEDetPAbqwSmSzRkngeNATDOHE2ntcXgQqdRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abbcc8956e65025f2ce752008d1bdad0cc126c7ce18b9ab9c2a9b4c5391d63cf","last_reissued_at":"2026-05-18T00:13:10.808411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:10.808411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Multigrid: learning prolongation and restriction matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexandr Katrutsa, Ivan Oseledets, Talgat Daulbaev","submitted_at":"2017-11-10T14:10:40Z","abstract_excerpt":"This paper proposes the method to optimize restriction and prolongation operators in the two-grid method. The proposed method is straightforwardly extended to the geometric multigrid method (GMM). GMM is used in solving discretized partial differential equation (PDE) and based on the restriction and prolongation operators. The operators are crucial for fast convergence of GMM, but they are unknown. To find them we propose a reformulation of the two-grid method in terms of a deep neural network with a specific architecture. This architecture is based on the idea that every operation in the two-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03825","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":""},"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":"1711.03825","created_at":"2026-05-18T00:13:10.808526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03825v1","created_at":"2026-05-18T00:13:10.808526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03825","created_at":"2026-05-18T00:13:10.808526+00:00"},{"alias_kind":"pith_short_12","alias_value":"VO6MRFLOMUBF","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VO6MRFLOMUBF6LHH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VO6MRFLO","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2302.03286","citing_title":"Algorithmically Designed Artificial Neural Networks (ADANNs): Higher order deep operator learning for parametric partial differential equations","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D","json":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D.json","graph_json":"https://pith.science/api/pith-number/VO6MRFLOMUBF6LHHKIAI2G622D/graph.json","events_json":"https://pith.science/api/pith-number/VO6MRFLOMUBF6LHHKIAI2G622D/events.json","paper":"https://pith.science/paper/VO6MRFLO"},"agent_actions":{"view_html":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D","download_json":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D.json","view_paper":"https://pith.science/paper/VO6MRFLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03825&json=true","fetch_graph":"https://pith.science/api/pith-number/VO6MRFLOMUBF6LHHKIAI2G622D/graph.json","fetch_events":"https://pith.science/api/pith-number/VO6MRFLOMUBF6LHHKIAI2G622D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D/action/storage_attestation","attest_author":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D/action/author_attestation","sign_citation":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D/action/citation_signature","submit_replication":"https://pith.science/pith/VO6MRFLOMUBF6LHHKIAI2G622D/action/replication_record"}},"created_at":"2026-05-18T00:13:10.808526+00:00","updated_at":"2026-05-18T00:13:10.808526+00:00"}