*/*: fix MissingRemoteId in metadata.xml

* Manually checked, I hope I caught most errors

Signed-off-by: Lucio Sauer <watermanpaint@posteo.net>

sci-mathematics/minisat+/metadata.xml

@@ -13,4 +13,7 @@ MiniSat+ is a two-week hack done to enable MiniSat to compete in the new categor
 However, the PB part is, arguably, the more interesting one. A number of generalizations of SAT solvers to PB solvers have been proposed (Pueblo, Galena, OPBDP and more), but we felt that the other approach — converting the problem to SAT — had not been invesigated adequately. Our hope was to provide a point of reference for the proper generalizations of SAT to PB, so that the merit of such an approach could be evaluated. Therefore MiniSat+ provides multiple ways of translating PB constraints to clauses.
 For the PB evaluation 2005, we provided a top-level heuristic to choose between the translation methods. To our surprise, MiniSat+ solved more problem than any of the other 6 dedicated PB solvers did, and also seemed to one of the few solvers not being visibly buggy (modulo giving the wrong exitcode for SATISFIABLE instances without an objective function).
   </longdescription>
+  <upstream>
+    <remote-id type="github">niklasso/minisat-webpage</remote-id>
+  </upstream>
 </pkgmetadata>

sci-mathematics/qepcad/metadata.xml

@@ -10,6 +10,7 @@
       <email>wcbrown@usna.edu</email>
       <name>Chris Brown</name>
     </maintainer>
+    <remote-id type="github">Alessandro-Barbieri/qepcad</remote-id>
   </upstream>
   <longdescription lang="en">
 The Program

sci-mathematics/the-omega-project/metadata.xml

@@ -22,4 +22,7 @@ but this may just be an equivalent iteration space expressed in a different way.
     <flag name="htmldoc">Build html documentation</flag>
     <flag name="petit">Build Petit, a educational/research tool for analyzing array data dependences</flag>
   </use>
+  <upstream>
+    <remote-id type="github">davewathaverford/the-omega-project</remote-id>
+  </upstream>
 </pkgmetadata>