{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VPSAEVU74IRSOZADJT4SWU454Y","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":"4ac86c099c03714d320d9b423245c8018bed0a3db8e2a6aac81bcf26f2c06e6f","cross_cats_sorted":["cs.DM","math.CO","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-28T12:20:05Z","title_canon_sha256":"7ae816999409cd015f9ab2b3623982fd99a282c2b33c2630166111c6dda947b3"},"schema_version":"1.0","source":{"id":"2503.22368","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.22368","created_at":"2026-07-05T10:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"2503.22368v2","created_at":"2026-07-05T10:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22368","created_at":"2026-07-05T10:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"VPSAEVU74IRS","created_at":"2026-07-05T10:43:27Z"},{"alias_kind":"pith_short_16","alias_value":"VPSAEVU74IRSOZAD","created_at":"2026-07-05T10:43:27Z"},{"alias_kind":"pith_short_8","alias_value":"VPSAEVU7","created_at":"2026-07-05T10:43:27Z"}],"graph_snapshots":[{"event_id":"sha256:32704c466a83dcb4dfc959f18ad78c70446b03ec4e3a6d4c1a710e4974ad0fc9","target":"graph","created_at":"2026-07-05T10:43:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.22368/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an exact algorithm for computing all common subgraphs with the maximum number of vertices across multiple graphs. Our approach is further extended to handle the connected Maximum Common Subgraph (MCS), identifying the largest common subgraph in terms of either vertices or edges across multiple graphs, where edges or vertices may additionally be labeled to account for possible atom types or bond types, a classical labeling used in molecular graphs. Our approach leverages modular product graphs and a modified Bron-Kerbosch algorithm to enumerate maximal cliques, ensuring all intermedi","authors_text":"Akbar Davoodi, Daniel Merkle, Johannes B.S. Petersen, Marc Hellmuth, Thomas G\\\"artner","cross_cats":["cs.DM","math.CO","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-28T12:20:05Z","title":"On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22368","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:768075b7a449a270b56bc21ccdfd93794ebf08bb510bb7c86322e600885ab02d","target":"record","created_at":"2026-07-05T10:43:27Z","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":"4ac86c099c03714d320d9b423245c8018bed0a3db8e2a6aac81bcf26f2c06e6f","cross_cats_sorted":["cs.DM","math.CO","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-28T12:20:05Z","title_canon_sha256":"7ae816999409cd015f9ab2b3623982fd99a282c2b33c2630166111c6dda947b3"},"schema_version":"1.0","source":{"id":"2503.22368","kind":"arxiv","version":2}},"canonical_sha256":"abe402569fe2232764034cf92b539de6294c83a60f38a6413f61b760fe4b5ea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abe402569fe2232764034cf92b539de6294c83a60f38a6413f61b760fe4b5ea1","first_computed_at":"2026-07-05T10:43:27.058355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:27.058355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SOloSBW03nugjlnWAl814AYuEA82hVOQ8KzzkZt92yFYCMyCcT+/7J54rHiYMVB/aYSc7Vq9B5KEAjzDDu3VAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:27.058866Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.22368","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:768075b7a449a270b56bc21ccdfd93794ebf08bb510bb7c86322e600885ab02d","sha256:32704c466a83dcb4dfc959f18ad78c70446b03ec4e3a6d4c1a710e4974ad0fc9"],"state_sha256":"83eae75001bee5983ec089da691b253cf4cdda87b605b03eff20a4b67e1cf455"}