{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L2L5FOKCI7SHJZYAXIDOYMLWI2","short_pith_number":"pith:L2L5FOKC","schema_version":"1.0","canonical_sha256":"5e97d2b94247e474e700ba06ec317646a80f012cf11c867d95c4a9bb2455068c","source":{"kind":"arxiv","id":"1505.05740","version":1},"attestation_state":"computed","paper":{"title":"Graph edit distance : a new binary linear programming formulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Julien Lerouge, Pierre H\\'eroux, Romain Raveaux, S\\'ebastien Adam, Zeina Abu-Aisheh","submitted_at":"2015-05-21T13:57:40Z","abstract_excerpt":"Graph edit distance (GED) is a powerful and flexible graph matching paradigm that can be used to address different tasks in structural pattern recognition, machine learning, and data mining. In this paper, some new binary linear programming formulations for computing the exact GED between two graphs are proposed. A major strength of the formulations lies in their genericity since the GED can be computed between directed or undirected fully attributed graphs (i.e. with attributes on both vertices and edges). Moreover, a relaxation of the domain constraints in the formulations provides efficient"},"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":"1505.05740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-21T13:57:40Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"c4e857f69c4ba031ef45be240e59b9a828ba6d828fc329d42eb582718c52ed89","abstract_canon_sha256":"67ee2a6f1be1f3aad0f055cac142a6bb08e295fe86a99b2458c7257026b70fbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:53.592723Z","signature_b64":"4MF6137N9JNCWn/TUff6AhlxfTeX+Udre7XjOHHv377u0Ovasf7LAceicHQvrgcZKQWHUmRtdcsGf4lVEEyECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e97d2b94247e474e700ba06ec317646a80f012cf11c867d95c4a9bb2455068c","last_reissued_at":"2026-05-18T02:03:53.592037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:53.592037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph edit distance : a new binary linear programming formulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Julien Lerouge, Pierre H\\'eroux, Romain Raveaux, S\\'ebastien Adam, Zeina Abu-Aisheh","submitted_at":"2015-05-21T13:57:40Z","abstract_excerpt":"Graph edit distance (GED) is a powerful and flexible graph matching paradigm that can be used to address different tasks in structural pattern recognition, machine learning, and data mining. In this paper, some new binary linear programming formulations for computing the exact GED between two graphs are proposed. A major strength of the formulations lies in their genericity since the GED can be computed between directed or undirected fully attributed graphs (i.e. with attributes on both vertices and edges). Moreover, a relaxation of the domain constraints in the formulations provides efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05740","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":"1505.05740","created_at":"2026-05-18T02:03:53.592129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05740v1","created_at":"2026-05-18T02:03:53.592129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05740","created_at":"2026-05-18T02:03:53.592129+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2L5FOKCI7SH","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2L5FOKCI7SHJZYA","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2L5FOKC","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2","json":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2.json","graph_json":"https://pith.science/api/pith-number/L2L5FOKCI7SHJZYAXIDOYMLWI2/graph.json","events_json":"https://pith.science/api/pith-number/L2L5FOKCI7SHJZYAXIDOYMLWI2/events.json","paper":"https://pith.science/paper/L2L5FOKC"},"agent_actions":{"view_html":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2","download_json":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2.json","view_paper":"https://pith.science/paper/L2L5FOKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05740&json=true","fetch_graph":"https://pith.science/api/pith-number/L2L5FOKCI7SHJZYAXIDOYMLWI2/graph.json","fetch_events":"https://pith.science/api/pith-number/L2L5FOKCI7SHJZYAXIDOYMLWI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2/action/storage_attestation","attest_author":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2/action/author_attestation","sign_citation":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2/action/citation_signature","submit_replication":"https://pith.science/pith/L2L5FOKCI7SHJZYAXIDOYMLWI2/action/replication_record"}},"created_at":"2026-05-18T02:03:53.592129+00:00","updated_at":"2026-05-18T02:03:53.592129+00:00"}