diff --git a/src/lib/as/as_costcomp.c b/src/lib/as/as_costcomp.c
index c0b86d95..d0a43d70 100644
--- a/src/lib/as/as_costcomp.c
+++ b/src/lib/as/as_costcomp.c
@@ -19,10 +19,6 @@
  */
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_costcomp.c	1.4	11/13/90";
-#endif /* not lint */
-
 /*
  * Compare the lower bound costs of two nodes.  If the two nodes have
  * equal lower bound costs, sort on the secondary field.
diff --git a/src/lib/as/as_delete.c b/src/lib/as/as_delete.c
index 30efb645..39292e5f 100644
--- a/src/lib/as/as_delete.c
+++ b/src/lib/as/as_delete.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_delete.c	1.5	11/13/90";
-#endif /* not lint */
-
 static void as_free_queue(struct as_queue *queue);
 
 /*
diff --git a/src/lib/as/as_extend.c b/src/lib/as/as_extend.c
index a51b89c2..86ed6fe4 100644
--- a/src/lib/as/as_extend.c
+++ b/src/lib/as/as_extend.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_extend.c	1.2	11/13/90";
-#endif /* not lint */
-
 /*
  * Extend the queue by neighbors.  This entails getting the
  * coordinates of all the neighbors, figuring out their lower bound
diff --git a/src/lib/as/as_hash.c b/src/lib/as/as_hash.c
index 030dd914..d9a47f2e 100644
--- a/src/lib/as/as_hash.c
+++ b/src/lib/as/as_hash.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_hash.c	1.2	11/13/90";
-#endif /* not lint */
-
 /*
  * Return a pointer to the as_queue structure associated with
  * this coordinate if the coordinate is in the queue.
diff --git a/src/lib/as/as_init.c b/src/lib/as/as_init.c
index 32ff719b..a31fc85f 100644
--- a/src/lib/as/as_init.c
+++ b/src/lib/as/as_init.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_init.c	1.4	11/13/90";
-#endif /* not lint */
-
 /*
  * Return an as_data structure with the necessary fields filled in
  * and space malloced.  Return NULL if malloc fails.
diff --git a/src/lib/as/as_merge.c b/src/lib/as/as_merge.c
index 83549542..1f7a361c 100644
--- a/src/lib/as/as_merge.c
+++ b/src/lib/as/as_merge.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_merge.c	1.2	11/13/90";
-#endif /* not lint */
-
 /*
  * Merge neighbors into queue, keeping it sorted.  "neighbors" is sorted,
  * both by lower bound cost and then by secondary cost.
diff --git a/src/lib/as/as_search.c b/src/lib/as/as_search.c
index fd885592..ba618881 100644
--- a/src/lib/as/as_search.c
+++ b/src/lib/as/as_search.c
@@ -25,10 +25,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_search.c	1.2	11/13/90";
-#endif /* not lint */
-
 /*
  * Basic A* search function.  "adp" should have been initialized by
  * as_init (any previously allocated data will be freed by as_reset here),
diff --git a/src/lib/as/as_stats.c b/src/lib/as/as_stats.c
index af47a26f..970077fa 100644
--- a/src/lib/as/as_stats.c
+++ b/src/lib/as/as_stats.c
@@ -20,10 +20,6 @@
 #include <stdio.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_stats.c	1.2	11/13/90";
-#endif /* not lint */
-
 /*
  * Print statistics on algorithm performance to the file pointer "fp".
  */
diff --git a/src/lib/as/as_winnow.c b/src/lib/as/as_winnow.c
index aa8c395a..2fd79122 100644
--- a/src/lib/as/as_winnow.c
+++ b/src/lib/as/as_winnow.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_winnow.c	1.8	11/13/90";
-#endif /* not lint */
-
 static struct as_node *as_newnode(struct as_node *backp, struct as_coord c,
 				  double inclbcost, double lbcost,
 				  double knowncost, double seccost);