{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TENJF3JAS3VC2K67MUWVB24GLL","short_pith_number":"pith:TENJF3JA","schema_version":"1.0","canonical_sha256":"991a92ed2096ea2d2bdf652d50eb865acbfdde9c7f3ec081393a950fd35bfd35","source":{"kind":"arxiv","id":"1205.4894","version":1},"attestation_state":"computed","paper":{"title":"Effective and efficient approximations of the generalized inverse of the graph Laplacian matrix with an application to current-flow betweenness centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Enrico Bozzo, Massimo Franceschet","submitted_at":"2012-05-22T12:31:37Z","abstract_excerpt":"We devise methods for finding approximations of the generalized inverse of the graph Laplacian matrix, which arises in many graph-theoretic applications. Finding this matrix in its entirety involves solving a matrix inversion problem, which is resource demanding in terms of consumed time and memory and hence impractical whenever the graph is relatively large. Our approximations use only few eigenpairs of the Laplacian matrix and are parametric with respect to this number, so that the user can compromise between effectiveness and efficiency of the approximated solution. We apply the devised app"},"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":"1205.4894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-05-22T12:31:37Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b02fdaea85c99a54684dde2cd22361f7ee59a3de406a9b62722ddb93216cd587","abstract_canon_sha256":"c50212fd41bed320ef3621ca2fb9d13e4e2ffd91b7858cd452d52b62fb0b8b0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.375491Z","signature_b64":"gqZXjMePkSfunFYWhqCIdQlQaY+Pb9JwMQ8DkBeXAQxFJBkvzHBH9jVncafg0X1+FGrgIIccy6ORzWAvIs+9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"991a92ed2096ea2d2bdf652d50eb865acbfdde9c7f3ec081393a950fd35bfd35","last_reissued_at":"2026-05-18T03:55:11.374940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.374940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective and efficient approximations of the generalized inverse of the graph Laplacian matrix with an application to current-flow betweenness centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Enrico Bozzo, Massimo Franceschet","submitted_at":"2012-05-22T12:31:37Z","abstract_excerpt":"We devise methods for finding approximations of the generalized inverse of the graph Laplacian matrix, which arises in many graph-theoretic applications. Finding this matrix in its entirety involves solving a matrix inversion problem, which is resource demanding in terms of consumed time and memory and hence impractical whenever the graph is relatively large. Our approximations use only few eigenpairs of the Laplacian matrix and are parametric with respect to this number, so that the user can compromise between effectiveness and efficiency of the approximated solution. We apply the devised app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4894","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":"1205.4894","created_at":"2026-05-18T03:55:11.375013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4894v1","created_at":"2026-05-18T03:55:11.375013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4894","created_at":"2026-05-18T03:55:11.375013+00:00"},{"alias_kind":"pith_short_12","alias_value":"TENJF3JAS3VC","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TENJF3JAS3VC2K67","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TENJF3JA","created_at":"2026-05-18T12:27:23.164592+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/TENJF3JAS3VC2K67MUWVB24GLL","json":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL.json","graph_json":"https://pith.science/api/pith-number/TENJF3JAS3VC2K67MUWVB24GLL/graph.json","events_json":"https://pith.science/api/pith-number/TENJF3JAS3VC2K67MUWVB24GLL/events.json","paper":"https://pith.science/paper/TENJF3JA"},"agent_actions":{"view_html":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL","download_json":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL.json","view_paper":"https://pith.science/paper/TENJF3JA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4894&json=true","fetch_graph":"https://pith.science/api/pith-number/TENJF3JAS3VC2K67MUWVB24GLL/graph.json","fetch_events":"https://pith.science/api/pith-number/TENJF3JAS3VC2K67MUWVB24GLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL/action/storage_attestation","attest_author":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL/action/author_attestation","sign_citation":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL/action/citation_signature","submit_replication":"https://pith.science/pith/TENJF3JAS3VC2K67MUWVB24GLL/action/replication_record"}},"created_at":"2026-05-18T03:55:11.375013+00:00","updated_at":"2026-05-18T03:55:11.375013+00:00"}