{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OFNIRW52JUNJTJLRYAVM3GJ36S","short_pith_number":"pith:OFNIRW52","canonical_record":{"source":{"id":"1901.10180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T08:54:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"793a84da09131b8fe9927a7ceddf98e3a81f3b4723e8cc6bb822cb46ef9b2160","abstract_canon_sha256":"5e118b9e353bb7e5c1a4ea516cdb283afd50015233fe7d7e2353aa7e210886b8"},"schema_version":"1.0"},"canonical_sha256":"715a88dbba4d1a99a571c02acd993bf4a400aca26027cfc4ebfc0812557685d9","source":{"kind":"arxiv","id":"1901.10180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10180","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10180v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10180","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"OFNIRW52JUNJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFNIRW52JUNJTJLR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFNIRW52","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OFNIRW52JUNJTJLRYAVM3GJ36S","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T08:54:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"793a84da09131b8fe9927a7ceddf98e3a81f3b4723e8cc6bb822cb46ef9b2160","abstract_canon_sha256":"5e118b9e353bb7e5c1a4ea516cdb283afd50015233fe7d7e2353aa7e210886b8"},"schema_version":"1.0"},"canonical_sha256":"715a88dbba4d1a99a571c02acd993bf4a400aca26027cfc4ebfc0812557685d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:15.918979Z","signature_b64":"GUasJ939aG720f/Ypd2mMS/Egrz2Vn9FOhEQmMm3IVGEaYDyDyNhIvhR4SoOVdqTogfUE/sqb6bu4wX7SoJaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715a88dbba4d1a99a571c02acd993bf4a400aca26027cfc4ebfc0812557685d9","last_reissued_at":"2026-05-17T23:55:15.918536Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:15.918536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10180","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-17T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79wMkcU/eLBmmFVnDXKRnQg1yb4Wvs7VreTzma0B0C+nbcbcUBZCpKdYNW+NWn3JulkLMiLTY0II3HEcJ7dFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:20:26.099075Z"},"content_sha256":"8ce2cf5fdc3dd4dfed3b36dd806360087196163c2cd31e762a219280c9b09b2e","schema_version":"1.0","event_id":"sha256:8ce2cf5fdc3dd4dfed3b36dd806360087196163c2cd31e762a219280c9b09b2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OFNIRW52JUNJTJLRYAVM3GJ36S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the distance $\\alpha$-spectral radius of a connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"B. Zhou, H.Y. Guo","submitted_at":"2019-01-29T08:54:21Z","abstract_excerpt":"For a connected graph $G$ and $\\alpha\\in [0,1)$, the distance $\\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\\alpha}(G)$ defined as $D_{\\alpha}(G)=\\alpha T(G)+(1-\\alpha)D(G)$, where $T(G)$ is a diagonal matrix of vertex transmissions of $G$ and $D(G)$ is the distance matrix of $G$. We give bounds for the distance $\\alpha$-spectral radius, especially for graphs that are not transmission regular, propose some graft transformations that decrease or increase the distance $\\alpha$-spectral radius, and determine the unique graphs with minimum and maximum distance $\\alpha$-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10180","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-17T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BMhJfX5B8WiLtbpfAiyOuo4FWBNcaga5GkfzsMiI2mzQNnPRkVq8csry51oxYORuNDsxDmNrJay4zqUphztDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:20:26.099742Z"},"content_sha256":"25d7c1ddf15fbeb7fb256560ff08a237c2219bb9006e8b929683c28443386159","schema_version":"1.0","event_id":"sha256:25d7c1ddf15fbeb7fb256560ff08a237c2219bb9006e8b929683c28443386159"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFNIRW52JUNJTJLRYAVM3GJ36S/bundle.json","state_url":"https://pith.science/pith/OFNIRW52JUNJTJLRYAVM3GJ36S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFNIRW52JUNJTJLRYAVM3GJ36S/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-06-06T16:20:26Z","links":{"resolver":"https://pith.science/pith/OFNIRW52JUNJTJLRYAVM3GJ36S","bundle":"https://pith.science/pith/OFNIRW52JUNJTJLRYAVM3GJ36S/bundle.json","state":"https://pith.science/pith/OFNIRW52JUNJTJLRYAVM3GJ36S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFNIRW52JUNJTJLRYAVM3GJ36S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OFNIRW52JUNJTJLRYAVM3GJ36S","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":"5e118b9e353bb7e5c1a4ea516cdb283afd50015233fe7d7e2353aa7e210886b8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T08:54:21Z","title_canon_sha256":"793a84da09131b8fe9927a7ceddf98e3a81f3b4723e8cc6bb822cb46ef9b2160"},"schema_version":"1.0","source":{"id":"1901.10180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10180","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10180v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10180","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"OFNIRW52JUNJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFNIRW52JUNJTJLR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFNIRW52","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:25d7c1ddf15fbeb7fb256560ff08a237c2219bb9006e8b929683c28443386159","target":"graph","created_at":"2026-05-17T23:55:15Z","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":"For a connected graph $G$ and $\\alpha\\in [0,1)$, the distance $\\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\\alpha}(G)$ defined as $D_{\\alpha}(G)=\\alpha T(G)+(1-\\alpha)D(G)$, where $T(G)$ is a diagonal matrix of vertex transmissions of $G$ and $D(G)$ is the distance matrix of $G$. We give bounds for the distance $\\alpha$-spectral radius, especially for graphs that are not transmission regular, propose some graft transformations that decrease or increase the distance $\\alpha$-spectral radius, and determine the unique graphs with minimum and maximum distance $\\alpha$-s","authors_text":"B. Zhou, H.Y. Guo","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T08:54:21Z","title":"On the distance $\\alpha$-spectral radius of a connected graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10180","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:8ce2cf5fdc3dd4dfed3b36dd806360087196163c2cd31e762a219280c9b09b2e","target":"record","created_at":"2026-05-17T23:55:15Z","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":"5e118b9e353bb7e5c1a4ea516cdb283afd50015233fe7d7e2353aa7e210886b8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T08:54:21Z","title_canon_sha256":"793a84da09131b8fe9927a7ceddf98e3a81f3b4723e8cc6bb822cb46ef9b2160"},"schema_version":"1.0","source":{"id":"1901.10180","kind":"arxiv","version":1}},"canonical_sha256":"715a88dbba4d1a99a571c02acd993bf4a400aca26027cfc4ebfc0812557685d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"715a88dbba4d1a99a571c02acd993bf4a400aca26027cfc4ebfc0812557685d9","first_computed_at":"2026-05-17T23:55:15.918536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:15.918536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GUasJ939aG720f/Ypd2mMS/Egrz2Vn9FOhEQmMm3IVGEaYDyDyNhIvhR4SoOVdqTogfUE/sqb6bu4wX7SoJaBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:15.918979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ce2cf5fdc3dd4dfed3b36dd806360087196163c2cd31e762a219280c9b09b2e","sha256:25d7c1ddf15fbeb7fb256560ff08a237c2219bb9006e8b929683c28443386159"],"state_sha256":"233d479aff98a34c5ae726fede33dc3a8de57f5f035c2da7bbdb17dd0b5e3365"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"enH4LLjIZ1SLQa6IkYLm/7qOIlRNx4WVq1pMzLCvOlrg/ODTtZhGHibw6wqt5jmvVl7ost4eeqxoCGMbphhXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:20:26.104228Z","bundle_sha256":"0203490d69a7cececf07eed2e8d42fa4858262ce4187430de5c9ed9a5416cf11"}}