{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EN2B5TSZQF4DVII2ZXGPERIFTO","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":"d09fa637ff22e4cde8b4d8c6943ba74a8b11f11b1c249e82754e0375e231a444","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-13T17:12:57Z","title_canon_sha256":"e01e6cc97ac45549d27364d98aa7f0d0897096c9c553dc2326036566408a4d91"},"schema_version":"1.0","source":{"id":"2501.07494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07494","created_at":"2026-07-05T10:00:29Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07494v1","created_at":"2026-07-05T10:00:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07494","created_at":"2026-07-05T10:00:29Z"},{"alias_kind":"pith_short_12","alias_value":"EN2B5TSZQF4D","created_at":"2026-07-05T10:00:29Z"},{"alias_kind":"pith_short_16","alias_value":"EN2B5TSZQF4DVII2","created_at":"2026-07-05T10:00:29Z"},{"alias_kind":"pith_short_8","alias_value":"EN2B5TSZ","created_at":"2026-07-05T10:00:29Z"}],"graph_snapshots":[{"event_id":"sha256:2049e03e1f669c7d089517502f0abe30f3b4bf47e1a5d6b797ea2190044015da","target":"graph","created_at":"2026-07-05T10:00:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.07494/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph on $n \\ge 3$ vertices, whose adjacency matrix has eigenvalues $\\lambda_1 \\ge \\lambda_2 \\ge \\dots \\ge \\lambda_n$. The problem of bounding $\\lambda_k$ in terms of $n$ was first proposed by Hong and was studied by Nikiforov, who demonstrated strong upper and lower bounds for arbitrary $k$. Nikiforov also claimed a strengthened upper bound for $k \\ge 3$, namely that $\\frac{\\lambda_k}{n} < \\frac{1}{2\\sqrt{k-1}} - \\varepsilon_k$ for some positive $\\varepsilon_k$, but omitted the proof due to its length. In this paper, we give a proof of this bound for $k = 3$. We achieve this by i","authors_text":"Sida Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-13T17:12:57Z","title":"Strengthened upper bound on the third eigenvalue of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07494","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:21c5545bad4ad3a2dd0b68939f24ad6226dd01699a94e1cadc050c201519a176","target":"record","created_at":"2026-07-05T10:00:29Z","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":"d09fa637ff22e4cde8b4d8c6943ba74a8b11f11b1c249e82754e0375e231a444","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-13T17:12:57Z","title_canon_sha256":"e01e6cc97ac45549d27364d98aa7f0d0897096c9c553dc2326036566408a4d91"},"schema_version":"1.0","source":{"id":"2501.07494","kind":"arxiv","version":1}},"canonical_sha256":"23741ece5981783aa11acdccf245059ba1f19c75eee37fdc51c60ffbaf682a60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23741ece5981783aa11acdccf245059ba1f19c75eee37fdc51c60ffbaf682a60","first_computed_at":"2026-07-05T10:00:29.327132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:29.327132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"165xhZfUhVyg2Rl8bK9FGxw4VZBD/UOY7rTaWlDfPg0+t5l2EU9rLYIvM56Ymgq2Lr8OJ/dknW+5FtV63Gp+Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:29.327625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21c5545bad4ad3a2dd0b68939f24ad6226dd01699a94e1cadc050c201519a176","sha256:2049e03e1f669c7d089517502f0abe30f3b4bf47e1a5d6b797ea2190044015da"],"state_sha256":"487f014f8f56aad663e9ed5c2c93c7c67cdde9444bb9f09b3e18a7f593301ee6"}