{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CB3VK7O6H4ZJBS7F5MOBK5S2ZM","short_pith_number":"pith:CB3VK7O6","canonical_record":{"source":{"id":"1605.02353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T19:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"f326b7ba15cdb45836a3731ce4ad0596ec1d4e84c4c49105e8241d960f62a136","abstract_canon_sha256":"d4580f039703b73b1188480df9325d0f29abc02d3f4a0091cde6b254bda4847d"},"schema_version":"1.0"},"canonical_sha256":"1077557dde3f3290cbe5eb1c15765acb19891f3bf1da6a6500c7d34a04e88488","source":{"kind":"arxiv","id":"1605.02353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02353","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02353v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02353","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"CB3VK7O6H4ZJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CB3VK7O6H4ZJBS7F","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CB3VK7O6","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CB3VK7O6H4ZJBS7F5MOBK5S2ZM","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T19:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"f326b7ba15cdb45836a3731ce4ad0596ec1d4e84c4c49105e8241d960f62a136","abstract_canon_sha256":"d4580f039703b73b1188480df9325d0f29abc02d3f4a0091cde6b254bda4847d"},"schema_version":"1.0"},"canonical_sha256":"1077557dde3f3290cbe5eb1c15765acb19891f3bf1da6a6500c7d34a04e88488","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.210497Z","signature_b64":"g1Vy7UsF9eiA1iVpU4zaRiScEL2g9FIXF73YTv/yo8kGv+Qq9BobC0v86rwQ0WGKig3hD3t+4KzhTNegA/TPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1077557dde3f3290cbe5eb1c15765acb19891f3bf1da6a6500c7d34a04e88488","last_reissued_at":"2026-05-18T01:15:21.209826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.209826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02353","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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeDO3prGfNDC6RQPTSfiob/FVuOb803qY+Bg36pI3FGxHMKVULKzuQOlm94BREgHLDuVH49S8eCvku325iMJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:33:51.990721Z"},"content_sha256":"be8cc464355838347a73cbf239ae760079fc63b85177ce7adf6f829a700b1419","schema_version":"1.0","event_id":"sha256:be8cc464355838347a73cbf239ae760079fc63b85177ce7adf6f829a700b1419"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CB3VK7O6H4ZJBS7F5MOBK5S2ZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rasmus Kyng, Sushant Sachdeva","submitted_at":"2016-05-08T19:34:05Z","abstract_excerpt":"We show how to perform sparse approximate Gaussian elimination for Laplacian matrices. We present a simple, nearly linear time algorithm that approximates a Laplacian by a matrix with a sparse Cholesky factorization, the version of Gaussian elimination for symmetric matrices. This is the first nearly linear time solver for Laplacian systems that is based purely on random sampling, and does not use any graph theoretic constructions such as low-stretch trees, sparsifiers, or expanders. The crux of our analysis is a novel concentration bound for matrix martingales where the differences are sums o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02353","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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qN6hm8rwT/Q/B8CDa/pp5ckPBL4yEN9663m9H0B3m351gOJJnD16NSyYt51sEMo7qwmLfxKLiKkGUKX8LqEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:33:51.991096Z"},"content_sha256":"628cf2b1932342b66ae16682520b017ce2e0ddae572c2d79acdf8d25ffa66dd5","schema_version":"1.0","event_id":"sha256:628cf2b1932342b66ae16682520b017ce2e0ddae572c2d79acdf8d25ffa66dd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM/bundle.json","state_url":"https://pith.science/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM/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-26T19:33:51Z","links":{"resolver":"https://pith.science/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM","bundle":"https://pith.science/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM/bundle.json","state":"https://pith.science/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CB3VK7O6H4ZJBS7F5MOBK5S2ZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CB3VK7O6H4ZJBS7F5MOBK5S2ZM","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":"d4580f039703b73b1188480df9325d0f29abc02d3f4a0091cde6b254bda4847d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T19:34:05Z","title_canon_sha256":"f326b7ba15cdb45836a3731ce4ad0596ec1d4e84c4c49105e8241d960f62a136"},"schema_version":"1.0","source":{"id":"1605.02353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02353","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02353v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02353","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"CB3VK7O6H4ZJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CB3VK7O6H4ZJBS7F","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CB3VK7O6","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:628cf2b1932342b66ae16682520b017ce2e0ddae572c2d79acdf8d25ffa66dd5","target":"graph","created_at":"2026-05-18T01:15:21Z","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 how to perform sparse approximate Gaussian elimination for Laplacian matrices. We present a simple, nearly linear time algorithm that approximates a Laplacian by a matrix with a sparse Cholesky factorization, the version of Gaussian elimination for symmetric matrices. This is the first nearly linear time solver for Laplacian systems that is based purely on random sampling, and does not use any graph theoretic constructions such as low-stretch trees, sparsifiers, or expanders. The crux of our analysis is a novel concentration bound for matrix martingales where the differences are sums o","authors_text":"Rasmus Kyng, Sushant Sachdeva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T19:34:05Z","title":"Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02353","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:be8cc464355838347a73cbf239ae760079fc63b85177ce7adf6f829a700b1419","target":"record","created_at":"2026-05-18T01:15:21Z","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":"d4580f039703b73b1188480df9325d0f29abc02d3f4a0091cde6b254bda4847d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T19:34:05Z","title_canon_sha256":"f326b7ba15cdb45836a3731ce4ad0596ec1d4e84c4c49105e8241d960f62a136"},"schema_version":"1.0","source":{"id":"1605.02353","kind":"arxiv","version":1}},"canonical_sha256":"1077557dde3f3290cbe5eb1c15765acb19891f3bf1da6a6500c7d34a04e88488","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1077557dde3f3290cbe5eb1c15765acb19891f3bf1da6a6500c7d34a04e88488","first_computed_at":"2026-05-18T01:15:21.209826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.209826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1Vy7UsF9eiA1iVpU4zaRiScEL2g9FIXF73YTv/yo8kGv+Qq9BobC0v86rwQ0WGKig3hD3t+4KzhTNegA/TPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.210497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be8cc464355838347a73cbf239ae760079fc63b85177ce7adf6f829a700b1419","sha256:628cf2b1932342b66ae16682520b017ce2e0ddae572c2d79acdf8d25ffa66dd5"],"state_sha256":"918d3af016d00ac20c236de15235db9d655109ddfaa0185f035b4177dee0cfa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBGcmDiydvLT/9fwohf83hl0B4YdszpGE4HFwRVh2QNtowoyxZzUQso7XTA57IxQYOrz9PC6uHNZXgkINPR0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:33:51.993806Z","bundle_sha256":"e97a281bf85012257494b36b813c2c9bc05df27cbb5626d1c2e2529a9a2f520f"}}