{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UXEEGM4IZSO6O2XFAMTGSNHLOX","short_pith_number":"pith:UXEEGM4I","canonical_record":{"source":{"id":"1512.01892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T03:13:54Z","cross_cats_sorted":[],"title_canon_sha256":"6dbecea36fa2d148c2c292308d77b3692a856012db1f06fd4fdb6c338af604b7","abstract_canon_sha256":"9e8fb2bacc19fd80ff1cb99063d8b34d60a662d7e22cff76200303256257a010"},"schema_version":"1.0"},"canonical_sha256":"a5c8433388cc9de76ae503266934eb75f339ba77c94290843b74332886b1ffb3","source":{"kind":"arxiv","id":"1512.01892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01892","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01892v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01892","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"UXEEGM4IZSO6","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UXEEGM4IZSO6O2XF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UXEEGM4I","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UXEEGM4IZSO6O2XFAMTGSNHLOX","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T03:13:54Z","cross_cats_sorted":[],"title_canon_sha256":"6dbecea36fa2d148c2c292308d77b3692a856012db1f06fd4fdb6c338af604b7","abstract_canon_sha256":"9e8fb2bacc19fd80ff1cb99063d8b34d60a662d7e22cff76200303256257a010"},"schema_version":"1.0"},"canonical_sha256":"a5c8433388cc9de76ae503266934eb75f339ba77c94290843b74332886b1ffb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.102912Z","signature_b64":"CcfSC406A8x2psF/jEKUh01lGuYK9N5nzKd/lI3acvOlMCJOcMgH6u3de4nRrT0ToOTzUXIOPqHbiTAFTJYuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c8433388cc9de76ae503266934eb75f339ba77c94290843b74332886b1ffb3","last_reissued_at":"2026-05-18T01:25:10.102346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.102346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01892","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-18T01:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQQWGWW6cjpmJWZ9FF6a8QqgWgyw1cfx0CK9LRb/IRBFLyZUHJUjUM5esz/F/gqNJFpkjJNrknHjqSYSFQ2cBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:27:09.016699Z"},"content_sha256":"91cff1ebf287cc7a480c37fe98b5ea69167c9aba8f1ee5c0cb87a324b8258f4d","schema_version":"1.0","event_id":"sha256:91cff1ebf287cc7a480c37fe98b5ea69167c9aba8f1ee5c0cb87a324b8258f4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UXEEGM4IZSO6O2XFAMTGSNHLOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsified Cholesky and Multigrid Solvers for Connection Laplacians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yin Tat Lee","submitted_at":"2015-12-07T03:13:54Z","abstract_excerpt":"We introduce the sparsified Cholesky and sparsified multigrid algorithms for solving systems of linear equations. These algorithms accelerate Gaussian elimination by sparsifying the nonzero matrix entries created by the elimination process. We use these new algorithms to derive the first nearly linear time algorithms for solving systems of equations in connection Laplacians, a generalization of Laplacian matrices that arise in many problems in image and signal processing. We also prove that every connection Laplacian has a linear sized approximate inverse. This is an LU factorization with a li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01892","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-18T01:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yagCAH1siySl/Bns0NhxH/B2ztV8saqbgm6cydVbEv2w2iP+14wWcCvBX/os6znMnIO5PnfDrLVWsMSGil7YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:27:09.017372Z"},"content_sha256":"42c3b64fe4da5c682e610656aeedb52356249b64c9a239e94637e2a67dc46b07","schema_version":"1.0","event_id":"sha256:42c3b64fe4da5c682e610656aeedb52356249b64c9a239e94637e2a67dc46b07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX/bundle.json","state_url":"https://pith.science/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX/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-29T16:27:09Z","links":{"resolver":"https://pith.science/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX","bundle":"https://pith.science/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX/bundle.json","state":"https://pith.science/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXEEGM4IZSO6O2XFAMTGSNHLOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UXEEGM4IZSO6O2XFAMTGSNHLOX","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":"9e8fb2bacc19fd80ff1cb99063d8b34d60a662d7e22cff76200303256257a010","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T03:13:54Z","title_canon_sha256":"6dbecea36fa2d148c2c292308d77b3692a856012db1f06fd4fdb6c338af604b7"},"schema_version":"1.0","source":{"id":"1512.01892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01892","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01892v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01892","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"UXEEGM4IZSO6","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UXEEGM4IZSO6O2XF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UXEEGM4I","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:42c3b64fe4da5c682e610656aeedb52356249b64c9a239e94637e2a67dc46b07","target":"graph","created_at":"2026-05-18T01:25:10Z","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 introduce the sparsified Cholesky and sparsified multigrid algorithms for solving systems of linear equations. These algorithms accelerate Gaussian elimination by sparsifying the nonzero matrix entries created by the elimination process. We use these new algorithms to derive the first nearly linear time algorithms for solving systems of equations in connection Laplacians, a generalization of Laplacian matrices that arise in many problems in image and signal processing. We also prove that every connection Laplacian has a linear sized approximate inverse. This is an LU factorization with a li","authors_text":"Daniel A. Spielman, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yin Tat Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T03:13:54Z","title":"Sparsified Cholesky and Multigrid Solvers for Connection Laplacians"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01892","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:91cff1ebf287cc7a480c37fe98b5ea69167c9aba8f1ee5c0cb87a324b8258f4d","target":"record","created_at":"2026-05-18T01:25:10Z","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":"9e8fb2bacc19fd80ff1cb99063d8b34d60a662d7e22cff76200303256257a010","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T03:13:54Z","title_canon_sha256":"6dbecea36fa2d148c2c292308d77b3692a856012db1f06fd4fdb6c338af604b7"},"schema_version":"1.0","source":{"id":"1512.01892","kind":"arxiv","version":1}},"canonical_sha256":"a5c8433388cc9de76ae503266934eb75f339ba77c94290843b74332886b1ffb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5c8433388cc9de76ae503266934eb75f339ba77c94290843b74332886b1ffb3","first_computed_at":"2026-05-18T01:25:10.102346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:10.102346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CcfSC406A8x2psF/jEKUh01lGuYK9N5nzKd/lI3acvOlMCJOcMgH6u3de4nRrT0ToOTzUXIOPqHbiTAFTJYuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:10.102912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91cff1ebf287cc7a480c37fe98b5ea69167c9aba8f1ee5c0cb87a324b8258f4d","sha256:42c3b64fe4da5c682e610656aeedb52356249b64c9a239e94637e2a67dc46b07"],"state_sha256":"7815798cd34f69f42ec0992e955f87fba90aae643b10c2b221be15f96747dbce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Erg2OgYI9exePaomhliL0C5/iEahys2jnpKBO4kf7kRWXH2JOU8J6ooohSXzR0pp/g4wQPs/mhN0CjiymBZcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:27:09.022942Z","bundle_sha256":"402ea2b2baa68f5ca5c6158907cb10290694dbe9e017ed3f261f575574a8a183"}}