{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S2NGZ2QRYLNQWKU7MDWD7WJKJR","short_pith_number":"pith:S2NGZ2QR","canonical_record":{"source":{"id":"1506.08204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T20:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"0fdaff71e52044d4e73eec179d4fa1fbea7e8e1a3fdaeb8b60710f4c66246366","abstract_canon_sha256":"5208d043c0a01150cc0501fbf09f3c96bc86a21b1820577e64b498275e9af672"},"schema_version":"1.0"},"canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","source":{"kind":"arxiv","id":"1506.08204","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08204","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08204v2","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08204","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"S2NGZ2QRYLNQ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S2NGZ2QRYLNQWKU7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S2NGZ2QR","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S2NGZ2QRYLNQWKU7MDWD7WJKJR","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T20:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"0fdaff71e52044d4e73eec179d4fa1fbea7e8e1a3fdaeb8b60710f4c66246366","abstract_canon_sha256":"5208d043c0a01150cc0501fbf09f3c96bc86a21b1820577e64b498275e9af672"},"schema_version":"1.0"},"canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:22.090953Z","signature_b64":"1Qv0ayLCe10pIOZhohYDjrbVkbLe9OsxDo1oWSH8btLVOOgkaHEy6ZL4/7UX3IijZMpbbzg00fvqxc/qIzKbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","last_reissued_at":"2026-05-18T01:35:22.090126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:22.090126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08204","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-18T01:35:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/H07DVOCpGigi6tgMNQWZARPf8foR0MJgAE2x+ttUqXVmMqZtR5UbSiLp72g6Ruaylqqmp6Wl37MTSDyLWBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:47:07.302920Z"},"content_sha256":"ba8d496296704850c58907c260e3a1ce69af6f54f247abebb0f160a6d91241f3","schema_version":"1.0","event_id":"sha256:ba8d496296704850c58907c260e3a1ce69af6f54f247abebb0f160a6d91241f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S2NGZ2QRYLNQWKU7MDWD7WJKJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsified Cholesky Solvers for SDD linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Richard Peng, Yin Tat Lee","submitted_at":"2015-06-26T20:00:41Z","abstract_excerpt":"We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where $L$ is a lower-triangular matrix with a number of nonzero entries linear in its dimension. Furthermore linear systems in $L$ and $L^{T}$ can be solved in $O (n)$ work and $O(\\log{n}\\log^2\\log{n})$ depth, where $n$ is the dimension of the matrix.\n  We present nearly linear time algorithms that construct solvers that are almost this efficient. In doing so, we gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08204","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-18T01:35:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrVAUmcyWABRfRl4wih+qolXrdUb2noykK2gS6b2F6FaNLKJACnid0lB/wX0Tgqzo0U28NjFkHemkpfbJlgZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:47:07.303590Z"},"content_sha256":"addbd222a72ec6b9c7c9dbeb77c572967c7f323d933511c88d43183b9229e989","schema_version":"1.0","event_id":"sha256:addbd222a72ec6b9c7c9dbeb77c572967c7f323d933511c88d43183b9229e989"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/bundle.json","state_url":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/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:47:07Z","links":{"resolver":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR","bundle":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/bundle.json","state":"https://pith.science/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2NGZ2QRYLNQWKU7MDWD7WJKJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S2NGZ2QRYLNQWKU7MDWD7WJKJR","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":"5208d043c0a01150cc0501fbf09f3c96bc86a21b1820577e64b498275e9af672","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T20:00:41Z","title_canon_sha256":"0fdaff71e52044d4e73eec179d4fa1fbea7e8e1a3fdaeb8b60710f4c66246366"},"schema_version":"1.0","source":{"id":"1506.08204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08204","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08204v2","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08204","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"S2NGZ2QRYLNQ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S2NGZ2QRYLNQWKU7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S2NGZ2QR","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:addbd222a72ec6b9c7c9dbeb77c572967c7f323d933511c88d43183b9229e989","target":"graph","created_at":"2026-05-18T01:35:22Z","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 show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where $L$ is a lower-triangular matrix with a number of nonzero entries linear in its dimension. Furthermore linear systems in $L$ and $L^{T}$ can be solved in $O (n)$ work and $O(\\log{n}\\log^2\\log{n})$ depth, where $n$ is the dimension of the matrix.\n  We present nearly linear time algorithms that construct solvers that are almost this efficient. In doing so, we gi","authors_text":"Daniel A. Spielman, Richard Peng, Yin Tat Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T20:00:41Z","title":"Sparsified Cholesky Solvers for SDD linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08204","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:ba8d496296704850c58907c260e3a1ce69af6f54f247abebb0f160a6d91241f3","target":"record","created_at":"2026-05-18T01:35:22Z","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":"5208d043c0a01150cc0501fbf09f3c96bc86a21b1820577e64b498275e9af672","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T20:00:41Z","title_canon_sha256":"0fdaff71e52044d4e73eec179d4fa1fbea7e8e1a3fdaeb8b60710f4c66246366"},"schema_version":"1.0","source":{"id":"1506.08204","kind":"arxiv","version":2}},"canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"969a6cea11c2db0b2a9f60ec3fd92a4c75451b78e9b2aa91c1dcf0cafa4090f7","first_computed_at":"2026-05-18T01:35:22.090126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:22.090126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Qv0ayLCe10pIOZhohYDjrbVkbLe9OsxDo1oWSH8btLVOOgkaHEy6ZL4/7UX3IijZMpbbzg00fvqxc/qIzKbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:22.090953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba8d496296704850c58907c260e3a1ce69af6f54f247abebb0f160a6d91241f3","sha256:addbd222a72ec6b9c7c9dbeb77c572967c7f323d933511c88d43183b9229e989"],"state_sha256":"d3d774de9467d66f25c779862aac3c89e7cde2ac4156016144b5a94cb95781a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"56sXFPv4gG+ZxT9iHNl19HhXoEARtCk8QlXShlKzZ1mT23EYLEL6oHPUA4/z+dwdj5RT0INX9YTmswlGDLzmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:47:07.306989Z","bundle_sha256":"c94cddeafa642564818d139eaffca862bf28fd5fb42687f016b6426856dbcd3d"}}