{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","short_pith_number":"pith:FL6BTRXD","schema_version":"1.0","canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","source":{"kind":"arxiv","id":"2606.00843","version":1},"attestation_state":"computed","paper":{"title":"Sharp upper bounds on the $A_\\alpha$-spectral radius of graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zheng-Jiang Xia, Zhen-Mu Hong, Zhi Qiao","submitted_at":"2026-05-30T18:33:11Z","abstract_excerpt":"Let $G$ be a simple graph with degree diagonal matrix $D(G)$ and adjacency matrix $A(G)$. The signless Laplacian matrix of $G$ is defined as $Q(G)=D(G)+A(G)$. For a real number $\\alpha \\in [0, 1]$, Nikiforov (2017) proposed the $A_\\alpha$-matrix of a graph $G$ as $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$. The $A_\\alpha$-spectral radius of $G$, denoted by $\\rho_\\alpha(G)$, is the largest eigenvalue of $A_\\alpha(G)$, where $\\rho_0(G)=\\rho(G)$ is the spectral radius of $A(G)$ and $2\\rho_{\\frac{1}{2}}(G)=q(G)$ is the spectral radius of $Q(G)$. Sun and Das (2020) proved that for any non-isolated v"},"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":"2606.00843","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T18:33:11Z","cross_cats_sorted":[],"title_canon_sha256":"567e7f6656b5371eb466beca7720278d2e2bc478b78b4234aff47e79c0f107b4","abstract_canon_sha256":"d3390e7ac4715e7b9f154d3531ec789f5bb28d145a33217f33383ecc231172f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:07.401922Z","signature_b64":"nQHKBfqqgcsxud4U9WGNp6sghNtmvvWLdfAyjtrJDpPisQuvWQA3dvLpPJaKh9/N8V5tQetaOG8Qo43u2PCVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","last_reissued_at":"2026-06-02T01:04:07.401569Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:07.401569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp upper bounds on the $A_\\alpha$-spectral radius of graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zheng-Jiang Xia, Zhen-Mu Hong, Zhi Qiao","submitted_at":"2026-05-30T18:33:11Z","abstract_excerpt":"Let $G$ be a simple graph with degree diagonal matrix $D(G)$ and adjacency matrix $A(G)$. The signless Laplacian matrix of $G$ is defined as $Q(G)=D(G)+A(G)$. For a real number $\\alpha \\in [0, 1]$, Nikiforov (2017) proposed the $A_\\alpha$-matrix of a graph $G$ as $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$. The $A_\\alpha$-spectral radius of $G$, denoted by $\\rho_\\alpha(G)$, is the largest eigenvalue of $A_\\alpha(G)$, where $\\rho_0(G)=\\rho(G)$ is the spectral radius of $A(G)$ and $2\\rho_{\\frac{1}{2}}(G)=q(G)$ is the spectral radius of $Q(G)$. Sun and Das (2020) proved that for any non-isolated v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00843","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/2606.00843/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":"2606.00843","created_at":"2026-06-02T01:04:07.401625+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00843v1","created_at":"2026-06-02T01:04:07.401625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00843","created_at":"2026-06-02T01:04:07.401625+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL6BTRXD3ZPG","created_at":"2026-06-02T01:04:07.401625+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL6BTRXD3ZPG6IZ2","created_at":"2026-06-02T01:04:07.401625+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL6BTRXD","created_at":"2026-06-02T01:04:07.401625+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/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","json":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ.json","graph_json":"https://pith.science/api/pith-number/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/graph.json","events_json":"https://pith.science/api/pith-number/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/events.json","paper":"https://pith.science/paper/FL6BTRXD"},"agent_actions":{"view_html":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","download_json":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ.json","view_paper":"https://pith.science/paper/FL6BTRXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00843&json=true","fetch_graph":"https://pith.science/api/pith-number/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/action/storage_attestation","attest_author":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/action/author_attestation","sign_citation":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/action/citation_signature","submit_replication":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/action/replication_record"}},"created_at":"2026-06-02T01:04:07.401625+00:00","updated_at":"2026-06-02T01:04:07.401625+00:00"}