{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JTTHKZEUKPNE5UEDXJWCIQP6QF","short_pith_number":"pith:JTTHKZEU","canonical_record":{"source":{"id":"1311.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-11-13T20:41:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ff486eaf2006e1cad6b7e47374d66e9e67b39b2f7ac8cd2eef4f2d94984c66f","abstract_canon_sha256":"951df00018ddc510b23db25606aef3e49fa90395df786e90720a774fa839dd48"},"schema_version":"1.0"},"canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","source":{"kind":"arxiv","id":"1311.3286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3286","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3286v1","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3286","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"JTTHKZEUKPNE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JTTHKZEUKPNE5UED","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JTTHKZEU","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JTTHKZEUKPNE5UEDXJWCIQP6QF","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-11-13T20:41:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ff486eaf2006e1cad6b7e47374d66e9e67b39b2f7ac8cd2eef4f2d94984c66f","abstract_canon_sha256":"951df00018ddc510b23db25606aef3e49fa90395df786e90720a774fa839dd48"},"schema_version":"1.0"},"canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:12.504640Z","signature_b64":"HjeNjct+zzu4g15EXEAcyUJDQnEtclPvrRHQyXEfRXZ4at8qomVmmc/PJM+E79YFpigoT8K8O5oaKxeXdfXuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","last_reissued_at":"2026-05-18T03:07:12.503814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:12.503814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3286","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-18T03:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3eV14P9gxpLtHPM/2f688/GvF8uncDsdFj9655Sv9j7obIR5kZP0Z7BE07UXt/+G1QkKw7lJTQWNzOjhZEODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:23:57.615985Z"},"content_sha256":"2636408fb884e356deaf54ce73cbe2cd9bf1bdc6446dc1642739e6dea279c7b6","schema_version":"1.0","event_id":"sha256:2636408fb884e356deaf54ce73cbe2cd9bf1bdc6446dc1642739e6dea279c7b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JTTHKZEUKPNE5UEDXJWCIQP6QF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Parallel Solver for SDD Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NA","authors_text":"Daniel A. Spielman, Richard Peng","submitted_at":"2013-11-13T20:41:01Z","abstract_excerpt":"We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a sparse approximate inverse chain for the input matrix: a sequence of sparse matrices whose product approximates its inverse. Whereas other fast algorithms for solving systems of equations in SDD matrices exploit low-stretch spanning trees, our algorithm only requires spectral graph sparsifiers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3286","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-18T03:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOgT/17YDWpn49yxxxuv4Q6rFe/STtwThiL7uA/UKI0sZP7VvwJWViQNNvZPc6dKuZzLXq2DLYuG5Ijtvum+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:23:57.616601Z"},"content_sha256":"c9aec5086640afb93f3f4908273067fa7662a79ad966f679ddc103901eb5ca38","schema_version":"1.0","event_id":"sha256:c9aec5086640afb93f3f4908273067fa7662a79ad966f679ddc103901eb5ca38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/bundle.json","state_url":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/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-26T15:23:57Z","links":{"resolver":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF","bundle":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/bundle.json","state":"https://pith.science/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTTHKZEUKPNE5UEDXJWCIQP6QF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JTTHKZEUKPNE5UEDXJWCIQP6QF","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":"951df00018ddc510b23db25606aef3e49fa90395df786e90720a774fa839dd48","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-11-13T20:41:01Z","title_canon_sha256":"5ff486eaf2006e1cad6b7e47374d66e9e67b39b2f7ac8cd2eef4f2d94984c66f"},"schema_version":"1.0","source":{"id":"1311.3286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3286","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3286v1","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3286","created_at":"2026-05-18T03:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"JTTHKZEUKPNE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JTTHKZEUKPNE5UED","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JTTHKZEU","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:c9aec5086640afb93f3f4908273067fa7662a79ad966f679ddc103901eb5ca38","target":"graph","created_at":"2026-05-18T03:07:12Z","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":"We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a sparse approximate inverse chain for the input matrix: a sequence of sparse matrices whose product approximates its inverse. Whereas other fast algorithms for solving systems of equations in SDD matrices exploit low-stretch spanning trees, our algorithm only requires spectral graph sparsifiers.","authors_text":"Daniel A. Spielman, Richard Peng","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-11-13T20:41:01Z","title":"An Efficient Parallel Solver for SDD Linear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3286","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:2636408fb884e356deaf54ce73cbe2cd9bf1bdc6446dc1642739e6dea279c7b6","target":"record","created_at":"2026-05-18T03:07:12Z","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":"951df00018ddc510b23db25606aef3e49fa90395df786e90720a774fa839dd48","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-11-13T20:41:01Z","title_canon_sha256":"5ff486eaf2006e1cad6b7e47374d66e9e67b39b2f7ac8cd2eef4f2d94984c66f"},"schema_version":"1.0","source":{"id":"1311.3286","kind":"arxiv","version":1}},"canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ce675649453da4ed083ba6c2441fe815543c806b0555db1abb62a693185fbe6","first_computed_at":"2026-05-18T03:07:12.503814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:12.503814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HjeNjct+zzu4g15EXEAcyUJDQnEtclPvrRHQyXEfRXZ4at8qomVmmc/PJM+E79YFpigoT8K8O5oaKxeXdfXuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:12.504640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2636408fb884e356deaf54ce73cbe2cd9bf1bdc6446dc1642739e6dea279c7b6","sha256:c9aec5086640afb93f3f4908273067fa7662a79ad966f679ddc103901eb5ca38"],"state_sha256":"b316fca16246893f69cc414100315da99972e735097af8cb53613c543038b15f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9CsoQo3VFcEfEpx21fiJLYB9z9ZdTTH0aQNw9p880XxpfvgvNHwDoRPE2gP2ry4K8MVANxQiDTqCnQxNxH9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:23:57.619979Z","bundle_sha256":"6be198ba8cd7b1c41335abb313a0e603c9d76589ce868d8bb34d8ed0f51959ae"}}