{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YLRHMI7CYRRC5TNZRKZ3IJF5J3","short_pith_number":"pith:YLRHMI7C","canonical_record":{"source":{"id":"1907.02353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T12:16:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e440d3fa1832a35fdbf7c3994cb65e1e9c4a3de66dd3b53fb0f6d6b819032e28","abstract_canon_sha256":"f8684341eec6bfe9a905ddc6f23a240edd5c9e8172b3350a91155a7398a7dd7f"},"schema_version":"1.0"},"canonical_sha256":"c2e27623e2c4622ecdb98ab3b424bd4ee4e75583d74d100d889278bdeaaf95f4","source":{"kind":"arxiv","id":"1907.02353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02353","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02353v2","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02353","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"YLRHMI7CYRRC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YLRHMI7CYRRC5TNZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YLRHMI7C","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YLRHMI7CYRRC5TNZRKZ3IJF5J3","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T12:16:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e440d3fa1832a35fdbf7c3994cb65e1e9c4a3de66dd3b53fb0f6d6b819032e28","abstract_canon_sha256":"f8684341eec6bfe9a905ddc6f23a240edd5c9e8172b3350a91155a7398a7dd7f"},"schema_version":"1.0"},"canonical_sha256":"c2e27623e2c4622ecdb98ab3b424bd4ee4e75583d74d100d889278bdeaaf95f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:24.130475Z","signature_b64":"JNtpT164mMCnZ2bCv2KG2NsjAW8hyFk5wJ1bzzAjZa9+BlXmQvof/dD2s/2Fc5jjy33FQ9K0j6VpX+1s1I1GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e27623e2c4622ecdb98ab3b424bd4ee4e75583d74d100d889278bdeaaf95f4","last_reissued_at":"2026-05-17T23:41:24.129791Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:24.129791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02353","source_version":2,"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-05-17T23:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sY8YnKSCWtK8VgrYnvuAlD3n3mEiVkh5lpRuplXwQG+aLn3Xs/3rSTzgDwdJaNhJOh6GW2SYjx48Mno4unDtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:33:39.567725Z"},"content_sha256":"d54dee781a790fd74666ad1b596e09bbc6891d34bca0b2f920882d4c0eb26054","schema_version":"1.0","event_id":"sha256:d54dee781a790fd74666ad1b596e09bbc6891d34bca0b2f920882d4c0eb26054"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YLRHMI7CYRRC5TNZRKZ3IJF5J3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-parameter tractability of counting small minimum $(S,T)$-cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arpad Rimmel, Benjamin Mouscadet, Joanna Tomasik, Pierre Berg\\'e","submitted_at":"2019-07-04T12:16:34Z","abstract_excerpt":"The parameterized complexity of counting minimum cuts stands as a natural question because Ball and Provan showed its #P-completeness. For any undirected graph $G=(V,E)$ and two disjoint sets of its vertices $S,T$, we design a fixed-parameter tractable algorithm which counts minimum edge $(S,T)$-cuts parameterized by their size $p$. Our algorithm operates on a transformed graph instance. This transformation, called drainage, reveals a collection of at most $n=\\left| V \\right|$ successive minimum $(S,T)$-cuts $Z_i$. We prove that any minimum $(S,T)$-cut $X$ contains edges of at least one cut $Z"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02353","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5RAqWgS3Lk9iaOiCkZi0jnEwhgjco0j87ha0l5s04EnKrq4xa28O5WiCD4Ghsoa6cB38UTYMn4oNM90OUHADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:33:39.568462Z"},"content_sha256":"2c0ff887929765c74be27690ff7b478287eec3d3381e4fc4b32e1b3485c8d37a","schema_version":"1.0","event_id":"sha256:2c0ff887929765c74be27690ff7b478287eec3d3381e4fc4b32e1b3485c8d37a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3/bundle.json","state_url":"https://pith.science/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3/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-06-11T08:33:39Z","links":{"resolver":"https://pith.science/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3","bundle":"https://pith.science/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3/bundle.json","state":"https://pith.science/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLRHMI7CYRRC5TNZRKZ3IJF5J3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YLRHMI7CYRRC5TNZRKZ3IJF5J3","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":"f8684341eec6bfe9a905ddc6f23a240edd5c9e8172b3350a91155a7398a7dd7f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T12:16:34Z","title_canon_sha256":"e440d3fa1832a35fdbf7c3994cb65e1e9c4a3de66dd3b53fb0f6d6b819032e28"},"schema_version":"1.0","source":{"id":"1907.02353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02353","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02353v2","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02353","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"YLRHMI7CYRRC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YLRHMI7CYRRC5TNZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YLRHMI7C","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:2c0ff887929765c74be27690ff7b478287eec3d3381e4fc4b32e1b3485c8d37a","target":"graph","created_at":"2026-05-17T23:41:24Z","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"},"paper":{"abstract_excerpt":"The parameterized complexity of counting minimum cuts stands as a natural question because Ball and Provan showed its #P-completeness. For any undirected graph $G=(V,E)$ and two disjoint sets of its vertices $S,T$, we design a fixed-parameter tractable algorithm which counts minimum edge $(S,T)$-cuts parameterized by their size $p$. Our algorithm operates on a transformed graph instance. This transformation, called drainage, reveals a collection of at most $n=\\left| V \\right|$ successive minimum $(S,T)$-cuts $Z_i$. We prove that any minimum $(S,T)$-cut $X$ contains edges of at least one cut $Z","authors_text":"Arpad Rimmel, Benjamin Mouscadet, Joanna Tomasik, Pierre Berg\\'e","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T12:16:34Z","title":"Fixed-parameter tractability of counting small minimum $(S,T)$-cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02353","kind":"arxiv","version":2},"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:d54dee781a790fd74666ad1b596e09bbc6891d34bca0b2f920882d4c0eb26054","target":"record","created_at":"2026-05-17T23:41:24Z","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":"f8684341eec6bfe9a905ddc6f23a240edd5c9e8172b3350a91155a7398a7dd7f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T12:16:34Z","title_canon_sha256":"e440d3fa1832a35fdbf7c3994cb65e1e9c4a3de66dd3b53fb0f6d6b819032e28"},"schema_version":"1.0","source":{"id":"1907.02353","kind":"arxiv","version":2}},"canonical_sha256":"c2e27623e2c4622ecdb98ab3b424bd4ee4e75583d74d100d889278bdeaaf95f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e27623e2c4622ecdb98ab3b424bd4ee4e75583d74d100d889278bdeaaf95f4","first_computed_at":"2026-05-17T23:41:24.129791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:24.129791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNtpT164mMCnZ2bCv2KG2NsjAW8hyFk5wJ1bzzAjZa9+BlXmQvof/dD2s/2Fc5jjy33FQ9K0j6VpX+1s1I1GAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:24.130475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d54dee781a790fd74666ad1b596e09bbc6891d34bca0b2f920882d4c0eb26054","sha256:2c0ff887929765c74be27690ff7b478287eec3d3381e4fc4b32e1b3485c8d37a"],"state_sha256":"df8403c42c848317274e6f43c35114a7ad4bdbb2a7c7eb80bcabb667e75440f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3ghxwaUuAeeCEe8GobmQL3xx+PCBXKX6TDtS3vMLeTkYUSpdoyOpG2DNA/l39en/f3AyrelvquceKSD3CX8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:33:39.573044Z","bundle_sha256":"6fcdc752b657ec4fd489773bbac414954fce3aa5ee43ab2c20932aed0b4b3b9d"}}