{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TPXDZYZMXVLBS4JQBGGSOGLEXG","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":"43a74a08bc6681f6665f6ef634c7466dbd57692eaf2b7a1e303c1e89d834e246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:06:55Z","title_canon_sha256":"398e93f771c9f9350027be805702d7d2a719c0af83472738fdcf589c92e69c65"},"schema_version":"1.0","source":{"id":"1108.4810","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4810","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4810v3","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4810","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"TPXDZYZMXVLB","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TPXDZYZMXVLBS4JQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TPXDZYZM","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:df6844161f1ba248695c2ff3f1b3045eb24f208c9522096079f72572c4406893","target":"graph","created_at":"2026-05-18T03:54:49Z","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":"Let $NPO(k)$ be the smallest number $n$ such that the adjacency matrix of any undirected graph with $n$ vertices or more has at least $k$ nonpositive eigenvalues. We show that $NPO(k)$ is well-defined and prove that the values of $NPO(k)$ for $k=1,2,3,4,5$ are $1,3,6,10,16$ respectively. In addition, we prove that for all $k \\geq 5$, $R(k,k+1) \\ge NPO(k) > T_k$, in which $R(k,k+1)$ is the Ramsey number for $k$ and $k+1$, and $T_k$ is the $k^{th}$ triangular number. This implies new lower bounds for eigenvalues of Laplacian matrices: the $k$-th largest eigenvalue is bounded from below by the $N","authors_text":"Charles R. Johnson, Lee Kennedy-Shaffer, Miriam Farber, Zachary B. Charles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:06:55Z","title":"Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4810","kind":"arxiv","version":3},"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:505aacaa40d158c22ecaf23e355ce985d14afabc14eb871f683acd6c7e8cefbb","target":"record","created_at":"2026-05-18T03:54:49Z","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":"43a74a08bc6681f6665f6ef634c7466dbd57692eaf2b7a1e303c1e89d834e246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:06:55Z","title_canon_sha256":"398e93f771c9f9350027be805702d7d2a719c0af83472738fdcf589c92e69c65"},"schema_version":"1.0","source":{"id":"1108.4810","kind":"arxiv","version":3}},"canonical_sha256":"9bee3ce32cbd56197130098d271964b98dab418348244522e5c931935a2c3e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bee3ce32cbd56197130098d271964b98dab418348244522e5c931935a2c3e68","first_computed_at":"2026-05-18T03:54:49.421225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:49.421225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5kTUxdjxoNhXbTJWcLBYWMf78c5XVcq93gwodt4gCUwUZoKOKznw2mCqpzV+P8kh6NCx0lkJ/OQ7uwfC4dsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:49.421948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4810","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:505aacaa40d158c22ecaf23e355ce985d14afabc14eb871f683acd6c7e8cefbb","sha256:df6844161f1ba248695c2ff3f1b3045eb24f208c9522096079f72572c4406893"],"state_sha256":"05c2c7c9ea8dd06e8df5bce8be820034ff47381a7b6987af4d5519883ee532ca"}