{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WOCLQ7KMACRFISIBAEFXCETERM","short_pith_number":"pith:WOCLQ7KM","schema_version":"1.0","canonical_sha256":"b384b87d4c00a2544901010b7112648b14ad09faed4be271fd040fe870182971","source":{"kind":"arxiv","id":"1110.5709","version":4},"attestation_state":"computed","paper":{"title":"Graph partitioning using matrix values for preconditioning symmetric positive definite systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eugene Vecharynski, Masha Sosonkina, Yousef Saad","submitted_at":"2011-10-26T06:29:21Z","abstract_excerpt":"Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel matrix-vector multiplication, and typically disregard the information on the coefficients of the matrix. This information, however, may have a significant impact on the quality of the preconditioning procedure used within the chosen iterative scheme. In the present paper, we suggest a spectral partitioning algorithm, which takes into account the information on the mat"},"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":"1110.5709","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-26T06:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"67b1606b674349f6529b8ae9f88589b04b05b92586aa0c36c4c75de5adc93ffb","abstract_canon_sha256":"996a7e7a6a65136d64405d34d607a2ef5ff02bc90006c61d04b70beb93f5a4bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:02.339137Z","signature_b64":"3yTb7t4uo5i3w+R2VmBv7Hset9k0zkQDXrKp9yQXlEB7Njin25ulhk/3TTLe0CyK2YjeRT0oXHi3gNYYNNgkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b384b87d4c00a2544901010b7112648b14ad09faed4be271fd040fe870182971","last_reissued_at":"2026-05-18T03:07:02.338683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:02.338683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph partitioning using matrix values for preconditioning symmetric positive definite systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eugene Vecharynski, Masha Sosonkina, Yousef Saad","submitted_at":"2011-10-26T06:29:21Z","abstract_excerpt":"Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel matrix-vector multiplication, and typically disregard the information on the coefficients of the matrix. This information, however, may have a significant impact on the quality of the preconditioning procedure used within the chosen iterative scheme. In the present paper, we suggest a spectral partitioning algorithm, which takes into account the information on the mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5709","kind":"arxiv","version":4},"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":"1110.5709","created_at":"2026-05-18T03:07:02.338748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5709v4","created_at":"2026-05-18T03:07:02.338748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5709","created_at":"2026-05-18T03:07:02.338748+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOCLQ7KMACRF","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOCLQ7KMACRFISIB","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOCLQ7KM","created_at":"2026-05-18T12:26:44.992195+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/WOCLQ7KMACRFISIBAEFXCETERM","json":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM.json","graph_json":"https://pith.science/api/pith-number/WOCLQ7KMACRFISIBAEFXCETERM/graph.json","events_json":"https://pith.science/api/pith-number/WOCLQ7KMACRFISIBAEFXCETERM/events.json","paper":"https://pith.science/paper/WOCLQ7KM"},"agent_actions":{"view_html":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM","download_json":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM.json","view_paper":"https://pith.science/paper/WOCLQ7KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5709&json=true","fetch_graph":"https://pith.science/api/pith-number/WOCLQ7KMACRFISIBAEFXCETERM/graph.json","fetch_events":"https://pith.science/api/pith-number/WOCLQ7KMACRFISIBAEFXCETERM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM/action/storage_attestation","attest_author":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM/action/author_attestation","sign_citation":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM/action/citation_signature","submit_replication":"https://pith.science/pith/WOCLQ7KMACRFISIBAEFXCETERM/action/replication_record"}},"created_at":"2026-05-18T03:07:02.338748+00:00","updated_at":"2026-05-18T03:07:02.338748+00:00"}