{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E4CB4QVVXVAPVCFUSG7H2SDBEV","short_pith_number":"pith:E4CB4QVV","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"},"canonical_sha256":"27041e42b5bd40fa88b491be7d4861254afa6036316af2135a72d28e59cfd375","source":{"kind":"arxiv","id":"1502.00359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00359","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00359v1","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00359","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"E4CB4QVVXVAP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4CB4QVVXVAPVCFU","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4CB4QVV","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E4CB4QVVXVAPVCFUSG7H2SDBEV","target":"record","payload":{"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"},"canonical_sha256":"27041e42b5bd40fa88b491be7d4861254afa6036316af2135a72d28e59cfd375","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"},"source_kind":"arxiv","source_id":"1502.00359","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xrCwABBGAiDmKCYAimEwGKYXZWBa3CHM81T80ZxZrB3+rXj/QcfO4IIICWzjJW2rEAr+ue/FnDFp5Ed/BWLGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:59:06.858507Z"},"content_sha256":"83899305bc99408f22d1a89510b877112d4ea520fec683cfe79b32aa6207ed24","schema_version":"1.0","event_id":"sha256:83899305bc99408f22d1a89510b877112d4ea520fec683cfe79b32aa6207ed24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E4CB4QVVXVAPVCFUSG7H2SDBEV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//MmI1GYS/lSD6QXKEuPsbLMWGcBM1PqKqZZKBzH4PhrLAz8StXARt+EvNANeJgTHEokEFfn4RtvXmB5oQ8rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:59:06.859211Z"},"content_sha256":"cd688b49bcad3b14492d9f124dbba2b8e80ff8a7e595d975bc9dd11d437a74aa","schema_version":"1.0","event_id":"sha256:cd688b49bcad3b14492d9f124dbba2b8e80ff8a7e595d975bc9dd11d437a74aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/bundle.json","state_url":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T07:59:06Z","links":{"resolver":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV","bundle":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/bundle.json","state":"https://pith.science/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4CB4QVVXVAPVCFUSG7H2SDBEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E4CB4QVVXVAPVCFUSG7H2SDBEV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f17a38dae421e222dd328654e36cf859da30851db4f5e3a57c27cbae47a098d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T04:51:58Z","title_canon_sha256":"ad69e0e8f9cc5ebf87825dd8793e4b3a78fe7e9899c203b810f97fe0df151223"},"schema_version":"1.0","source":{"id":"1502.00359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00359","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00359v1","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00359","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"E4CB4QVVXVAP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4CB4QVVXVAPVCFU","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4CB4QVV","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:cd688b49bcad3b14492d9f124dbba2b8e80ff8a7e595d975bc9dd11d437a74aa","target":"graph","created_at":"2026-05-18T02:28:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Vladimir Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T04:51:58Z","title":"Extrema of graph eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00359","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83899305bc99408f22d1a89510b877112d4ea520fec683cfe79b32aa6207ed24","target":"record","created_at":"2026-05-18T02:28:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f17a38dae421e222dd328654e36cf859da30851db4f5e3a57c27cbae47a098d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T04:51:58Z","title_canon_sha256":"ad69e0e8f9cc5ebf87825dd8793e4b3a78fe7e9899c203b810f97fe0df151223"},"schema_version":"1.0","source":{"id":"1502.00359","kind":"arxiv","version":1}},"canonical_sha256":"27041e42b5bd40fa88b491be7d4861254afa6036316af2135a72d28e59cfd375","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27041e42b5bd40fa88b491be7d4861254afa6036316af2135a72d28e59cfd375","first_computed_at":"2026-05-18T02:28:06.183102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:06.183102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rEegNlF21ff3Zv+NyrQvJBR2zg/Ug+mcg29fDemoBpdVmOgT8i2LcOTQbqdIdcqslfjlABngmCz5bHcOTeqiAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:06.183521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83899305bc99408f22d1a89510b877112d4ea520fec683cfe79b32aa6207ed24","sha256:cd688b49bcad3b14492d9f124dbba2b8e80ff8a7e595d975bc9dd11d437a74aa"],"state_sha256":"6fc6c0d8800055b28a04aea4f29a579ae2164f03a7d5b578f20781d6b4f7124e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZrKe9MeXjps7YOJ2RVfGmufbi5JXLDiZ4A64C7HytXXbK53Ux2YTdU2t1Ez1uKRycTFcGxpdN+vq5EF4qM1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T07:59:06.863027Z","bundle_sha256":"b0bb943652f064ca6c44b14030cc01eade1231574da3ca653d2c4c63b340c41f"}}