{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:U4DOX74VRDX33KDKBNDQJ2GVIB","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":"7d3ff2e5eb0f9c777f57910e48f5dc03b2dfec43dbd6c949b837ec4fbc514f34","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-12-16T23:14:08Z","title_canon_sha256":"ca9de5cf467e8049430dc0160fe9c1b3996f4e41f4d3cfe1c0c59dd85fccdca4"},"schema_version":"1.0","source":{"id":"2112.09248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09248","created_at":"2026-07-05T03:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09248v1","created_at":"2026-07-05T03:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09248","created_at":"2026-07-05T03:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"U4DOX74VRDX3","created_at":"2026-07-05T03:41:44Z"},{"alias_kind":"pith_short_16","alias_value":"U4DOX74VRDX33KDK","created_at":"2026-07-05T03:41:44Z"},{"alias_kind":"pith_short_8","alias_value":"U4DOX74V","created_at":"2026-07-05T03:41:44Z"}],"graph_snapshots":[{"event_id":"sha256:79f338b4d8e0be07dbc2b5bd6d2cafe2c40d8b6efb5d3dde445c550743a8d990","target":"graph","created_at":"2026-07-05T03:41:44Z","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/2112.09248/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational complexity of determining the maximum cardinality of a matching whose vertex set induces a disconnected graph. In this paper we answer this question. In fact, we consider the generalized problem of finding $c$-disconnected matchings; such matchings are ones whose vertex sets induce subgraphs with at least $c$ connected components. We show that, for every fixed $c \\geq 2$, this problem is NP-complete even if we restrict the","authors_text":"Bruno P. Masquio, Guilherme C. M. Gomes, Jayme L. Szwarcfiter, Paulo E. D. Pinto, Vinicius F. dos Santos","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-12-16T23:14:08Z","title":"Disconnected Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09248","kind":"arxiv","version":1},"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:77bc3c158878dda7bd5d4ee95aeb5324ac4bba93975a41e32903d513c89a19f5","target":"record","created_at":"2026-07-05T03:41:44Z","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":"7d3ff2e5eb0f9c777f57910e48f5dc03b2dfec43dbd6c949b837ec4fbc514f34","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-12-16T23:14:08Z","title_canon_sha256":"ca9de5cf467e8049430dc0160fe9c1b3996f4e41f4d3cfe1c0c59dd85fccdca4"},"schema_version":"1.0","source":{"id":"2112.09248","kind":"arxiv","version":1}},"canonical_sha256":"a706ebff9588efbda86a0b4704e8d54068cb03861d690a62fc93a0cf36c07911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a706ebff9588efbda86a0b4704e8d54068cb03861d690a62fc93a0cf36c07911","first_computed_at":"2026-07-05T03:41:44.159885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:41:44.159885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q11Fufou2rwT7vrWYpkj1hpquSR6EfhRSMBm3RDSFVcSjyjC/XTGiDX4btOXN+Kkl1iyVXsAS7+Iks3lgJLtDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:41:44.160265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.09248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77bc3c158878dda7bd5d4ee95aeb5324ac4bba93975a41e32903d513c89a19f5","sha256:79f338b4d8e0be07dbc2b5bd6d2cafe2c40d8b6efb5d3dde445c550743a8d990"],"state_sha256":"b3e99be2f1432fba37db6249ae2c2a7c5cdb268a79a5e2e85e7cc9ae87340483"}