{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2SAC25NKTZE35XTTCRXDWXBZNO","short_pith_number":"pith:2SAC25NK","schema_version":"1.0","canonical_sha256":"d4802d75aa9e49bede73146e3b5c396babc751252d950c3ce2e0925152837b05","source":{"kind":"arxiv","id":"1805.10754","version":2},"attestation_state":"computed","paper":{"title":"A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andre Droschinsky, Nils M. Kriege, Petra Mutzel","submitted_at":"2018-05-28T03:40:20Z","abstract_excerpt":"Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs. We show that the article contains the following errors: (i) The running time of the presented approach is claimed to be $\\mathcal{O}(n^{2.5})$ for two graphs of order $n$. We show that the algorithm of the authors allows no better bound than $\\mathcal{O}(n^4)$ when using state-of-the-art general purpose methods to solve the matching instances arising as subproblems. This is even true for the spe"},"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":"1805.10754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T03:40:20Z","cross_cats_sorted":[],"title_canon_sha256":"8df41f32f374d5d0cfe023fefcc580eee025ddeda5b14e1a8b7248ef7b4922d6","abstract_canon_sha256":"d29c2ddc61a25ca36077d37c78ec490b4f092e06e018513b2cd63e2fad9e6a52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:56.036866Z","signature_b64":"VCGPTPIiRPGgKm9xudqvnIafK2o4G1UjvbOpz+o7i2DHeXtaWpQ6IGr5B8yzfxrTxeVx/qrg930jAfX2e0GFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4802d75aa9e49bede73146e3b5c396babc751252d950c3ce2e0925152837b05","last_reissued_at":"2026-05-17T23:58:56.036307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:56.036307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andre Droschinsky, Nils M. Kriege, Petra Mutzel","submitted_at":"2018-05-28T03:40:20Z","abstract_excerpt":"Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs. We show that the article contains the following errors: (i) The running time of the presented approach is claimed to be $\\mathcal{O}(n^{2.5})$ for two graphs of order $n$. We show that the algorithm of the authors allows no better bound than $\\mathcal{O}(n^4)$ when using state-of-the-art general purpose methods to solve the matching instances arising as subproblems. This is even true for the spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10754","kind":"arxiv","version":2},"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":"1805.10754","created_at":"2026-05-17T23:58:56.036397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10754v2","created_at":"2026-05-17T23:58:56.036397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10754","created_at":"2026-05-17T23:58:56.036397+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SAC25NKTZE3","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SAC25NKTZE35XTT","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SAC25NK","created_at":"2026-05-18T12:32:02.567920+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/2SAC25NKTZE35XTTCRXDWXBZNO","json":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO.json","graph_json":"https://pith.science/api/pith-number/2SAC25NKTZE35XTTCRXDWXBZNO/graph.json","events_json":"https://pith.science/api/pith-number/2SAC25NKTZE35XTTCRXDWXBZNO/events.json","paper":"https://pith.science/paper/2SAC25NK"},"agent_actions":{"view_html":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO","download_json":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO.json","view_paper":"https://pith.science/paper/2SAC25NK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10754&json=true","fetch_graph":"https://pith.science/api/pith-number/2SAC25NKTZE35XTTCRXDWXBZNO/graph.json","fetch_events":"https://pith.science/api/pith-number/2SAC25NKTZE35XTTCRXDWXBZNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/action/storage_attestation","attest_author":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/action/author_attestation","sign_citation":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/action/citation_signature","submit_replication":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/action/replication_record"}},"created_at":"2026-05-17T23:58:56.036397+00:00","updated_at":"2026-05-17T23:58:56.036397+00:00"}