{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LK6WLWA4ZEWMKMXVSRKHSPPIFG","short_pith_number":"pith:LK6WLWA4","canonical_record":{"source":{"id":"1412.1261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"29d3eed573ecee7463de23bccd6c52c521e9352a4054182b36424cd0ad91de2e","abstract_canon_sha256":"e810875d2ad6ef86de7875ced248d528c371ee88345977cbb6c81afc482fb16d"},"schema_version":"1.0"},"canonical_sha256":"5abd65d81cc92cc532f59454793de8299f6256b135b79de23c7804ae46ead739","source":{"kind":"arxiv","id":"1412.1261","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1261","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1261v2","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1261","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"LK6WLWA4ZEWM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LK6WLWA4ZEWMKMXV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LK6WLWA4","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LK6WLWA4ZEWMKMXVSRKHSPPIFG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"29d3eed573ecee7463de23bccd6c52c521e9352a4054182b36424cd0ad91de2e","abstract_canon_sha256":"e810875d2ad6ef86de7875ced248d528c371ee88345977cbb6c81afc482fb16d"},"schema_version":"1.0"},"canonical_sha256":"5abd65d81cc92cc532f59454793de8299f6256b135b79de23c7804ae46ead739","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:12.615882Z","signature_b64":"GxA7DxxdUJIgAF8soC9lhR0+kxr/24L39L1wOvygGAM5zTm67PGSxdXSM7DHa3IEr8hn1qdNGY1G/4wMR+zNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5abd65d81cc92cc532f59454793de8299f6256b135b79de23c7804ae46ead739","last_reissued_at":"2026-05-18T00:50:12.615367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:12.615367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1261","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-18T00:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNHQCKuqQvHmpw6PZgvH7cRPcSFsUyy5E3RPbxQYKHoVcL8NwRg4nnDJEQn/k6IEV/F4ZDgm96gezVV5jJ09Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:38:36.195149Z"},"content_sha256":"348264b1312e34aaf9add771c26cc9bc55bd42decdef471657d255f675241822","schema_version":"1.0","event_id":"sha256:348264b1312e34aaf9add771c26cc9bc55bd42decdef471657d255f675241822"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LK6WLWA4ZEWMKMXVSRKHSPPIFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"\\'Edouard Bonnet, Faisal N. Abu-Khzam, Florian Sikora","submitted_at":"2014-12-03T10:28:35Z","abstract_excerpt":"In the Maximum Common Induced Subgraph problem (henceforth MCIS), given two graphs $G_1$ and $G_2$, one looks for a graph with the maximum number of vertices being both an induced subgraph of $G_1$ and $G_2$. MCIS is among the most studied classical NP-hard problems. It remains NP-hard on many graph classes including forests. In this paper, we study the parameterized complexity of MCIS. As a generalization of \\textsc{Clique}, it is W[1]-hard parameterized by the size of the solution. Being NP-hard even on forests, most structural parameterizations are intractable. One has to go as far as param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1261","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-18T00:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRtihWJF1UU28lx0ZcWFShJ+VYZCv1qDdOXguYjH59xph+XrBni9lFeoiqMLeYeE6LNYedTqD3GbXNAcKewwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:38:36.195576Z"},"content_sha256":"2a9ec97d8e07868f0411ad3b1b3aa6edd2f153a2e67b1347dc252cedea796925","schema_version":"1.0","event_id":"sha256:2a9ec97d8e07868f0411ad3b1b3aa6edd2f153a2e67b1347dc252cedea796925"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG/bundle.json","state_url":"https://pith.science/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG/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-05-31T01:38:36Z","links":{"resolver":"https://pith.science/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG","bundle":"https://pith.science/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG/bundle.json","state":"https://pith.science/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LK6WLWA4ZEWMKMXVSRKHSPPIFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LK6WLWA4ZEWMKMXVSRKHSPPIFG","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":"e810875d2ad6ef86de7875ced248d528c371ee88345977cbb6c81afc482fb16d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:28:35Z","title_canon_sha256":"29d3eed573ecee7463de23bccd6c52c521e9352a4054182b36424cd0ad91de2e"},"schema_version":"1.0","source":{"id":"1412.1261","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1261","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1261v2","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1261","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"LK6WLWA4ZEWM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LK6WLWA4ZEWMKMXV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LK6WLWA4","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:2a9ec97d8e07868f0411ad3b1b3aa6edd2f153a2e67b1347dc252cedea796925","target":"graph","created_at":"2026-05-18T00:50:12Z","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":"In the Maximum Common Induced Subgraph problem (henceforth MCIS), given two graphs $G_1$ and $G_2$, one looks for a graph with the maximum number of vertices being both an induced subgraph of $G_1$ and $G_2$. MCIS is among the most studied classical NP-hard problems. It remains NP-hard on many graph classes including forests. In this paper, we study the parameterized complexity of MCIS. As a generalization of \\textsc{Clique}, it is W[1]-hard parameterized by the size of the solution. Being NP-hard even on forests, most structural parameterizations are intractable. One has to go as far as param","authors_text":"\\'Edouard Bonnet, Faisal N. Abu-Khzam, Florian Sikora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:28:35Z","title":"On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1261","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:348264b1312e34aaf9add771c26cc9bc55bd42decdef471657d255f675241822","target":"record","created_at":"2026-05-18T00:50:12Z","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":"e810875d2ad6ef86de7875ced248d528c371ee88345977cbb6c81afc482fb16d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:28:35Z","title_canon_sha256":"29d3eed573ecee7463de23bccd6c52c521e9352a4054182b36424cd0ad91de2e"},"schema_version":"1.0","source":{"id":"1412.1261","kind":"arxiv","version":2}},"canonical_sha256":"5abd65d81cc92cc532f59454793de8299f6256b135b79de23c7804ae46ead739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5abd65d81cc92cc532f59454793de8299f6256b135b79de23c7804ae46ead739","first_computed_at":"2026-05-18T00:50:12.615367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:12.615367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GxA7DxxdUJIgAF8soC9lhR0+kxr/24L39L1wOvygGAM5zTm67PGSxdXSM7DHa3IEr8hn1qdNGY1G/4wMR+zNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:12.615882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1261","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:348264b1312e34aaf9add771c26cc9bc55bd42decdef471657d255f675241822","sha256:2a9ec97d8e07868f0411ad3b1b3aa6edd2f153a2e67b1347dc252cedea796925"],"state_sha256":"fe989393c134c6f1290f30dc70f41515a1cef69b7576c55fb34a1b6a157ba3b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGpKgLZK+3nhySm9DAmMiUv1FRHRaHQh4EnAGuO3cKFkEn0jDCaADE/BlI8Cd+046XwY8zvEZkLbcL6nh8yGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:38:36.199279Z","bundle_sha256":"de55042d5afa5f946a544aea58d6be8d06db465befaba4566f646b5a0c5bb9b7"}}