{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NEEVB7QEC26LWQJRVRC5F5KSWW","short_pith_number":"pith:NEEVB7QE","schema_version":"1.0","canonical_sha256":"690950fe0416bcbb4131ac45d2f552b584dbcba62080ba28195fdfca42999d6f","source":{"kind":"arxiv","id":"1409.2538","version":2},"attestation_state":"computed","paper":{"title":"A (forgotten) upper bound for the spectral radius of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chia-an Liu, Clive Elphick","submitted_at":"2014-09-08T22:09:24Z","abstract_excerpt":"The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating from 1983 is equivalent to their much more recent bound. This bound is then used to compare lower bounds for the clique number. A series of sharp upper bounds for the signless Laplacian spectral radius is then proposed as another application. Finally a new lower bound for generalised r-partite graphs is proved, by extending a result due to Erdos."},"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":"1409.2538","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-08T22:09:24Z","cross_cats_sorted":[],"title_canon_sha256":"7d82fabf4e8703e84253a8314323ce9a6ae12d78744cae89a0b98c0d753ad2a4","abstract_canon_sha256":"9a5ba317c880f2b7337bc12f28058c5693f683d66c7898664ad915138a13f00f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.245674Z","signature_b64":"MRyFAJIZY++Cecv4svrX/HWEAuMlMoQ+J/Du0g2LovHCMr2KHNNKi6aIy20SBc2ysVauBPpvEk5V3LCi2KXJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690950fe0416bcbb4131ac45d2f552b584dbcba62080ba28195fdfca42999d6f","last_reissued_at":"2026-05-18T02:41:03.245157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.245157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A (forgotten) upper bound for the spectral radius of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chia-an Liu, Clive Elphick","submitted_at":"2014-09-08T22:09:24Z","abstract_excerpt":"The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating from 1983 is equivalent to their much more recent bound. This bound is then used to compare lower bounds for the clique number. A series of sharp upper bounds for the signless Laplacian spectral radius is then proposed as another application. Finally a new lower bound for generalised r-partite graphs is proved, by extending a result due to Erdos."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2538","kind":"arxiv","version":2},"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":"1409.2538","created_at":"2026-05-18T02:41:03.245238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2538v2","created_at":"2026-05-18T02:41:03.245238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2538","created_at":"2026-05-18T02:41:03.245238+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEEVB7QEC26L","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEEVB7QEC26LWQJR","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEEVB7QE","created_at":"2026-05-18T12:28:41.024544+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/NEEVB7QEC26LWQJRVRC5F5KSWW","json":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW.json","graph_json":"https://pith.science/api/pith-number/NEEVB7QEC26LWQJRVRC5F5KSWW/graph.json","events_json":"https://pith.science/api/pith-number/NEEVB7QEC26LWQJRVRC5F5KSWW/events.json","paper":"https://pith.science/paper/NEEVB7QE"},"agent_actions":{"view_html":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW","download_json":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW.json","view_paper":"https://pith.science/paper/NEEVB7QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2538&json=true","fetch_graph":"https://pith.science/api/pith-number/NEEVB7QEC26LWQJRVRC5F5KSWW/graph.json","fetch_events":"https://pith.science/api/pith-number/NEEVB7QEC26LWQJRVRC5F5KSWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW/action/storage_attestation","attest_author":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW/action/author_attestation","sign_citation":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW/action/citation_signature","submit_replication":"https://pith.science/pith/NEEVB7QEC26LWQJRVRC5F5KSWW/action/replication_record"}},"created_at":"2026-05-18T02:41:03.245238+00:00","updated_at":"2026-05-18T02:41:03.245238+00:00"}