{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4VOAT4OPGY35A2K67DH4CLXM2X","short_pith_number":"pith:4VOAT4OP","schema_version":"1.0","canonical_sha256":"e55c09f1cf3637d0695ef8cfc12eecd5f11355bfcfa4d422d13581c242e5bbad","source":{"kind":"arxiv","id":"2302.04114","version":1},"attestation_state":"computed","paper":{"title":"Resistance Distances in Directed Graphs: Definitions, Properties, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Huan Li, Liwang Zhu, Mingzhe Zhu, Wei Li, Zhongzhi Zhang","submitted_at":"2023-02-08T15:12:02Z","abstract_excerpt":"Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact that various realistic networks are directed. Although several generalizations of resistance distance on directed graphs have been proposed, they either have no physical interpretation or are not a metric. In this paper, we first extend the definition of resistance distance to strongly connected directed graphs based on random walks and show that the two-node resistance distance on directed graphs is a metric. Then, we introduce the Lapl"},"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":"2302.04114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-02-08T15:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"63d9bcf509b5ea04a00d1b57961ca7ce71c88784774cde2923dc39429e06ea00","abstract_canon_sha256":"08d2b7eb9ea3d37aa3bdfa9befc4d37bf85b6e30e0a9047bba425214d65a23ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:01.269826Z","signature_b64":"/Tn7af278dzblrbhVLdxgRX2G/v8qOiwVgl9lINB9QnJvkX9LJsnzoRj0Ub0hE+OOVVP4PjA7D4LBV4S/VsGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e55c09f1cf3637d0695ef8cfc12eecd5f11355bfcfa4d422d13581c242e5bbad","last_reissued_at":"2026-07-05T05:40:01.269373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:01.269373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resistance Distances in Directed Graphs: Definitions, Properties, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Huan Li, Liwang Zhu, Mingzhe Zhu, Wei Li, Zhongzhi Zhang","submitted_at":"2023-02-08T15:12:02Z","abstract_excerpt":"Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact that various realistic networks are directed. Although several generalizations of resistance distance on directed graphs have been proposed, they either have no physical interpretation or are not a metric. In this paper, we first extend the definition of resistance distance to strongly connected directed graphs based on random walks and show that the two-node resistance distance on directed graphs is a metric. Then, we introduce the Lapl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04114","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/2302.04114/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":"2302.04114","created_at":"2026-07-05T05:40:01.269430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.04114v1","created_at":"2026-07-05T05:40:01.269430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04114","created_at":"2026-07-05T05:40:01.269430+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VOAT4OPGY35","created_at":"2026-07-05T05:40:01.269430+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VOAT4OPGY35A2K6","created_at":"2026-07-05T05:40:01.269430+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VOAT4OP","created_at":"2026-07-05T05:40:01.269430+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/4VOAT4OPGY35A2K67DH4CLXM2X","json":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X.json","graph_json":"https://pith.science/api/pith-number/4VOAT4OPGY35A2K67DH4CLXM2X/graph.json","events_json":"https://pith.science/api/pith-number/4VOAT4OPGY35A2K67DH4CLXM2X/events.json","paper":"https://pith.science/paper/4VOAT4OP"},"agent_actions":{"view_html":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X","download_json":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X.json","view_paper":"https://pith.science/paper/4VOAT4OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.04114&json=true","fetch_graph":"https://pith.science/api/pith-number/4VOAT4OPGY35A2K67DH4CLXM2X/graph.json","fetch_events":"https://pith.science/api/pith-number/4VOAT4OPGY35A2K67DH4CLXM2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X/action/storage_attestation","attest_author":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X/action/author_attestation","sign_citation":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X/action/citation_signature","submit_replication":"https://pith.science/pith/4VOAT4OPGY35A2K67DH4CLXM2X/action/replication_record"}},"created_at":"2026-07-05T05:40:01.269430+00:00","updated_at":"2026-07-05T05:40:01.269430+00:00"}