Paper Citation Record · LEDGER

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems

As of 23 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2511.15849.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2511.15849 v4

Coverage vector

measured 44 of 44 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T21:29:48.560075Z

measured 44 of 44 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

44 of 44 outbound references displayed

verified exact0
verified fuzzy0
unresolved43
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a2829d28-1aa7-41e4-ab26-f8033a9ef494 · outbound

This paper cites A pa- rameterized algorithm for vertex connectivity survivable network design problem with uniform demands.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems A pa- rameterized algorithm for vertex connectivity survivable network design problem with uniform demands

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:43.693725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d490f0b8-0350-4b22-bbc6-c5053fa7b7e2 · outbound

This paper cites Fomin, Petr A.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Fomin, Petr A

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:43.831165Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 486246e9-4819-4ee9-aa80-b4b745f34acc · outbound

This paper cites Fomin, Fanny Hauser, and Saket Saurabh.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Fomin, Fanny Hauser, and Saket Saurabh

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:43.956155Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e902ea8-3d9d-4aea-8aea-33e1b28b2e17 · outbound

This paper cites Generating all the minimal separators of a graph.Int.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Generating all the minimal separators of a graph.Int

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.100886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea82ef45-770b-478c-af6f-999400bfa9ab · outbound

This paper cites Multicut is FPT.SIAM J.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Multicut is FPT.SIAM J

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.244636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f1119fc-e0dc-4323-adc3-6073b12bfb97 · outbound

This paper cites A fixed-parameter algorithm for the directed feedback vertex set problem.J.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems A fixed-parameter algorithm for the directed feedback vertex set problem.J

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.419175Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8920f40b-db80-4ead-9ffc-4ad7c4f88685 · outbound

This paper cites Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.539479Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa1992b5-4ae8-4129-af83-cb8638d2e88f · outbound

This paper cites Designing FPT algorithms for cut problems using randomized contractions.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Designing FPT algorithms for cut problems using randomized contractions

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.618595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0cdd4d8-6421-494f-b2db-ebdcbb7a29dd · outbound

This paper cites Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.SIAM J.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.SIAM J

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.675825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 216e8a0b-d4e4-4460-9ed9-1afa8000631d · outbound

This paper cites Corneil, Stephan Olariu, and Lorna Stewart.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Corneil, Stephan Olariu, and Lorna Stewart

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.757560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a1461a21-2114-4cb9-b235-6115fd4c7314 · outbound

This paper cites Kevin Wood, and Alexandra M.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Kevin Wood, and Alexandra M

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.826988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56672c0f-10fe-45e4-afb7-a9b6496e40a4 · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.899414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e2ab035-e097-489f-9270-05d116e82fce · outbound

This paper cites Springer, 2012.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Springer, 2012

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:44.984000Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 771048e9-04a3-436b-8db3-6c5ec408ce2e · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:45.132967Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 39cec7c5-a530-433c-9197-4077e7c182e2 · outbound

This paper cites On DDoS Attack Related Minimum Cut Problems.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems On DDoS Attack Related Minimum Cut Problems

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:45.235307Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ea4be7e-6689-4446-9a82-7cc21c4c2f18 · outbound

This paper cites On the connectivity preserving minimum cut problem.J.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems On the connectivity preserving minimum cut problem.J

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:45.356727Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b3ada33-5a50-4083-bb4f-dc5f56f82435 · outbound

This paper cites Cambridge University Press, 2012.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Cambridge University Press, 2012

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:45.497949Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07f90776-3d9c-4b87-9b8a-ad22528a8b52 · outbound

This paper cites Golovach, Dieter Kratsch, and Dani¨ el Paulusma.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Golovach, Dieter Kratsch, and Dani¨ el Paulusma

Reference 18

Resolution: malformed identifier; no resolver link, observed 2026-08-03T21:29:45.660871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3bf201c8-b4b9-471b-b069-52e52ca5447e · outbound

This paper cites Silveira.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Silveira

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:45.827233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7443ed7-dcc9-4f3d-8d4b-2a4753765057 · outbound

This paper cites The induced disjoint paths problem.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems The induced disjoint paths problem

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.006853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c564c307-ebe0-4a08-8a47-1e1ce77083c3 · outbound

This paper cites Connectivity-Preserving Minimum Separator in AT-free Graphs.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Connectivity-Preserving Minimum Separator in AT-free Graphs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.185199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1447e27b-fb8b-4878-a4a3-9a951c39bb17 · outbound

This paper cites Disjoint paths and connected subgraphs for H-free graphs.Theoretical Computer Sci- ence, 898:59–68, 2022.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Disjoint paths and connected subgraphs for H-free graphs.Theoretical Computer Sci- ence, 898:59–68, 2022

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.286456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30c5b272-ea3c-4cd3-83ec-7af71a6a6e06 · outbound

This paper cites Listing all minimal separators of a graph.SIAM J.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Listing all minimal separators of a graph.SIAM J

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.441570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fba2588d-5e39-42b7-a356-8237921b5a9c · outbound

This paper cites Clustering with local restrictions.Inf.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Clustering with local restrictions.Inf

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.599182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 624bfd16-b805-4831-8c21-eca50c596057 · outbound

This paper cites Slightly superexponential parameterized problems.SIAM Journal on Computing, 47(3):675–702, 2018.arXiv:https://doi.org/10.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Slightly superexponential parameterized problems.SIAM Journal on Computing, 47(3):675–702, 2018.arXiv:https://doi.org/10

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.704551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b61d3bc1-e745-4688-8420-4d134161775f · outbound

This paper cites Parameterized graph separation problems.Theor.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Parameterized graph separation problems.Theor

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.857577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f20aa7f-32d4-4d59-ae86-f657d8117d4b · outbound

This paper cites Treewidth reduction for constrained separation and bipartization problems.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Treewidth reduction for constrained separation and bipartization problems

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.058819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6c5ed0d-6e27-40d9-9298-7c6f5a0c60f8 · outbound

This paper cites Finding small separators in linear time via treewidth reduction.ACM Trans.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Finding small separators in linear time via treewidth reduction.ACM Trans

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.197479Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 698cac7a-ee88-432f-a280-7b3150f167dc · outbound

This paper cites Fixed-parameter tractability of multicut parameterized by the size of the cutset.SIAM J.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Fixed-parameter tractability of multicut parameterized by the size of the cutset.SIAM J

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.256095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b6cf770-a0df-47eb-b51b-fb44fa9a30ee · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.329752Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 373accb4-18e9-40cc-a57c-35e6a40e3671 · outbound

This paper cites Large Isolating Cuts Shrink the Multiway Cut.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Large Isolating Cuts Shrink the Multiway Cut

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.395760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3283ced6-777a-4999-a6f6-711a16106ace · outbound

This paper cites Almost 2-SAT is Fixed-Parameter Tractable.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Almost 2-SAT is Fixed-Parameter Tractable

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.481295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e32dea9a-d112-44ca-8362-e51fdd2775bf · outbound

This paper cites Connecting terminals and 2-disjoint connected subgraphs.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Connecting terminals and 2-disjoint connected subgraphs

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.544148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4618bde4-25a1-4891-a141-b7080d7b563c · outbound

This paper cites A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.666986Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1d6d920-f707-4921-9351-2ce371e3e754 · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.787227Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd2c6b70-a290-4718-96e0-33422543a1ed · outbound

This paper cites 3.κ s,t(G′) =κ s,t(G).

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems 3.κ s,t(G′) =κ s,t(G)

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.886789Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5894093f-1eeb-4fcd-b030-8989c5096352 · outbound

This paper cites SinceC s(G−L∗ sAQ,t(G))⊆C s(G−S), then Ai ⊆ S C∈D C∪C s(G−L∗ sAQ,t(G))⊆C s(G−S), and henceA i is connected inG −S.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems SinceC s(G−L∗ sAQ,t(G))⊆C s(G−S), then Ai ⊆ S C∈D C∪C s(G−L∗ sAQ,t(G))⊆C s(G−S), and henceA i is connected inG −S

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.995460Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be3fecfc-2701-4692-8f89-061e83b05a0a · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:48.105459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c06f49a-6f5a-4ee6-b8ef-2fa82a90dd5b · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:48.239505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23c79009-3f75-4347-bc34-be8575ce21ff · outbound

This paper cites We have previously established thatC q is connected inG −S.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems We have previously established thatC q is connected inG −S

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:48.355868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d261537d-18c8-41f8-8849-dbcc8283e2ee · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:48.453441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd40592a-1322-4c08-806d-9b17561f5df2 · outbound

This paper cites Ifx∈L t sA,t(G) thenκ sAx,t(G)> κsA,t(G).

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Ifx∈L t sA,t(G) thenκ sAx,t(G)> κsA,t(G)

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:48.560075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e6286fd-a4ff-4aa3-a04d-decf8907ae76 · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 428

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:47.583732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4daaa329-d45b-4a99-a144-6fc7ab2748cb · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems Unresolved cited work

Reference 2006

Resolution: unresolved; no resolver link, observed 2026-08-03T21:29:46.957459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.