{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T56OURSUPPM4ZEJ2FPXCUU6O7P","short_pith_number":"pith:T56OURSU","schema_version":"1.0","canonical_sha256":"9f7cea46547bd9cc913a2bee2a53cefbf4e835b9f9fea0a3fd5da8752283f9bb","source":{"kind":"arxiv","id":"2505.17993","version":1},"attestation_state":"computed","paper":{"title":"Finding d-Cuts in Claw-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Dani\\\"el Paulusma, Felicia Lucke, Jungho Ahn, Siani Smith, Tala Eagling-Vose","submitted_at":"2025-05-23T14:58:42Z","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"},"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":"2505.17993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:58:42Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"38b3c75e465240cb5e76f7c8e88eadff52b498896b06ec65c76f0a9e1ebc961f","abstract_canon_sha256":"2c9cb131057675d755790e10c3dc779def940c3a2cd733fe7f93122162ce986d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:34.896080Z","signature_b64":"63EDDtVK7ZGHSOZIzeEjTTjpO3fPRq5ues77jII08EwNIC7oYk5hy/XI+4bUtNCysewJtpyDHFwiE9JYG00vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7cea46547bd9cc913a2bee2a53cefbf4e835b9f9fea0a3fd5da8752283f9bb","last_reissued_at":"2026-07-05T11:08:34.895603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:34.895603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding d-Cuts in Claw-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Dani\\\"el Paulusma, Felicia Lucke, Jungho Ahn, Siani Smith, Tala Eagling-Vose","submitted_at":"2025-05-23T14:58:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17993","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.17993/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":"2505.17993","created_at":"2026-07-05T11:08:34.895662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17993v1","created_at":"2026-07-05T11:08:34.895662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17993","created_at":"2026-07-05T11:08:34.895662+00:00"},{"alias_kind":"pith_short_12","alias_value":"T56OURSUPPM4","created_at":"2026-07-05T11:08:34.895662+00:00"},{"alias_kind":"pith_short_16","alias_value":"T56OURSUPPM4ZEJ2","created_at":"2026-07-05T11:08:34.895662+00:00"},{"alias_kind":"pith_short_8","alias_value":"T56OURSU","created_at":"2026-07-05T11:08:34.895662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22351","citing_title":"Finding $d$-Cuts in Probe $H$-Free Graphs","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P","json":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P.json","graph_json":"https://pith.science/api/pith-number/T56OURSUPPM4ZEJ2FPXCUU6O7P/graph.json","events_json":"https://pith.science/api/pith-number/T56OURSUPPM4ZEJ2FPXCUU6O7P/events.json","paper":"https://pith.science/paper/T56OURSU"},"agent_actions":{"view_html":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P","download_json":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P.json","view_paper":"https://pith.science/paper/T56OURSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17993&json=true","fetch_graph":"https://pith.science/api/pith-number/T56OURSUPPM4ZEJ2FPXCUU6O7P/graph.json","fetch_events":"https://pith.science/api/pith-number/T56OURSUPPM4ZEJ2FPXCUU6O7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P/action/storage_attestation","attest_author":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P/action/author_attestation","sign_citation":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P/action/citation_signature","submit_replication":"https://pith.science/pith/T56OURSUPPM4ZEJ2FPXCUU6O7P/action/replication_record"}},"created_at":"2026-07-05T11:08:34.895662+00:00","updated_at":"2026-07-05T11:08:34.895662+00:00"}