Paper Citation Record · LEDGER

Connectivity-Preserving Minimum Separator in AT-free Graphs

As of 8 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 2 inbound Pith citation observations for arXiv:2506.03612.

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

pith.paper-citation-record.v1
2506.03612 v2

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:14:51.149153Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-17T20:10:11.247425Z

Reference resolution

24 of 24 outbound references displayed

verified exact4
verified fuzzy3
unresolved14
parse uncertain0
malformed identifier3
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2d1e7853-8f14-4bd6-a1f8-f7747303b4b9 · outbound

This paper cites Fomin, Petr A.

Connectivity-Preserving Minimum Separator in AT-free Graphs Fomin, Petr A

Reference 1

Resolution: malformed identifier; no resolver link, observed 2026-08-07T11:14:49.202981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63a10bae-0450-4706-bbbb-d4f96e3407a2 · outbound

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

Connectivity-Preserving Minimum Separator in AT-free Graphs Generating all the minimal separators of a graph.Int

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:49.253129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 598bcca9-1320-41e5-8c81-79d1026bd1f4 · outbound

This paper cites On the complexity of testing for odd holes and induced odd paths.Discret.

Connectivity-Preserving Minimum Separator in AT-free Graphs On the complexity of testing for odd holes and induced odd paths.Discret

Reference 3

Resolution: verified exact; doi, observed 2026-08-07T11:14:51.670641Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 28a745e0-d4b1-4c3c-bb6a-5dcfc5ca3fbf · outbound

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

Connectivity-Preserving Minimum Separator in AT-free Graphs Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:49.400797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c37bfd43-1beb-45a2-ba76-bbd76ff37c7d · outbound

This paper cites Asteroidaltriple-freegraphs.

Connectivity-Preserving Minimum Separator in AT-free Graphs Asteroidaltriple-freegraphs

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:49.464157Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4999f15-282f-4b1d-bf16-eb9915664069 · outbound

This paper cites Kevin Wood, and Alexandra M.

Connectivity-Preserving Minimum Separator in AT-free Graphs Kevin Wood, and Alexandra M

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:49.534069Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b525a46-27d9-44d8-9690-e727e8bfca8f · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Minimum Separator in AT-free Graphs Unresolved cited work

Reference 7

Resolution: verified exact; raw_fallback, observed 2026-08-07T11:14:52.148847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 71260d90-890a-48e4-b01e-87a011a8461b · outbound

This paper cites Solving the 2-Disjoint connected subgraphs problem faster than2 n.

Connectivity-Preserving Minimum Separator in AT-free Graphs Solving the 2-Disjoint connected subgraphs problem faster than2 n

Reference 8

Resolution: verified exact; doi, observed 2026-08-07T11:14:51.543638Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation eaf44035-94a5-4d93-ac98-9772978c2f5d · outbound

This paper cites On DDoS Attack Related Minimum Cut Problems.

Connectivity-Preserving Minimum Separator in AT-free Graphs On DDoS Attack Related Minimum Cut Problems

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:49.769896Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d545483-9c9d-4a48-acbb-974837e7fec8 · outbound

This paper cites On the connectivity preserving minimum cut problem.

Connectivity-Preserving Minimum Separator in AT-free Graphs On the connectivity preserving minimum cut problem

Reference 10

Resolution: malformed identifier; no resolver link, observed 2026-08-07T11:14:49.865215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c682d350-71a3-405c-bc65-acf01f23d90e · outbound

This paper cites Cambridge University Press, 2012.

Connectivity-Preserving Minimum Separator in AT-free Graphs Cambridge University Press, 2012

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:49.946382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38fd8627-f9ed-497a-892a-330a51790ee9 · outbound

This paper cites Golovach, Dieter Kratsch, and Daniël Paulusma.

Connectivity-Preserving Minimum Separator in AT-free Graphs Golovach, Dieter Kratsch, and Daniël Paulusma

Reference 12

Resolution: verified exact; doi, observed 2026-08-07T11:14:51.381622Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 24677849-1791-4168-bcaa-1bd9d754cdf1 · outbound

This paper cites Silveira.

Connectivity-Preserving Minimum Separator in AT-free Graphs Silveira

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:50.168395Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20eb54f8-44f2-4a41-a5db-6e2230f7b768 · outbound

This paper cites Liu, and Aaron Sidford.

Connectivity-Preserving Minimum Separator in AT-free Graphs Liu, and Aaron Sidford

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:50.238663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 708dac6e-f2ef-4751-939c-39a5db2bc3ac · outbound

This paper cites The induced disjoint paths prob- lem.

Connectivity-Preserving Minimum Separator in AT-free Graphs The induced disjoint paths prob- lem

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:14:52.723628Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 90276e95-f572-48fa-b84f-cb1f9e1362bf · outbound

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

Connectivity-Preserving Minimum Separator in AT-free Graphs Disjoint paths and connected subgraphs for H- free graphs.Theoretical Computer Science, 898:59–68, 2022

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:50.423704Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c72a638e-8586-4e7e-a3cd-68f505f446a3 · outbound

This paper cites Liu and Aaron Sidford.

Connectivity-Preserving Minimum Separator in AT-free Graphs Liu and Aaron Sidford

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:50.517325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f87c8e4d-3780-41d8-83fd-c3f9e681dcdf · outbound

This paper cites an unresolved cited work.

Connectivity-Preserving Minimum Separator in AT-free Graphs Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:50.609573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5da8563a-db50-4285-a340-969a176d8709 · outbound

This paper cites Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discret.

Connectivity-Preserving Minimum Separator in AT-free Graphs Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discret

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:14:52.596834Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation a6527ac9-d0e0-4473-a8fe-8f02bcfa2e6f · outbound

This paper cites Connectingterminalsand2-disjointconnected subgraphs.

Connectivity-Preserving Minimum Separator in AT-free Graphs Connectingterminalsand2-disjointconnected subgraphs

Reference 20

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T11:14:52.488266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 93552626-48e4-4b2e-a889-4fc1af846008 · outbound

This paper cites Liu, Maxi- milian Probst Gutenberg, Sushant Sachdeva, and Aaron Sidford.

Connectivity-Preserving Minimum Separator in AT-free Graphs Liu, Maxi- milian Probst Gutenberg, Sushant Sachdeva, and Aaron Sidford

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:50.877863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b270c613-a5aa-4e27-ac54-5746d6d7dd43 · outbound

This paper cites Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang.

Connectivity-Preserving Minimum Separator in AT-free Graphs Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:51.002577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c0afa7a-44c8-439b-b933-b4c5b7215f04 · outbound

This paper cites Woeginger.

Connectivity-Preserving Minimum Separator in AT-free Graphs Woeginger

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T11:14:51.079599Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99f63ebd-6582-49ca-8d51-2068f4f1b44e · outbound

This paper cites The input to this problem is an undirected graphGand a collection ofkvertex pairs {(s1, t1),.

Connectivity-Preserving Minimum Separator in AT-free Graphs The input to this problem is an undirected graphGand a collection ofkvertex pairs {(s1, t1),

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:14:52.365860Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Pith citing papers

Observation 2980c8b6-620a-4830-95bd-b54b5dca4a9e · inbound

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems cites this paper.

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

Reference 21

Resolution: verified exact; arxiv_id, observed 2026-05-17T20:10:11.250237Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

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

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems cites this paper.

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.