{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TUOS5F3WJMR7HJZ6S5S2L5LLFX","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":"e68a751b22e606ed4e45ae0a6e2f8663d873c47398e06ec27767acb57d8b5145","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-02T16:17:37Z","title_canon_sha256":"e6e110bb5dd37baf051bf4a47692666f5251afaa55e1373b975188671c30cced"},"schema_version":"1.0","source":{"id":"2307.00604","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.00604","created_at":"2026-07-05T06:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"2307.00604v2","created_at":"2026-07-05T06:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00604","created_at":"2026-07-05T06:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"TUOS5F3WJMR7","created_at":"2026-07-05T06:56:53Z"},{"alias_kind":"pith_short_16","alias_value":"TUOS5F3WJMR7HJZ6","created_at":"2026-07-05T06:56:53Z"},{"alias_kind":"pith_short_8","alias_value":"TUOS5F3W","created_at":"2026-07-05T06:56:53Z"}],"graph_snapshots":[{"event_id":"sha256:21743cfcf0fa85ef3fe66a6b359d2d7d0aabe9d022e383db591cbfb9de4eec76","target":"graph","created_at":"2026-07-05T06:56:53Z","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/2307.00604/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be an undirected graph, and $s,t$ distinguished vertices of $G$. A minimal $s,t$-separator is an inclusion-wise minimal vertex-set whose removal places $s$ and $t$ in distinct connected components. We present an algorithm for listing the minimal $s,t$-separators of a graph, whose cardinality is at most $k$, with FPT-delay, where the parameter depends only on $k$. This problem finds applications in various algorithms parameterized by treewidth, which include query evaluation in relational databases, probabilistic inference, and many more. We also present a simple algorithm that enumerat","authors_text":"Batya Kenig","cross_cats":["cs.DB"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-02T16:17:37Z","title":"Listing Small Minimal $s,t$-separators in FPT-Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00604","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:6c5540f791429980918fc6cab7236d2522b0feea6989e489d1413fa7d7d6a208","target":"record","created_at":"2026-07-05T06:56:53Z","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":"e68a751b22e606ed4e45ae0a6e2f8663d873c47398e06ec27767acb57d8b5145","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-02T16:17:37Z","title_canon_sha256":"e6e110bb5dd37baf051bf4a47692666f5251afaa55e1373b975188671c30cced"},"schema_version":"1.0","source":{"id":"2307.00604","kind":"arxiv","version":2}},"canonical_sha256":"9d1d2e97764b23f3a73e9765a5f56b2dfad1af9462acc87a1b7527ad6fd4cb53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d1d2e97764b23f3a73e9765a5f56b2dfad1af9462acc87a1b7527ad6fd4cb53","first_computed_at":"2026-07-05T06:56:53.889635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:56:53.889635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yEMJL7s0RD3RyANuMT2rkihYlUsq/Ey+S72LgXBeIM1uqakzt4cypJfGCa3DqcIlFrf/6DybT3Q3VGX+khboBg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:56:53.890095Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.00604","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c5540f791429980918fc6cab7236d2522b0feea6989e489d1413fa7d7d6a208","sha256:21743cfcf0fa85ef3fe66a6b359d2d7d0aabe9d022e383db591cbfb9de4eec76"],"state_sha256":"91a0d70bb5057518f39eaae57addcf1da231b4e12d0df99a61f50ef70cf58dbb"}