{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TPXDZYZMXVLBS4JQBGGSOGLEXG","short_pith_number":"pith:TPXDZYZM","canonical_record":{"source":{"id":"1108.4810","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"398e93f771c9f9350027be805702d7d2a719c0af83472738fdcf589c92e69c65","abstract_canon_sha256":"43a74a08bc6681f6665f6ef634c7466dbd57692eaf2b7a1e303c1e89d834e246"},"schema_version":"1.0"},"canonical_sha256":"9bee3ce32cbd56197130098d271964b98dab418348244522e5c931935a2c3e68","source":{"kind":"arxiv","id":"1108.4810","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TPXDZYZMXVLBS4JQBGGSOGLEXG","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4810","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"398e93f771c9f9350027be805702d7d2a719c0af83472738fdcf589c92e69c65","abstract_canon_sha256":"43a74a08bc6681f6665f6ef634c7466dbd57692eaf2b7a1e303c1e89d834e246"},"schema_version":"1.0"},"canonical_sha256":"9bee3ce32cbd56197130098d271964b98dab418348244522e5c931935a2c3e68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:49.421948Z","signature_b64":"V5kTUxdjxoNhXbTJWcLBYWMf78c5XVcq93gwodt4gCUwUZoKOKznw2mCqpzV+P8kh6NCx0lkJ/OQ7uwfC4dsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bee3ce32cbd56197130098d271964b98dab418348244522e5c931935a2c3e68","last_reissued_at":"2026-05-18T03:54:49.421225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:49.421225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4810","source_version":3,"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-18T03:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeaM6JJ7ih4x0NNEo+WCS+ZmnxwVOiFbVVO3rf8x3PMeT5puZ15MHz8VBIE1KlMcZ01nSomYNjyNl/hrk10HBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:18:32.604530Z"},"content_sha256":"505aacaa40d158c22ecaf23e355ce985d14afabc14eb871f683acd6c7e8cefbb","schema_version":"1.0","event_id":"sha256:505aacaa40d158c22ecaf23e355ce985d14afabc14eb871f683acd6c7e8cefbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TPXDZYZMXVLBS4JQBGGSOGLEXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles R. Johnson, Lee Kennedy-Shaffer, Miriam Farber, Zachary B. Charles","submitted_at":"2011-08-24T11:06:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4810","kind":"arxiv","version":3},"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-18T03:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/PybM694S8mEiztdYaCff0vNzF5zBQpc3+kmV7biTqGRZOWDOnrGlvaagC1aJCzy4mpWXYrygPN6XHCHjgABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:18:32.604874Z"},"content_sha256":"df6844161f1ba248695c2ff3f1b3045eb24f208c9522096079f72572c4406893","schema_version":"1.0","event_id":"sha256:df6844161f1ba248695c2ff3f1b3045eb24f208c9522096079f72572c4406893"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG/bundle.json","state_url":"https://pith.science/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG/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-06-20T07:18:32Z","links":{"resolver":"https://pith.science/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG","bundle":"https://pith.science/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG/bundle.json","state":"https://pith.science/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPXDZYZMXVLBS4JQBGGSOGLEXG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqVMkUIyAz81WFAgXj9cHhd22eWydh+DvOW1hM2ZCCEztpL2LxTSzHf2u5X9UGICj0X5OJ/uUPvlsPa1Rkq5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:18:32.606833Z","bundle_sha256":"62a057fdfa0a7f7fba73879bcc6b87e5d689b68431f1ba433f5e61a79eb04097"}}