{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WUUXCE2MKPMAPQCRJ5ZP25UIUA","short_pith_number":"pith:WUUXCE2M","canonical_record":{"source":{"id":"2212.12317","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-23T13:18:52Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"c8ece74c652ee2da0a69ba4f94d9c1e4f854cfdcabd21a50d6d138de282e67a3","abstract_canon_sha256":"1604b5afc3b30ba00126782e3c9e2e719425c2fe8fd543ce3f0042cc98659393"},"schema_version":"1.0"},"canonical_sha256":"b52971134c53d807c0514f72fd7688a008a6ad1c32b207be5e24873ea0567007","source":{"kind":"arxiv","id":"2212.12317","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.12317","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2212.12317v5","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12317","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"WUUXCE2MKPMA","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"WUUXCE2MKPMAPQCR","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"WUUXCE2M","created_at":"2026-07-05T07:09:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WUUXCE2MKPMAPQCRJ5ZP25UIUA","target":"record","payload":{"canonical_record":{"source":{"id":"2212.12317","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-23T13:18:52Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"c8ece74c652ee2da0a69ba4f94d9c1e4f854cfdcabd21a50d6d138de282e67a3","abstract_canon_sha256":"1604b5afc3b30ba00126782e3c9e2e719425c2fe8fd543ce3f0042cc98659393"},"schema_version":"1.0"},"canonical_sha256":"b52971134c53d807c0514f72fd7688a008a6ad1c32b207be5e24873ea0567007","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:45.546853Z","signature_b64":"6jFEPhyugkY2+38rT9MwNxRBADECYGdmEohrmiBMZOomfCJWRNcBtsr3LL1b+CHBVbNuvzbMqy/C/Qtb7yDqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52971134c53d807c0514f72fd7688a008a6ad1c32b207be5e24873ea0567007","last_reissued_at":"2026-07-05T07:09:45.546345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:45.546345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.12317","source_version":5,"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-05T07:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSEpqCWQhKKGYEBOfYDqqI1Hf69i9fdjH9zARzPTdahZeNLFAoTu0JNwZgNX54gDIOO77j1vV29MJpQtQjHiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:08:24.974651Z"},"content_sha256":"a63439fda001d70e722d62bfa44d1ceca5efd742a7fa98a4c858db3d7714ab1e","schema_version":"1.0","event_id":"sha256:a63439fda001d70e722d62bfa44d1ceca5efd742a7fa98a4c858db3d7714ab1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WUUXCE2MKPMAPQCRJ5ZP25UIUA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching Cuts in Graphs of High Girth and H-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Bernard Ries, Carl Feghali, Daniel Paulusma, Felicia Lucke","submitted_at":"2022-12-23T13:18:52Z","abstract_excerpt":"The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut. The Disconnected Perfect Matching problem is to decide if a connected graph has a perfect matching that contains a matching cut. Both Matching Cut and Disconnected Perfect Matching are NP-complete for planar graphs of girth 5, whereas Perfect Matching Cut is known to be NP-complete even for subcubic bipartite graphs of arbitrarily large fixed girth. We prove that Matching Cut and Disconnected Perfect Matching are also NP-complete for bipartite graphs of arbitrarily large fixe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12317","kind":"arxiv","version":5},"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/2212.12317/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-05T07:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysOZs1tDnt8ZKvx8sfQpwX7We2VydrLpDPZ0aIuytRKkz2w6h3W6LOUxizjPdjD+ne0KA68wXqmmK+WQTNxTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:08:24.975194Z"},"content_sha256":"f7da5bca9d4b8dc3c055f7356010800844bcb3d1d9cbe03278876486d1cf4354","schema_version":"1.0","event_id":"sha256:f7da5bca9d4b8dc3c055f7356010800844bcb3d1d9cbe03278876486d1cf4354"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA/bundle.json","state_url":"https://pith.science/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA/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-11T01:08:24Z","links":{"resolver":"https://pith.science/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA","bundle":"https://pith.science/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA/bundle.json","state":"https://pith.science/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUUXCE2MKPMAPQCRJ5ZP25UIUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WUUXCE2MKPMAPQCRJ5ZP25UIUA","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":"1604b5afc3b30ba00126782e3c9e2e719425c2fe8fd543ce3f0042cc98659393","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-23T13:18:52Z","title_canon_sha256":"c8ece74c652ee2da0a69ba4f94d9c1e4f854cfdcabd21a50d6d138de282e67a3"},"schema_version":"1.0","source":{"id":"2212.12317","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.12317","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2212.12317v5","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12317","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"WUUXCE2MKPMA","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"WUUXCE2MKPMAPQCR","created_at":"2026-07-05T07:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"WUUXCE2M","created_at":"2026-07-05T07:09:45Z"}],"graph_snapshots":[{"event_id":"sha256:f7da5bca9d4b8dc3c055f7356010800844bcb3d1d9cbe03278876486d1cf4354","target":"graph","created_at":"2026-07-05T07:09:45Z","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/2212.12317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut. The Disconnected Perfect Matching problem is to decide if a connected graph has a perfect matching that contains a matching cut. Both Matching Cut and Disconnected Perfect Matching are NP-complete for planar graphs of girth 5, whereas Perfect Matching Cut is known to be NP-complete even for subcubic bipartite graphs of arbitrarily large fixed girth. We prove that Matching Cut and Disconnected Perfect Matching are also NP-complete for bipartite graphs of arbitrarily large fixe","authors_text":"Bernard Ries, Carl Feghali, Daniel Paulusma, Felicia Lucke","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-23T13:18:52Z","title":"Matching Cuts in Graphs of High Girth and H-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12317","kind":"arxiv","version":5},"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:a63439fda001d70e722d62bfa44d1ceca5efd742a7fa98a4c858db3d7714ab1e","target":"record","created_at":"2026-07-05T07:09:45Z","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":"1604b5afc3b30ba00126782e3c9e2e719425c2fe8fd543ce3f0042cc98659393","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-23T13:18:52Z","title_canon_sha256":"c8ece74c652ee2da0a69ba4f94d9c1e4f854cfdcabd21a50d6d138de282e67a3"},"schema_version":"1.0","source":{"id":"2212.12317","kind":"arxiv","version":5}},"canonical_sha256":"b52971134c53d807c0514f72fd7688a008a6ad1c32b207be5e24873ea0567007","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b52971134c53d807c0514f72fd7688a008a6ad1c32b207be5e24873ea0567007","first_computed_at":"2026-07-05T07:09:45.546345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:09:45.546345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6jFEPhyugkY2+38rT9MwNxRBADECYGdmEohrmiBMZOomfCJWRNcBtsr3LL1b+CHBVbNuvzbMqy/C/Qtb7yDqDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:09:45.546853Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.12317","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a63439fda001d70e722d62bfa44d1ceca5efd742a7fa98a4c858db3d7714ab1e","sha256:f7da5bca9d4b8dc3c055f7356010800844bcb3d1d9cbe03278876486d1cf4354"],"state_sha256":"e0029e03ee868e3826126ca0dc59f8ff55590143dca4f123f8ff0f377da7564e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tM+XB2qMs6WVnB7eY4EK3CKq9+SaiKNoTaY6RTYUfcDO+zQRxKHjnixb4vXc7n6vna9rn+lhpbo5ExSTDBfjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:08:24.979661Z","bundle_sha256":"d744c0dab430db46c688f69fa9204f2d30c7c923ede3b963c8d52fabcc320993"}}