{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UV5LIOVJ4AS6UGSDVBHAHKV4U3","short_pith_number":"pith:UV5LIOVJ","canonical_record":{"source":{"id":"1710.08176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T10:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"38c7ed64796a1d6aa8ce49d14a39b3e05a7abe75437716e71179d236c2b86e98","abstract_canon_sha256":"1d4f06b146e4930e925173d8fe7fc0d8e4e4e21b7e85a32ec6cd1b71f4745150"},"schema_version":"1.0"},"canonical_sha256":"a57ab43aa9e025ea1a43a84e03aabca6f17af4a85a983133725bc0097b3ef9ff","source":{"kind":"arxiv","id":"1710.08176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08176","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08176v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08176","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"UV5LIOVJ4AS6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UV5LIOVJ4AS6UGSD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UV5LIOVJ","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UV5LIOVJ4AS6UGSDVBHAHKV4U3","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T10:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"38c7ed64796a1d6aa8ce49d14a39b3e05a7abe75437716e71179d236c2b86e98","abstract_canon_sha256":"1d4f06b146e4930e925173d8fe7fc0d8e4e4e21b7e85a32ec6cd1b71f4745150"},"schema_version":"1.0"},"canonical_sha256":"a57ab43aa9e025ea1a43a84e03aabca6f17af4a85a983133725bc0097b3ef9ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.080677Z","signature_b64":"iW2OPZrFg0ZfnmOlYbaHec7y+zSvOQ1dvCWbBh+voOSPIBbdH1Et3EV6xQ0SoGPKusOsb0hhKbkuI+k8DZnfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57ab43aa9e025ea1a43a84e03aabca6f17af4a85a983133725bc0097b3ef9ff","last_reissued_at":"2026-05-18T00:05:41.080225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.080225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08176","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-05-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SqbRwPE44Tupz1y6TB7uPjydn2I3XJ33GieS6v2D7At5XHCHdGwnWA5DAvK/9c3WV7if7fs1Hg6+SxzRv3nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:12:49.459109Z"},"content_sha256":"9d65f94004dd2b16cf860ffb68e9518994a0dd613f2eb7127510da6eff5a36dc","schema_version":"1.0","event_id":"sha256:9d65f94004dd2b16cf860ffb68e9518994a0dd613f2eb7127510da6eff5a36dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UV5LIOVJ4AS6UGSDVBHAHKV4U3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the transmission-based graph topological indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reza Sharafdini, Tamas Reti","submitted_at":"2017-10-23T10:05:28Z","abstract_excerpt":"The distance $d(u,v)$ between the vertices $u$ and $v$ of a connected graph $G$ is defined as the number of edges in a minimal path connecting them. The \\emph{transmission} of a vertex $v$ of $G$ is defined by $\\sigma(v)=\\sum\\limits_{u\\in V(G)}{d(v,u)}$. In this article we aim to define some transmission-based topological indices. We obtain lower and upper bounds on these indices and characterize graphs for which these bounds are best possible. Finally, we find these indices for various graphs using the group of automorphisms of $G$. This is an efficient method of finding these indices especia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08176","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"},"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-05-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KDS8X0lDXn6FvEf1KWl0wixkAdzfjMoeQhdAitsX1OSCfBl8UGYTbv9xUPxhr+BZIK9A5X6qSPrvQTnhWO0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:12:49.459746Z"},"content_sha256":"03dd68943d9aef2ccbc51c4276bf3643bceaebb97350c1ef49c34b89c5b1de1d","schema_version":"1.0","event_id":"sha256:03dd68943d9aef2ccbc51c4276bf3643bceaebb97350c1ef49c34b89c5b1de1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3/bundle.json","state_url":"https://pith.science/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3/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-05-31T12:12:49Z","links":{"resolver":"https://pith.science/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3","bundle":"https://pith.science/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3/bundle.json","state":"https://pith.science/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV5LIOVJ4AS6UGSDVBHAHKV4U3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UV5LIOVJ4AS6UGSDVBHAHKV4U3","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":"1d4f06b146e4930e925173d8fe7fc0d8e4e4e21b7e85a32ec6cd1b71f4745150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T10:05:28Z","title_canon_sha256":"38c7ed64796a1d6aa8ce49d14a39b3e05a7abe75437716e71179d236c2b86e98"},"schema_version":"1.0","source":{"id":"1710.08176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08176","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08176v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08176","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"UV5LIOVJ4AS6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UV5LIOVJ4AS6UGSD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UV5LIOVJ","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:03dd68943d9aef2ccbc51c4276bf3643bceaebb97350c1ef49c34b89c5b1de1d","target":"graph","created_at":"2026-05-18T00:05:41Z","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"},"paper":{"abstract_excerpt":"The distance $d(u,v)$ between the vertices $u$ and $v$ of a connected graph $G$ is defined as the number of edges in a minimal path connecting them. The \\emph{transmission} of a vertex $v$ of $G$ is defined by $\\sigma(v)=\\sum\\limits_{u\\in V(G)}{d(v,u)}$. In this article we aim to define some transmission-based topological indices. We obtain lower and upper bounds on these indices and characterize graphs for which these bounds are best possible. Finally, we find these indices for various graphs using the group of automorphisms of $G$. This is an efficient method of finding these indices especia","authors_text":"Reza Sharafdini, Tamas Reti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T10:05:28Z","title":"On the transmission-based graph topological indices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08176","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:9d65f94004dd2b16cf860ffb68e9518994a0dd613f2eb7127510da6eff5a36dc","target":"record","created_at":"2026-05-18T00:05:41Z","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":"1d4f06b146e4930e925173d8fe7fc0d8e4e4e21b7e85a32ec6cd1b71f4745150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T10:05:28Z","title_canon_sha256":"38c7ed64796a1d6aa8ce49d14a39b3e05a7abe75437716e71179d236c2b86e98"},"schema_version":"1.0","source":{"id":"1710.08176","kind":"arxiv","version":1}},"canonical_sha256":"a57ab43aa9e025ea1a43a84e03aabca6f17af4a85a983133725bc0097b3ef9ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a57ab43aa9e025ea1a43a84e03aabca6f17af4a85a983133725bc0097b3ef9ff","first_computed_at":"2026-05-18T00:05:41.080225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.080225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iW2OPZrFg0ZfnmOlYbaHec7y+zSvOQ1dvCWbBh+voOSPIBbdH1Et3EV6xQ0SoGPKusOsb0hhKbkuI+k8DZnfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.080677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d65f94004dd2b16cf860ffb68e9518994a0dd613f2eb7127510da6eff5a36dc","sha256:03dd68943d9aef2ccbc51c4276bf3643bceaebb97350c1ef49c34b89c5b1de1d"],"state_sha256":"7d7ff4c88a34becf4042509a8af819be63a1a760a4f2803099489add79fa1c23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQPu054Po0T+133mc90HeVsoS2+Dej5JZ9CWv6FMWz/vwt4Xys/wMaSo8+Zd3ixrQOb6z2agt6680o/KwJeyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:12:49.463000Z","bundle_sha256":"2747ff87c3126f4af360bfc9ff3251547e34580c519fa8289e7e087e26b834c9"}}