{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PDMJC6NAIOBTUFX5GAFYJF5Q44","short_pith_number":"pith:PDMJC6NA","schema_version":"1.0","canonical_sha256":"78d89179a043833a16fd300b8497b0e70a50f247c809e0b7ee075682f923d46a","source":{"kind":"arxiv","id":"1208.1958","version":1},"attestation_state":"computed","paper":{"title":"Spectral Radius and Degree Sequence of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chia-an Liu, Chih-wen Weng","submitted_at":"2012-08-09T15:52:43Z","abstract_excerpt":"Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give a sharp upper bound for rho(G) by a function of d_1, d_2, ..., d_L, which generalizes a series of previous results."},"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":"1208.1958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-09T15:52:43Z","cross_cats_sorted":[],"title_canon_sha256":"7d265addd3aa66eda6c027e52c20b932c7bf8e7431eb3de3bd773d5bb2d58b96","abstract_canon_sha256":"03ff79f9d3b7bbdc9040f3bcb53ede4e0a64aac1af0ad6d87183c44edace11b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:09.608469Z","signature_b64":"he4ixYw6oL5UC5B8Axt7QgbXsB4WZw0J5I0xADdafT2DBxTjZuZt4VERQWfecVPKTcrTXGGNo3rPSdplWVPWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78d89179a043833a16fd300b8497b0e70a50f247c809e0b7ee075682f923d46a","last_reissued_at":"2026-05-18T03:49:09.608019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:09.608019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Radius and Degree Sequence of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chia-an Liu, Chih-wen Weng","submitted_at":"2012-08-09T15:52:43Z","abstract_excerpt":"Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give a sharp upper bound for rho(G) by a function of d_1, d_2, ..., d_L, which generalizes a series of previous results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1958","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":"1208.1958","created_at":"2026-05-18T03:49:09.608100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1958v1","created_at":"2026-05-18T03:49:09.608100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1958","created_at":"2026-05-18T03:49:09.608100+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDMJC6NAIOBT","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDMJC6NAIOBTUFX5","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDMJC6NA","created_at":"2026-05-18T12:27:18.751474+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/PDMJC6NAIOBTUFX5GAFYJF5Q44","json":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44.json","graph_json":"https://pith.science/api/pith-number/PDMJC6NAIOBTUFX5GAFYJF5Q44/graph.json","events_json":"https://pith.science/api/pith-number/PDMJC6NAIOBTUFX5GAFYJF5Q44/events.json","paper":"https://pith.science/paper/PDMJC6NA"},"agent_actions":{"view_html":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44","download_json":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44.json","view_paper":"https://pith.science/paper/PDMJC6NA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1958&json=true","fetch_graph":"https://pith.science/api/pith-number/PDMJC6NAIOBTUFX5GAFYJF5Q44/graph.json","fetch_events":"https://pith.science/api/pith-number/PDMJC6NAIOBTUFX5GAFYJF5Q44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44/action/storage_attestation","attest_author":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44/action/author_attestation","sign_citation":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44/action/citation_signature","submit_replication":"https://pith.science/pith/PDMJC6NAIOBTUFX5GAFYJF5Q44/action/replication_record"}},"created_at":"2026-05-18T03:49:09.608100+00:00","updated_at":"2026-05-18T03:49:09.608100+00:00"}