{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WZ7TQNTKXUBOPFY6DB6ZEAT2XF","short_pith_number":"pith:WZ7TQNTK","schema_version":"1.0","canonical_sha256":"b67f38366abd02e7971e187d92027ab942889306cd707ffe061c701a00ad8655","source":{"kind":"arxiv","id":"1805.03456","version":1},"attestation_state":"computed","paper":{"title":"On the $\\alpha$-spectral radius of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Haiyan Guo","submitted_at":"2018-05-09T11:08:12Z","abstract_excerpt":"For $0\\le \\alpha\\le 1$, Nikiforov proposed to study the spectral properties of the family of matrices $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$ of a graph $G$, where $D(G)$ is the degree diagonal matrix and $A(G)$ is the adjacency matrix. The $\\alpha$-spectral radius of $G$ is the largest eigenvalue of $A_{\\alpha}(G)$. We give upper bounds for $\\alpha$-spectral radius for unicyclic graphs $G$ with maximum degree $\\Delta\\ge 2$, connected irregular graphs with given maximum degree and and some other graph parameters, and graphs with given domination number, respectively. We determine the unique"},"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":"1805.03456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T11:08:12Z","cross_cats_sorted":[],"title_canon_sha256":"33e990fd2a7ee49f16a566d23bfeb466d00c8e57e1a7378cbd521368371f3099","abstract_canon_sha256":"1bf158aede020380b4cb32972d2f30fb2a3e615a7afa98b814cae8119d148405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.160085Z","signature_b64":"geQFNn42M+8izE/jQE3eFWUec9yTyHBXm4lB78ivfEmwHWg0wv6kTgHAB+azEfA4o8DDyk6P4amF/r8+ba27Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67f38366abd02e7971e187d92027ab942889306cd707ffe061c701a00ad8655","last_reissued_at":"2026-05-18T00:16:20.159526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.159526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $\\alpha$-spectral radius of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Haiyan Guo","submitted_at":"2018-05-09T11:08:12Z","abstract_excerpt":"For $0\\le \\alpha\\le 1$, Nikiforov proposed to study the spectral properties of the family of matrices $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$ of a graph $G$, where $D(G)$ is the degree diagonal matrix and $A(G)$ is the adjacency matrix. The $\\alpha$-spectral radius of $G$ is the largest eigenvalue of $A_{\\alpha}(G)$. We give upper bounds for $\\alpha$-spectral radius for unicyclic graphs $G$ with maximum degree $\\Delta\\ge 2$, connected irregular graphs with given maximum degree and and some other graph parameters, and graphs with given domination number, respectively. We determine the unique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03456","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03456","created_at":"2026-05-18T00:16:20.159606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03456v1","created_at":"2026-05-18T00:16:20.159606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03456","created_at":"2026-05-18T00:16:20.159606+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ7TQNTKXUBO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ7TQNTKXUBOPFY6","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ7TQNTK","created_at":"2026-05-18T12:33:01.666342+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/WZ7TQNTKXUBOPFY6DB6ZEAT2XF","json":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF.json","graph_json":"https://pith.science/api/pith-number/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/graph.json","events_json":"https://pith.science/api/pith-number/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/events.json","paper":"https://pith.science/paper/WZ7TQNTK"},"agent_actions":{"view_html":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF","download_json":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF.json","view_paper":"https://pith.science/paper/WZ7TQNTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03456&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/action/storage_attestation","attest_author":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/action/author_attestation","sign_citation":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/action/citation_signature","submit_replication":"https://pith.science/pith/WZ7TQNTKXUBOPFY6DB6ZEAT2XF/action/replication_record"}},"created_at":"2026-05-18T00:16:20.159606+00:00","updated_at":"2026-05-18T00:16:20.159606+00:00"}