{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E2VZQVAJ4XHKO7ABIIPRJRF4OX","short_pith_number":"pith:E2VZQVAJ","canonical_record":{"source":{"id":"1502.03158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T00:32:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2a8732133e1d9b364d7ba5bf6295245b400c2881974c00b4d966212dbe01907","abstract_canon_sha256":"cf1dfaf3138abc472c921a5b45b57a23e310fbe1d5b5597380a258ee6e9527a1"},"schema_version":"1.0"},"canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","source":{"kind":"arxiv","id":"1502.03158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03158","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03158v1","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03158","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"E2VZQVAJ4XHK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2VZQVAJ4XHKO7AB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2VZQVAJ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E2VZQVAJ4XHKO7ABIIPRJRF4OX","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T00:32:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2a8732133e1d9b364d7ba5bf6295245b400c2881974c00b4d966212dbe01907","abstract_canon_sha256":"cf1dfaf3138abc472c921a5b45b57a23e310fbe1d5b5597380a258ee6e9527a1"},"schema_version":"1.0"},"canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:20.368167Z","signature_b64":"Fqwx2Dh4TsPJP3P6ZxfTOuR/kA/gH+BliLGjcsMH+9Cs1728CE1KZjJEu3OUR4wAawqrYOz5SrznKab95fFcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","last_reissued_at":"2026-05-18T02:27:20.367435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:20.367435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03158","source_version":1,"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-18T02:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Evw609VsI/D6kbhb0WXGuTJDggdgEorvEGLpg//IjmzAgysSniIor98gD5WSv8hIbXmCQiTzQdsg6uISlEpzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:25:59.620961Z"},"content_sha256":"1f7e7bc696b7c7ccd3da11f028618b90479243ff491fb5ede583f0ca09dc68a1","schema_version":"1.0","event_id":"sha256:1f7e7bc696b7c7ccd3da11f028618b90479243ff491fb5ede583f0ca09dc68a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E2VZQVAJ4XHKO7ABIIPRJRF4OX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Distributed Solver for Symmetric Diagonally Dominant Linear Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","submitted_at":"2015-02-11T00:32:28Z","abstract_excerpt":"In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph $\\mathbb{G}$, the proposed distributed algorithm is capable of attaining $\\epsilon$-close solutions (for arbitrary $\\epsilon$) in time proportional to $n^{3}$ (number of nodes in $\\mathbb{G}$), ${\\alpha}$ (upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03158","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"},"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-18T02:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hE+LlaJFxsBK7nOBxvJ4+LFh8d9ykQ/jL5WgfTBH0d7WN2ZOt4+9J9qR0U0IMauazPJeJIDPHM1apifQxS/rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:25:59.621692Z"},"content_sha256":"bde49e523ea0f6023059b2163e645fdd51c3ab70728d61a394111f95a59248b9","schema_version":"1.0","event_id":"sha256:bde49e523ea0f6023059b2163e645fdd51c3ab70728d61a394111f95a59248b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/bundle.json","state_url":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/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-05-31T12:25:59Z","links":{"resolver":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX","bundle":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/bundle.json","state":"https://pith.science/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2VZQVAJ4XHKO7ABIIPRJRF4OX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E2VZQVAJ4XHKO7ABIIPRJRF4OX","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":"cf1dfaf3138abc472c921a5b45b57a23e310fbe1d5b5597380a258ee6e9527a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T00:32:28Z","title_canon_sha256":"e2a8732133e1d9b364d7ba5bf6295245b400c2881974c00b4d966212dbe01907"},"schema_version":"1.0","source":{"id":"1502.03158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03158","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03158v1","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03158","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"E2VZQVAJ4XHK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2VZQVAJ4XHKO7AB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2VZQVAJ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:bde49e523ea0f6023059b2163e645fdd51c3ab70728d61a394111f95a59248b9","target":"graph","created_at":"2026-05-18T02:27:20Z","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":"In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph $\\mathbb{G}$, the proposed distributed algorithm is capable of attaining $\\epsilon$-close solutions (for arbitrary $\\epsilon$) in time proportional to $n^{3}$ (number of nodes in $\\mathbb{G}$), ${\\alpha}$ (upper bound","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T00:32:28Z","title":"A Fast Distributed Solver for Symmetric Diagonally Dominant Linear Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03158","kind":"arxiv","version":1},"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:1f7e7bc696b7c7ccd3da11f028618b90479243ff491fb5ede583f0ca09dc68a1","target":"record","created_at":"2026-05-18T02:27:20Z","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":"cf1dfaf3138abc472c921a5b45b57a23e310fbe1d5b5597380a258ee6e9527a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T00:32:28Z","title_canon_sha256":"e2a8732133e1d9b364d7ba5bf6295245b400c2881974c00b4d966212dbe01907"},"schema_version":"1.0","source":{"id":"1502.03158","kind":"arxiv","version":1}},"canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26ab985409e5cea77c01421f14c4bc75c8d898a77f19b59309798a5a674f3dcf","first_computed_at":"2026-05-18T02:27:20.367435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:20.367435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fqwx2Dh4TsPJP3P6ZxfTOuR/kA/gH+BliLGjcsMH+9Cs1728CE1KZjJEu3OUR4wAawqrYOz5SrznKab95fFcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:20.368167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f7e7bc696b7c7ccd3da11f028618b90479243ff491fb5ede583f0ca09dc68a1","sha256:bde49e523ea0f6023059b2163e645fdd51c3ab70728d61a394111f95a59248b9"],"state_sha256":"609316331a8030eda7e7f8ea7fcc03e05048444f7eb8a59a476e3c8c1664733a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkjRM5tHVxJjJthC59lV9JRE7Cyf4GCbO8eshUrwC81ofEjJf/IFAfmn5C+87DeHFtxkXLLICYBjCaWA38C8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:25:59.625855Z","bundle_sha256":"9bc5715719bece9a9116b7ecd866f32cf0c07ec70ec04a4aa5aff26532e6200d"}}