{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RAU6XEXLUPG7VUGQEU44243J3X","short_pith_number":"pith:RAU6XEXL","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"},"canonical_sha256":"8829eb92eba3cdfad0d02539cd7369dde168b06c2953e37bed4f0206306b1ad5","source":{"kind":"arxiv","id":"2212.05297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.05297","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2212.05297v1","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.05297","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"RAU6XEXLUPG7","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"RAU6XEXLUPG7VUGQ","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"RAU6XEXL","created_at":"2026-07-05T05:24:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RAU6XEXLUPG7VUGQEU44243J3X","target":"record","payload":{"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"},"canonical_sha256":"8829eb92eba3cdfad0d02539cd7369dde168b06c2953e37bed4f0206306b1ad5","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"},"source_kind":"arxiv","source_id":"2212.05297","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Thlbv/IhdR7wB5glHVy41yQ9cWIjuSnEMlsqWtTLFYK0gVMsHJrjhzQ/sPRb18FnMRlYVN8gX3FTTwhLFZRxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T18:30:41.613423Z"},"content_sha256":"b63fab959265f52f9dbe962627ce2069960d09583b4463e276bcc1f24d231a73","schema_version":"1.0","event_id":"sha256:b63fab959265f52f9dbe962627ce2069960d09583b4463e276bcc1f24d231a73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RAU6XEXLUPG7VUGQEU44243J3X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veXMyxx00YhXWapzl/fcR25r4C5DodRWI8H/V5M4IoXItjkiUudvOaIPqSugjVUZ+t29cCJXPp/x6bgrLYRyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T18:30:41.613809Z"},"content_sha256":"33168cea4cd2a333681c72df35c401a8b623d6bb4b41de21262feb54fa5b5d7f","schema_version":"1.0","event_id":"sha256:33168cea4cd2a333681c72df35c401a8b623d6bb4b41de21262feb54fa5b5d7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/bundle.json","state_url":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAU6XEXLUPG7VUGQEU44243J3X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-18T18:30:41Z","links":{"resolver":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X","bundle":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/bundle.json","state":"https://pith.science/pith/RAU6XEXLUPG7VUGQEU44243J3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAU6XEXLUPG7VUGQEU44243J3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RAU6XEXLUPG7VUGQEU44243J3X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c6d3e5fc99ff79dd6d459c33c483c86611105bd4ea81d8048787d7190b04d65e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-10T13:27:17Z","title_canon_sha256":"379b5fdec47f2b9f85dafdbe0cb1aeaaf44081d684ed2c249a5a29e549d57a0c"},"schema_version":"1.0","source":{"id":"2212.05297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.05297","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2212.05297v1","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.05297","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"RAU6XEXLUPG7","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"RAU6XEXLUPG7VUGQ","created_at":"2026-07-05T05:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"RAU6XEXL","created_at":"2026-07-05T05:24:02Z"}],"graph_snapshots":[{"event_id":"sha256:33168cea4cd2a333681c72df35c401a8b623d6bb4b41de21262feb54fa5b5d7f","target":"graph","created_at":"2026-07-05T05:24:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.05297/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Carlos A. Alfaro, Octavio Zapata","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-10T13:27:17Z","title":"The degree-distance and transmission-adjacency matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.05297","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b63fab959265f52f9dbe962627ce2069960d09583b4463e276bcc1f24d231a73","target":"record","created_at":"2026-07-05T05:24:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c6d3e5fc99ff79dd6d459c33c483c86611105bd4ea81d8048787d7190b04d65e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-10T13:27:17Z","title_canon_sha256":"379b5fdec47f2b9f85dafdbe0cb1aeaaf44081d684ed2c249a5a29e549d57a0c"},"schema_version":"1.0","source":{"id":"2212.05297","kind":"arxiv","version":1}},"canonical_sha256":"8829eb92eba3cdfad0d02539cd7369dde168b06c2953e37bed4f0206306b1ad5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8829eb92eba3cdfad0d02539cd7369dde168b06c2953e37bed4f0206306b1ad5","first_computed_at":"2026-07-05T05:24:02.431559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:24:02.431559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MosXU9WKGPlKOT3DON3zaU98JsvEvU/psZKuGPQmVTn8TDgax/9VUu2WhVoAzeUZJEBXrLAgipOg2dxYn+GCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:24:02.432040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.05297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b63fab959265f52f9dbe962627ce2069960d09583b4463e276bcc1f24d231a73","sha256:33168cea4cd2a333681c72df35c401a8b623d6bb4b41de21262feb54fa5b5d7f"],"state_sha256":"9a44c92399114ef278b0283e5612a2b21a36748b187a38a20cc98060ec923da7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGLYdJRkrB+FjeEslyN+ovj+bK46c9VxJemDAWCHda6SKnLkGSYFOhyFXkJok0SYAKiWZWBiuUV39Cf0fH52DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T18:30:41.615959Z","bundle_sha256":"3500008a4339ea584fbb9aaa3f9f98d8300336c91ccac2686e6a873539241d0c"}}