{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CGPCX65ECLEF7DHTEIS2WLXWPU","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":"f4623c7273e43a88bd5c077e247cb36cdd61e7123a340ec6469b49424ed445a6","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T13:32:59Z","title_canon_sha256":"ee74c980acb9eb67d1c3027acea728bb22d935fa84a63fdce27ceb6996d855a0"},"schema_version":"1.0","source":{"id":"2505.22351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22351","created_at":"2026-07-05T11:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22351v1","created_at":"2026-07-05T11:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22351","created_at":"2026-07-05T11:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"CGPCX65ECLEF","created_at":"2026-07-05T11:11:13Z"},{"alias_kind":"pith_short_16","alias_value":"CGPCX65ECLEF7DHT","created_at":"2026-07-05T11:11:13Z"},{"alias_kind":"pith_short_8","alias_value":"CGPCX65E","created_at":"2026-07-05T11:11:13Z"}],"graph_snapshots":[{"event_id":"sha256:ea7d2232d5e48504aff00eb67968462a9339dafcf6edf2629c1d669b00dac287","target":"graph","created_at":"2026-07-05T11:11:13Z","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.22351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$","authors_text":"Dani\\\"el Paulusma, Giacomo Paesani, Konrad K. Dabrowski, Matthew Johnson, Tala Eagling-Vose","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T13:32:59Z","title":"Finding $d$-Cuts in Probe $H$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22351","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:a7730136ba1330a08d4c7d9933e3500a6adfc97f874825a1a3b126e51a62f5b4","target":"record","created_at":"2026-07-05T11:11:13Z","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":"f4623c7273e43a88bd5c077e247cb36cdd61e7123a340ec6469b49424ed445a6","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T13:32:59Z","title_canon_sha256":"ee74c980acb9eb67d1c3027acea728bb22d935fa84a63fdce27ceb6996d855a0"},"schema_version":"1.0","source":{"id":"2505.22351","kind":"arxiv","version":1}},"canonical_sha256":"119e2bfba412c85f8cf32225ab2ef67d27f6fc3d021fef960ce0761245c907e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"119e2bfba412c85f8cf32225ab2ef67d27f6fc3d021fef960ce0761245c907e7","first_computed_at":"2026-07-05T11:11:13.733083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:13.733083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"syQ2xdSXV+gopBLxvvnTEsWFYu7xj3bUWiDA0BGxJmESC9PknOnx6sN91Cx8y9tToD7krSQjPwkBhsufNOvYBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:13.733602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.22351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7730136ba1330a08d4c7d9933e3500a6adfc97f874825a1a3b126e51a62f5b4","sha256:ea7d2232d5e48504aff00eb67968462a9339dafcf6edf2629c1d669b00dac287"],"state_sha256":"d6846687524894bda4d0d2e877d737e068d8c99715ca952adffb682da04a33e2"}