{"as_of":"2026-08-23T09:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22abcbf024cec22353b15f41017d07cff6d402c33dd7153b2c9c9684ca122e67","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:29:48.560075Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.15849/citation-record","integrity":"/paper/2511.15849/integrity","json":"/paper/2511.15849/citation-record.json","paper":"/paper/2511.15849"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:43.693725Z","title":"A pa- rameterized algorithm for vertex connectivity survivable network design problem with uniform demands","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:43.693725Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:7792d3d5fba2bbd22c7d39b0cdda27bc9b58f15a9a85938209e455c24ddb5f05","observation_id":"a2829d28-1aa7-41e4-ab26-f8033a9ef494","resolution":{"observed_at":"2026-08-03T21:29:43.693725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:43.831165Z","title":"Fomin, Petr A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:43.831165Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:fe5f1cead460ad3c012eaa4fb0e3bdc3e38bc3e4c3eb119730ce97e38e0db50c","observation_id":"d490f0b8-0350-4b22-bbc6-c5053fa7b7e2","resolution":{"observed_at":"2026-08-03T21:29:43.831165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:43.956155Z","title":"Fomin, Fanny Hauser, and Saket Saurabh","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:43.956155Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:5103a6a8de1895fbf5f1d1a11794893efc3fb35db9e99adeb55289f1ce6109b2","observation_id":"486246e9-4819-4ee9-aa80-b4b745f34acc","resolution":{"observed_at":"2026-08-03T21:29:43.956155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.100886Z","title":"Generating all the minimal separators of a graph.Int","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.100886Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:35b58b6e3c53cc0b40de61b9b1ab728eb1a91233c6358c1351b1cb4bcfbd65cf","observation_id":"4e902ea8-3d9d-4aea-8aea-33e1b28b2e17","resolution":{"observed_at":"2026-08-03T21:29:44.100886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.244636Z","title":"Multicut is FPT.SIAM J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.244636Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:824044d9fef111ab633f6e25159f149d87afda90fb40fe2359e2122d1e4a598c","observation_id":"ea82ef45-770b-478c-af6f-999400bfa9ab","resolution":{"observed_at":"2026-08-03T21:29:44.244636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.419175Z","title":"A fixed-parameter algorithm for the directed feedback vertex set problem.J","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.419175Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:2f6954467e1d9e6168604369117b1eef9ba1132703ca9f52b051363365d0807e","observation_id":"6f1119fc-e0dc-4323-adc3-6073b12bfb97","resolution":{"observed_at":"2026-08-03T21:29:44.419175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.539479Z","title":"Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.539479Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:7209fa9e16dbe6d106068850694c52403c7c0a8a27bd349438a97a7b8ae98efe","observation_id":"8920f40b-db80-4ead-9ffc-4ad7c4f88685","resolution":{"observed_at":"2026-08-03T21:29:44.539479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1207.4079","last_updated":"2016-07-19T08:15:02Z","snapshot_observed_at":"2026-08-15T00:52:57.510294Z","submitted_at":"2012-07-17T18:24:13Z","title":"Designing FPT algorithms for cut problems using randomized contractions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1207.4079","snapshot_observed_at":"2026-08-03T21:29:44.618595Z","title":"Designing FPT algorithms for cut problems using randomized contractions","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.618595Z"},"links":{"cited_paper":"/paper/1207.4079","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:53cc688b6578da1ba33f4dd8faf1af49a4fb64170da9bf70c1fac2aec80956ea","observation_id":"aa1992b5-4ae8-4129-af83-cb8638d2e88f","resolution":{"observed_at":"2026-08-03T21:29:44.618595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.675825Z","title":"Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.SIAM J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.675825Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:216624fd0b82b1c5fb0d59e755578134da107e7b571c73911f14b99be4d9872e","observation_id":"b0cdd4d8-6421-494f-b2db-ebdcbb7a29dd","resolution":{"observed_at":"2026-08-03T21:29:44.675825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.757560Z","title":"Corneil, Stephan Olariu, and Lorna Stewart","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.757560Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:fb5805fc3115d472298971367f08eb95df40bf7ca6d4b45b0251ed8e3c24d723","observation_id":"216e8a0b-d4e4-4460-9ed9-1afa8000631d","resolution":{"observed_at":"2026-08-03T21:29:44.757560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.826988Z","title":"Kevin Wood, and Alexandra M","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.826988Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:cd495d11ca2957e4cb53c7d71fa16ae0bd0cfba9657a71474dd759dfec2a96a8","observation_id":"a1461a21-2114-4cb9-b235-6115fd4c7314","resolution":{"observed_at":"2026-08-03T21:29:44.826988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.899414Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.899414Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:042eab5ae7be7b6197157487bc068059f8b632e632ab6f4af8536303359f2445","observation_id":"56672c0f-10fe-45e4-afb7-a9b6496e40a4","resolution":{"observed_at":"2026-08-03T21:29:44.899414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:44.984000Z","title":"Springer, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:44.984000Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:4e07fb19729f559acb9c828066b567a0a91fb972c49e8f09510bf960dea7da14","observation_id":"1e2ab035-e097-489f-9270-05d116e82fce","resolution":{"observed_at":"2026-08-03T21:29:44.984000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:45.132967Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:45.132967Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:bde6b1cc12dccf7de53b33332e80d042a4bb6ef0e3ca9fb64e269cb4f16ffc7b","observation_id":"771048e9-04a3-436b-8db3-6c5ec408ce2e","resolution":{"observed_at":"2026-08-03T21:29:45.132967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3359","last_updated":"2015-04-17T14:33:11Z","snapshot_observed_at":"2026-08-14T23:08:09.290957Z","submitted_at":"2014-12-10T16:35:32Z","title":"On DDoS Attack Related Minimum Cut Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.3359","snapshot_observed_at":"2026-08-03T21:29:45.235307Z","title":"On ddos attack related mini- mum cut problems.CoRR, abs/1412.3359, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:45.235307Z"},"links":{"cited_paper":"/paper/1412.3359","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:1fa2db629a073ddb2a596436aa996035067664fefa7a3ee262206cd7e2b3ad24","observation_id":"39cec7c5-a530-433c-9197-4077e7c182e2","resolution":{"observed_at":"2026-08-03T21:29:45.235307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:45.356727Z","title":"On the connectivity preserving minimum cut problem.J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:45.356727Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:55672aa40b701ad45764437853326b0b461599d56f7f68ab010be386386d3463","observation_id":"5ea4be7e-6689-4446-9a82-7cc21c4c2f18","resolution":{"observed_at":"2026-08-03T21:29:45.356727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:45.497949Z","title":"Cambridge University Press, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:45.497949Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:5278fb7ba2718c89104f459e7c1362cbe4b0d756a1ec29dd90bd87bd351e8d6d","observation_id":"0b3ada33-5a50-4083-bb4f-dc5f56f82435","resolution":{"observed_at":"2026-08-03T21:29:45.497949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:45.660871Z","title":"Golovach, Dieter Kratsch, and Dani¨ el Paulusma","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:45.660871Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:09a2ee2f5d9089df4d4cff0e822b795631a1d264ca89e74022f3e14e35e1d47e","observation_id":"07f90776-3d9c-4b87-9b8a-ad22528a8b52","resolution":{"observed_at":"2026-08-03T21:29:45.660871Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:45.827233Z","title":"Silveira","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:45.827233Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:219dc639c3b7000db09aac863e20acd3001e1b227eaf4db254f2757fc57f3b8e","observation_id":"3bf201c8-b4b9-471b-b069-52e52ca5447e","resolution":{"observed_at":"2026-08-03T21:29:45.827233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.006853Z","title":"The induced disjoint paths problem","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.006853Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:869487860ce2f6982e641991e55e68d7284091d984421d4784ded99f606bd0bb","observation_id":"f7443ed7-dcc9-4f3d-8d4b-2a4753765057","resolution":{"observed_at":"2026-08-03T21:29:46.006853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-18T13:16:33.714843Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03612","snapshot_observed_at":"2026-08-03T21:29:46.185199Z","title":"Connectivity-preserving minimum separator in at-free graphs, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.185199Z"},"links":{"cited_paper":"/paper/2506.03612","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:706e7ba2b3d313b755a0efb0b5c77ed0bb3c2d8154accc9b707e9e8ca2feb72a","observation_id":"c564c307-ebe0-4a08-8a47-1e1ce77083c3","resolution":{"observed_at":"2026-08-03T21:29:46.185199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.286456Z","title":"Disjoint paths and connected subgraphs for H-free graphs.Theoretical Computer Sci- ence, 898:59–68, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.286456Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:563898ad451dadb664bcfdc739ba96f11bb213802ca98f6a63a29ea49b1f3863","observation_id":"1447e27b-fb8b-4878-a4a3-9a951c39bb17","resolution":{"observed_at":"2026-08-03T21:29:46.286456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.441570Z","title":"Listing all minimal separators of a graph.SIAM J","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.441570Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:4c68796b6138d112386602f26143e1347038b274cfcd469ec7ac5dab1f0fbc76","observation_id":"30c5b272-ea3c-4cd3-83ec-7af71a6a6e06","resolution":{"observed_at":"2026-08-03T21:29:46.441570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.599182Z","title":"Clustering with local restrictions.Inf","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.599182Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:8d7a2e9a8427d36d882c2adf978a3b45340c23030b276590a4606cd878dffaa7","observation_id":"fba2588d-5e39-42b7-a356-8237921b5a9c","resolution":{"observed_at":"2026-08-03T21:29:46.599182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.704551Z","title":"Slightly superexponential parameterized problems.SIAM Journal on Computing, 47(3):675–702, 2018.arXiv:https://doi.org/10","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.704551Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:01548bb71d529578081f19ab49a3bc4dd5705855a84d2cea702159fd2d68bcee","observation_id":"624bfd16-b805-4831-8c21-eca50c596057","resolution":{"observed_at":"2026-08-03T21:29:46.704551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.857577Z","title":"Parameterized graph separation problems.Theor","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.857577Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:43137e935308347adfbd094a09df9b1a9e849bda0e7219205e87886cadef0ef7","observation_id":"b61d3bc1-e745-4688-8420-4d134161775f","resolution":{"observed_at":"2026-08-03T21:29:46.857577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.058819Z","title":"Treewidth reduction for constrained separation and bipartization problems","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.058819Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:08dc47b2618f5b1c076913c58ea1b6ac3ab6f025a18d6f07596e891b9e89037f","observation_id":"1f20aa7f-32d4-4d59-ae86-f657d8117d4b","resolution":{"observed_at":"2026-08-03T21:29:47.058819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.197479Z","title":"Finding small separators in linear time via treewidth reduction.ACM Trans","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.197479Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:fa2945e57e1247acdf936e13c8b08bde4cc649aa84c8b9effe8374de6cd04c82","observation_id":"f6c5ed0d-6e27-40d9-9298-7c6f5a0c60f8","resolution":{"observed_at":"2026-08-03T21:29:47.197479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.256095Z","title":"Fixed-parameter tractability of multicut parameterized by the size of the cutset.SIAM J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.256095Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:9bca8c4aca8e99f36c0f56d1bef5f4928885def1f7d5f8d455bdb95fe2873dff","observation_id":"698cac7a-ee88-432f-a280-7b3150f167dc","resolution":{"observed_at":"2026-08-03T21:29:47.256095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.329752Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.329752Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:45b572081f8c9583f3b7f11ce828e07a71e97ff9d22704b626e34449b906b736","observation_id":"8b6cf770-a0df-47eb-b51b-fb44fa9a30ee","resolution":{"observed_at":"2026-08-03T21:29:47.329752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1104.5361","last_updated":"2011-05-01T15:18:55Z","snapshot_observed_at":"2026-08-15T04:48:13.906856Z","submitted_at":"2011-04-28T11:38:24Z","title":"Large Isolating Cuts Shrink the Multiway Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1104.5361","snapshot_observed_at":"2026-08-03T21:29:47.395760Z","title":"Large isolating cuts shrink the multiway cut.CoRR, abs/1104.5361, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.395760Z"},"links":{"cited_paper":"/paper/1104.5361","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:711b93005101bce152ad6063658996d01a1d39e0a6c51ef6cac392172e68a6d8","observation_id":"373accb4-18e9-40cc-a57c-35e6a40e3671","resolution":{"observed_at":"2026-08-03T21:29:47.395760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0801.1300","last_updated":"2008-04-18T14:07:04Z","snapshot_observed_at":"2026-08-15T10:24:02.209162Z","submitted_at":"2008-01-08T19:04:14Z","title":"Almost 2-SAT is Fixed-Parameter Tractable","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0801.1300","snapshot_observed_at":"2026-08-03T21:29:47.481295Z","title":"Almost 2-sat is fixed-parameter tractable.CoRR, abs/0801.1300, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.481295Z"},"links":{"cited_paper":"/paper/0801.1300","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:5cbf22f82cac990447757ed7430f6b68f3fdfa5be876460543f93f692adfb052","observation_id":"3283ced6-777a-4999-a6f6-711a16106ace","resolution":{"observed_at":"2026-08-03T21:29:47.481295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.544148Z","title":"Connecting terminals and 2-disjoint connected subgraphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.544148Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:8ca8e480d42b85e1dca6a488ca53cb94069dfde4ae2f52461df512dfaf310eb4","observation_id":"e32dea9a-d112-44ca-8362-e51fdd2775bf","resolution":{"observed_at":"2026-08-03T21:29:47.544148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16629","last_updated":"2023-09-28T17:35:22Z","snapshot_observed_at":"2026-08-16T14:56:45.967070Z","submitted_at":"2023-09-28T17:35:22Z","title":"A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16629","snapshot_observed_at":"2026-08-03T21:29:47.666986Z","title":"Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, and Aaron Sidford","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.666986Z"},"links":{"cited_paper":"/paper/2309.16629","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:46feefd246d64a9a39343c432a545e0ed51dac29d06916bb603e30b026768653","observation_id":"4618bde4-25a1-4891-a141-b7080d7b563c","resolution":{"observed_at":"2026-08-03T21:29:47.666986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.787227Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.787227Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:5b0554fc58cc15e4a86dbada5d766a91f5e2ecf27034c9b06f4b46058d192d17","observation_id":"f1d6d920-f707-4921-9351-2ce371e3e754","resolution":{"observed_at":"2026-08-03T21:29:47.787227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.886789Z","title":"3.κ s,t(G′) =κ s,t(G)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.886789Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:c6d558471d26655f1921a6b7bf1e0b6cfc8bf0d4882464bd5821a0120605ef08","observation_id":"cd2c6b70-a290-4718-96e0-33422543a1ed","resolution":{"observed_at":"2026-08-03T21:29:47.886789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.995460Z","title":"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","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.995460Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:d4af4ca6e69b9e4d09ec8b5338b8de7202384ad2b7e279602fb4ba000a95abfa","observation_id":"5894093f-1eeb-4fcd-b030-8989c5096352","resolution":{"observed_at":"2026-08-03T21:29:47.995460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:48.105459Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:48.105459Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:3f08a26ab211d92266f07ec0b05e191982e63f10cbd35ccf27227d80760508cf","observation_id":"be3fecfc-2701-4692-8f89-061e83b05a0a","resolution":{"observed_at":"2026-08-03T21:29:48.105459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:48.239505Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:48.239505Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:41356518ecb6a170b7f17a4f1b9f4a769495e402202cddf6c92e8048af14d1df","observation_id":"3c06f49a-6f5a-4ee6-b8ef-2fa82a90dd5b","resolution":{"observed_at":"2026-08-03T21:29:48.239505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:48.355868Z","title":"We have previously established thatC q is connected inG −S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:48.355868Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:a903a70e081db1b56780318d0dfe07f74fdbd3a4f3b548324b6ef5b156d2f418","observation_id":"23c79009-3f75-4347-bc34-be8575ce21ff","resolution":{"observed_at":"2026-08-03T21:29:48.355868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:48.453441Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:48.453441Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:9525ffda3ccd42872aed570ec7aec6a1bbaa07db585016d10ea71a219c95a452","observation_id":"d261537d-18c8-41f8-8849-dbcc8283e2ee","resolution":{"observed_at":"2026-08-03T21:29:48.453441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:48.560075Z","title":"Ifx∈L t sA,t(G) thenκ sAx,t(G)> κsA,t(G)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:48.560075Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:f283b4d0e2cc82a47e3afbe1e57fcd51022f77f1dde7b23d557d1557bd62d349","observation_id":"bd40592a-1322-4c08-806d-9b17561f5df2","resolution":{"observed_at":"2026-08-03T21:29:48.560075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:47.583732Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":428,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:47.583732Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:0953f94012b52a6351419ba05a03e2711efeafc94d597350a2ced12597bbbf0a","observation_id":"4e6286fd-a4ff-4aa3-a04d-decf8907ae76","resolution":{"observed_at":"2026-08-03T21:29:47.583732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:29:46.957459Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":4},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-03T21:29:46.957459Z"},"links":{"citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:59885e3ec0e0ebfdfca39c7a85255a3ff4a0688b978d3e632a17eb070fe3a06e","observation_id":"4daaa329-d45b-4a99-a144-6fc7ab2748cb","resolution":{"observed_at":"2026-08-03T21:29:46.957459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T18:54:48.671889Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"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."}