{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7RDYFS67XHD6BFTSQ2MXU2F6CE","short_pith_number":"pith:7RDYFS67","schema_version":"1.0","canonical_sha256":"fc4782cbdfb9c7e0967286997a68be112fb4ab8d01785a6fa2cf8bdf51e73711","source":{"kind":"arxiv","id":"1803.03663","version":1},"attestation_state":"computed","paper":{"title":"Disconnected Cuts in Claw-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Barnaby Martin, Daniel Paulusma, Erik Jan van Leeuwen","submitted_at":"2018-03-09T19:23:03Z","abstract_excerpt":"A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several homomorphism and contraction problems, and fits in an extensive line of research on vertex cuts with additional properties. It is known that Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms are known for several graph classes. However, the complexity of the problem on claw-free graphs remained an open question. Its connection to t"},"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":"1803.03663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-09T19:23:03Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"82552824c9feab80cac488a4dc6a458f41a784bc666923dbf284e126faff83aa","abstract_canon_sha256":"4238c3ed4d1122aa52cb2efca59a3c90bf80c5af365f20b7ccf7c757efd69379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.582164Z","signature_b64":"erEXwaCDAyj/vUxghY6zE88Ic6BQTLqiiYU4Mb6F4aP6xdkzBuh6HR2hqau2QaJn6JePGdQjaIfl/M6yAjtwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4782cbdfb9c7e0967286997a68be112fb4ab8d01785a6fa2cf8bdf51e73711","last_reissued_at":"2026-05-18T00:21:38.581451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.581451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disconnected Cuts in Claw-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Barnaby Martin, Daniel Paulusma, Erik Jan van Leeuwen","submitted_at":"2018-03-09T19:23:03Z","abstract_excerpt":"A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several homomorphism and contraction problems, and fits in an extensive line of research on vertex cuts with additional properties. It is known that Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms are known for several graph classes. However, the complexity of the problem on claw-free graphs remained an open question. Its connection to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03663","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":"1803.03663","created_at":"2026-05-18T00:21:38.581562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03663v1","created_at":"2026-05-18T00:21:38.581562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03663","created_at":"2026-05-18T00:21:38.581562+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RDYFS67XHD6","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RDYFS67XHD6BFTS","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RDYFS67","created_at":"2026-05-18T12:32:11.075285+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/7RDYFS67XHD6BFTSQ2MXU2F6CE","json":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE.json","graph_json":"https://pith.science/api/pith-number/7RDYFS67XHD6BFTSQ2MXU2F6CE/graph.json","events_json":"https://pith.science/api/pith-number/7RDYFS67XHD6BFTSQ2MXU2F6CE/events.json","paper":"https://pith.science/paper/7RDYFS67"},"agent_actions":{"view_html":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE","download_json":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE.json","view_paper":"https://pith.science/paper/7RDYFS67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03663&json=true","fetch_graph":"https://pith.science/api/pith-number/7RDYFS67XHD6BFTSQ2MXU2F6CE/graph.json","fetch_events":"https://pith.science/api/pith-number/7RDYFS67XHD6BFTSQ2MXU2F6CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE/action/storage_attestation","attest_author":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE/action/author_attestation","sign_citation":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE/action/citation_signature","submit_replication":"https://pith.science/pith/7RDYFS67XHD6BFTSQ2MXU2F6CE/action/replication_record"}},"created_at":"2026-05-18T00:21:38.581562+00:00","updated_at":"2026-05-18T00:21:38.581562+00:00"}