{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WTVKFGWQUOPP5JV6FGKUI6UJRY","short_pith_number":"pith:WTVKFGWQ","schema_version":"1.0","canonical_sha256":"b4eaa29ad0a39efea6be2995447a898e303d751f0f20bbb697c3932c8992b8d5","source":{"kind":"arxiv","id":"1710.10097","version":1},"attestation_state":"computed","paper":{"title":"On distance and Laplacian matrices of trees with matrix weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fouzul Atik, M. Rajesh Kannan, R. B. Bapat","submitted_at":"2017-10-27T12:05:26Z","abstract_excerpt":"The \\emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of same size. The distance $d_{ij}$ between the vertices $i$ and $j$ is the sum of the weight matrices of the edges in the unique path from $i$ to $j$. In this article we establish a characterization for the trees in terms of rank of (matrix) weighted Laplacian matrix associated with it. Then we establish a necessary and sufficient condition for the distance matr"},"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":"1710.10097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T12:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"2101e06917488b2cf5d023d44de7ca5d41752b366e368ee22a21c6f4d1d200ba","abstract_canon_sha256":"25b70006a107c1a1b75a2e7d3a0bd71f10c25ae98d375ee8ee096982ae8ef5d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.763571Z","signature_b64":"kPHY9GF/f5rYzrjv0BluEsacfFoKpnfcwmbfnMLI3SKQiehR2MOFRap5ccWAyD1Ry3E092knulMEUOGPTQI3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4eaa29ad0a39efea6be2995447a898e303d751f0f20bbb697c3932c8992b8d5","last_reissued_at":"2026-05-18T00:31:54.763144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.763144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On distance and Laplacian matrices of trees with matrix weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fouzul Atik, M. Rajesh Kannan, R. B. Bapat","submitted_at":"2017-10-27T12:05:26Z","abstract_excerpt":"The \\emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of same size. The distance $d_{ij}$ between the vertices $i$ and $j$ is the sum of the weight matrices of the edges in the unique path from $i$ to $j$. In this article we establish a characterization for the trees in terms of rank of (matrix) weighted Laplacian matrix associated with it. Then we establish a necessary and sufficient condition for the distance matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10097","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":"1710.10097","created_at":"2026-05-18T00:31:54.763214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10097v1","created_at":"2026-05-18T00:31:54.763214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10097","created_at":"2026-05-18T00:31:54.763214+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTVKFGWQUOPP","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTVKFGWQUOPP5JV6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTVKFGWQ","created_at":"2026-05-18T12:31:53.515858+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/WTVKFGWQUOPP5JV6FGKUI6UJRY","json":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY.json","graph_json":"https://pith.science/api/pith-number/WTVKFGWQUOPP5JV6FGKUI6UJRY/graph.json","events_json":"https://pith.science/api/pith-number/WTVKFGWQUOPP5JV6FGKUI6UJRY/events.json","paper":"https://pith.science/paper/WTVKFGWQ"},"agent_actions":{"view_html":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY","download_json":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY.json","view_paper":"https://pith.science/paper/WTVKFGWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10097&json=true","fetch_graph":"https://pith.science/api/pith-number/WTVKFGWQUOPP5JV6FGKUI6UJRY/graph.json","fetch_events":"https://pith.science/api/pith-number/WTVKFGWQUOPP5JV6FGKUI6UJRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY/action/storage_attestation","attest_author":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY/action/author_attestation","sign_citation":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY/action/citation_signature","submit_replication":"https://pith.science/pith/WTVKFGWQUOPP5JV6FGKUI6UJRY/action/replication_record"}},"created_at":"2026-05-18T00:31:54.763214+00:00","updated_at":"2026-05-18T00:31:54.763214+00:00"}