Result for 7CFF66F0468692A896FA8BA6B72132A404E8138C

Query result

Key Value
FileName./usr/lib/.build-id/2a/d1c16c14afa3de3aeb5456d082c027becd7da1
FileSize39
MD5B828CE0000D8D9497A9873E61630115F
SHA-17CFF66F0468692A896FA8BA6B72132A404E8138C
SHA-256B99E575B722AB8EEAD8B62C226BEC049422F78B7D488C7C72C27E94A9AAEF672
SSDEEP3:gCD/UJbWKqU:X/QZv
TLSH
hashlookup:parent-total6
hashlookup:trust80

Network graph view

Parents (Total: 6)

The searched file hash is included in 6 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD58885E96A854D8FC3788FF2300C0EA072
PackageArchi586
PackageDescriptionThe CCOLAMD 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.
PackageMaintainerumeabot <umeabot>
PackageNamelibccolamd2
PackageRelease4.mga8
PackageVersion4.4.6
SHA-1E7B5FB82D51D371252933C00DD4B1BAFD97FAE0B
SHA-2560F5FF04BAB3299A093ACC8591602C4EFC822FFDCE7EC586700DFC7D5F7C69517
Key Value
MD5102A64F95CE599F7F521F5360F3EFFC2
PackageArcharmv7hl
PackageDescriptionThe CCOLAMD 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.
PackageMaintainerumeabot <umeabot>
PackageNamelibccolamd2
PackageRelease4.mga8
PackageVersion4.4.6
SHA-167CCB5C904F0D0159FA80EF1305032DBBF01F8A3
SHA-256B9F4617DE73C8118E5F3AC99B3B72B2B6F0F5346B8954C99508AEAA3E51558F6
Key Value
MD58A77B87ACB2045B0E2ADA5AF6B35FDE7
PackageArchi686
PackageDescriptionsuitesparse is a collection of libraries for computations involving sparse matrices. The package includes the following libraries: AMD approximate minimum degree ordering BTF permutation to block triangular form (beta) CAMD constrained approximate minimum degree ordering COLAMD column approximate minimum degree ordering CCOLAMD constrained column approximate minimum degree ordering CHOLMOD sparse Cholesky factorization CSparse a concise sparse matrix package CXSparse CSparse extended: complex matrix, int and long int support KLU sparse LU factorization, primarily for circuit simulation LDL a simple LDL factorization SQPR a multithread, multifrontal, rank-revealing sparse QR factorization method UMFPACK sparse LU factorization SuiteSparse_config configuration file for all the above packages. RBio read/write files in Rutherford/Boeing format
PackageMaintainerCentOS Buildsys <bugs@centos.org>
PackageNamesuitesparse
PackageRelease11.el8
PackageVersion4.4.6
SHA-16740B40ECB201DF090A3B92CAB54C438ED8DE438
SHA-256C3FEBE5A277FD658D5D58ADF009768F3D18919CAD4E83371889DA673CBC8E55D
Key Value
MD52F099357F1F8FF83B90C578C88CA6017
PackageArcharmv7hl
PackageDescriptionThe CCOLAMD 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.
PackageMaintainerumeabot <umeabot>
PackageNamelibccolamd2
PackageRelease3.mga7
PackageVersion4.4.6
SHA-12AD7325AA9A30DD11B1FEE47D24C8A18BD0F74F7
SHA-2563CA6102E4383F3799EB9F5BA87D8BC408C0D8A10D642FF71C3D0101D946F9FCE
Key Value
MD55134434A3E6346CDCF732132F03EDD29
PackageArchi686
PackageDescriptionsuitesparse is a collection of libraries for computations involving sparse matrices. The package includes the following libraries: AMD approximate minimum degree ordering BTF permutation to block triangular form (beta) CAMD constrained approximate minimum degree ordering COLAMD column approximate minimum degree ordering CCOLAMD constrained column approximate minimum degree ordering CHOLMOD sparse Cholesky factorization CSparse a concise sparse matrix package CXSparse CSparse extended: complex matrix, int and long int support KLU sparse LU factorization, primarily for circuit simulation LDL a simple LDL factorization SQPR a multithread, multifrontal, rank-revealing sparse QR factorization method UMFPACK sparse LU factorization SuiteSparse_config configuration file for all the above packages. RBio read/write files in Rutherford/Boeing format
PackageMaintainerCloudLinux Packaging Team <packager@cloudlinux.com>
PackageNamesuitesparse
PackageRelease11.el8
PackageVersion4.4.6
SHA-16E9AF7743596EA2EF1183EA01168B6B57E789847
SHA-25629F6CC67535DF32BA0358AF5A38E496260DB7CD2BE70275159F6BB35B9DD2B5B
Key Value
MD5472F0DD38F7889BADAB7C45AD6DCD6EA
PackageArchi586
PackageDescriptionThe CCOLAMD 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.
PackageMaintainerumeabot <umeabot>
PackageNamelibccolamd2
PackageRelease3.mga7
PackageVersion4.4.6
SHA-1913A5667BEB0DB2431C7B7549F209CD3E4618C1B
SHA-256BA8742AC8BB2918B0D93224EA17351E1BD36BDBDEAD763D92BA6621B686F8D66