{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UJIKKJLWWLR6TLQX3RW3RAUZ7B","short_pith_number":"pith:UJIKKJLW","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"},"canonical_sha256":"a250a52576b2e3e9ae17dc6db88299f86e6a4a49fa62f6145df2112a905d278e","source":{"kind":"arxiv","id":"2111.12011","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12011","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12011v3","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12011","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"UJIKKJLWWLR6","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"pith_short_16","alias_value":"UJIKKJLWWLR6TLQX","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"pith_short_8","alias_value":"UJIKKJLW","created_at":"2026-07-05T04:23:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UJIKKJLWWLR6TLQX3RW3RAUZ7B","target":"record","payload":{"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"},"canonical_sha256":"a250a52576b2e3e9ae17dc6db88299f86e6a4a49fa62f6145df2112a905d278e","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"},"source_kind":"arxiv","source_id":"2111.12011","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yeH6J78OcZ13Fvd6Y6+N2Anlee1mmSdmdg0gC3YdqCo1gQIdUh3egB1FNTFVas1f62TK9uNZZTnLJ4wxqUePBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:49:31.898700Z"},"content_sha256":"a48df07c6037098a1d8d66b6e8a49def01c5268e58ccedd230d90b76fb3956db","schema_version":"1.0","event_id":"sha256:a48df07c6037098a1d8d66b6e8a49def01c5268e58ccedd230d90b76fb3956db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UJIKKJLWWLR6TLQX3RW3RAUZ7B","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/K/3MfJQ6AkwrlhKfdRkLa3TY+7+LkPTnwJHwIx6VX3ncU3YQQf0uAeD8jmL5KqCnyPWJLerAvTIY9tIOSFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:49:31.899583Z"},"content_sha256":"20640788dc4ffb3351fdccc1a1b9d9ce58cc9449bd1da6399b24a9a35ac67287","schema_version":"1.0","event_id":"sha256:20640788dc4ffb3351fdccc1a1b9d9ce58cc9449bd1da6399b24a9a35ac67287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/bundle.json","state_url":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T22:49:31Z","links":{"resolver":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B","bundle":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/bundle.json","state":"https://pith.science/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJIKKJLWWLR6TLQX3RW3RAUZ7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UJIKKJLWWLR6TLQX3RW3RAUZ7B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c0704033322fe2eedc0554abdb7865e3022fafe233765442030feaca4db0f687","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-23T17:21:26Z","title_canon_sha256":"6f3419f0e2fd742ab93d3b283f7079fcfc3ef37a0610ea61ebba39084c74938c"},"schema_version":"1.0","source":{"id":"2111.12011","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12011","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12011v3","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12011","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"UJIKKJLWWLR6","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"pith_short_16","alias_value":"UJIKKJLWWLR6TLQX","created_at":"2026-07-05T04:23:22Z"},{"alias_kind":"pith_short_8","alias_value":"UJIKKJLW","created_at":"2026-07-05T04:23:22Z"}],"graph_snapshots":[{"event_id":"sha256:20640788dc4ffb3351fdccc1a1b9d9ce58cc9449bd1da6399b24a9a35ac67287","target":"graph","created_at":"2026-07-05T04:23:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.12011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Carl Feghali","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-23T17:21:26Z","title":"A note on Matching-Cut in $P_t$-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12011","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a48df07c6037098a1d8d66b6e8a49def01c5268e58ccedd230d90b76fb3956db","target":"record","created_at":"2026-07-05T04:23:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c0704033322fe2eedc0554abdb7865e3022fafe233765442030feaca4db0f687","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-23T17:21:26Z","title_canon_sha256":"6f3419f0e2fd742ab93d3b283f7079fcfc3ef37a0610ea61ebba39084c74938c"},"schema_version":"1.0","source":{"id":"2111.12011","kind":"arxiv","version":3}},"canonical_sha256":"a250a52576b2e3e9ae17dc6db88299f86e6a4a49fa62f6145df2112a905d278e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a250a52576b2e3e9ae17dc6db88299f86e6a4a49fa62f6145df2112a905d278e","first_computed_at":"2026-07-05T04:23:22.508905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:23:22.508905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WBg8hob86KgJVTIlWPH+lyXVwir9MAmoX5VymqyTzcY7QMOToCORkna6qrHP7ymwgUZcEwZ5B39sUP2h31M5Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:23:22.509252Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.12011","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a48df07c6037098a1d8d66b6e8a49def01c5268e58ccedd230d90b76fb3956db","sha256:20640788dc4ffb3351fdccc1a1b9d9ce58cc9449bd1da6399b24a9a35ac67287"],"state_sha256":"63035089d406b2dae3f78e46e6474f2c1e24be31ee1f0bd752f7dc5be440999f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEVFVGLG2oaBNEHlWJGusW3PJNcgvq+tZagO8aO2zpUFE7zVsRAHjYdo0iTUqEQi+pDGeaWx/lOxWzEY86EXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:49:31.909938Z","bundle_sha256":"8266d80e5234240230f7967e2bc8822f3541a5d9ce33c3013e033c05ce0165fb"}}