{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:U4DOX74VRDX33KDKBNDQJ2GVIB","short_pith_number":"pith:U4DOX74V","schema_version":"1.0","canonical_sha256":"a706ebff9588efbda86a0b4704e8d54068cb03861d690a62fc93a0cf36c07911","source":{"kind":"arxiv","id":"2112.09248","version":1},"attestation_state":"computed","paper":{"title":"Disconnected Matchings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Bruno P. Masquio, Guilherme C. M. Gomes, Jayme L. Szwarcfiter, Paulo E. D. Pinto, Vinicius F. dos Santos","submitted_at":"2021-12-16T23:14:08Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2112.09248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-12-16T23:14:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ca9de5cf467e8049430dc0160fe9c1b3996f4e41f4d3cfe1c0c59dd85fccdca4","abstract_canon_sha256":"7d3ff2e5eb0f9c777f57910e48f5dc03b2dfec43dbd6c949b837ec4fbc514f34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:44.160265Z","signature_b64":"q11Fufou2rwT7vrWYpkj1hpquSR6EfhRSMBm3RDSFVcSjyjC/XTGiDX4btOXN+Kkl1iyVXsAS7+Iks3lgJLtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a706ebff9588efbda86a0b4704e8d54068cb03861d690a62fc93a0cf36c07911","last_reissued_at":"2026-07-05T03:41:44.159885Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:44.159885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disconnected Matchings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Bruno P. Masquio, Guilherme C. M. Gomes, Jayme L. Szwarcfiter, Paulo E. D. Pinto, Vinicius F. dos Santos","submitted_at":"2021-12-16T23:14:08Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09248","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.09248/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.09248","created_at":"2026-07-05T03:41:44.159941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.09248v1","created_at":"2026-07-05T03:41:44.159941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09248","created_at":"2026-07-05T03:41:44.159941+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4DOX74VRDX3","created_at":"2026-07-05T03:41:44.159941+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4DOX74VRDX33KDK","created_at":"2026-07-05T03:41:44.159941+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4DOX74V","created_at":"2026-07-05T03:41:44.159941+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB","json":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB.json","graph_json":"https://pith.science/api/pith-number/U4DOX74VRDX33KDKBNDQJ2GVIB/graph.json","events_json":"https://pith.science/api/pith-number/U4DOX74VRDX33KDKBNDQJ2GVIB/events.json","paper":"https://pith.science/paper/U4DOX74V"},"agent_actions":{"view_html":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB","download_json":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB.json","view_paper":"https://pith.science/paper/U4DOX74V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.09248&json=true","fetch_graph":"https://pith.science/api/pith-number/U4DOX74VRDX33KDKBNDQJ2GVIB/graph.json","fetch_events":"https://pith.science/api/pith-number/U4DOX74VRDX33KDKBNDQJ2GVIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB/action/storage_attestation","attest_author":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB/action/author_attestation","sign_citation":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB/action/citation_signature","submit_replication":"https://pith.science/pith/U4DOX74VRDX33KDKBNDQJ2GVIB/action/replication_record"}},"created_at":"2026-07-05T03:41:44.159941+00:00","updated_at":"2026-07-05T03:41:44.159941+00:00"}