{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LDRMFWZHNIFOCWQZSX774MMKVJ","short_pith_number":"pith:LDRMFWZH","schema_version":"1.0","canonical_sha256":"58e2c2db276a0ae15a1995fffe318aaa745a4bdb76e848896add8eb2bf0a749f","source":{"kind":"arxiv","id":"1112.0088","version":4},"attestation_state":"computed","paper":{"title":"Simple expressions for the long walk distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.MG","math.RA"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, R. Balaji, R. B. Bapat","submitted_at":"2011-12-01T05:39:33Z","abstract_excerpt":"The walk distances in graphs are defined as the result of appropriate transformations of the $\\sum_{k=0}^\\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a connected weighted graph and $t$ is a sufficiently small positive parameter. The walk distances are graph-geodetic, moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter $t$ approaches its limiting values. In this paper, simple expressions for the long walk distance are obtained. They involve the generalized inverse, minors, and inverses of submatrices o"},"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":"1112.0088","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-01T05:39:33Z","cross_cats_sorted":["cs.DM","math.MG","math.RA"],"title_canon_sha256":"20585e4d49373348b4c6cc1466da544bed6abea33597f7a75e12d2953933ae53","abstract_canon_sha256":"64e55659ee712df109c50af52af70f8385c60ea51549cf258daf69c08d8313b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:03.664481Z","signature_b64":"8E5Gr9TBgzKlrG+69lrzDcVWwVTU5wdXOdIuETP5mjKLK2FvKI5BLzM83eCQoSh3vQhbJtKbPUN0y286Hd+KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58e2c2db276a0ae15a1995fffe318aaa745a4bdb76e848896add8eb2bf0a749f","last_reissued_at":"2026-05-18T03:46:03.663909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:03.663909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple expressions for the long walk distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.MG","math.RA"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, R. Balaji, R. B. Bapat","submitted_at":"2011-12-01T05:39:33Z","abstract_excerpt":"The walk distances in graphs are defined as the result of appropriate transformations of the $\\sum_{k=0}^\\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a connected weighted graph and $t$ is a sufficiently small positive parameter. The walk distances are graph-geodetic, moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter $t$ approaches its limiting values. In this paper, simple expressions for the long walk distance are obtained. They involve the generalized inverse, minors, and inverses of submatrices o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0088","kind":"arxiv","version":4},"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":"1112.0088","created_at":"2026-05-18T03:46:03.663980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0088v4","created_at":"2026-05-18T03:46:03.663980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0088","created_at":"2026-05-18T03:46:03.663980+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDRMFWZHNIFO","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDRMFWZHNIFOCWQZ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDRMFWZH","created_at":"2026-05-18T12:26:34.985390+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/LDRMFWZHNIFOCWQZSX774MMKVJ","json":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ.json","graph_json":"https://pith.science/api/pith-number/LDRMFWZHNIFOCWQZSX774MMKVJ/graph.json","events_json":"https://pith.science/api/pith-number/LDRMFWZHNIFOCWQZSX774MMKVJ/events.json","paper":"https://pith.science/paper/LDRMFWZH"},"agent_actions":{"view_html":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ","download_json":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ.json","view_paper":"https://pith.science/paper/LDRMFWZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0088&json=true","fetch_graph":"https://pith.science/api/pith-number/LDRMFWZHNIFOCWQZSX774MMKVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LDRMFWZHNIFOCWQZSX774MMKVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ/action/storage_attestation","attest_author":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ/action/author_attestation","sign_citation":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ/action/citation_signature","submit_replication":"https://pith.science/pith/LDRMFWZHNIFOCWQZSX774MMKVJ/action/replication_record"}},"created_at":"2026-05-18T03:46:03.663980+00:00","updated_at":"2026-05-18T03:46:03.663980+00:00"}