{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:377WDXIIMZKGSCNVTPXXIMH7Y7","short_pith_number":"pith:377WDXII","schema_version":"1.0","canonical_sha256":"dfff61dd0866546909b59bef7430ffc7da5afda7f697b2e5c5eef93cd54783f6","source":{"kind":"arxiv","id":"2207.00090","version":1},"attestation_state":"computed","paper":{"title":"Graph Similarity Based on Matrix Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Martin Grohe, Timo Gervens","submitted_at":"2022-06-30T20:19:49Z","abstract_excerpt":"Quantifying the similarity between two graphs is a fundamental algorithmic problem at the heart of many data analysis tasks for graph-based data. In this paper, we study the computational complexity of a family of similarity measures based on quantifying the mismatch between the two graphs, that is, the \"symmetric difference\" of the graphs under an optimal alignment of the vertices. An important example is similarity based on graph edit distance. While edit distance calculates the \"global\" mismatch, that is, the number of edges in the symmetric difference, our main focus is on \"local\" measures"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2207.00090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-30T20:19:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9237403bd042a06c6fe30a62638d0fffac96db516c1fa955589426fddb279931","abstract_canon_sha256":"e18895aefb0910a30183b7c5b6ff2662820804efeb3dae5cad4c1b8b615ab77e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:39.042658Z","signature_b64":"jcfYQq6BfTZdeB33/NNw4yPEkuwxH9Kn/uDyQv8ZiPLwsj43FboA/BzoiwodGOrnqZu2hUJFWkEcuVYXZBo+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfff61dd0866546909b59bef7430ffc7da5afda7f697b2e5c5eef93cd54783f6","last_reissued_at":"2026-07-05T04:36:39.042164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:39.042164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Similarity Based on Matrix Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Martin Grohe, Timo Gervens","submitted_at":"2022-06-30T20:19:49Z","abstract_excerpt":"Quantifying the similarity between two graphs is a fundamental algorithmic problem at the heart of many data analysis tasks for graph-based data. In this paper, we study the computational complexity of a family of similarity measures based on quantifying the mismatch between the two graphs, that is, the \"symmetric difference\" of the graphs under an optimal alignment of the vertices. An important example is similarity based on graph edit distance. While edit distance calculates the \"global\" mismatch, that is, the number of edges in the symmetric difference, our main focus is on \"local\" measures"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00090","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.00090/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2207.00090","created_at":"2026-07-05T04:36:39.042233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.00090v1","created_at":"2026-07-05T04:36:39.042233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00090","created_at":"2026-07-05T04:36:39.042233+00:00"},{"alias_kind":"pith_short_12","alias_value":"377WDXIIMZKG","created_at":"2026-07-05T04:36:39.042233+00:00"},{"alias_kind":"pith_short_16","alias_value":"377WDXIIMZKGSCNV","created_at":"2026-07-05T04:36:39.042233+00:00"},{"alias_kind":"pith_short_8","alias_value":"377WDXII","created_at":"2026-07-05T04:36:39.042233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09999","citing_title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7","json":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7.json","graph_json":"https://pith.science/api/pith-number/377WDXIIMZKGSCNVTPXXIMH7Y7/graph.json","events_json":"https://pith.science/api/pith-number/377WDXIIMZKGSCNVTPXXIMH7Y7/events.json","paper":"https://pith.science/paper/377WDXII"},"agent_actions":{"view_html":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7","download_json":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7.json","view_paper":"https://pith.science/paper/377WDXII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.00090&json=true","fetch_graph":"https://pith.science/api/pith-number/377WDXIIMZKGSCNVTPXXIMH7Y7/graph.json","fetch_events":"https://pith.science/api/pith-number/377WDXIIMZKGSCNVTPXXIMH7Y7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/action/storage_attestation","attest_author":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/action/author_attestation","sign_citation":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/action/citation_signature","submit_replication":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/action/replication_record"}},"created_at":"2026-07-05T04:36:39.042233+00:00","updated_at":"2026-07-05T04:36:39.042233+00:00"}