{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MLE5U457KHBN6ATZSAQUKQAU4N","short_pith_number":"pith:MLE5U457","canonical_record":{"source":{"id":"1705.06266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T17:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"7b5504ed13efd4eaf0893567d78759d32f82a06cecfa9db80c11bf6c34796540","abstract_canon_sha256":"8d6dac314c57386b9de9819833319a8b0fa270a4fae1e72d2f60fc42ec894109"},"schema_version":"1.0"},"canonical_sha256":"62c9da73bf51c2df02799021454014e357d7e70d8f44cd3c0cf2297f1c4b1abc","source":{"kind":"arxiv","id":"1705.06266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06266","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06266v2","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06266","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"MLE5U457KHBN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MLE5U457KHBN6ATZ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MLE5U457","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MLE5U457KHBN6ATZSAQUKQAU4N","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T17:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"7b5504ed13efd4eaf0893567d78759d32f82a06cecfa9db80c11bf6c34796540","abstract_canon_sha256":"8d6dac314c57386b9de9819833319a8b0fa270a4fae1e72d2f60fc42ec894109"},"schema_version":"1.0"},"canonical_sha256":"62c9da73bf51c2df02799021454014e357d7e70d8f44cd3c0cf2297f1c4b1abc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:00.578820Z","signature_b64":"DtRHgXGaraSf6cKJteMVOAMpZCMhXNhHdewhLokBsv1aSYhjsDYHEZzcysj7FmileditaS7VanG3pGqq+XRuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c9da73bf51c2df02799021454014e357d7e70d8f44cd3c0cf2297f1c4b1abc","last_reissued_at":"2026-05-18T00:11:00.578054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:00.578054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06266","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/O2FImhrUXFzsdksRcovLzydqS2S7yFEbA/0F29aj3R63rSef9akj0OcC4CB2mQB/oZKeLZJykZrFuSt2OKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:04:08.700540Z"},"content_sha256":"ddbfc001435f5bd157225bee5959bf3979f6c04ee71ff94f1df669dc4b100ae4","schema_version":"1.0","event_id":"sha256:ddbfc001435f5bd157225bee5959bf3979f6c04ee71ff94f1df669dc4b100ae4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MLE5U457KHBN6ATZSAQUKQAU4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parallel Solver for Graph Laplacians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jed Brown, Tristan Konolige","submitted_at":"2017-05-17T17:24:05Z","abstract_excerpt":"Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06266","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+Ogzo99q6NMy1e0sA0rhAwDPTZZjcJAcy9cZVP+2FXHdCf/SDyGYji7s7yq2fPF3WVv2m8eloULC25Hq5WDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:04:08.700887Z"},"content_sha256":"97acfba56748f4ac772b55e8df145aaf17e0205a65058c6968dceb7320522815","schema_version":"1.0","event_id":"sha256:97acfba56748f4ac772b55e8df145aaf17e0205a65058c6968dceb7320522815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLE5U457KHBN6ATZSAQUKQAU4N/bundle.json","state_url":"https://pith.science/pith/MLE5U457KHBN6ATZSAQUKQAU4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLE5U457KHBN6ATZSAQUKQAU4N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T15:04:08Z","links":{"resolver":"https://pith.science/pith/MLE5U457KHBN6ATZSAQUKQAU4N","bundle":"https://pith.science/pith/MLE5U457KHBN6ATZSAQUKQAU4N/bundle.json","state":"https://pith.science/pith/MLE5U457KHBN6ATZSAQUKQAU4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLE5U457KHBN6ATZSAQUKQAU4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MLE5U457KHBN6ATZSAQUKQAU4N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d6dac314c57386b9de9819833319a8b0fa270a4fae1e72d2f60fc42ec894109","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T17:24:05Z","title_canon_sha256":"7b5504ed13efd4eaf0893567d78759d32f82a06cecfa9db80c11bf6c34796540"},"schema_version":"1.0","source":{"id":"1705.06266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06266","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06266v2","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06266","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"MLE5U457KHBN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MLE5U457KHBN6ATZ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MLE5U457","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:97acfba56748f4ac772b55e8df145aaf17e0205a65058c6968dceb7320522815","target":"graph","created_at":"2026-05-18T00:11:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These a","authors_text":"Jed Brown, Tristan Konolige","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T17:24:05Z","title":"A Parallel Solver for Graph Laplacians"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06266","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ddbfc001435f5bd157225bee5959bf3979f6c04ee71ff94f1df669dc4b100ae4","target":"record","created_at":"2026-05-18T00:11:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8d6dac314c57386b9de9819833319a8b0fa270a4fae1e72d2f60fc42ec894109","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T17:24:05Z","title_canon_sha256":"7b5504ed13efd4eaf0893567d78759d32f82a06cecfa9db80c11bf6c34796540"},"schema_version":"1.0","source":{"id":"1705.06266","kind":"arxiv","version":2}},"canonical_sha256":"62c9da73bf51c2df02799021454014e357d7e70d8f44cd3c0cf2297f1c4b1abc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c9da73bf51c2df02799021454014e357d7e70d8f44cd3c0cf2297f1c4b1abc","first_computed_at":"2026-05-18T00:11:00.578054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:00.578054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DtRHgXGaraSf6cKJteMVOAMpZCMhXNhHdewhLokBsv1aSYhjsDYHEZzcysj7FmileditaS7VanG3pGqq+XRuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:00.578820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddbfc001435f5bd157225bee5959bf3979f6c04ee71ff94f1df669dc4b100ae4","sha256:97acfba56748f4ac772b55e8df145aaf17e0205a65058c6968dceb7320522815"],"state_sha256":"91c1480d645c1e2c92d5a175aed14b5ecf865ac34acb90c10217e9921d7b5c73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBEK1UKKn1HVQeJnyNG3NNgK6uCCUV4BJ/IsFj+J5Daky+/Z+l5LJOwyLvvfTOHJ7tLU/YUcdSkx+yH3Xjj1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:04:08.702789Z","bundle_sha256":"8826f2aef08085a83f0d3273cd4e331809497c8146c54407bf877127244b1174"}}