{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RHHQ3KT7BVFTU3H54JSV23ZF4H","short_pith_number":"pith:RHHQ3KT7","schema_version":"1.0","canonical_sha256":"89cf0daa7f0d4b3a6cfde2655d6f25e1d5893bdbb98d039280f50c3ee1a0a55f","source":{"kind":"arxiv","id":"2607.03266","version":1},"attestation_state":"computed","paper":{"title":"An FPT Algorithm for Diverse Minimum s-t Cuts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Krishnan Dehaleesan, Laure Morelle, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Petr A. Golovach","submitted_at":"2026-07-03T12:35:53Z","abstract_excerpt":"We study the problem of finding a family of diverse minimum edge s-t cuts in a directed weighted graph G. Given integers k and d, the task is to decide whether G contains k minimum s-t cuts C_1, ..., C_k such that for any i,j in [k], the number of edges in the symmetric difference of C_i and C_j is at least d.\n  For d being 1 or 2, the problem corresponds to counting minimum s-t cuts in G, which is #P-complete [Provan and Ball, SICOMP 1983]. The problem is also known to be NP-complete already for k = 3 [de Berg, L\\'opez Mart\\'inez, Spieksma, ISAAC 2024]. Our main result shows that the problem "},"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":"2607.03266","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-03T12:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"26189a11e13904c07571e8fbcc49af9411367042eb26b433ecc1192a1c096d88","abstract_canon_sha256":"94cbfac82488b1b1955aba4bae2f5a51ef8acd3fe0dc832cd9053d9e6d948fb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:49.223346Z","signature_b64":"PYNyOCoROu37aZAFzfNIV35T459lhz1OepIpD+hNOyhNWRcie4qGcDA+P1HW0G8p8OEKK2IiQ3v62ZDrEIjoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89cf0daa7f0d4b3a6cfde2655d6f25e1d5893bdbb98d039280f50c3ee1a0a55f","last_reissued_at":"2026-07-07T01:16:49.222889Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:49.222889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An FPT Algorithm for Diverse Minimum s-t Cuts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Krishnan Dehaleesan, Laure Morelle, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Petr A. Golovach","submitted_at":"2026-07-03T12:35:53Z","abstract_excerpt":"We study the problem of finding a family of diverse minimum edge s-t cuts in a directed weighted graph G. Given integers k and d, the task is to decide whether G contains k minimum s-t cuts C_1, ..., C_k such that for any i,j in [k], the number of edges in the symmetric difference of C_i and C_j is at least d.\n  For d being 1 or 2, the problem corresponds to counting minimum s-t cuts in G, which is #P-complete [Provan and Ball, SICOMP 1983]. The problem is also known to be NP-complete already for k = 3 [de Berg, L\\'opez Mart\\'inez, Spieksma, ISAAC 2024]. Our main result shows that the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03266","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/2607.03266/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":"2607.03266","created_at":"2026-07-07T01:16:49.222955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03266v1","created_at":"2026-07-07T01:16:49.222955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03266","created_at":"2026-07-07T01:16:49.222955+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHHQ3KT7BVFT","created_at":"2026-07-07T01:16:49.222955+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHHQ3KT7BVFTU3H5","created_at":"2026-07-07T01:16:49.222955+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHHQ3KT7","created_at":"2026-07-07T01:16:49.222955+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/RHHQ3KT7BVFTU3H54JSV23ZF4H","json":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H.json","graph_json":"https://pith.science/api/pith-number/RHHQ3KT7BVFTU3H54JSV23ZF4H/graph.json","events_json":"https://pith.science/api/pith-number/RHHQ3KT7BVFTU3H54JSV23ZF4H/events.json","paper":"https://pith.science/paper/RHHQ3KT7"},"agent_actions":{"view_html":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H","download_json":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H.json","view_paper":"https://pith.science/paper/RHHQ3KT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03266&json=true","fetch_graph":"https://pith.science/api/pith-number/RHHQ3KT7BVFTU3H54JSV23ZF4H/graph.json","fetch_events":"https://pith.science/api/pith-number/RHHQ3KT7BVFTU3H54JSV23ZF4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H/action/storage_attestation","attest_author":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H/action/author_attestation","sign_citation":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H/action/citation_signature","submit_replication":"https://pith.science/pith/RHHQ3KT7BVFTU3H54JSV23ZF4H/action/replication_record"}},"created_at":"2026-07-07T01:16:49.222955+00:00","updated_at":"2026-07-07T01:16:49.222955+00:00"}