{"as_of":"2026-08-08T12:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4f7538659a56d2ede6ab1600dc3a49f723b8e7255ad011ddad63cbacf5052ee","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:14:51.149153Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:29:46.185199Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T20:10:11.247425Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"cited_work":{"arxiv_id":"2506.03612","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03612","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Connectivity-preserving minimum separator in at-free graphs","venue":null,"work_id":"4fe59ac4-3181-4d64-b12c-cb66244d70b3","year":2025},"citing_paper":{"arxiv_id":"2511.15849","last_updated":"2026-07-01T12:26:40Z","snapshot_observed_at":"2026-08-03T21:29:41.349458Z","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-17T20:06:48.783567Z"},"links":{"cited_paper":"/paper/2506.03612","citing_paper":"/paper/2511.15849"},"observation_digest":"sha256:ed6fef946fac4f8e202a8cb6b775dc719ee4ba1d93d108b8ea8b14765886812e","observation_id":"2980c8b6-620a-4830-95bd-b54b5dca4a9e","resolution":{"observed_at":"2026-05-17T20:10:11.250237Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","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-03T21:29:41.349458Z","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:c6f5d46993a2169d995c25e3f29830daccafdccc8cc8e15220053b2f1fd7d73a","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"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03612/citation-record","integrity":"/paper/2506.03612/integrity","json":"/paper/2506.03612/citation-record.json","paper":"/paper/2506.03612"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.202981Z","title":"Fomin, Petr A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.202981Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:b60d8b69909c390a7570c801f53a969ab59eb548b98c2ed83dadcf977524326c","observation_id":"2d1e7853-8f14-4bd6-a1f8-f7747303b4b9","resolution":{"observed_at":"2026-08-07T11:14:49.202981Z","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-07T11:14:49.253129Z","title":"Generating all the minimal separators of a graph.Int","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.253129Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:4be99672afc498b5a3c696dd427435c4a0fb28a87f3c5e9f3f455d4a14b9f1e0","observation_id":"63a10bae-0450-4706-bbbb-d4f96e3407a2","resolution":{"observed_at":"2026-08-07T11:14:49.253129Z","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":"10.1016/0012-365x(91)90098-m","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.614729Z","title":"On the complexity of testing for odd holes and induced odd paths.Discret","venue":null,"work_id":"7366b29f-3142-4245-a021-3557f0271375","year":1991},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.332878Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:d4503a5f8f4a6ad9cdc70cbd13cc60a1ba35d6f3d8775474383cc8d236f6196a","observation_id":"598bcca9-1320-41e5-8c81-79d1026bd1f4","resolution":{"observed_at":"2026-08-07T11:14:51.670641Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.400797Z","title":"Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.400797Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:85cda6d045b62722794109746e29f5cd2f253fa157a616cf418aaec42e2c46a8","observation_id":"28a745e0-d4b1-4c3c-bb6a-5dcfc5ca3fbf","resolution":{"observed_at":"2026-08-07T11:14:49.400797Z","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-07T11:14:49.464157Z","title":"Asteroidaltriple-freegraphs","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.464157Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:a966fd8eaed7126210ee7040d2fc7f142d74dda123acaf795dacb56341c3db17","observation_id":"c37bfd43-1beb-45a2-ba76-bbd76ff37c7d","resolution":{"observed_at":"2026-08-07T11:14:49.464157Z","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-07T11:14:49.534069Z","title":"Kevin Wood, and Alexandra M","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.534069Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:9506187b8fe1d4c9ad30c1091092f262490f3a2c9d93312120dddab3b2f909e1","observation_id":"e4999f15-282f-4b1d-bf16-eb9915664069","resolution":{"observed_at":"2026-08-07T11:14:49.534069Z","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":"stable/4394367","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.061886Z","title":null,"venue":null,"work_id":"c8972b4b-d389-4269-ac35-13371dc706fa","year":2001},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.622687Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:f74aa9368d3868f7d9730f4c403f6eafda6188984a0f89c2d5365cd0f5c58265","observation_id":"1b525a46-27d9-44d8-9690-e727e8bfca8f","resolution":{"observed_at":"2026-08-07T11:14:52.148847Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-013-9796-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.459227Z","title":"Solving the 2-Disjoint connected subgraphs problem faster than2 n","venue":null,"work_id":"16bcb23e-c2fd-4b4f-a16b-e315971d8ab3","year":2014},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.695149Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:7c9cf5590300da107e2eaf0d622bdcf040717cb224787d61ba6bfe704fac0a15","observation_id":"71260d90-890a-48e4-b01e-87a011a8461b","resolution":{"observed_at":"2026-08-07T11:14:51.543638Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3359","last_updated":"2015-04-17T14:33:11Z","snapshot_observed_at":"2026-07-06T04:03:11.003049Z","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-07T11:14:49.769896Z","title":"On ddos attack related minimum cut problems.CoRR, abs/1412.3359, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.769896Z"},"links":{"cited_paper":"/paper/1412.3359","citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:6d1c434ecbb47b63ecab796d78662a7878becfcc55eb6fa2da8515853188771d","observation_id":"eaf44035-94a5-4d93-ac98-9772978c2f5d","resolution":{"observed_at":"2026-08-07T11:14:49.769896Z","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-07T11:14:49.865215Z","title":"On the connectivity preserving minimum cut problem","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.865215Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:3afc5ab7344f73d9d625518fb7d7db21fdb1edd8a324aa1d3417d9b72f0b8cec","observation_id":"3d545483-9c9d-4a48-acbb-974837e7fec8","resolution":{"observed_at":"2026-08-07T11:14:49.865215Z","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-07T11:14:49.946382Z","title":"Cambridge University Press, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.946382Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:03a4d6a4dfe921eaf336905a10962f85376b42d82b1056c9f237fab797caf8a5","observation_id":"c682d350-71a3-405c-bc65-acf01f23d90e","resolution":{"observed_at":"2026-08-07T11:14:49.946382Z","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":"10.1016/j.tcs.2013.02.029","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.311532Z","title":"Golovach, Dieter Kratsch, and Daniël Paulusma","venue":null,"work_id":"37e3c362-114e-47d2-a8ec-1a93c1956839","year":2013},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.063035Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:eed1084e38948e9ea405e0d362cbb09c7e029d5b625cff48c14e79d51b666e6b","observation_id":"38fd8627-f9ed-497a-892a-330a51790ee9","resolution":{"observed_at":"2026-08-07T11:14:51.381622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.168395Z","title":"Silveira","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.168395Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:31f6621f338a668ff16847a969fca3f4d563a6caeabbc0947d5b9218bef432bc","observation_id":"24677849-1791-4168-bcaa-1bd9d754cdf1","resolution":{"observed_at":"2026-08-07T11:14:50.168395Z","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-07T11:14:50.238663Z","title":"Liu, and Aaron Sidford","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.238663Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:6335fb40551fca8858e9b66d65e22996fde881fbf5bbafe471b1cf772dc1c7a2","observation_id":"20eb54f8-44f2-4a41-a5db-6e2230f7b768","resolution":{"observed_at":"2026-08-07T11:14:50.238663Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.670276Z","title":"The induced disjoint paths prob- lem","venue":null,"work_id":"5c8fc14f-e07a-40ee-bb55-55d34aa083bc","year":2008},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.337394Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:cea17dc8bc99b6542d4cb71625f820d302b3556df7f175a871ddb654cf18ce10","observation_id":"708dac6e-f2ef-4751-939c-39a5db2bc3ac","resolution":{"observed_at":"2026-08-07T11:14:52.723628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.423704Z","title":"Disjoint paths and connected subgraphs for H- free graphs.Theoretical Computer Science, 898:59–68, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.423704Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:077d5d3dec5b886cdf7baab8118fc78b321db3267c1e25f291e653570b079634","observation_id":"90276e95-f572-48fa-b84f-cb1f9e1362bf","resolution":{"observed_at":"2026-08-07T11:14:50.423704Z","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-07T11:14:50.517325Z","title":"Liu and Aaron Sidford","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.517325Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:d24ece8f8f8fdf57b0e4766f2d52b2b952592790bebd091e0134ad4d5f39fd10","observation_id":"c72a638e-8586-4e7e-a3cd-68f505f446a3","resolution":{"observed_at":"2026-08-07T11:14:50.517325Z","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-07T11:14:50.609573Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.609573Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:9d9a079867e750df145805490ab05e654aaae498085268b8d06c4c015a2ef088","observation_id":"f87c8e4d-3780-41d8-83fd-c3f9e681dcdf","resolution":{"observed_at":"2026-08-07T11:14:50.609573Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.545507Z","title":"Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discret","venue":null,"work_id":"2a5678de-01ae-45e1-9575-6092d9781040","year":2010},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.714534Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:aa983cffbd006a359f48b0b99f27efaf1c1347dc6fa4f644c662beb326302e60","observation_id":"5da8563a-db50-4285-a340-969a176d8709","resolution":{"observed_at":"2026-08-07T11:14:52.596834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.447332Z","title":"Connectingterminalsand2-disjointconnected subgraphs","venue":null,"work_id":"40bc0936-4eb0-40ea-aca3-fc104d59228f","year":2013},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.791589Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:4ca8e234bd5df6fa256f8ec131ae4d34fdf95203a8f5cc0f27465397674fc37d","observation_id":"a6527ac9-d0e0-4473-a8fe-8f02bcfa2e6f","resolution":{"observed_at":"2026-08-07T11:14:52.488266Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.877863Z","title":"Liu, Maxi- milian Probst Gutenberg, Sushant Sachdeva, and Aaron Sidford","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.877863Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:3fee8ea9393edf897403d1e07e24917e634270bca1894f04a15d70556f566772","observation_id":"93552626-48e4-4b2e-a889-4fc1af846008","resolution":{"observed_at":"2026-08-07T11:14:50.877863Z","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-07T11:14:51.002577Z","title":"Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.002577Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:d9a4da02fbe8bd242b831c9779a2b02b47d7a787f115b164ba7905c7a32b3095","observation_id":"b270c613-a5aa-4e27-ac54-5746d6d7dd43","resolution":{"observed_at":"2026-08-07T11:14:51.002577Z","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-07T11:14:51.079599Z","title":"Woeginger","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.079599Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:215918aeaac1248782985bf6adec616a2da23d206593f0117839956099efaa33","observation_id":"5c0afa7a-44c8-439b-b933-b4c5b7215f04","resolution":{"observed_at":"2026-08-07T11:14:51.079599Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.294545Z","title":"The input to this problem is an undirected graphGand a collection ofkvertex pairs {(s1, t1),","venue":null,"work_id":"5796e107-cea1-4b67-95fe-6dd0d5d16994","year":null},"citing_paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.149153Z"},"links":{"citing_paper":"/paper/2506.03612"},"observation_digest":"sha256:48a3028fa04bbd7e2c34900c34a902078cac2dba3b88fb8d7aa8c85b8bc4b452","observation_id":"99f63ebd-6582-49ca-8d51-2068f4f1b44e","resolution":{"observed_at":"2026-08-07T11:14:52.365860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03612","last_updated":"2025-06-05T11:49:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T10:56:42.999932Z","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":4,"verified_fuzzy":3},"total_outbound_references":24},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}