{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2SAC25NKTZE35XTTCRXDWXBZNO","short_pith_number":"pith:2SAC25NK","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"},"canonical_sha256":"d4802d75aa9e49bede73146e3b5c396babc751252d950c3ce2e0925152837b05","source":{"kind":"arxiv","id":"1805.10754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10754","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10754v2","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10754","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"2SAC25NKTZE3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SAC25NKTZE35XTT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SAC25NK","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2SAC25NKTZE35XTTCRXDWXBZNO","target":"record","payload":{"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"},"canonical_sha256":"d4802d75aa9e49bede73146e3b5c396babc751252d950c3ce2e0925152837b05","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"},"source_kind":"arxiv","source_id":"1805.10754","source_version":2,"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-17T23:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pvha5JtTfuSyYEyW4edmKpau+i6DmEWy7GnmF2Kj4Lhrs7k3ERRdiaMrrWd3PeBcQ7IMDAUvUqQWqXQXhufUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:09:54.111400Z"},"content_sha256":"0b03500b8ae199d0393d4700ccc946ce16edcf927eaccf0db6b7aebd1e85cc7e","schema_version":"1.0","event_id":"sha256:0b03500b8ae199d0393d4700ccc946ce16edcf927eaccf0db6b7aebd1e85cc7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2SAC25NKTZE35XTTCRXDWXBZNO","target":"graph","payload":{"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"},"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-17T23:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TafS43kSCqB/7hx1ch7kg7XDMN3pdByrHvRvfjDiYQhHdNCYGQ6b1M+7619VGtzW7CymZxQAoNJgvS+PtSQ0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:09:54.112279Z"},"content_sha256":"1f2a082f09f98b933eb944f60e0578f12c8f787931224ad53807f12a1d93c28e","schema_version":"1.0","event_id":"sha256:1f2a082f09f98b933eb944f60e0578f12c8f787931224ad53807f12a1d93c28e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/bundle.json","state_url":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SAC25NKTZE35XTTCRXDWXBZNO/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-06T08:09:54Z","links":{"resolver":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO","bundle":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/bundle.json","state":"https://pith.science/pith/2SAC25NKTZE35XTTCRXDWXBZNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SAC25NKTZE35XTTCRXDWXBZNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2SAC25NKTZE35XTTCRXDWXBZNO","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":"d29c2ddc61a25ca36077d37c78ec490b4f092e06e018513b2cd63e2fad9e6a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T03:40:20Z","title_canon_sha256":"8df41f32f374d5d0cfe023fefcc580eee025ddeda5b14e1a8b7248ef7b4922d6"},"schema_version":"1.0","source":{"id":"1805.10754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10754","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10754v2","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10754","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"2SAC25NKTZE3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SAC25NKTZE35XTT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SAC25NK","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:1f2a082f09f98b933eb944f60e0578f12c8f787931224ad53807f12a1d93c28e","target":"graph","created_at":"2026-05-17T23:58:56Z","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":"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","authors_text":"Andre Droschinsky, Nils M. Kriege, Petra Mutzel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T03:40:20Z","title":"A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10754","kind":"arxiv","version":2},"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:0b03500b8ae199d0393d4700ccc946ce16edcf927eaccf0db6b7aebd1e85cc7e","target":"record","created_at":"2026-05-17T23:58:56Z","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":"d29c2ddc61a25ca36077d37c78ec490b4f092e06e018513b2cd63e2fad9e6a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-28T03:40:20Z","title_canon_sha256":"8df41f32f374d5d0cfe023fefcc580eee025ddeda5b14e1a8b7248ef7b4922d6"},"schema_version":"1.0","source":{"id":"1805.10754","kind":"arxiv","version":2}},"canonical_sha256":"d4802d75aa9e49bede73146e3b5c396babc751252d950c3ce2e0925152837b05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4802d75aa9e49bede73146e3b5c396babc751252d950c3ce2e0925152837b05","first_computed_at":"2026-05-17T23:58:56.036307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:56.036307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCGPTPIiRPGgKm9xudqvnIafK2o4G1UjvbOpz+o7i2DHeXtaWpQ6IGr5B8yzfxrTxeVx/qrg930jAfX2e0GFBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:56.036866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b03500b8ae199d0393d4700ccc946ce16edcf927eaccf0db6b7aebd1e85cc7e","sha256:1f2a082f09f98b933eb944f60e0578f12c8f787931224ad53807f12a1d93c28e"],"state_sha256":"66200083fa814b5f0057fb48b124aa55fbc32fe4334c89ce36a2b7d30b633c8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgc+62Pm/BtvtYxUkPzSKfMAFg3uGaGK20QNULuuFK2X5JBHlNpzJWih4k2bvOJXxnUg8hMn+VK+v0cVpMnuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:09:54.115708Z","bundle_sha256":"9923a9f6b29aa8a75be801e15d2e5bdeb21ee45c8e32aefda105015c793ab30f"}}