{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OMP5DPL3PLCUNKJLSWNVFFOMSJ","short_pith_number":"pith:OMP5DPL3","schema_version":"1.0","canonical_sha256":"731fd1bd7b7ac546a92b959b5295cc927255bc96968212a82bec96d99c3045ad","source":{"kind":"arxiv","id":"1711.03274","version":1},"attestation_state":"computed","paper":{"title":"A matrix realization of spectral bounds of the spectral radius of a nonnegative matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chih-wen Weng, Yen-Jen Cheng","submitted_at":"2017-11-09T06:54:31Z","abstract_excerpt":"We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give a sharp upper bound of the spectral radius of $C$ expressed by the sum of entries, the largest off-diagonal entry $f$ and the largest diagonal entry $d$ in $C$. We also give a new class of sharp lower bounds of the spectral radius of $C$ expressed by the above $d$ and $f$, the least row-sum $r_n$ and the $t$-th largest row-sum $r_t$ in $C$ satisfying $0<r_n-"},"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":"1711.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T06:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"b15d29a5ef3a60ac6cc314cc038fd650e3585712a9a45252088dacb45f3b02a9","abstract_canon_sha256":"72c229c9855cf1a80e4a3e2861c0a7762f71ac9156e37cd765f6a29b2e899e3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.697869Z","signature_b64":"GcT0JGnZg/6gER4ogsB4o4WhEMCXbQ+rQHJmY2bIy0NtnKbrm5yjqn+rS0Ohd+hn6vDYRVfM+HU7kZ6fBO/hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731fd1bd7b7ac546a92b959b5295cc927255bc96968212a82bec96d99c3045ad","last_reissued_at":"2026-05-18T00:30:56.697198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.697198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A matrix realization of spectral bounds of the spectral radius of a nonnegative matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chih-wen Weng, Yen-Jen Cheng","submitted_at":"2017-11-09T06:54:31Z","abstract_excerpt":"We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give a sharp upper bound of the spectral radius of $C$ expressed by the sum of entries, the largest off-diagonal entry $f$ and the largest diagonal entry $d$ in $C$. We also give a new class of sharp lower bounds of the spectral radius of $C$ expressed by the above $d$ and $f$, the least row-sum $r_n$ and the $t$-th largest row-sum $r_t$ in $C$ satisfying $0<r_n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03274","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":"1711.03274","created_at":"2026-05-18T00:30:56.697289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03274v1","created_at":"2026-05-18T00:30:56.697289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03274","created_at":"2026-05-18T00:30:56.697289+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMP5DPL3PLCU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMP5DPL3PLCUNKJL","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMP5DPL3","created_at":"2026-05-18T12:31:34.259226+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/OMP5DPL3PLCUNKJLSWNVFFOMSJ","json":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ.json","graph_json":"https://pith.science/api/pith-number/OMP5DPL3PLCUNKJLSWNVFFOMSJ/graph.json","events_json":"https://pith.science/api/pith-number/OMP5DPL3PLCUNKJLSWNVFFOMSJ/events.json","paper":"https://pith.science/paper/OMP5DPL3"},"agent_actions":{"view_html":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ","download_json":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ.json","view_paper":"https://pith.science/paper/OMP5DPL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03274&json=true","fetch_graph":"https://pith.science/api/pith-number/OMP5DPL3PLCUNKJLSWNVFFOMSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OMP5DPL3PLCUNKJLSWNVFFOMSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ/action/storage_attestation","attest_author":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ/action/author_attestation","sign_citation":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ/action/citation_signature","submit_replication":"https://pith.science/pith/OMP5DPL3PLCUNKJLSWNVFFOMSJ/action/replication_record"}},"created_at":"2026-05-18T00:30:56.697289+00:00","updated_at":"2026-05-18T00:30:56.697289+00:00"}