Result for DA3B084E2213BB08841A28F8BD91D27E515E2674

Query result

Key Value
FileName./usr/share/lintian/overrides/libbliss-dev-common
FileSize76
MD5E442158DEB25D01DDA7B9893EBBE1124
RDS:package_id182052
SHA-1DA3B084E2213BB08841A28F8BD91D27E515E2674
SHA-256F8BB62D54135121FFBE8176B0C1636ABCFD216400F16E3E9553E428C6874C422
SSDEEP3:SDWuzZlEMiFLZNop3QAu7Nho:SKuFll8zAu7NC
TLSHT1F0A02453DCD400F01047C00413C1031011DCCFD1C0100D13413DD7C37413140C17CC10
insert-timestamp1679425333.5997355
sourceRDS.db
hashlookup:parent-total12
hashlookup:trust100

Network graph view

Parents (Total: 12)

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

Key Value
FileSize16488
MD5162173E81BD070D9BE174C9C87CA7043
PackageDescriptiondevelopment files to compute graph automorphisms and labelings -- headers Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the C/C++ headers needed for development.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibbliss-dev-common
PackageSectionlibdevel
PackageVersion0.73-1
SHA-18EB7A3684CB662E379E600C8236C08408043C0E1
SHA-2564EEB71F6704BC5DCD2088CDB7229B84479E5EBC16B1DE28EA16EF2CBFF3E5A18
Key Value
FileSize274196
MD5AE0747834350340160FFAE3FBBB13BCB
PackageDescriptionsuite to compute graph automorphisms and labelings -- doc Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the API documentation.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamebliss-doc
PackageSectiondoc
PackageVersion0.73-2
SHA-161D8119FD9188E53009C6D83DD7B2234A6505A62
SHA-2565F9CE4D08D8716FF954BB586E3BA7BB55ED3E73F9E0CE7F603A4D98FD259B957
Key Value
FileName11442
FileSize16484
MD5BD815D68589A9A9B320CC2D9519FF9BA
PackageDescriptiondevelopment files to compute graph automorphisms and labelings -- headers Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the C/C++ headers needed for development.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss-dev-common
PackageSectionlibdevel
PackageVersion0.73-1
RDS:package_id182052
SHA-1A99BC7B4FA11E1B12A89FFBC60AE93A129B509E4
SHA-2566FBB491F40138D66058229D63B515FBFFA22E74932BF0D532F467AD2F5F2E507
insert-timestamp1679408382.1887412
sourceRDS.db
Key Value
FileSize17080
MD52DA7B0FA3F95404167EB5B6322EE92D9
PackageDescriptiondevelopment files to compute graph automorphisms and labelings -- headers Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the C/C++ headers needed for development.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss-dev-common
PackageSectionlibdevel
PackageVersion0.73-4
SHA-12B1C61707DD0A3D8E61A101985705BFA2FE8B255
SHA-2566440B33AFCB9CD95649A8106E199A7D2A47DBD20244EC01ADB828211D20B3A7F
Key Value
FileSize274272
MD52312F52431B38724FCF0AAEDF5A920CA
PackageDescriptionsuite to compute graph automorphisms and labelings -- doc Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the API documentation.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamebliss-doc
PackageSectiondoc
PackageVersion0.73-2
SHA-17D38187F0B9E4D6CFF7E3FE29249B5579A06C8BC
SHA-256B0BE84D1F7E7720B5DF727514A56E75E23421C1539A647A02D8DE3D7405E2FDF
Key Value
FileSize16784
MD55E4048DD5B1102D09064A0606BCB58AE
PackageDescriptiondevelopment files to compute graph automorphisms and labelings -- headers Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the C/C++ headers needed for development.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss-dev-common
PackageSectionlibdevel
PackageVersion0.73-2
SHA-17BED5D29E40289A3C7F5771031C4F665BEA1EA58
SHA-2569FB906F20A1A329CC79D11B18DFDCC0D96728FD81459BC169B257AE1ED2D4828
Key Value
FileSize16744
MD510C323074FCBDC19EDDEB57E39FDBABC
PackageDescriptiondevelopment files to compute graph automorphisms and labelings -- headers Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the C/C++ headers needed for development.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibbliss-dev-common
PackageSectionlibdevel
PackageVersion0.73-2
SHA-1A56C86B1C68F31F90735D1545FC4B89F545778A7
SHA-256AB2078E69E885AEBFC7A02D970C1BBC7F3855EB7ACD91585AA6B873653AB0665
Key Value
FileSize17120
MD5120413F3C8FEF567B53AB38905696F73
PackageDescriptiondevelopment files to compute graph automorphisms and labelings -- headers Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the C/C++ headers needed for development.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss-dev-common
PackageSectionlibdevel
PackageVersion0.73-4build1
SHA-1B919273B2A596620A9F58752299A496B27C4E536
SHA-256ED6676A67906EAFBC176DD2CD3B6C54FEB608E00710EB57FB56E4B1D295B78BB
Key Value
FileSize277900
MD51D14D0B76A5DBAF6CA1BE81FDE594B2C
PackageDescriptionsuite to compute graph automorphisms and labelings -- doc Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the API documentation.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamebliss-doc
PackageSectiondoc
PackageVersion0.73-4build1
SHA-1B0EDFBF7DAB45968255CE9364A10E89A6170E559
SHA-256287EBAA62FDF92D5DCEDED0FF4C0C7082ADEF3D183155093FA4C84030AF13AFE
Key Value
FileSize260854
MD537DBAA16F50B17C3B43D8C4984D7225C
PackageDescriptionsuite to compute graph automorphisms and labelings -- doc Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the API documentation.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamebliss-doc
PackageSectiondoc
PackageVersion0.73-1
SHA-131F24A2F36D7506B23222C9E225E1D93B9EC08E3
SHA-25609ADEDC552CBF4F64C587BEFBB45A983B508BF2ADAB9FC9721F854D0CB8DDD73
Key Value
FileName11440
FileSize260546
MD5DFFE97A1EFB925FAA0CEEDE9E320959C
PackageDescriptionsuite to compute graph automorphisms and labelings -- doc Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the API documentation.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamebliss-doc
PackageSectiondoc
PackageVersion0.73-1
RDS:package_id182052
SHA-1811405319794AD94A02C0B8F789EBAB449F8D85E
SHA-2568283DABE9B26EEEE61FCD613EBA4EFD730D4671EEB10BE1D5C4BF7DEC65DD025
insert-timestamp1679408382.1909697
sourceRDS.db
Key Value
FileSize275068
MD515405A10E6F5134C75A7A6BBF77A6B52
PackageDescriptionsuite to compute graph automorphisms and labelings -- doc Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. . This package provides the API documentation.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamebliss-doc
PackageSectiondoc
PackageVersion0.73-4
SHA-1FB40E4CA4EF5BB1DF99071618E1D4CED69E29DEB
SHA-256EB98E59172D81C99200E018CB34D5B07AF2F981165E5AE6255C31FBC6A97D358