{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UJIKKJLWWLR6TLQX3RW3RAUZ7B","short_pith_number":"pith:UJIKKJLW","schema_version":"1.0","canonical_sha256":"a250a52576b2e3e9ae17dc6db88299f86e6a4a49fa62f6145df2112a905d278e","source":{"kind":"arxiv","id":"2111.12011","version":3},"attestation_state":"computed","paper":{"title":"A note on Matching-Cut in $P_t$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Carl Feghali","submitted_at":"2021-11-23T17:21:26Z","abstract_excerpt":"A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of Matching-Cut for graphs without a fixed path as an induced subgraph. We show that Matching-Cut is in P for $P_5$-free graphs, but that there exists an integer $t > 0$ for which it is NP-complete for $P_{t}$-free graphs."},"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":"2111.12011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-23T17:21:26Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"6f3419f0e2fd742ab93d3b283f7079fcfc3ef37a0610ea61ebba39084c74938c","abstract_canon_sha256":"c0704033322fe2eedc0554abdb7865e3022fafe233765442030feaca4db0f687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:22.509252Z","signature_b64":"WBg8hob86KgJVTIlWPH+lyXVwir9MAmoX5VymqyTzcY7QMOToCORkna6qrHP7ymwgUZcEwZ5B39sUP2h31M5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a250a52576b2e3e9ae17dc6db88299f86e6a4a49fa62f6145df2112a905d278e","last_reissued_at":"2026-07-05T04:23:22.508905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:22.508905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Matching-Cut in $P_t$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Carl Feghali","submitted_at":"2021-11-23T17:21:26Z","abstract_excerpt":"A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of Matching-Cut for graphs without a fixed path as an induced subgraph. We show that Matching-Cut is in P for $P_5$-free graphs, but that there exists an integer $t > 0$ for which it is NP-complete for $P_{t}$-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12011","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.12011/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":"2111.12011","created_at":"2026-07-05T04:23:22.508965+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.12011v3","created_at":"2026-07-05T04:23:22.508965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12011","created_at":"2026-07-05T04:23:22.508965+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJIKKJLWWLR6","created_at":"2026-07-05T04:23:22.508965+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJIKKJLWWLR6TLQX","created_at":"2026-07-05T04:23:22.508965+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJIKKJLW","created_at":"2026-07-05T04:23:22.508965+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/UJIKKJLWWLR6TLQX3RW3RAUZ7B","json":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B.json","graph_json":"https://pith.science/api/pith-number/UJIKKJLWWLR6TLQX3RW3RAUZ7B/graph.json","events_json":"https://pith.science/api/pith-number/UJIKKJLWWLR6TLQX3RW3RAUZ7B/events.json","paper":"https://pith.science/paper/UJIKKJLW"},"agent_actions":{"view_html":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B","download_json":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B.json","view_paper":"https://pith.science/paper/UJIKKJLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.12011&json=true","fetch_graph":"https://pith.science/api/pith-number/UJIKKJLWWLR6TLQX3RW3RAUZ7B/graph.json","fetch_events":"https://pith.science/api/pith-number/UJIKKJLWWLR6TLQX3RW3RAUZ7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/action/storage_attestation","attest_author":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/action/author_attestation","sign_citation":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/action/citation_signature","submit_replication":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/action/replication_record"}},"created_at":"2026-07-05T04:23:22.508965+00:00","updated_at":"2026-07-05T04:23:22.508965+00:00"}