{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QUMRRCS7UZPXFV73AIKJAUUBH3","short_pith_number":"pith:QUMRRCS7","schema_version":"1.0","canonical_sha256":"8519188a5fa65f72d7fb02149052813ecb6fd9ed45de3b9801731b0760e8b40c","source":{"kind":"arxiv","id":"1506.00944","version":1},"attestation_state":"computed","paper":{"title":"Parameterized mixed cluster editing via modular decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"F\\'abio Protti, Jayme Luiz Szwarcfiter, Maise Dantas da Silva","submitted_at":"2015-06-02T16:22:46Z","abstract_excerpt":"In this paper we introduce a natural generalization of the well-known problems Cluster Editing and Bicluster Editing, whose parameterized versions have been intensively investigated in the recent literature. The generalized problem, called Mixed Cluster Editing or ${\\cal M}$-Cluster Editing, is formulated as follows. Let ${\\cal M}$ be a family of graphs. Given a graph $G$ and a nonnegative integer $k$, transform $G$, through a sequence of at most $k$ edge editions, into a target graph $G'$ with the following property: $G'$ is a vertex-disjoint union of graphs $G_1, G_2, \\ldots$ such that every"},"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":"1506.00944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-02T16:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"bf74483a0e82b64a7db8a79163209fe82150b3c5973d543d37ac79888c910fb9","abstract_canon_sha256":"d614f45a41ed73a8afc8f37bb18abaa8a04a8f6936018a0044b087c0c14d2101"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:34.023666Z","signature_b64":"r4bWwcJAQgjsK9FVupS0a5qsBn4CmWeGT8dZa3Gln24TLlYvuW6ghaaDt+HMJoQ8GdYjSguReOBGDBciQuGnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8519188a5fa65f72d7fb02149052813ecb6fd9ed45de3b9801731b0760e8b40c","last_reissued_at":"2026-05-18T01:59:34.023060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:34.023060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized mixed cluster editing via modular decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"F\\'abio Protti, Jayme Luiz Szwarcfiter, Maise Dantas da Silva","submitted_at":"2015-06-02T16:22:46Z","abstract_excerpt":"In this paper we introduce a natural generalization of the well-known problems Cluster Editing and Bicluster Editing, whose parameterized versions have been intensively investigated in the recent literature. The generalized problem, called Mixed Cluster Editing or ${\\cal M}$-Cluster Editing, is formulated as follows. Let ${\\cal M}$ be a family of graphs. Given a graph $G$ and a nonnegative integer $k$, transform $G$, through a sequence of at most $k$ edge editions, into a target graph $G'$ with the following property: $G'$ is a vertex-disjoint union of graphs $G_1, G_2, \\ldots$ such that every"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00944","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":""},"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":"1506.00944","created_at":"2026-05-18T01:59:34.023140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00944v1","created_at":"2026-05-18T01:59:34.023140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00944","created_at":"2026-05-18T01:59:34.023140+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUMRRCS7UZPX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUMRRCS7UZPXFV73","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUMRRCS7","created_at":"2026-05-18T12:29:39.896362+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/QUMRRCS7UZPXFV73AIKJAUUBH3","json":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3.json","graph_json":"https://pith.science/api/pith-number/QUMRRCS7UZPXFV73AIKJAUUBH3/graph.json","events_json":"https://pith.science/api/pith-number/QUMRRCS7UZPXFV73AIKJAUUBH3/events.json","paper":"https://pith.science/paper/QUMRRCS7"},"agent_actions":{"view_html":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3","download_json":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3.json","view_paper":"https://pith.science/paper/QUMRRCS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00944&json=true","fetch_graph":"https://pith.science/api/pith-number/QUMRRCS7UZPXFV73AIKJAUUBH3/graph.json","fetch_events":"https://pith.science/api/pith-number/QUMRRCS7UZPXFV73AIKJAUUBH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3/action/storage_attestation","attest_author":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3/action/author_attestation","sign_citation":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3/action/citation_signature","submit_replication":"https://pith.science/pith/QUMRRCS7UZPXFV73AIKJAUUBH3/action/replication_record"}},"created_at":"2026-05-18T01:59:34.023140+00:00","updated_at":"2026-05-18T01:59:34.023140+00:00"}