{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OCEOBL52U6QLIPRLPK7D5DSQ2H","short_pith_number":"pith:OCEOBL52","canonical_record":{"source":{"id":"2304.14345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-27T17:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"3308dda6d6a10cfe75d89730dcf313f663620c210dd1c9229d3078dab238d0dc","abstract_canon_sha256":"b1521cf8bb21e34c28820656d7f283818bf089925ed289b4a84667be0404044f"},"schema_version":"1.0"},"canonical_sha256":"7088e0afbaa7a0b43e2b7abe3e8e50d1ca29a47450412a9debb6bf4caa25ffa8","source":{"kind":"arxiv","id":"2304.14345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.14345","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2304.14345v1","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.14345","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"OCEOBL52U6QL","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"OCEOBL52U6QLIPRL","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"OCEOBL52","created_at":"2026-07-05T06:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OCEOBL52U6QLIPRLPK7D5DSQ2H","target":"record","payload":{"canonical_record":{"source":{"id":"2304.14345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-27T17:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"3308dda6d6a10cfe75d89730dcf313f663620c210dd1c9229d3078dab238d0dc","abstract_canon_sha256":"b1521cf8bb21e34c28820656d7f283818bf089925ed289b4a84667be0404044f"},"schema_version":"1.0"},"canonical_sha256":"7088e0afbaa7a0b43e2b7abe3e8e50d1ca29a47450412a9debb6bf4caa25ffa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:03.362761Z","signature_b64":"5puIo1b68PoXFrLsILaUSIorKYArT4BjZ1BaUBUsFVTw301YLKQ0l3Bifk79Iik5ToaT0yuM4jaLcUqE0SlCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7088e0afbaa7a0b43e2b7abe3e8e50d1ca29a47450412a9debb6bf4caa25ffa8","last_reissued_at":"2026-07-05T06:05:03.362280Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:03.362280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.14345","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-07-05T06:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jmgjc41F4npG/DnnWuNOWGqrG0GXPbwpwjmBS9hgyZEomlRIEc3PGfHAX0Lo6Enag5nPf8mXvRHEo2ZZadafBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T16:53:17.335213Z"},"content_sha256":"7601d8b89f43203c60c1d96f34b6e8c7b7c00c6720f9a4bf2da93c129f9f3fac","schema_version":"1.0","event_id":"sha256:7601d8b89f43203c60c1d96f34b6e8c7b7c00c6720f9a4bf2da93c129f9f3fac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OCEOBL52U6QLIPRLPK7D5DSQ2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and Efficient Parallel Laplacian Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sushant Sachdeva, Yibin Zhao","submitted_at":"2023-04-27T17:20:11Z","abstract_excerpt":"A symmetric matrix is called a Laplacian if it has nonpositive off-diagonal entries and zero row sums. Since the seminal work of Spielman and Teng (2004) on solving Laplacian linear systems in nearly linear time, several algorithms have been designed for the task. Yet, the work of Kyng and Sachdeva (2016) remains the simplest and most practical sequential solver. They presented a solver purely based on random sampling and without graph-theoretic constructions such as low-stretch trees and sparsifiers.\n  In this work, we extend the result of Kyng and Sachdeva to a simple parallel Laplacian solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.14345","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.14345/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbrGDS9ghwCLG/2hABWMIAWvifprUsvdlwPhBurFZ5HbVVClwF1FvrwhTVTZDfxCtD4Y9UDNuAvgHde9nn17CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T16:53:17.335624Z"},"content_sha256":"3ab8f45aae295e098293d1f3928f2f010384a0cdf3612a1a221d717b8cf72af0","schema_version":"1.0","event_id":"sha256:3ab8f45aae295e098293d1f3928f2f010384a0cdf3612a1a221d717b8cf72af0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H/bundle.json","state_url":"https://pith.science/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H/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-07-17T16:53:17Z","links":{"resolver":"https://pith.science/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H","bundle":"https://pith.science/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H/bundle.json","state":"https://pith.science/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCEOBL52U6QLIPRLPK7D5DSQ2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OCEOBL52U6QLIPRLPK7D5DSQ2H","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":"b1521cf8bb21e34c28820656d7f283818bf089925ed289b4a84667be0404044f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-27T17:20:11Z","title_canon_sha256":"3308dda6d6a10cfe75d89730dcf313f663620c210dd1c9229d3078dab238d0dc"},"schema_version":"1.0","source":{"id":"2304.14345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.14345","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2304.14345v1","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.14345","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"OCEOBL52U6QL","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"OCEOBL52U6QLIPRL","created_at":"2026-07-05T06:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"OCEOBL52","created_at":"2026-07-05T06:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:3ab8f45aae295e098293d1f3928f2f010384a0cdf3612a1a221d717b8cf72af0","target":"graph","created_at":"2026-07-05T06:05:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2304.14345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A symmetric matrix is called a Laplacian if it has nonpositive off-diagonal entries and zero row sums. Since the seminal work of Spielman and Teng (2004) on solving Laplacian linear systems in nearly linear time, several algorithms have been designed for the task. Yet, the work of Kyng and Sachdeva (2016) remains the simplest and most practical sequential solver. They presented a solver purely based on random sampling and without graph-theoretic constructions such as low-stretch trees and sparsifiers.\n  In this work, we extend the result of Kyng and Sachdeva to a simple parallel Laplacian solv","authors_text":"Sushant Sachdeva, Yibin Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-27T17:20:11Z","title":"A Simple and Efficient Parallel Laplacian Solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.14345","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:7601d8b89f43203c60c1d96f34b6e8c7b7c00c6720f9a4bf2da93c129f9f3fac","target":"record","created_at":"2026-07-05T06:05:03Z","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":"b1521cf8bb21e34c28820656d7f283818bf089925ed289b4a84667be0404044f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-27T17:20:11Z","title_canon_sha256":"3308dda6d6a10cfe75d89730dcf313f663620c210dd1c9229d3078dab238d0dc"},"schema_version":"1.0","source":{"id":"2304.14345","kind":"arxiv","version":1}},"canonical_sha256":"7088e0afbaa7a0b43e2b7abe3e8e50d1ca29a47450412a9debb6bf4caa25ffa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7088e0afbaa7a0b43e2b7abe3e8e50d1ca29a47450412a9debb6bf4caa25ffa8","first_computed_at":"2026-07-05T06:05:03.362280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:05:03.362280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5puIo1b68PoXFrLsILaUSIorKYArT4BjZ1BaUBUsFVTw301YLKQ0l3Bifk79Iik5ToaT0yuM4jaLcUqE0SlCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:05:03.362761Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.14345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7601d8b89f43203c60c1d96f34b6e8c7b7c00c6720f9a4bf2da93c129f9f3fac","sha256:3ab8f45aae295e098293d1f3928f2f010384a0cdf3612a1a221d717b8cf72af0"],"state_sha256":"eb4ee568946c6dea5c7363a83a9ac83fd0a092853d6bbcb713343457291a1d2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RT7254frmE1Fla5U+j3O+4ZJuBuB3tfGR6fp5DGsxogPSrnNtW/4yCu8f2CPP4LRL+owUZ0Dm9Sv6A+gvdFBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T16:53:17.337762Z","bundle_sha256":"2e3a71f679d6f74fa8d3ad375890d98508baccdfa60d5b5fd6a9c639a1645b8a"}}