{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SVOW3HGRAKNQSBFPNXHS47L52O","short_pith_number":"pith:SVOW3HGR","schema_version":"1.0","canonical_sha256":"955d6d9cd1029b0904af6dcf2e7d7dd396e9532efe90937ddca7ddfe5c8c725e","source":{"kind":"arxiv","id":"1104.3791","version":1},"attestation_state":"computed","paper":{"title":"Fast matrix computations for pair-wise and column-wise commute times and Katz scores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Chen Greif, David F. Gleich, Francesco Bonchi, Laks V. S. Lakshmanan, Pooya Esfandiar","submitted_at":"2011-04-19T16:17:48Z","abstract_excerpt":"We first explore methods for approximating the commute time and Katz score between a pair of nodes. These methods are based on the approach of matrices, moments, and quadrature developed in the numerical linear algebra community. They rely on the Lanczos process and provide upper and lower bounds on an estimate of the pair-wise scores. We also explore methods to approximate the commute times and Katz scores from a node to all other nodes in the graph. Here, our approach for the commute times is based on a variation of the conjugate gradient algorithm, and it provides an estimate of all the dia"},"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":"1104.3791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-19T16:17:48Z","cross_cats_sorted":["cs.NA","physics.soc-ph"],"title_canon_sha256":"95dad32498616f200d4b2c284cb6c7c1e4d9b87cb0d15c8036cedc9ffbad60d8","abstract_canon_sha256":"b458f78d96d149c24c3600d4363c84536b3386fa52b8873b9e501966d20176d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:39.379661Z","signature_b64":"K9JPozNUtvMk2CKUn5m2jNXexip9Mgm1FVzKqLyQzJCQ6lWM+p5msWpXu1+aMq1GfiYZoqtKZ7WmehLimFLHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"955d6d9cd1029b0904af6dcf2e7d7dd396e9532efe90937ddca7ddfe5c8c725e","last_reissued_at":"2026-05-18T04:00:39.378783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:39.378783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast matrix computations for pair-wise and column-wise commute times and Katz scores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Chen Greif, David F. Gleich, Francesco Bonchi, Laks V. S. Lakshmanan, Pooya Esfandiar","submitted_at":"2011-04-19T16:17:48Z","abstract_excerpt":"We first explore methods for approximating the commute time and Katz score between a pair of nodes. These methods are based on the approach of matrices, moments, and quadrature developed in the numerical linear algebra community. They rely on the Lanczos process and provide upper and lower bounds on an estimate of the pair-wise scores. We also explore methods to approximate the commute times and Katz scores from a node to all other nodes in the graph. Here, our approach for the commute times is based on a variation of the conjugate gradient algorithm, and it provides an estimate of all the dia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3791","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":"1104.3791","created_at":"2026-05-18T04:00:39.378929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3791v1","created_at":"2026-05-18T04:00:39.378929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3791","created_at":"2026-05-18T04:00:39.378929+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVOW3HGRAKNQ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVOW3HGRAKNQSBFP","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVOW3HGR","created_at":"2026-05-18T12:26:41.206345+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/SVOW3HGRAKNQSBFPNXHS47L52O","json":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O.json","graph_json":"https://pith.science/api/pith-number/SVOW3HGRAKNQSBFPNXHS47L52O/graph.json","events_json":"https://pith.science/api/pith-number/SVOW3HGRAKNQSBFPNXHS47L52O/events.json","paper":"https://pith.science/paper/SVOW3HGR"},"agent_actions":{"view_html":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O","download_json":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O.json","view_paper":"https://pith.science/paper/SVOW3HGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3791&json=true","fetch_graph":"https://pith.science/api/pith-number/SVOW3HGRAKNQSBFPNXHS47L52O/graph.json","fetch_events":"https://pith.science/api/pith-number/SVOW3HGRAKNQSBFPNXHS47L52O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O/action/storage_attestation","attest_author":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O/action/author_attestation","sign_citation":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O/action/citation_signature","submit_replication":"https://pith.science/pith/SVOW3HGRAKNQSBFPNXHS47L52O/action/replication_record"}},"created_at":"2026-05-18T04:00:39.378929+00:00","updated_at":"2026-05-18T04:00:39.378929+00:00"}