{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JT2JXJ5OWLQUJHCPLKUXG7PZS2","short_pith_number":"pith:JT2JXJ5O","schema_version":"1.0","canonical_sha256":"4cf49ba7aeb2e1449c4f5aa9737df996a17d2ab8fe9f70159348eb3748875c1a","source":{"kind":"arxiv","id":"1701.04162","version":3},"attestation_state":"computed","paper":{"title":"On distance matrices of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Zhou, Qi Ding, Ruiling Jia","submitted_at":"2017-01-16T04:34:20Z","abstract_excerpt":"Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\\sf D}(G)$ be the distance matrix of $G$. Graham, Hoffman and Hosoya [3] showed a very attractive theorem, expressing the determinant of ${\\sf D}(G)$ explicitly as a function of blocks of $G$. In this paper, we study the inverse of ${\\sf D}(G)$ and get an analogous theory, expressing the inverse of ${\\sf D}(G)$ through the inverses of distance matrices of blocks of $G$ (see Theorem 3.3) by the theory of "},"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":"1701.04162","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-16T04:34:20Z","cross_cats_sorted":[],"title_canon_sha256":"42d5fe407458b54df10ede79dde1cf9daeb161db842852e97bade5f56b20830d","abstract_canon_sha256":"3a2513c7e6ca0e34517a523becdf37402d6964d87916fa5d80d98e715f3443f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:31.100231Z","signature_b64":"LVPI/lRa2f8uGKAILu2j0pQ0kUA59qUGJbaKmiBm15YVerMfHy7ao72hPBtE+kphxaXRJ9LEvNN8Vw3dj/OJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cf49ba7aeb2e1449c4f5aa9737df996a17d2ab8fe9f70159348eb3748875c1a","last_reissued_at":"2026-05-18T00:29:31.099620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:31.099620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On distance matrices of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Zhou, Qi Ding, Ruiling Jia","submitted_at":"2017-01-16T04:34:20Z","abstract_excerpt":"Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\\sf D}(G)$ be the distance matrix of $G$. Graham, Hoffman and Hosoya [3] showed a very attractive theorem, expressing the determinant of ${\\sf D}(G)$ explicitly as a function of blocks of $G$. In this paper, we study the inverse of ${\\sf D}(G)$ and get an analogous theory, expressing the inverse of ${\\sf D}(G)$ through the inverses of distance matrices of blocks of $G$ (see Theorem 3.3) by the theory of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04162","kind":"arxiv","version":3},"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":"1701.04162","created_at":"2026-05-18T00:29:31.099702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04162v3","created_at":"2026-05-18T00:29:31.099702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04162","created_at":"2026-05-18T00:29:31.099702+00:00"},{"alias_kind":"pith_short_12","alias_value":"JT2JXJ5OWLQU","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JT2JXJ5OWLQUJHCP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JT2JXJ5O","created_at":"2026-05-18T12:31:24.725408+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/JT2JXJ5OWLQUJHCPLKUXG7PZS2","json":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2.json","graph_json":"https://pith.science/api/pith-number/JT2JXJ5OWLQUJHCPLKUXG7PZS2/graph.json","events_json":"https://pith.science/api/pith-number/JT2JXJ5OWLQUJHCPLKUXG7PZS2/events.json","paper":"https://pith.science/paper/JT2JXJ5O"},"agent_actions":{"view_html":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2","download_json":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2.json","view_paper":"https://pith.science/paper/JT2JXJ5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04162&json=true","fetch_graph":"https://pith.science/api/pith-number/JT2JXJ5OWLQUJHCPLKUXG7PZS2/graph.json","fetch_events":"https://pith.science/api/pith-number/JT2JXJ5OWLQUJHCPLKUXG7PZS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2/action/storage_attestation","attest_author":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2/action/author_attestation","sign_citation":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2/action/citation_signature","submit_replication":"https://pith.science/pith/JT2JXJ5OWLQUJHCPLKUXG7PZS2/action/replication_record"}},"created_at":"2026-05-18T00:29:31.099702+00:00","updated_at":"2026-05-18T00:29:31.099702+00:00"}