| Key | Value |
|---|---|
| MD5 | 21F040349DE3448AA832F1109068BC7C |
| PackageArch | i586 |
| PackageDescription | The COLAMD column approximate minimum degree ordering algorithm computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A. |
| PackageMaintainer | umeabot <umeabot> |
| PackageName | libcolamd2 |
| PackageRelease | 3.mga7 |
| PackageVersion | 4.4.6 |
| SHA-1 | 3736418955AB3C88364949B5775BD4128F0AD815 |
| SHA-256 | A31DFF533A74843AA61E63BCE5A029286FEC7B8377D57C527229BD55E5B63CF2 |
| hashlookup:children-total | 3 |
| hashlookup:trust | 50 |
The searched file hash includes 3 children files known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileName | ./usr/lib64/libcolamd.so |
| FileSize | 18 |
| MD5 | 4529ACAC199C49CE380EEEAD5897131D |
| SHA-1 | 0451AAA45EEE83E001F94164F080CAE6AB620DD5 |
| SHA-256 | DCD7902DE0CA9880F349CCC2E3ACA178A4F6C4EE4CC61667DBABA1F9979D7867 |
| SSDEEP | 3:EG3aWKqV:EG3Iu |
| TLSH |
| Key | Value |
|---|---|
| FileName | ./usr/lib/libcolamd.so.2.9.0 |
| FileSize | 34136 |
| MD5 | 2E073E33EE4A2D66044B1217EFE70EF8 |
| SHA-1 | 7AA0AEBA4ED758B78F00FCE19C8C055FDCF9AC79 |
| SHA-256 | FD354D1D9C8961F74DEF0C4A6A17DF0F91616EC5369F4DF8E84D46319D210B77 |
| SSDEEP | 768:eJW/PXjojR8lJz/Fjr67XjFj0ll1z//jVyJVFyADVn:eQ/PXjXzdvAXjIz3JOr |
| TLSH | T1B5E23B61F3E1D0F9E68A14B91087EB17557096128023FFB6FB153AA27E723D87827344 |
| Key | Value |
|---|---|
| FileName | ./usr/lib/.build-id/4d/a18f92d982374a2b9974da47184051a5340557 |
| FileSize | 38 |
| MD5 | 23AE8C004EFDED2DAB4E78EF63F85B53 |
| SHA-1 | DF9D92F52492A3BC4ED91D41C7C8A7A437CDFABA |
| SHA-256 | 714C8722533C0CEED14F152F1B970F20CF24299CBABFB0525DDF47975FDC5B7A |
| SSDEEP | 3:gCD/DEaWKqV:X/DEIu |
| TLSH |