{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RAU6XEXLUPG7VUGQEU44243J3X","short_pith_number":"pith:RAU6XEXL","schema_version":"1.0","canonical_sha256":"8829eb92eba3cdfad0d02539cd7369dde168b06c2953e37bed4f0206306b1ad5","source":{"kind":"arxiv","id":"2212.05297","version":1},"attestation_state":"computed","paper":{"title":"The degree-distance and transmission-adjacency matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos A. Alfaro, Octavio Zapata","submitted_at":"2022-12-10T13:27:17Z","abstract_excerpt":"Let $G$ be a connected graph with adjacency matrix $A(G)$. The distance matrix $D(G)$ of $G$ has rows and columns indexed by $V(G)$ with $uv$-entry equal to the distance $\\mathrm{dist}(u,v)$ which is the number of edges in a shortest path between the vertices $u$ and $v$. The transmission $\\mathrm{trs}(u)$ of $u$ is defined as $\\sum_{v\\in V(G)}\\mathrm{dist}(u,v)$. Let $\\mathrm{trs}(G)$ be the diagonal matrix with the transmissions of the vertices of $G$ in the diagonal, and $\\mathrm{deg}(G)$ the diagonal matrix with the degrees of the vertices in the diagonal. In this paper we investigate the "},"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":"2212.05297","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-10T13:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"379b5fdec47f2b9f85dafdbe0cb1aeaaf44081d684ed2c249a5a29e549d57a0c","abstract_canon_sha256":"c6d3e5fc99ff79dd6d459c33c483c86611105bd4ea81d8048787d7190b04d65e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:02.432040Z","signature_b64":"0MosXU9WKGPlKOT3DON3zaU98JsvEvU/psZKuGPQmVTn8TDgax/9VUu2WhVoAzeUZJEBXrLAgipOg2dxYn+GCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8829eb92eba3cdfad0d02539cd7369dde168b06c2953e37bed4f0206306b1ad5","last_reissued_at":"2026-07-05T05:24:02.431559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:02.431559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The degree-distance and transmission-adjacency matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos A. Alfaro, Octavio Zapata","submitted_at":"2022-12-10T13:27:17Z","abstract_excerpt":"Let $G$ be a connected graph with adjacency matrix $A(G)$. The distance matrix $D(G)$ of $G$ has rows and columns indexed by $V(G)$ with $uv$-entry equal to the distance $\\mathrm{dist}(u,v)$ which is the number of edges in a shortest path between the vertices $u$ and $v$. The transmission $\\mathrm{trs}(u)$ of $u$ is defined as $\\sum_{v\\in V(G)}\\mathrm{dist}(u,v)$. Let $\\mathrm{trs}(G)$ be the diagonal matrix with the transmissions of the vertices of $G$ in the diagonal, and $\\mathrm{deg}(G)$ the diagonal matrix with the degrees of the vertices in the diagonal. In this paper we investigate the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.05297","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/2212.05297/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":"2212.05297","created_at":"2026-07-05T05:24:02.431617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.05297v1","created_at":"2026-07-05T05:24:02.431617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.05297","created_at":"2026-07-05T05:24:02.431617+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAU6XEXLUPG7","created_at":"2026-07-05T05:24:02.431617+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAU6XEXLUPG7VUGQ","created_at":"2026-07-05T05:24:02.431617+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAU6XEXL","created_at":"2026-07-05T05:24:02.431617+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/RAU6XEXLUPG7VUGQEU44243J3X","json":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X.json","graph_json":"https://pith.science/api/pith-number/RAU6XEXLUPG7VUGQEU44243J3X/graph.json","events_json":"https://pith.science/api/pith-number/RAU6XEXLUPG7VUGQEU44243J3X/events.json","paper":"https://pith.science/paper/RAU6XEXL"},"agent_actions":{"view_html":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X","download_json":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X.json","view_paper":"https://pith.science/paper/RAU6XEXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.05297&json=true","fetch_graph":"https://pith.science/api/pith-number/RAU6XEXLUPG7VUGQEU44243J3X/graph.json","fetch_events":"https://pith.science/api/pith-number/RAU6XEXLUPG7VUGQEU44243J3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/action/storage_attestation","attest_author":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/action/author_attestation","sign_citation":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/action/citation_signature","submit_replication":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/action/replication_record"}},"created_at":"2026-07-05T05:24:02.431617+00:00","updated_at":"2026-07-05T05:24:02.431617+00:00"}