{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EJGCW6L3NB35Q5NAT7W4UHYC3G","short_pith_number":"pith:EJGCW6L3","schema_version":"1.0","canonical_sha256":"224c2b797b6877d875a09fedca1f02d9a3dc723054655fe2458c8eb493ea0d81","source":{"kind":"arxiv","id":"1304.2300","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.2300","created_at":"2026-05-18T03:28:43.490272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2300v1","created_at":"2026-05-18T03:28:43.490272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2300","created_at":"2026-05-18T03:28:43.490272+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJGCW6L3NB35","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJGCW6L3NB35Q5NA","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJGCW6L3","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G","json":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G.json","graph_json":"https://pith.science/api/pith-number/EJGCW6L3NB35Q5NAT7W4UHYC3G/graph.json","events_json":"https://pith.science/api/pith-number/EJGCW6L3NB35Q5NAT7W4UHYC3G/events.json","paper":"https://pith.science/paper/EJGCW6L3"},"agent_actions":{"view_html":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G","download_json":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G.json","view_paper":"https://pith.science/paper/EJGCW6L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2300&json=true","fetch_graph":"https://pith.science/api/pith-number/EJGCW6L3NB35Q5NAT7W4UHYC3G/graph.json","fetch_events":"https://pith.science/api/pith-number/EJGCW6L3NB35Q5NAT7W4UHYC3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/action/storage_attestation","attest_author":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/action/author_attestation","sign_citation":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/action/citation_signature","submit_replication":"https://pith.science/pith/EJGCW6L3NB35Q5NAT7W4UHYC3G/action/replication_record"}},"created_at":"2026-05-18T03:28:43.490272+00:00","updated_at":"2026-05-18T03:28:43.490272+00:00"}