{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TUOS5F3WJMR7HJZ6S5S2L5LLFX","short_pith_number":"pith:TUOS5F3W","schema_version":"1.0","canonical_sha256":"9d1d2e97764b23f3a73e9765a5f56b2dfad1af9462acc87a1b7527ad6fd4cb53","source":{"kind":"arxiv","id":"2307.00604","version":2},"attestation_state":"computed","paper":{"title":"Listing Small Minimal $s,t$-separators in FPT-Delay","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Batya Kenig","submitted_at":"2023-07-02T16:17:37Z","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"},"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":"2307.00604","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-02T16:17:37Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e6e110bb5dd37baf051bf4a47692666f5251afaa55e1373b975188671c30cced","abstract_canon_sha256":"e68a751b22e606ed4e45ae0a6e2f8663d873c47398e06ec27767acb57d8b5145"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:53.890095Z","signature_b64":"yEMJL7s0RD3RyANuMT2rkihYlUsq/Ey+S72LgXBeIM1uqakzt4cypJfGCa3DqcIlFrf/6DybT3Q3VGX+khboBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1d2e97764b23f3a73e9765a5f56b2dfad1af9462acc87a1b7527ad6fd4cb53","last_reissued_at":"2026-07-05T06:56:53.889635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:53.889635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Listing Small Minimal $s,t$-separators in FPT-Delay","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Batya Kenig","submitted_at":"2023-07-02T16:17:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00604","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.00604/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":"2307.00604","created_at":"2026-07-05T06:56:53.889692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.00604v2","created_at":"2026-07-05T06:56:53.889692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00604","created_at":"2026-07-05T06:56:53.889692+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUOS5F3WJMR7","created_at":"2026-07-05T06:56:53.889692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUOS5F3WJMR7HJZ6","created_at":"2026-07-05T06:56:53.889692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUOS5F3W","created_at":"2026-07-05T06:56:53.889692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06393","citing_title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX","json":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX.json","graph_json":"https://pith.science/api/pith-number/TUOS5F3WJMR7HJZ6S5S2L5LLFX/graph.json","events_json":"https://pith.science/api/pith-number/TUOS5F3WJMR7HJZ6S5S2L5LLFX/events.json","paper":"https://pith.science/paper/TUOS5F3W"},"agent_actions":{"view_html":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX","download_json":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX.json","view_paper":"https://pith.science/paper/TUOS5F3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.00604&json=true","fetch_graph":"https://pith.science/api/pith-number/TUOS5F3WJMR7HJZ6S5S2L5LLFX/graph.json","fetch_events":"https://pith.science/api/pith-number/TUOS5F3WJMR7HJZ6S5S2L5LLFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX/action/storage_attestation","attest_author":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX/action/author_attestation","sign_citation":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX/action/citation_signature","submit_replication":"https://pith.science/pith/TUOS5F3WJMR7HJZ6S5S2L5LLFX/action/replication_record"}},"created_at":"2026-07-05T06:56:53.889692+00:00","updated_at":"2026-07-05T06:56:53.889692+00:00"}