{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E4CB4QVVXVAPVCFUSG7H2SDBEV","short_pith_number":"pith:E4CB4QVV","schema_version":"1.0","canonical_sha256":"27041e42b5bd40fa88b491be7d4861254afa6036316af2135a72d28e59cfd375","source":{"kind":"arxiv","id":"1502.00359","version":1},"attestation_state":"computed","paper":{"title":"Extrema of graph eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2015-02-02T04:51:58Z","abstract_excerpt":"In 1993 Hong asked what are the best bounds on the $k$'th largest eigenvalue $\\lambda_{k}(G)$ of a graph $G$ of order $n$. This challenging question has never been tackled for any $2<k<n$. In the present paper tight bounds are obtained for all $k>2,$ and even tighter bounds are obtained for the $k$'th largest singular value $\\lambda_{k}^{\\ast}(G).$\n  Some of these bounds are based on Taylor's strongly regular graphs, and other on a method of Kharaghani for constructing Hadamard matrices. The same kind of constructions are applied to other open problems, like Nordhaus-Gaddum problems of the kin"},"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":"1502.00359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T04:51:58Z","cross_cats_sorted":[],"title_canon_sha256":"ad69e0e8f9cc5ebf87825dd8793e4b3a78fe7e9899c203b810f97fe0df151223","abstract_canon_sha256":"f17a38dae421e222dd328654e36cf859da30851db4f5e3a57c27cbae47a098d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:06.183521Z","signature_b64":"rEegNlF21ff3Zv+NyrQvJBR2zg/Ug+mcg29fDemoBpdVmOgT8i2LcOTQbqdIdcqslfjlABngmCz5bHcOTeqiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27041e42b5bd40fa88b491be7d4861254afa6036316af2135a72d28e59cfd375","last_reissued_at":"2026-05-18T02:28:06.183102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:06.183102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extrema of graph eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2015-02-02T04:51:58Z","abstract_excerpt":"In 1993 Hong asked what are the best bounds on the $k$'th largest eigenvalue $\\lambda_{k}(G)$ of a graph $G$ of order $n$. This challenging question has never been tackled for any $2<k<n$. In the present paper tight bounds are obtained for all $k>2,$ and even tighter bounds are obtained for the $k$'th largest singular value $\\lambda_{k}^{\\ast}(G).$\n  Some of these bounds are based on Taylor's strongly regular graphs, and other on a method of Kharaghani for constructing Hadamard matrices. The same kind of constructions are applied to other open problems, like Nordhaus-Gaddum problems of the kin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00359","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":"1502.00359","created_at":"2026-05-18T02:28:06.183171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00359v1","created_at":"2026-05-18T02:28:06.183171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00359","created_at":"2026-05-18T02:28:06.183171+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4CB4QVVXVAP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4CB4QVVXVAPVCFU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4CB4QVV","created_at":"2026-05-18T12:29:17.054201+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/E4CB4QVVXVAPVCFUSG7H2SDBEV","json":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV.json","graph_json":"https://pith.science/api/pith-number/E4CB4QVVXVAPVCFUSG7H2SDBEV/graph.json","events_json":"https://pith.science/api/pith-number/E4CB4QVVXVAPVCFUSG7H2SDBEV/events.json","paper":"https://pith.science/paper/E4CB4QVV"},"agent_actions":{"view_html":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV","download_json":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV.json","view_paper":"https://pith.science/paper/E4CB4QVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00359&json=true","fetch_graph":"https://pith.science/api/pith-number/E4CB4QVVXVAPVCFUSG7H2SDBEV/graph.json","fetch_events":"https://pith.science/api/pith-number/E4CB4QVVXVAPVCFUSG7H2SDBEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/action/storage_attestation","attest_author":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/action/author_attestation","sign_citation":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/action/citation_signature","submit_replication":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/action/replication_record"}},"created_at":"2026-05-18T02:28:06.183171+00:00","updated_at":"2026-05-18T02:28:06.183171+00:00"}