{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3UG3BBEDN4GHR7F2RT5YMTWLSZ","short_pith_number":"pith:3UG3BBED","schema_version":"1.0","canonical_sha256":"dd0db084836f0c78fcba8cfb864ecb965fcb5d7d8a720579274fa8c02171f300","source":{"kind":"arxiv","id":"2106.09238","version":1},"attestation_state":"computed","paper":{"title":"On the spectral radius of unicyclic and bicyclic graphs with a fixed diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F.F. Wang, H.Y. Shan, Y.Y. Zhai","submitted_at":"2021-06-17T04:11:27Z","abstract_excerpt":"The $\\alpha$-spectral radius of a connected graph $G$ is the spectral radius of $A_\\alpha$-matrix of $G$. In this paper, we discuss the methods for comparing $\\alpha$-spectral radius of graphs. As applications, we characterize the graphs with the maximal $\\alpha$-spectral radius among all unicyclic and bicyclic graphs of order $n$ with diameter $d$, respectively. Finally, we determine the unique graph with maximal signless Laplacian spectral radius among bicyclic graphs of order $n$ with diameter $d$."},"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":"2106.09238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T04:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"7e72e720e57a02397311f733a0e52f747f94cfe2887d8b9947ede2c000970708","abstract_canon_sha256":"ca07091f2f3de71e9af35d12211cf166b17d01bdcde0835747cc3d7c9c48edc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:13.994484Z","signature_b64":"7TszBlqrcKWuwZSWtI+3SkTt2qed2K5OX2sCgTg/+ns9LE5NIPwN9z64VQdBVEvz3wMuUQyTbCTIUeryxebOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd0db084836f0c78fcba8cfb864ecb965fcb5d7d8a720579274fa8c02171f300","last_reissued_at":"2026-07-05T02:50:13.994077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:13.994077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the spectral radius of unicyclic and bicyclic graphs with a fixed diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F.F. Wang, H.Y. Shan, Y.Y. Zhai","submitted_at":"2021-06-17T04:11:27Z","abstract_excerpt":"The $\\alpha$-spectral radius of a connected graph $G$ is the spectral radius of $A_\\alpha$-matrix of $G$. In this paper, we discuss the methods for comparing $\\alpha$-spectral radius of graphs. As applications, we characterize the graphs with the maximal $\\alpha$-spectral radius among all unicyclic and bicyclic graphs of order $n$ with diameter $d$, respectively. Finally, we determine the unique graph with maximal signless Laplacian spectral radius among bicyclic graphs of order $n$ with diameter $d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09238","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/2106.09238/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":"2106.09238","created_at":"2026-07-05T02:50:13.994132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.09238v1","created_at":"2026-07-05T02:50:13.994132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09238","created_at":"2026-07-05T02:50:13.994132+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UG3BBEDN4GH","created_at":"2026-07-05T02:50:13.994132+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UG3BBEDN4GHR7F2","created_at":"2026-07-05T02:50:13.994132+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UG3BBED","created_at":"2026-07-05T02:50:13.994132+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/3UG3BBEDN4GHR7F2RT5YMTWLSZ","json":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ.json","graph_json":"https://pith.science/api/pith-number/3UG3BBEDN4GHR7F2RT5YMTWLSZ/graph.json","events_json":"https://pith.science/api/pith-number/3UG3BBEDN4GHR7F2RT5YMTWLSZ/events.json","paper":"https://pith.science/paper/3UG3BBED"},"agent_actions":{"view_html":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ","download_json":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ.json","view_paper":"https://pith.science/paper/3UG3BBED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.09238&json=true","fetch_graph":"https://pith.science/api/pith-number/3UG3BBEDN4GHR7F2RT5YMTWLSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3UG3BBEDN4GHR7F2RT5YMTWLSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ/action/storage_attestation","attest_author":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ/action/author_attestation","sign_citation":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ/action/citation_signature","submit_replication":"https://pith.science/pith/3UG3BBEDN4GHR7F2RT5YMTWLSZ/action/replication_record"}},"created_at":"2026-07-05T02:50:13.994132+00:00","updated_at":"2026-07-05T02:50:13.994132+00:00"}