{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EWYFIPLFPBLTPPRJUD3UXVN5HO","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":"74665623e8b1c42886557ec246bb0ac0b9640cbaa65784e92cead2ad062b0067","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-29T19:09:32Z","title_canon_sha256":"e2bbf23ac7fad3831c64c48ac9ff6fcf9b1941a33304ff092251de0a0580afd1"},"schema_version":"1.0","source":{"id":"1206.7105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.7105","created_at":"2026-05-18T02:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1206.7105v2","created_at":"2026-05-18T02:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.7105","created_at":"2026-05-18T02:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"EWYFIPLFPBLT","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EWYFIPLFPBLTPPRJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EWYFIPLF","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:0a74b0b85f4a0ed21610a3488107dca39b32f3bc4ba1acbf7966709cf308bf64","target":"graph","created_at":"2026-05-18T02:59:45Z","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":"The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical Independent Set and Induced Matching problems, among several other problems. We show that Induced Graph Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph, and even admits a polynomial kernel when H is a complete graph. Both results rely on a new, strong, and generic algorithmic structure theorem for claw-free graphs.","authors_text":"Danny Hermelin, Erik Jan van Leeuwen, Matthias Mnich","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-29T19:09:32Z","title":"Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.7105","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:ffa9cc7ee7e1c18dbd456ff7e334c47436339f5f11d97e6a1abf5d6a1be1630c","target":"record","created_at":"2026-05-18T02:59:45Z","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":"74665623e8b1c42886557ec246bb0ac0b9640cbaa65784e92cead2ad062b0067","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-29T19:09:32Z","title_canon_sha256":"e2bbf23ac7fad3831c64c48ac9ff6fcf9b1941a33304ff092251de0a0580afd1"},"schema_version":"1.0","source":{"id":"1206.7105","kind":"arxiv","version":2}},"canonical_sha256":"25b0543d65785737be29a0f74bd5bd3bb694ac77dda2b84ecf71b633d68937ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25b0543d65785737be29a0f74bd5bd3bb694ac77dda2b84ecf71b633d68937ba","first_computed_at":"2026-05-18T02:59:45.160561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:45.160561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wYZ8PqqL9rvlfK5MbFAWdCupHDcgOWSztTBV5sAUYLaW50PTX2fsCz3NMml8jFUtSqKLsZeRyY/2jITGUbJUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:45.161416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.7105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffa9cc7ee7e1c18dbd456ff7e334c47436339f5f11d97e6a1abf5d6a1be1630c","sha256:0a74b0b85f4a0ed21610a3488107dca39b32f3bc4ba1acbf7966709cf308bf64"],"state_sha256":"0c202cd7cb59d2ddf57ae191b058fb4e7ced9020c8fd7f13121452efce336f73"}