{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EJGCW6L3NB35Q5NAT7W4UHYC3G","short_pith_number":"pith:EJGCW6L3","canonical_record":{"source":{"id":"1304.2300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-08T18:31:56Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2d62b8f99948ad0f00182fea467fb455d1384c8bedd85adf207f4113ef618174","abstract_canon_sha256":"5dadff84c52bb5e1e0726a97209afedc825cdf007ac34b77e3890a3a8e02479a"},"schema_version":"1.0"},"canonical_sha256":"224c2b797b6877d875a09fedca1f02d9a3dc723054655fe2458c8eb493ea0d81","source":{"kind":"arxiv","id":"1304.2300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2300","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2300v1","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2300","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"EJGCW6L3NB35","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EJGCW6L3NB35Q5NA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EJGCW6L3","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EJGCW6L3NB35Q5NAT7W4UHYC3G","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-08T18:31:56Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2d62b8f99948ad0f00182fea467fb455d1384c8bedd85adf207f4113ef618174","abstract_canon_sha256":"5dadff84c52bb5e1e0726a97209afedc825cdf007ac34b77e3890a3a8e02479a"},"schema_version":"1.0"},"canonical_sha256":"224c2b797b6877d875a09fedca1f02d9a3dc723054655fe2458c8eb493ea0d81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:43.490815Z","signature_b64":"tclXkdm5P9PTwqEQfTO6UBigpLcLuOTfjh7wOfdtx1Sfq2BC4OGMI2JmDLEpEekHX/s2z9rOWcALrIfvXEdLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"224c2b797b6877d875a09fedca1f02d9a3dc723054655fe2458c8eb493ea0d81","last_reissued_at":"2026-05-18T03:28:43.490189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:43.490189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2300","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:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8Z2Epwn1OmIC5CZt+amVOW3o/PiH3Iqqz9ti349hQjfvajMVJvRgREYLu7xsBnCG2J6u6eAbbkJVFVK68EVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:14:30.036741Z"},"content_sha256":"3f3baf64c23ca2694a379e6676ddf46b329dbed3e2752aaef56ef44cfb7f6a02","schema_version":"1.0","event_id":"sha256:3f3baf64c23ca2694a379e6676ddf46b329dbed3e2752aaef56ef44cfb7f6a02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EJGCW6L3NB35Q5NAT7W4UHYC3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Computation of Pseudo-Inverse of Laplacian: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Daniel Boley, Gyan Ranjan, Zhi-Li Zhang","submitted_at":"2013-04-08T18:31:56Z","abstract_excerpt":"A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail by means of an elegant interplay between $\\bb L^+$ and the effective resistance distance $(\\Omega)$. Closed forms are provided for a novel {\\em two-stage} process that helps compute the pseudo-inverse incrementally. Analogous scalar forms are obtained for the converse case, that of structural regress, which entails the breaking up of a graph into disjoint c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2300","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:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5VQLQmw4il+VfTbpoY74L79lyPGeK+Wgsfu2NHuCRWx42xTtplAaKYAuJNETPfnIAyxneKTuoUSnSJmmqPwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:14:30.037154Z"},"content_sha256":"809e90238d87075998718c8c20c9a250f5d03d8c6aca65a159cf97589fbdd9ff","schema_version":"1.0","event_id":"sha256:809e90238d87075998718c8c20c9a250f5d03d8c6aca65a159cf97589fbdd9ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/bundle.json","state_url":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/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-31T06:14:30Z","links":{"resolver":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G","bundle":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/bundle.json","state":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EJGCW6L3NB35Q5NAT7W4UHYC3G","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":"5dadff84c52bb5e1e0726a97209afedc825cdf007ac34b77e3890a3a8e02479a","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-08T18:31:56Z","title_canon_sha256":"2d62b8f99948ad0f00182fea467fb455d1384c8bedd85adf207f4113ef618174"},"schema_version":"1.0","source":{"id":"1304.2300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2300","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2300v1","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2300","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"EJGCW6L3NB35","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EJGCW6L3NB35Q5NA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EJGCW6L3","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:809e90238d87075998718c8c20c9a250f5d03d8c6aca65a159cf97589fbdd9ff","target":"graph","created_at":"2026-05-18T03:28:43Z","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":"A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail by means of an elegant interplay between $\\bb L^+$ and the effective resistance distance $(\\Omega)$. Closed forms are provided for a novel {\\em two-stage} process that helps compute the pseudo-inverse incrementally. Analogous scalar forms are obtained for the converse case, that of structural regress, which entails the breaking up of a graph into disjoint c","authors_text":"Daniel Boley, Gyan Ranjan, Zhi-Li Zhang","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-08T18:31:56Z","title":"Incremental Computation of Pseudo-Inverse of Laplacian: Theory and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2300","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:3f3baf64c23ca2694a379e6676ddf46b329dbed3e2752aaef56ef44cfb7f6a02","target":"record","created_at":"2026-05-18T03:28:43Z","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":"5dadff84c52bb5e1e0726a97209afedc825cdf007ac34b77e3890a3a8e02479a","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-08T18:31:56Z","title_canon_sha256":"2d62b8f99948ad0f00182fea467fb455d1384c8bedd85adf207f4113ef618174"},"schema_version":"1.0","source":{"id":"1304.2300","kind":"arxiv","version":1}},"canonical_sha256":"224c2b797b6877d875a09fedca1f02d9a3dc723054655fe2458c8eb493ea0d81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"224c2b797b6877d875a09fedca1f02d9a3dc723054655fe2458c8eb493ea0d81","first_computed_at":"2026-05-18T03:28:43.490189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:43.490189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tclXkdm5P9PTwqEQfTO6UBigpLcLuOTfjh7wOfdtx1Sfq2BC4OGMI2JmDLEpEekHX/s2z9rOWcALrIfvXEdLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:43.490815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3baf64c23ca2694a379e6676ddf46b329dbed3e2752aaef56ef44cfb7f6a02","sha256:809e90238d87075998718c8c20c9a250f5d03d8c6aca65a159cf97589fbdd9ff"],"state_sha256":"42d3c0daf433f10deb6d7202862bb9d66b885e2f4a1200b9139942b4aec4f054"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/wD4NxCVSPCERBU+kWWERvYmQz/w3XnGHP4LsRL6sf3Fvuz8NC0mHMHUtH2D7WyEsRsJo7klgidqWBAPBw4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:14:30.039984Z","bundle_sha256":"8ca3ca11ad8df286d5983899f7fe003f22ba4c4c4905f2544133cb5f5d3b684a"}}