{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:377WDXIIMZKGSCNVTPXXIMH7Y7","short_pith_number":"pith:377WDXII","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"},"canonical_sha256":"dfff61dd0866546909b59bef7430ffc7da5afda7f697b2e5c5eef93cd54783f6","source":{"kind":"arxiv","id":"2207.00090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00090","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00090v1","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00090","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"377WDXIIMZKG","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"pith_short_16","alias_value":"377WDXIIMZKGSCNV","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"pith_short_8","alias_value":"377WDXII","created_at":"2026-07-05T04:36:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:377WDXIIMZKGSCNVTPXXIMH7Y7","target":"record","payload":{"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"},"canonical_sha256":"dfff61dd0866546909b59bef7430ffc7da5afda7f697b2e5c5eef93cd54783f6","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"},"source_kind":"arxiv","source_id":"2207.00090","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+zYD8t36okj+PDlMYBrEhH+H0cuMzh2cxZWV5ABJvN2FBJuH3HfJ7Dcy9a4+8lOgKo+4ma2IoReg2iOyf9dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:11:38.897020Z"},"content_sha256":"72f25cf81f3b8a1d5138013f9db8ce3edfc0cb2da0122bef9927393485b08bbd","schema_version":"1.0","event_id":"sha256:72f25cf81f3b8a1d5138013f9db8ce3edfc0cb2da0122bef9927393485b08bbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:377WDXIIMZKGSCNVTPXXIMH7Y7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEffoMI/p1YOyBOoaG00Y8pMJMb6l6W026A/VNzF+siG7ak4QwCx9UuBytOMImxzoa/ZS7K7m4OciZBXNlWrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:11:38.897712Z"},"content_sha256":"085c6af08a6b02947e23822bf788a267ff93fee629dba7259c18eb87915d978e","schema_version":"1.0","event_id":"sha256:085c6af08a6b02947e23822bf788a267ff93fee629dba7259c18eb87915d978e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/bundle.json","state_url":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T19:11:38Z","links":{"resolver":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7","bundle":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/bundle.json","state":"https://pith.science/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/377WDXIIMZKGSCNVTPXXIMH7Y7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:377WDXIIMZKGSCNVTPXXIMH7Y7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e18895aefb0910a30183b7c5b6ff2662820804efeb3dae5cad4c1b8b615ab77e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-30T20:19:49Z","title_canon_sha256":"9237403bd042a06c6fe30a62638d0fffac96db516c1fa955589426fddb279931"},"schema_version":"1.0","source":{"id":"2207.00090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00090","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00090v1","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00090","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"377WDXIIMZKG","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"pith_short_16","alias_value":"377WDXIIMZKGSCNV","created_at":"2026-07-05T04:36:39Z"},{"alias_kind":"pith_short_8","alias_value":"377WDXII","created_at":"2026-07-05T04:36:39Z"}],"graph_snapshots":[{"event_id":"sha256:085c6af08a6b02947e23822bf788a267ff93fee629dba7259c18eb87915d978e","target":"graph","created_at":"2026-07-05T04:36:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.00090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Martin Grohe, Timo Gervens","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-30T20:19:49Z","title":"Graph Similarity Based on Matrix Norms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00090","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:72f25cf81f3b8a1d5138013f9db8ce3edfc0cb2da0122bef9927393485b08bbd","target":"record","created_at":"2026-07-05T04:36:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e18895aefb0910a30183b7c5b6ff2662820804efeb3dae5cad4c1b8b615ab77e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-30T20:19:49Z","title_canon_sha256":"9237403bd042a06c6fe30a62638d0fffac96db516c1fa955589426fddb279931"},"schema_version":"1.0","source":{"id":"2207.00090","kind":"arxiv","version":1}},"canonical_sha256":"dfff61dd0866546909b59bef7430ffc7da5afda7f697b2e5c5eef93cd54783f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfff61dd0866546909b59bef7430ffc7da5afda7f697b2e5c5eef93cd54783f6","first_computed_at":"2026-07-05T04:36:39.042164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:36:39.042164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jcfYQq6BfTZdeB33/NNw4yPEkuwxH9Kn/uDyQv8ZiPLwsj43FboA/BzoiwodGOrnqZu2hUJFWkEcuVYXZBo+BA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:36:39.042658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.00090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72f25cf81f3b8a1d5138013f9db8ce3edfc0cb2da0122bef9927393485b08bbd","sha256:085c6af08a6b02947e23822bf788a267ff93fee629dba7259c18eb87915d978e"],"state_sha256":"6bed05b6a3d4c99437f75e7874c1edb62ce6e5dc1fe3f3e631866450d579a8d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtKAQa+vAqFXwbT37ZpiICEGBNL1lDPjUppxL0lBmrfRoLJBZZjTJ906eORavoK1ciA+LeML3PVdMQeGCgGsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T19:11:38.903304Z","bundle_sha256":"1544a7969d1809182c7567930f20f661f65cc2bc673b6c94da85dc7009f97eb1"}}