{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:V5Z3RB6EI6PJN4UC2HHIMAR2NT","short_pith_number":"pith:V5Z3RB6E","schema_version":"1.0","canonical_sha256":"af73b887c4479e96f282d1ce86023a6cd9f5570123e9c1d2df85413e32c45d2f","source":{"kind":"arxiv","id":"1204.4072","version":1},"attestation_state":"computed","paper":{"title":"Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"James Brannick, Johannes Kraus, Ludmil Zikatanov, Yao Chen","submitted_at":"2012-04-18T12:46:07Z","abstract_excerpt":"This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the projection operator onto any piecewise constant vector space, which results in an estimate of the two-level convergence rate where the coarse level graph is obtained by matching. The two-level convergence of the method is then used to establish the convergence of an Algebraic Multilevel Iteration that uses the two-level scheme recursively. On structured grids, "},"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":"1204.4072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-04-18T12:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"f412a49ec3fa78cac2086896d17d5abbe7574537824084e74b8325808fd8c852","abstract_canon_sha256":"4d512ddcd226ad019a36f8cd39b02a1fea0b8c1a7ded8ff06b0258a3ed10b5ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:37.820604Z","signature_b64":"AQ6XEH8F4iWLj4owyARUGdJFdz5MY9owJQQdd7I426vyM3DOgtxE4Vu5SCFhl92JOcB87Fp+V8uF2twmvPLaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af73b887c4479e96f282d1ce86023a6cd9f5570123e9c1d2df85413e32c45d2f","last_reissued_at":"2026-05-18T03:57:37.819952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:37.819952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"James Brannick, Johannes Kraus, Ludmil Zikatanov, Yao Chen","submitted_at":"2012-04-18T12:46:07Z","abstract_excerpt":"This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the projection operator onto any piecewise constant vector space, which results in an estimate of the two-level convergence rate where the coarse level graph is obtained by matching. The two-level convergence of the method is then used to establish the convergence of an Algebraic Multilevel Iteration that uses the two-level scheme recursively. On structured grids, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4072","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":"1204.4072","created_at":"2026-05-18T03:57:37.820071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4072v1","created_at":"2026-05-18T03:57:37.820071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4072","created_at":"2026-05-18T03:57:37.820071+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5Z3RB6EI6PJ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5Z3RB6EI6PJN4UC","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5Z3RB6E","created_at":"2026-05-18T12:27:25.539911+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/V5Z3RB6EI6PJN4UC2HHIMAR2NT","json":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT.json","graph_json":"https://pith.science/api/pith-number/V5Z3RB6EI6PJN4UC2HHIMAR2NT/graph.json","events_json":"https://pith.science/api/pith-number/V5Z3RB6EI6PJN4UC2HHIMAR2NT/events.json","paper":"https://pith.science/paper/V5Z3RB6E"},"agent_actions":{"view_html":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT","download_json":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT.json","view_paper":"https://pith.science/paper/V5Z3RB6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4072&json=true","fetch_graph":"https://pith.science/api/pith-number/V5Z3RB6EI6PJN4UC2HHIMAR2NT/graph.json","fetch_events":"https://pith.science/api/pith-number/V5Z3RB6EI6PJN4UC2HHIMAR2NT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT/action/storage_attestation","attest_author":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT/action/author_attestation","sign_citation":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT/action/citation_signature","submit_replication":"https://pith.science/pith/V5Z3RB6EI6PJN4UC2HHIMAR2NT/action/replication_record"}},"created_at":"2026-05-18T03:57:37.820071+00:00","updated_at":"2026-05-18T03:57:37.820071+00:00"}