{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CGPCX65ECLEF7DHTEIS2WLXWPU","short_pith_number":"pith:CGPCX65E","schema_version":"1.0","canonical_sha256":"119e2bfba412c85f8cf32225ab2ef67d27f6fc3d021fef960ce0761245c907e7","source":{"kind":"arxiv","id":"2505.22351","version":1},"attestation_state":"computed","paper":{"title":"Finding $d$-Cuts in Probe $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Giacomo Paesani, Konrad K. Dabrowski, Matthew Johnson, Tala Eagling-Vose","submitted_at":"2025-05-28T13:32:59Z","abstract_excerpt":"For an integer $d\\geq 1$, the $d$-Cut problem is that of deciding whether a graph has an edge cut in which each vertex is adjacent to at most $d$ vertices on the opposite side of the cut. The $1$-Cut problem is the well-known Matching Cut problem. The $d$-Cut problem has been extensively studied for $H$-free graphs. We extend these results to the probe graph model, where we do not know all the edges of the input graph. For a graph $H$, a partitioned probe $H$-free graph $(G,P,N)$ consists of a graph $G=(V,E)$, together with a set $P\\subseteq V$ of probes and an independent set $N=V\\setminus P$"},"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.22351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T13:32:59Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"ee74c980acb9eb67d1c3027acea728bb22d935fa84a63fdce27ceb6996d855a0","abstract_canon_sha256":"f4623c7273e43a88bd5c077e247cb36cdd61e7123a340ec6469b49424ed445a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:13.733602Z","signature_b64":"syQ2xdSXV+gopBLxvvnTEsWFYu7xj3bUWiDA0BGxJmESC9PknOnx6sN91Cx8y9tToD7krSQjPwkBhsufNOvYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119e2bfba412c85f8cf32225ab2ef67d27f6fc3d021fef960ce0761245c907e7","last_reissued_at":"2026-07-05T11:11:13.733083Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:13.733083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding $d$-Cuts in Probe $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Giacomo Paesani, Konrad K. Dabrowski, Matthew Johnson, Tala Eagling-Vose","submitted_at":"2025-05-28T13:32:59Z","abstract_excerpt":"For an integer $d\\geq 1$, the $d$-Cut problem is that of deciding whether a graph has an edge cut in which each vertex is adjacent to at most $d$ vertices on the opposite side of the cut. The $1$-Cut problem is the well-known Matching Cut problem. The $d$-Cut problem has been extensively studied for $H$-free graphs. We extend these results to the probe graph model, where we do not know all the edges of the input graph. For a graph $H$, a partitioned probe $H$-free graph $(G,P,N)$ consists of a graph $G=(V,E)$, together with a set $P\\subseteq V$ of probes and an independent set $N=V\\setminus P$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22351","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.22351/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.22351","created_at":"2026-07-05T11:11:13.733143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22351v1","created_at":"2026-07-05T11:11:13.733143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22351","created_at":"2026-07-05T11:11:13.733143+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGPCX65ECLEF","created_at":"2026-07-05T11:11:13.733143+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGPCX65ECLEF7DHT","created_at":"2026-07-05T11:11:13.733143+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGPCX65E","created_at":"2026-07-05T11:11:13.733143+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/CGPCX65ECLEF7DHTEIS2WLXWPU","json":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU.json","graph_json":"https://pith.science/api/pith-number/CGPCX65ECLEF7DHTEIS2WLXWPU/graph.json","events_json":"https://pith.science/api/pith-number/CGPCX65ECLEF7DHTEIS2WLXWPU/events.json","paper":"https://pith.science/paper/CGPCX65E"},"agent_actions":{"view_html":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU","download_json":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU.json","view_paper":"https://pith.science/paper/CGPCX65E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22351&json=true","fetch_graph":"https://pith.science/api/pith-number/CGPCX65ECLEF7DHTEIS2WLXWPU/graph.json","fetch_events":"https://pith.science/api/pith-number/CGPCX65ECLEF7DHTEIS2WLXWPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/action/storage_attestation","attest_author":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/action/author_attestation","sign_citation":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/action/citation_signature","submit_replication":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/action/replication_record"}},"created_at":"2026-07-05T11:11:13.733143+00:00","updated_at":"2026-07-05T11:11:13.733143+00:00"}