{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O2VEF65JQQ5MX53R6ESXGWSTZU","short_pith_number":"pith:O2VEF65J","schema_version":"1.0","canonical_sha256":"76aa42fba9843acbf771f125735a53cd3530d00036f5365e959f7105efe1eaa2","source":{"kind":"arxiv","id":"1512.07494","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.07494","created_at":"2026-05-18T01:23:49.546653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07494v1","created_at":"2026-05-18T01:23:49.546653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07494","created_at":"2026-05-18T01:23:49.546653+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2VEF65JQQ5M","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2VEF65JQQ5MX53R","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2VEF65J","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05929","citing_title":"ReLU Networks for Exact Generation of Similar Graphs","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU","json":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU.json","graph_json":"https://pith.science/api/pith-number/O2VEF65JQQ5MX53R6ESXGWSTZU/graph.json","events_json":"https://pith.science/api/pith-number/O2VEF65JQQ5MX53R6ESXGWSTZU/events.json","paper":"https://pith.science/paper/O2VEF65J"},"agent_actions":{"view_html":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU","download_json":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU.json","view_paper":"https://pith.science/paper/O2VEF65J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07494&json=true","fetch_graph":"https://pith.science/api/pith-number/O2VEF65JQQ5MX53R6ESXGWSTZU/graph.json","fetch_events":"https://pith.science/api/pith-number/O2VEF65JQQ5MX53R6ESXGWSTZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/action/storage_attestation","attest_author":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/action/author_attestation","sign_citation":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/action/citation_signature","submit_replication":"https://pith.science/pith/O2VEF65JQQ5MX53R6ESXGWSTZU/action/replication_record"}},"created_at":"2026-05-18T01:23:49.546653+00:00","updated_at":"2026-05-18T01:23:49.546653+00:00"}