{"as_of":"2026-08-14T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cbb9becb8bc7d3d477c2685191866555e71f03df26be353bff2bc1cfa14a7213","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T03:40:17.954159Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2607.03266/citation-record","integrity":"/paper/2607.03266/integrity","json":"/paper/2607.03266/citation-record.json","paper":"/paper/2607.03266"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T03:40:17.954159Z","title":"Ahuja, Thomas L","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:bf63b5338d5a454be72ee877574dc6965a8282335dde44cbc4f9d66ee8ff6e6c","observation_id":"50bcf873-cdf0-45dd-a630-f7b1fa6c7df2","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Color-coding.Journal of the ACM, 42(4):844–856, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:e2bb2106738a32ffb3efb54ae3374601bb574d922d10439c862a9a18fb8432c1","observation_id":"02388100-c178-4354-8b0a-48250310d3c1","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Gutin.Digraphs - Theory, Algorithms and Applications, Second Edition","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:1ca9788e2fd99266af4971f1b127fcad0099f287853e131f952368b0a9b9c819","observation_id":"dbcde9a6-50e7-419a-bdbc-6a999e6156b8","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Fellows, Lars Jaffke, Tom´ aˇ s Masaˇ r´ ık, Mateus de Oliveira Oliveira, Gee- varghese Philip, and Frances A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:437fb8203643c4022b56d408acac7d35f1fb581543fa88aba49920bcadbbd4a1","observation_id":"ef2b7e78-99f2-4d8d-8fab-242bc7e8dd41","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Maximum flow and minimum-cost flow in almost-linear time.Journal of the ACM, 72(3):1–103, 2025.doi:10.1145/3728631","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:acedf4a68e91ab6033796ced9786b399a0c17785663bf4efc53f9c92c51b9b58","observation_id":"11ce4738-e58d-416b-929c-63b7feb8ee77","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Micha l Pilipczuk, and Saket Saurabh.Parameterized Algorithms, volume 4","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:902dca1e86f4dfb5b11f795b630e63596d105836dee145f365dc2a42f5e86cd5","observation_id":"1ae12dc6-eda2-4647-a4ce-0b3165b62fd5","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Finding Diverse Minimum s-t Cuts","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:398dd7d2c1a61084563df466e113df71bfd3b9c89c900e2582bcefa91e4a74e1","observation_id":"fd25a725-c94e-42c8-bd51-e51ae906313e","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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.1007/978-981-95-7127-7_27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Disjoint tours and the price of diversity","venue":"Lecture notes in computer science","work_id":"833edc94-8b16-40fc-a698-cc8b30625580","year":2026},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:2130c9e06397d60e08c24543fec40f70f115bed51df97d791b4430335153b0d9","observation_id":"fcd37211-30d7-4633-aee8-c19d68c86018","resolution":{"observed_at":"2026-07-12T03:48:29.094617Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:35.093976+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:35.093976+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-07-12T03:40:17.954159Z","title":"Graduate texts in mathematics, volume 173","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:8a1b4f31375ab70c3a6f37063257f337b3fd88a21886cbb95953e42e6b120889","observation_id":"86c19706-348c-47d8-92c6-8acc4412d1f8","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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.1609/aaai.v40i43.41013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding diverse solutions parameterized by cliquewidth","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"10a28099-caa6-4e11-afd5-371fac88125c","year":2026},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:3c6af1bcfeda663e5594915a09bc736181c895db045c2be4585334b28434d0a5","observation_id":"09f3802a-8bdc-4e86-9980-39963db13545","resolution":{"observed_at":"2026-07-12T03:48:29.128828Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:35.593292+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:35.593292+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-07-12T03:40:17.954159Z","title":"Fomin, Petr A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:bedc9d7fcbcdbee970e4e984404ed875b91d8d39e517e8ee0519d50cae44c917","observation_id":"4f21f8c6-3260-4809-8538-7c0ca2652d51","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Fomin, Petr A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:b7d344fb5831f8fcc59af838f1735bd43786054ed755f585309da67cf6f972c5","observation_id":"d6d69059-ac9a-419f-8e13-45a66003b958","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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.1609/aaai.v37i4.25511","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"2942a573-e5bd-49be-94f3-3704c3b6dfd4","year":2023},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:9cdee8bf7e2a814055efea3da97f214308f6e3004839e8217362ef3ca2a86a64","observation_id":"93944250-0945-4ca7-8556-0c57dcefb076","resolution":{"observed_at":"2026-07-12T03:48:29.147399Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:36.151426+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:36.151426+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v36i4.20290","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"9d663c8a-5b62-4346-ad67-eddb2be3f73b","year":2022},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:0dadcb8aa72df89b10dd4ed16d8a034331432927323003c52212807fb85c8988","observation_id":"1d3cc6d7-3ab1-40c5-8190-524a7bcc4cab","resolution":{"observed_at":"2026-07-12T03:48:29.130872Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:36.402794+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:36.402794+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v35i5.16495","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding diverse trees, paths, and more.Proceedings of the AAAI Conference on Artificial Intelligence, 35(5):3778–3786, 2021","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"86c4e856-8af2-4523-9e3f-45df27ed7b22","year":2021},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:7d3370c090ac824aa53c30e59d70b06fa328a14dfd1479825c77eed5d9ae4c84","observation_id":"4e62685c-047f-4bfc-8bd0-b285919b5378","resolution":{"observed_at":"2026-07-12T03:48:29.119165Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:36.642766+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:36.642766+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-07-12T03:40:17.954159Z","title":"Karger and Clifford Stein","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:b7110d4bb1bfa14c87d6b2cfa8b999b41281dd9e5a873c8ac38dd0fd77dec8e8","observation_id":"89a6d8d9-f275-4c4a-8f44-10288f9f3e49","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Flow-augmentation I: Directed graphs.Journal of the ACM, 72(1):1–38, 2025.doi:10.1145/3706103","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:874591b3e51a9772a4ecf624de3ad6463604775c616388e905691f2a97721561","observation_id":"8613ee95-e9ec-4256-b3ba-9cf86803e220","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":"Pearson, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:3152b78ac467de63fcddecfd33bf1746d63b2ee0b3efef88e560255e2e349720","observation_id":"3ca8538e-661d-4eae-9887-faf666ebd676","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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-07-12T03:40:17.954159Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:de5a37c340788f4e39f8a9b43642dea9535a51f7deb5582253b244399264f67a","observation_id":"82f7b7d4-b880-4571-9a32-9b00b6e92e8a","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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.1007/bfb0120902","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the structure of all minimum cuts in a network and applications","venue":"Mathematical programming studies","work_id":"7b59ca4e-0da4-4d09-8179-e85206fca364","year":1980},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:d0e3a795cbfeb056d774c6db4badc0915d556b7032a5b3705e3e6ca8f6d9134b","observation_id":"665aead1-9a8d-4ecb-8d1b-7b742ffa24bb","resolution":{"observed_at":"2026-07-12T03:48:29.105969Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:37.431585+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:37.431585+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0212053","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scott Provan and Michael O","venue":"SIAM Journal on Computing","work_id":"ab349a21-ea82-4828-bca6-641137534426","year":1983},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:62a64819c8de195fdcf7ad2694b8873570c2e0502a1a91e0dfe1e8a095b86136","observation_id":"625f3266-8798-4ff7-b221-afbbdc2e6b45","resolution":{"observed_at":"2026-07-12T03:48:29.110123Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-08T09:38:09.401001+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T09:38:09.401001+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01961544","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scott Provan and Douglas R","venue":"Algorithmica","work_id":"7264536e-dfd5-4689-92dd-a7b85875b1d2","year":1996},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:6e25d22439da8d6ec2a40aeb1f738c5bf19b27339e005911dcf3a21e8becfa6b","observation_id":"d3fdf060-4c1f-45a9-a3c0-468255fbb8c7","resolution":{"observed_at":"2026-07-12T03:48:29.097176Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:37.952632+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:37.952632+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-07-12T03:40:17.954159Z","title":"Depth-first search and linear graph algorithms.SIAM Journal on Computing, 1(2):146–160, 1972.doi:10.1137/0201010","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:c6a8584ed1fec3774c26264d27e8e5ba3af2a9dcc811547b397dd758e53fc240","observation_id":"8f90cca1-218f-40a8-9c5b-1859f2f451bb","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","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":"2217.322220","doi":"10.1145/322217.322220","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tsukiyama, I","venue":"Journal of the ACM","work_id":"27c1c4dd-698d-46b9-b349-05d326c94037","year":1980},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:729702244df9bb9921e8df11a75eab6a2164d0f25aef2b458b5cefa7d8e013b4","observation_id":"a5e12c4b-e5f4-45f8-8f27-f93d79e1d865","resolution":{"observed_at":"2026-07-12T03:48:29.101049Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:38.462873+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:38.462873+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-07-12T03:40:17.954159Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T03:40:17.954159Z"},"links":{"citing_paper":"/paper/2607.03266"},"observation_digest":"sha256:57f82f74c5125e6da6d524cf6cbfdb1f02252847130f3ec74bd446fb41ce8653","observation_id":"8096b732-a697-4829-b497-c08b0621653a","resolution":{"observed_at":"2026-07-12T03:40:17.954159Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03266","last_updated":"2026-07-03T12:35:53Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T19:39:52.475915Z","submitted_at":"2026-07-03T12:35:53Z","title":"An FPT Algorithm for Diverse Minimum s-t Cuts"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":25},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.03266."}