You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Dec 11, 2023. It is now read-only.
ProvDAG equality checks are currently based on class identity and graph isomorphism.
Is this a reasonable way to define ProvDAG equality? It doesn't take into account the equality of some ProvDAG attributes, but leans on DiGraph isomorphism.
Questions
Are two isomorphic ProvDAGs unequal if one was created without checksum validation?
How about if one has a checksum diff because it's been tinkered with?
If in the future we have a method that produces non-identical results from two identical DiGraphs based on _parsed_artifact_uuids, are those ProvDAGs still equal?
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
From inline notes
ProvDAG equality checks are currently based on class identity and graph isomorphism.
Is this a reasonable way to define ProvDAG equality? It doesn't take into account the equality of some ProvDAG attributes, but leans on DiGraph isomorphism.
Questions
Are two isomorphic ProvDAGs unequal if one was created without checksum validation?
How about if one has a checksum diff because it's been tinkered with?
If in the future we have a method that produces non-identical results from two identical DiGraphs based on
_parsed_artifact_uuids
, are those ProvDAGs still equal?The text was updated successfully, but these errors were encountered: