{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FCQZI3AHW4LUSVZX3C52MO7QU2","short_pith_number":"pith:FCQZI3AH","schema_version":"1.0","canonical_sha256":"28a1946c07b717495737d8bba63bf0a6880d79245262454f21e80d7337faaa1b","source":{"kind":"arxiv","id":"1104.4779","version":3},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Disconnected Cut and 2K2-Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Daniel Paulusma","submitted_at":"2011-04-25T19:49:40Z","abstract_excerpt":"For a connected graph G=(V,E), a subset U of V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This problem is polynomially equivalent to the following problems: testing if a graph has a 2K2-partition, testing if a graph allows a vertex-surjective homomorphism to the reflexive 4-cycle and testing if a graph has a spanning subgraph that consists of at most two bicliques. Hence, as an immediate consequence, these three decision problems are NP-com"},"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":"1104.4779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-25T19:49:40Z","cross_cats_sorted":[],"title_canon_sha256":"d3834eca93ccab9f32a81f8814a3409ec266ffdd5eded47c6e75e1d7154cb0ec","abstract_canon_sha256":"39f62dbf32a5613a29f048880b5e787c1d1dbe7b37b6a0f1cc81bebd284bb637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:09.398123Z","signature_b64":"wFFMAXfL1ZOsapK0tVgAufSPF/igcvsCxJatLxfrp/tZFLsCRQ1ovuC/DiyaOn3Rdl+rZiZgtiwW7/Bu7OqkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28a1946c07b717495737d8bba63bf0a6880d79245262454f21e80d7337faaa1b","last_reissued_at":"2026-05-18T02:39:09.397543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:09.397543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Disconnected Cut and 2K2-Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Daniel Paulusma","submitted_at":"2011-04-25T19:49:40Z","abstract_excerpt":"For a connected graph G=(V,E), a subset U of V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This problem is polynomially equivalent to the following problems: testing if a graph has a 2K2-partition, testing if a graph allows a vertex-surjective homomorphism to the reflexive 4-cycle and testing if a graph has a spanning subgraph that consists of at most two bicliques. Hence, as an immediate consequence, these three decision problems are NP-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4779","kind":"arxiv","version":3},"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":"1104.4779","created_at":"2026-05-18T02:39:09.397623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4779v3","created_at":"2026-05-18T02:39:09.397623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4779","created_at":"2026-05-18T02:39:09.397623+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCQZI3AHW4LU","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCQZI3AHW4LUSVZX","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCQZI3AH","created_at":"2026-05-18T12:26:28.662955+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/FCQZI3AHW4LUSVZX3C52MO7QU2","json":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2.json","graph_json":"https://pith.science/api/pith-number/FCQZI3AHW4LUSVZX3C52MO7QU2/graph.json","events_json":"https://pith.science/api/pith-number/FCQZI3AHW4LUSVZX3C52MO7QU2/events.json","paper":"https://pith.science/paper/FCQZI3AH"},"agent_actions":{"view_html":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2","download_json":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2.json","view_paper":"https://pith.science/paper/FCQZI3AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4779&json=true","fetch_graph":"https://pith.science/api/pith-number/FCQZI3AHW4LUSVZX3C52MO7QU2/graph.json","fetch_events":"https://pith.science/api/pith-number/FCQZI3AHW4LUSVZX3C52MO7QU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2/action/storage_attestation","attest_author":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2/action/author_attestation","sign_citation":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2/action/citation_signature","submit_replication":"https://pith.science/pith/FCQZI3AHW4LUSVZX3C52MO7QU2/action/replication_record"}},"created_at":"2026-05-18T02:39:09.397623+00:00","updated_at":"2026-05-18T02:39:09.397623+00:00"}