{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BVPCFHUFK3RXWA5UOEE7PCJ3Q4","short_pith_number":"pith:BVPCFHUF","schema_version":"1.0","canonical_sha256":"0d5e229e8556e37b03b47109f7893b87282e7321459afc36ec2ecb7ba260cb53","source":{"kind":"arxiv","id":"2303.03617","version":1},"attestation_state":"computed","paper":{"title":"Computing Effective Resistances on Large Graphs Based on Approximate Inverse of Cholesky Factor","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.NA","authors_text":"Wenjian Yu, Zhiqiang Liu","submitted_at":"2023-03-07T03:02:02Z","abstract_excerpt":"Effective resistance, which originates from the field of circuits analysis, is an important graph distance in spectral graph theory. It has found numerous applications in various areas, such as graph data mining, spectral graph sparsification, circuits simulation, etc. However, computing effective resistances accurately can be intractable and we still lack efficient methods for estimating effective resistances on large graphs. In this work, we propose an efficient algorithm to compute effective resistances on general weighted graphs, based on a sparse approximate inverse technique. Compared wi"},"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":"2303.03617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NA","submitted_at":"2023-03-07T03:02:02Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"ef882f1fa218275e1c96627c3aafaa401a9c75638bfba76bbb5439ea1c3da317","abstract_canon_sha256":"35765a891345cad1597252e31687cfe51a629fd574573442f4ad4a1409957beb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:56.774457Z","signature_b64":"jJYb4xeAMXTsXMmGah0nZS5DHlwM9ARnwzCaX6P2ofGUcqxr/iqbzOPP2StpafnFuNhJmNKAUWbw6MhwSCuMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d5e229e8556e37b03b47109f7893b87282e7321459afc36ec2ecb7ba260cb53","last_reissued_at":"2026-07-05T05:48:56.774059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:56.774059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Effective Resistances on Large Graphs Based on Approximate Inverse of Cholesky Factor","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.NA","authors_text":"Wenjian Yu, Zhiqiang Liu","submitted_at":"2023-03-07T03:02:02Z","abstract_excerpt":"Effective resistance, which originates from the field of circuits analysis, is an important graph distance in spectral graph theory. It has found numerous applications in various areas, such as graph data mining, spectral graph sparsification, circuits simulation, etc. However, computing effective resistances accurately can be intractable and we still lack efficient methods for estimating effective resistances on large graphs. In this work, we propose an efficient algorithm to compute effective resistances on general weighted graphs, based on a sparse approximate inverse technique. Compared wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.03617","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/2303.03617/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.03617","created_at":"2026-07-05T05:48:56.774122+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.03617v1","created_at":"2026-07-05T05:48:56.774122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.03617","created_at":"2026-07-05T05:48:56.774122+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVPCFHUFK3RX","created_at":"2026-07-05T05:48:56.774122+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVPCFHUFK3RXWA5U","created_at":"2026-07-05T05:48:56.774122+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVPCFHUF","created_at":"2026-07-05T05:48:56.774122+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/BVPCFHUFK3RXWA5UOEE7PCJ3Q4","json":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4.json","graph_json":"https://pith.science/api/pith-number/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/graph.json","events_json":"https://pith.science/api/pith-number/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/events.json","paper":"https://pith.science/paper/BVPCFHUF"},"agent_actions":{"view_html":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4","download_json":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4.json","view_paper":"https://pith.science/paper/BVPCFHUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.03617&json=true","fetch_graph":"https://pith.science/api/pith-number/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/graph.json","fetch_events":"https://pith.science/api/pith-number/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/action/storage_attestation","attest_author":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/action/author_attestation","sign_citation":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/action/citation_signature","submit_replication":"https://pith.science/pith/BVPCFHUFK3RXWA5UOEE7PCJ3Q4/action/replication_record"}},"created_at":"2026-07-05T05:48:56.774122+00:00","updated_at":"2026-07-05T05:48:56.774122+00:00"}