{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CGPCX65ECLEF7DHTEIS2WLXWPU","short_pith_number":"pith:CGPCX65E","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"},"canonical_sha256":"119e2bfba412c85f8cf32225ab2ef67d27f6fc3d021fef960ce0761245c907e7","source":{"kind":"arxiv","id":"2505.22351","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CGPCX65ECLEF7DHTEIS2WLXWPU","target":"record","payload":{"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"},"canonical_sha256":"119e2bfba412c85f8cf32225ab2ef67d27f6fc3d021fef960ce0761245c907e7","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"},"source_kind":"arxiv","source_id":"2505.22351","source_version":1,"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-05T11:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmhSaFR591p17yEXtuVqIpcIAPoeCe9k48CV/Fo7H/ehtBjJrc+6pWU4WqHZ3L4vBzaSVHfIRobA9D0zgHYuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:36:45.007621Z"},"content_sha256":"a7730136ba1330a08d4c7d9933e3500a6adfc97f874825a1a3b126e51a62f5b4","schema_version":"1.0","event_id":"sha256:a7730136ba1330a08d4c7d9933e3500a6adfc97f874825a1a3b126e51a62f5b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CGPCX65ECLEF7DHTEIS2WLXWPU","target":"graph","payload":{"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"},"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-05T11:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1sgLe+OfrpVJdHlWyAqnWN3b7hYU3VGvLrtgc9eKu0bOQSoE+xK1haeRupEk/UZTyC47bMp3hgES8E1MVT/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:36:45.008149Z"},"content_sha256":"ea7d2232d5e48504aff00eb67968462a9339dafcf6edf2629c1d669b00dac287","schema_version":"1.0","event_id":"sha256:ea7d2232d5e48504aff00eb67968462a9339dafcf6edf2629c1d669b00dac287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/bundle.json","state_url":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/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-08T00:36:45Z","links":{"resolver":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU","bundle":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/bundle.json","state":"https://pith.science/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGPCX65ECLEF7DHTEIS2WLXWPU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nra9UM8wUtrM9gqfEwunWgki+fpcuuzMS3cNQnVcxPntjjN0B3UxRK8dwmQ+6kgBUwBv4pkD35rnhPXVPMsYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:36:45.012380Z","bundle_sha256":"c546d8f94302de682115123ae54ba5afb40d2ec44401aa81af88dbd175661944"}}