{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ESMJVLJCPCCDIUUE6SGNSAGLGV","short_pith_number":"pith:ESMJVLJC","schema_version":"1.0","canonical_sha256":"24989aad227884345284f48cd900cb3578b87b6061539bdf6c696448dc049864","source":{"kind":"arxiv","id":"1703.02285","version":3},"attestation_state":"computed","paper":{"title":"A multigrid algorithm for the $p$-version of the Virtual Element Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"L. Mascotto, M. Verani, P. F. Antonietti","submitted_at":"2017-03-07T08:59:18Z","abstract_excerpt":"We present a multigrid algorithm for the solution of the linear systems of equations stemming from the $p-$version of the Virtual Element discretization of a two-dimensional Poisson problem. The sequence of coarse spaces are constructed decreasing progressively the polynomial approximation degree of the Virtual Element space, as in standard $p$-multigrid schemes. The construction of the interspace operators relies on auxiliary Virtual Element spaces, where it is possible to compute higher order polynomial projectors. We prove that the multigrid scheme is uniformly convergent, provided the numb"},"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":"1703.02285","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-07T08:59:18Z","cross_cats_sorted":[],"title_canon_sha256":"4e811d5a6d63c61b86482b6086edce32543b6b8176b9bfd8beb83dfaf17582ad","abstract_canon_sha256":"c4aa0fae6214a6e042181e72c2f1d6ca1b836d19d3f56715ff91bd08b87f1d2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:38.956158Z","signature_b64":"Ln0Ohz+b7iEK7xy/VuiQtqBOTrvOn3oLVqEIgvJnLRYFPubMQ34BsjkOHqRTauBkYdhie0QKEDVm2em8bSZnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24989aad227884345284f48cd900cb3578b87b6061539bdf6c696448dc049864","last_reissued_at":"2026-05-18T00:42:38.955536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:38.955536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A multigrid algorithm for the $p$-version of the Virtual Element Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"L. Mascotto, M. Verani, P. F. Antonietti","submitted_at":"2017-03-07T08:59:18Z","abstract_excerpt":"We present a multigrid algorithm for the solution of the linear systems of equations stemming from the $p-$version of the Virtual Element discretization of a two-dimensional Poisson problem. The sequence of coarse spaces are constructed decreasing progressively the polynomial approximation degree of the Virtual Element space, as in standard $p$-multigrid schemes. The construction of the interspace operators relies on auxiliary Virtual Element spaces, where it is possible to compute higher order polynomial projectors. We prove that the multigrid scheme is uniformly convergent, provided the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02285","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":""},"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":"1703.02285","created_at":"2026-05-18T00:42:38.955683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02285v3","created_at":"2026-05-18T00:42:38.955683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02285","created_at":"2026-05-18T00:42:38.955683+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESMJVLJCPCCD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESMJVLJCPCCDIUUE","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESMJVLJC","created_at":"2026-05-18T12:31:12.930513+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/ESMJVLJCPCCDIUUE6SGNSAGLGV","json":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV.json","graph_json":"https://pith.science/api/pith-number/ESMJVLJCPCCDIUUE6SGNSAGLGV/graph.json","events_json":"https://pith.science/api/pith-number/ESMJVLJCPCCDIUUE6SGNSAGLGV/events.json","paper":"https://pith.science/paper/ESMJVLJC"},"agent_actions":{"view_html":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV","download_json":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV.json","view_paper":"https://pith.science/paper/ESMJVLJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02285&json=true","fetch_graph":"https://pith.science/api/pith-number/ESMJVLJCPCCDIUUE6SGNSAGLGV/graph.json","fetch_events":"https://pith.science/api/pith-number/ESMJVLJCPCCDIUUE6SGNSAGLGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV/action/storage_attestation","attest_author":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV/action/author_attestation","sign_citation":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV/action/citation_signature","submit_replication":"https://pith.science/pith/ESMJVLJCPCCDIUUE6SGNSAGLGV/action/replication_record"}},"created_at":"2026-05-18T00:42:38.955683+00:00","updated_at":"2026-05-18T00:42:38.955683+00:00"}