{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T56OURSUPPM4ZEJ2FPXCUU6O7P","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":"2c9cb131057675d755790e10c3dc779def940c3a2cd733fe7f93122162ce986d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:58:42Z","title_canon_sha256":"38b3c75e465240cb5e76f7c8e88eadff52b498896b06ec65c76f0a9e1ebc961f"},"schema_version":"1.0","source":{"id":"2505.17993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17993","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17993v1","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17993","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"T56OURSUPPM4","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_16","alias_value":"T56OURSUPPM4ZEJ2","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_8","alias_value":"T56OURSU","created_at":"2026-07-05T11:08:34Z"}],"graph_snapshots":[{"event_id":"sha256:b1fb371664f0ee8bfe4608fde4e2e739153de9512a114ea9e355b15be3df8e2e","target":"graph","created_at":"2026-07-05T11:08:34Z","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/2505.17993/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Matching Cut problem is to decide if the vertex set of a connected graph can be partitioned into two non-empty sets $B$ and $R$ such that the edges between $B$ and $R$ form a matching, that is, every vertex in $B$ has at most one neighbour in $R$, and vice versa. If for some integer $d\\geq 1$, we allow every neighbour in $B$ to have at most $d$ neighbours in $R$, and vice versa, we obtain the more general problem $d$-Cut. It is known that $d$-Cut is NP-complete for every $d\\geq 1$. However, for claw-free graphs, it is only known that $d$-Cut is polynomial-time solvable for $d=1$ and NP-com","authors_text":"Dani\\\"el Paulusma, Felicia Lucke, Jungho Ahn, Siani Smith, Tala Eagling-Vose","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17993","kind":"arxiv","version":1},"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:742e8acb2348387c7382f529602e6990488b7d8c732f448d82a56be0a0523590","target":"record","created_at":"2026-07-05T11:08:34Z","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":"2c9cb131057675d755790e10c3dc779def940c3a2cd733fe7f93122162ce986d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:58:42Z","title_canon_sha256":"38b3c75e465240cb5e76f7c8e88eadff52b498896b06ec65c76f0a9e1ebc961f"},"schema_version":"1.0","source":{"id":"2505.17993","kind":"arxiv","version":1}},"canonical_sha256":"9f7cea46547bd9cc913a2bee2a53cefbf4e835b9f9fea0a3fd5da8752283f9bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f7cea46547bd9cc913a2bee2a53cefbf4e835b9f9fea0a3fd5da8752283f9bb","first_computed_at":"2026-07-05T11:08:34.895603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:34.895603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"63EDDtVK7ZGHSOZIzeEjTTjpO3fPRq5ues77jII08EwNIC7oYk5hy/XI+4bUtNCysewJtpyDHFwiE9JYG00vCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:34.896080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:742e8acb2348387c7382f529602e6990488b7d8c732f448d82a56be0a0523590","sha256:b1fb371664f0ee8bfe4608fde4e2e739153de9512a114ea9e355b15be3df8e2e"],"state_sha256":"91ef7085cd114d2b4a9f38f77ca25d7a0d5442da052328833c9a7b69af21a972"}