{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZYEC3OKVAUQMOLKVIFQITRJGRP","short_pith_number":"pith:ZYEC3OKV","schema_version":"1.0","canonical_sha256":"ce082db9550520c72d55416089c5268bc69f08e92aed426e45a49b74f8d590d9","source":{"kind":"arxiv","id":"1609.00835","version":1},"attestation_state":"computed","paper":{"title":"On the $A_{\\alpha}$-spectra of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Germain Past\\'en, Oscar Rojo, Ricardo L. Soto, Vladimir Nikiforov","submitted_at":"2016-09-03T15:14:49Z","abstract_excerpt":"Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\\alpha\\in\\left[ 0,1\\right],$ define the matrix $A_{\\alpha}\\left(G\\right) $ as \\[ A_{\\alpha}\\left(G\\right) =\\alpha D\\left(G\\right) +(1-\\alpha)A\\left(G\\right) \\] where $0\\leq\\alpha\\leq1$.\n  This paper gives several results about the $A_{\\alpha}$-matrices of trees. In particular, it is shown that if $T_{\\Delta}$ is a tree of maximal degree $\\Delta,$ then the spectral radius of $A_{\\alpha}(T_{\\Delta})$ satisfies the tight inequality \\[ \\rho(A_{\\alpha}(T_{\\Delta}))<\\alpha\\Del"},"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":"1609.00835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-03T15:14:49Z","cross_cats_sorted":[],"title_canon_sha256":"9a0f7f127c99464ee3744d49bd6c447e7880748044d38638de8c20bc9481eec8","abstract_canon_sha256":"e5ac6da9c71dcb25a4103bb86713635428413a5a1634ae441630b619697be12b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.826411Z","signature_b64":"kX6CVTQYmnmJOoA/4SIdizKeiPubV3nKmwbvXddEy6s6oMN7VLrG3VLlMo0vOrLF1diqMM71XEdVfSdru3wVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce082db9550520c72d55416089c5268bc69f08e92aed426e45a49b74f8d590d9","last_reissued_at":"2026-05-18T01:06:19.825754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.825754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $A_{\\alpha}$-spectra of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Germain Past\\'en, Oscar Rojo, Ricardo L. Soto, Vladimir Nikiforov","submitted_at":"2016-09-03T15:14:49Z","abstract_excerpt":"Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\\alpha\\in\\left[ 0,1\\right],$ define the matrix $A_{\\alpha}\\left(G\\right) $ as \\[ A_{\\alpha}\\left(G\\right) =\\alpha D\\left(G\\right) +(1-\\alpha)A\\left(G\\right) \\] where $0\\leq\\alpha\\leq1$.\n  This paper gives several results about the $A_{\\alpha}$-matrices of trees. In particular, it is shown that if $T_{\\Delta}$ is a tree of maximal degree $\\Delta,$ then the spectral radius of $A_{\\alpha}(T_{\\Delta})$ satisfies the tight inequality \\[ \\rho(A_{\\alpha}(T_{\\Delta}))<\\alpha\\Del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00835","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":"1609.00835","created_at":"2026-05-18T01:06:19.825851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00835v1","created_at":"2026-05-18T01:06:19.825851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00835","created_at":"2026-05-18T01:06:19.825851+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYEC3OKVAUQM","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYEC3OKVAUQMOLKV","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYEC3OKV","created_at":"2026-05-18T12:30:55.937587+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/ZYEC3OKVAUQMOLKVIFQITRJGRP","json":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP.json","graph_json":"https://pith.science/api/pith-number/ZYEC3OKVAUQMOLKVIFQITRJGRP/graph.json","events_json":"https://pith.science/api/pith-number/ZYEC3OKVAUQMOLKVIFQITRJGRP/events.json","paper":"https://pith.science/paper/ZYEC3OKV"},"agent_actions":{"view_html":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP","download_json":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP.json","view_paper":"https://pith.science/paper/ZYEC3OKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00835&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYEC3OKVAUQMOLKVIFQITRJGRP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYEC3OKVAUQMOLKVIFQITRJGRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP/action/storage_attestation","attest_author":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP/action/author_attestation","sign_citation":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP/action/citation_signature","submit_replication":"https://pith.science/pith/ZYEC3OKVAUQMOLKVIFQITRJGRP/action/replication_record"}},"created_at":"2026-05-18T01:06:19.825851+00:00","updated_at":"2026-05-18T01:06:19.825851+00:00"}