{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O2VEF65JQQ5MX53R6ESXGWSTZU","short_pith_number":"pith:O2VEF65J","canonical_record":{"source":{"id":"1512.07494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T14:33:47Z","cross_cats_sorted":[],"title_canon_sha256":"5ae2bf6789ec9a9f7cc0305cd87cce72eb9a59c5ed4f0a3b70f565c4c5eecb8f","abstract_canon_sha256":"6b9134fd5628f1c6c66af333be0c2e4333023468764c598a5f49e2b87b771ce6"},"schema_version":"1.0"},"canonical_sha256":"76aa42fba9843acbf771f125735a53cd3530d00036f5365e959f7105efe1eaa2","source":{"kind":"arxiv","id":"1512.07494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07494","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07494v1","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07494","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"O2VEF65JQQ5M","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2VEF65JQQ5MX53R","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2VEF65J","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O2VEF65JQQ5MX53R6ESXGWSTZU","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T14:33:47Z","cross_cats_sorted":[],"title_canon_sha256":"5ae2bf6789ec9a9f7cc0305cd87cce72eb9a59c5ed4f0a3b70f565c4c5eecb8f","abstract_canon_sha256":"6b9134fd5628f1c6c66af333be0c2e4333023468764c598a5f49e2b87b771ce6"},"schema_version":"1.0"},"canonical_sha256":"76aa42fba9843acbf771f125735a53cd3530d00036f5365e959f7105efe1eaa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.547169Z","signature_b64":"ejG5SGboSCo+RZUgAQlFCFepdTtS8pqEL0RlKChc2J1SjTSLOjd/MNbSKDdd1FyKdBig0Cpcl3Kpe2mmBxDfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76aa42fba9843acbf771f125735a53cd3530d00036f5365e959f7105efe1eaa2","last_reissued_at":"2026-05-18T01:23:49.546578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.546578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07494","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-05-18T01:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwX4iUZmhcEvJy0abzqni3YCfmKL2rcfx7VJZ+pSw52g4PFMaelxtlFLOlVe1ovqGzMWT4ajGfX9p94qD9pvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:11:26.682989Z"},"content_sha256":"69305f4285be223035e161af3a0753ddc42c3b28e315d3ea3142b04f3c10084c","schema_version":"1.0","event_id":"sha256:69305f4285be223035e161af3a0753ddc42c3b28e315d3ea3142b04f3c10084c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O2VEF65JQQ5MX53R6ESXGWSTZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quadratic Assignment Formulation of the Graph Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benoit Ga\\\"uz\\`ere (LITIS), Luc Brun, Mario Vento, Pasquale Foggia, S\\'ebastien Bougleux, Vincenzo Carletti","submitted_at":"2015-12-23T14:33:47Z","abstract_excerpt":"Computing efficiently a robust measure of similarity or dissimilarity between graphs is a major challenge in Pattern Recognition. The Graph Edit Distance (GED) is a flexible measure of dissimilarity between graphs which arises in error-tolerant graph matching. It is defined from an optimal sequence of edit operations (edit path) transforming one graph into an other. Unfortunately, the exact computation of this measure is NP-hard. In the last decade, several approaches have been proposed to approximate the GED in polynomial time, mainly by solving linear programming problems. Among them, the bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07494","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":""},"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-05-18T01:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2c2tsXZiQ/fQwdTXzOp9ytUwLSZllcm5lCnt4+MQRnJEUlhhLOodzmbVqelFdqSUkEeX7nOhDs4LijvmO4mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:11:26.683649Z"},"content_sha256":"82840fbbd4c14b9d5c67f3f7007b73697cca2021cb3812ce21fd606ecc1d86bb","schema_version":"1.0","event_id":"sha256:82840fbbd4c14b9d5c67f3f7007b73697cca2021cb3812ce21fd606ecc1d86bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/bundle.json","state_url":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/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-06-10T05:11:26Z","links":{"resolver":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU","bundle":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/bundle.json","state":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O2VEF65JQQ5MX53R6ESXGWSTZU","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":"6b9134fd5628f1c6c66af333be0c2e4333023468764c598a5f49e2b87b771ce6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T14:33:47Z","title_canon_sha256":"5ae2bf6789ec9a9f7cc0305cd87cce72eb9a59c5ed4f0a3b70f565c4c5eecb8f"},"schema_version":"1.0","source":{"id":"1512.07494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07494","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07494v1","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07494","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"O2VEF65JQQ5M","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2VEF65JQQ5MX53R","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2VEF65J","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:82840fbbd4c14b9d5c67f3f7007b73697cca2021cb3812ce21fd606ecc1d86bb","target":"graph","created_at":"2026-05-18T01:23:49Z","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"},"paper":{"abstract_excerpt":"Computing efficiently a robust measure of similarity or dissimilarity between graphs is a major challenge in Pattern Recognition. The Graph Edit Distance (GED) is a flexible measure of dissimilarity between graphs which arises in error-tolerant graph matching. It is defined from an optimal sequence of edit operations (edit path) transforming one graph into an other. Unfortunately, the exact computation of this measure is NP-hard. In the last decade, several approaches have been proposed to approximate the GED in polynomial time, mainly by solving linear programming problems. Among them, the bi","authors_text":"Benoit Ga\\\"uz\\`ere (LITIS), Luc Brun, Mario Vento, Pasquale Foggia, S\\'ebastien Bougleux, Vincenzo Carletti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T14:33:47Z","title":"A Quadratic Assignment Formulation of the Graph Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07494","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:69305f4285be223035e161af3a0753ddc42c3b28e315d3ea3142b04f3c10084c","target":"record","created_at":"2026-05-18T01:23:49Z","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":"6b9134fd5628f1c6c66af333be0c2e4333023468764c598a5f49e2b87b771ce6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T14:33:47Z","title_canon_sha256":"5ae2bf6789ec9a9f7cc0305cd87cce72eb9a59c5ed4f0a3b70f565c4c5eecb8f"},"schema_version":"1.0","source":{"id":"1512.07494","kind":"arxiv","version":1}},"canonical_sha256":"76aa42fba9843acbf771f125735a53cd3530d00036f5365e959f7105efe1eaa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76aa42fba9843acbf771f125735a53cd3530d00036f5365e959f7105efe1eaa2","first_computed_at":"2026-05-18T01:23:49.546578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:49.546578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ejG5SGboSCo+RZUgAQlFCFepdTtS8pqEL0RlKChc2J1SjTSLOjd/MNbSKDdd1FyKdBig0Cpcl3Kpe2mmBxDfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:49.547169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69305f4285be223035e161af3a0753ddc42c3b28e315d3ea3142b04f3c10084c","sha256:82840fbbd4c14b9d5c67f3f7007b73697cca2021cb3812ce21fd606ecc1d86bb"],"state_sha256":"cc37113153cc9cdd1cebdd65b15be087fbb2e7bc482159189a6c26a05135bd1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVHl8/eyqY8A7l6UoivsAc67CbBLLY8snGbBNwDcVyDg0idy6kGblmn5eHdC/vEudt0zFLsidgHMb29QJe4KDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:11:26.687921Z","bundle_sha256":"0d0c9d96929b031b669957b6ed5accaedc7c48c36ec91f3b89b07ea1fe05b7e6"}}