{"as_of":"2026-07-31T20:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b7f8e9007e50f1261e2a8e2429fc45c5e1518dd3bfad2fb66cd299c528d21744","coverage":[{"denominator":81,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":81,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T02:19:47.540967Z","state":"measured"},{"denominator":81,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":81,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-31T06:34:12.847434+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/2605.09821/citation-record","integrity":"/paper/2605.09821/integrity","json":"/paper/2605.09821/citation-record.json","paper":"/paper/2605.09821"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6539.274659","doi":"10.1145/2746539.2746590","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Space- and","venue":null,"work_id":"16c1602d-96cf-4e3f-b39e-8a40245abc47","year":2015},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:dd6f6f026dba7369b703e8a9141432bc6be21d705b190d1564d66f604e62cfbf","observation_id":"9d831092-6ee9-425a-9369-93136f853d5c","resolution":{"observed_at":"2026-05-12T02:21:15.554720Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976465.168","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ’21) , pages =","venue":null,"work_id":"b6a0ac05-ff79-4de5-9de1-94c4a19897de","year":2021},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:46a9abf1cefee3c9dfbee42136f361135972586e04744e083a60101fc310d6e0","observation_id":"ca5ee990-8ea1-4add-8d33-c930894115a3","resolution":{"observed_at":"2026-05-12T02:21:15.568604Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms (SODA '25) , pages =","venue":null,"work_id":"3dbbb99f-bf46-4d03-aa92-002e262d2664","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:c3891035aabe8285e1f4a793b6504b90a0548605a0ff7f79eb0febf837993cd6","observation_id":"5dd2b2db-eff3-4653-8792-90fa563a57b3","resolution":{"observed_at":"2026-05-12T02:21:15.571308Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"Proceedings of the 34th International Conference on Machine Learning (ICML 2017) , series =","venue":null,"work_id":"17f81b0c-fbe8-4884-a28c-67b40a612c7a","year":2017},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:f6aeefd9efd45f8c507d323fad9a8791feac6d87044fb94fdf9fd976359520dd","observation_id":"37b971c9-5cf2-44f8-838b-d3bf3311b52b","resolution":{"observed_at":"2026-05-12T23:16:56.223283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976465.158","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ’21) , pages =","venue":null,"work_id":"2243d0bc-6b92-4cb7-bd82-9129a2dd80fd","year":2021},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:be8bd59f1b5595d93076aad84753011ce38a504f451c4d4b5d1a49f2e8321d53","observation_id":"d5ba428a-9acb-40be-89ac-e85431a2f78d","resolution":{"observed_at":"2026-05-12T02:21:15.545400Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.124","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fully Dynamic Consistent k-Center Clustering , booktitle =","venue":null,"work_id":"a3354ac5-6c72-4d91-9b06-c2fb02e527fd","year":null},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:42046725dfcb4a90ae8d6aef33e035935b27fa7ffbd1c6187719987ea031f250","observation_id":"bf2fc023-0330-4926-822f-88ad0ed41677","resolution":{"observed_at":"2026-05-12T02:21:15.561840Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3344999","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online bipartite matching with amortized O(log2n)replacements.J","venue":null,"work_id":"64bad0d8-15cb-41d5-90ac-3a2c5fdd153b","year":2019},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:f507771bf9db11a56bb305cb4a53b3dc3424b404ab84f30d8a8c0d14b94c13ea","observation_id":"a9040c83-22c2-484b-b5f2-135bfaf3e712","resolution":{"observed_at":"2026-05-12T02:21:15.548092Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5399.305549","doi":"10.1145/3055399.3055493","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"2017 , isbn =","venue":null,"work_id":"dbb0fd88-2e69-4ed8-bdd4-50d47d776d88","year":2017},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:77a417900186196fce09b79c6fdca42006352fcf0841e5610d6c64027b5c8732","observation_id":"50e1f081-2ae6-485f-a614-c5c9c4cddb3c","resolution":{"observed_at":"2026-05-12T02:21:15.565845Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6539.274661","doi":"10.1145/2746539.2746610","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"doi:10.1145/2746539.2746615 , booktitle =","venue":null,"work_id":"ad90be11-23ec-456d-b91b-90d671374a96","year":2015},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:2877dc174ef28b5cc1590585e2edeff88ffc91c55034af9188d06595bb992138","observation_id":"37ac0493-ff91-4858-8ba1-c23a0d6ff0ad","resolution":{"observed_at":"2026-05-12T02:21:15.558954Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977073.57","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 2022","venue":null,"work_id":"a2c08468-0527-42d2-8213-a2597c250709","year":2022},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:732392fb34b40c6b0d3a91f3177c41dce57b8a9f05a29726f4360fc210f7e986","observation_id":"9bed9f7d-8925-461c-9401-d68912a0a21d","resolution":{"observed_at":"2026-05-12T02:21:15.550565Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3397535","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Symmetry Exploitation for Online Machine Covering with Bounded Migration , year =","venue":null,"work_id":"a4d8b19b-df82-4412-8eb4-e8ac8d22302e","year":null},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:ca1b98675636fc0cc985f7fd3da9ed500044e9ef7af613eb31bc05720ea5a9f5","observation_id":"8dd70197-ec09-432b-8882-bb4394992e44","resolution":{"observed_at":"2026-05-12T02:21:15.574167Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Discrete Mathematics , volume =","venue":null,"work_id":"24218574-bf3a-4081-b792-4f1a718e2870","year":2024},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0eb81bf1eab94f2e53e5e7937bb5ea5e11c5363342a55702dab5a261f8489934","observation_id":"432e74d8-18e9-4806-b689-d0d24975a258","resolution":{"observed_at":"2026-05-12T23:16:56.201062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":"0e171e52-420c-41bb-b0af-52cf5f8a3635","year":2019},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:83b08a6f02548a214a16e74483a01a1417d22929db3c1838be8eac0a4ca2e543","observation_id":"23b5ecf5-f8df-422d-ac27-649ad6bbbd93","resolution":{"observed_at":"2026-05-12T23:16:56.212173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2020.37","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":"a4f24786-c528-4421-a92f-b655b8ff89a8","year":2020},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0bd2edfc307dfa26a7b56486ea1fad7aa154bec5d42ed4d1fa70b2a02e6e549b","observation_id":"ebe011ce-cb8c-46ab-872f-5bcea889dd66","resolution":{"observed_at":"2026-05-12T02:21:15.427026Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7990.2023","doi":"10.1109/focs57990.2023.00008","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"a54acb03-1df1-4af5-8acf-770716891711","year":2023},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:cfccd2e768199c629c3cac4b32ae3aca45bd214e6ee84f2859a0fa0e3e604593","observation_id":"e8d5bb62-951f-4d2d-a182-a4c6c6564850","resolution":{"observed_at":"2026-05-12T02:21:15.452808Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-43948-7_47","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Changing Bases: Multistage Optimization for Matroids and Matchings , booktitle =","venue":null,"work_id":"7fdb4613-40b7-48b1-a51d-95a19095fca9","year":2014},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:6565316e5f721d4f9491f5552ed80f3ee4f6fe3e9eacfa98973e9ad10db3ae28","observation_id":"9c23c7ed-cdb3-402f-9a92-c83ef52d6881","resolution":{"observed_at":"2026-05-12T02:21:15.399687Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.162","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T03:25:19.646799Z","title":"Toth , title =","venue":null,"work_id":"d2e8b9fa-08cc-4883-950a-8597c1e32d62","year":2024},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:9e4deaad8beb544d423dac95400423bf811df89f1d9f9c41dea61ef9b6065ab1","observation_id":"242962b3-3fac-426e-ba0b-ed8c5ce3cd2f","resolution":{"observed_at":"2026-05-12T02:21:15.471310Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-31594-7_58","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Power of Recourse for Online","venue":null,"work_id":"bbaeebe5-445c-40f9-8590-9507a6b1f422","year":2012},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:6c78ad1fd7aaa9a779eaa242c846cca2de30b2bc9af3629471a1cc0ef6b5fcf0","observation_id":"b3174fcb-cf3c-4b52-a332-e6f38a90559c","resolution":{"observed_at":"2026-05-12T02:21:15.320562Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.103697","doi":"10.1016/j.jcss.2025.103697","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Online knapsack with removal and recourse , journal =","venue":null,"work_id":"650dc1aa-bc39-4585-82db-fa05f505b97e","year":2026},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:88839f7c181f6bb2b17984b1c6321cb2f3575b2a3aa972531fcc227932f64b69","observation_id":"4e91dcc3-88b5-463b-8b40-a8242e84e536","resolution":{"observed_at":"2026-05-12T02:21:15.468556Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4684-2001-2_9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:51:48.444144Z","title":"Reducibility among combinatorial problems","venue":"Complexity of Computer Computations","work_id":"1bb10773-16bb-4c1d-a221-e6dc7d920481","year":2001},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:d0f74e64d0ff19095fcbc2e051614064fffe02dd5f3913a64ec815fca97600ce","observation_id":"112e96ec-848b-4ea9-893a-ff6a6301ce70","resolution":{"observed_at":"2026-05-12T02:21:15.481761Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-15T21:50:53.857638+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-15T21:50:53.857638+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2008.06.046","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Theoretical Computer Science , volume =","venue":null,"work_id":"eb0488cd-0978-4726-85bc-ea856643fd40","year":2008},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:e384c278b046093e1bd016078cb2a35875c45391876f72039527a8bbb438a709","observation_id":"bdaa9b7d-7ff3-44b9-8945-0f0e542b7d9c","resolution":{"observed_at":"2026-05-12T02:21:15.353559Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6689.180676","doi":"10.1145/1806689.1806769","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Proceedings of the forty-second ACM symposium on Theory of computing , pages =","venue":null,"work_id":"cc079950-277c-4ed3-8b2e-596b296bbe30","year":2010},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:5a6289a0a5a02ce96dfa26668f7ac801d266a306810b67b1dd540ecfaf3ee459","observation_id":"3b167b7e-56d8-48b0-8339-ea584449f36b","resolution":{"observed_at":"2026-05-12T02:21:15.305677Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0404033","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"1991 , publisher =","venue":null,"work_id":"49dfd8df-910d-49d5-9e37-e58a1442cb47","year":1991},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:ecaa3a79576a087a18e126854519d682d45443237b1a673b0a53ca241e43b91e","observation_id":"062ba03a-d452-4c22-bb9c-652261ade4d3","resolution":{"observed_at":"2026-05-12T02:21:15.333468Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130917703","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":"7c5f91f4-239b-466a-b5d8-ad038f7b0519","year":2016},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:36fbd89fac2047c3966fb94d87bf9ea41e16a9ffaf2df8ba0214d0fd3ff2ad70","observation_id":"d5b65b74-a47b-4a0d-955e-b12d28c32d71","resolution":{"observed_at":"2026-05-12T02:21:15.534084Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"On-line Generalized Steiner Problem , booktitle =","venue":null,"work_id":"b92632bc-0280-4f97-8f3c-d07f4bc1eaf9","year":1996},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:43774045fbfb74e374b31cef053c094f9038fcbb905f3d3c12db0277b3aad358","observation_id":"4010cfbc-50e4-425a-adce-91b867558873","resolution":{"observed_at":"2026-05-12T23:16:56.219635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973402.34","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms , pages =","venue":null,"work_id":"6072371e-17b5-4223-bc28-a52c0c40d833","year":2014},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:c5cdc92989c975fba4599ffdaf0b7e9f9112d6cf84eb71992f76edb9e966da07","observation_id":"bc8ebd4b-0691-40ce-aa51-a2b4f7bae971","resolution":{"observed_at":"2026-05-12T02:21:15.541258Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539792236237","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T03:15:20.306619Z","title":"1995 , publisher =","venue":null,"work_id":"d12bd928-d4f6-43bc-85a4-f21febe47c31","year":1995},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:dfdeb935347ecc4b3e1ef800cd9bf82362907ad15fd352f71feafc217e395a4e","observation_id":"0ba27467-92b5-4a61-ba76-507b38db971c","resolution":{"observed_at":"2026-05-12T02:21:15.415414Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539793242618","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T00:04:05.724498Z","title":"1995 , publisher =","venue":null,"work_id":"4d37a1c6-7ee1-455e-8eb8-84c900cbe11c","year":1995},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:07468e3e6dc45577b0a7cbdafba258232c682dde659e11ba5c3b519fc5982bea","observation_id":"52eca355-3948-4aa6-a987-96339b058ade","resolution":{"observed_at":"2026-05-12T02:21:15.410400Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-12T19:19:40.12263+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T19:19:40.12263+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977073.125","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 2022","venue":null,"work_id":"f22fd8d2-fb94-45cf-8ead-004ce667f5a9","year":2022},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0fbd61e25a64eeb4ab6c76350afb69697006410a939527e875d6399f27baa785","observation_id":"d20ef06d-0eb7-4bcb-b9fb-84b79927028b","resolution":{"observed_at":"2026-05-12T02:21:15.318270Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3196.2025","doi":"10.1109/focs63196.2025","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Tight pair query lower bounds for matching and earth mover’s distance","venue":null,"work_id":"5fd4b01f-47c3-4faa-a1ac-715b003b010a","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:74ff7e3a57b4dd69a6d80c0b9b86dbbd824eb0cdc6788c5494fc7fe55580e85f","observation_id":"d0a39485-bcd5-4b08-8c21-439593fdf108","resolution":{"observed_at":"2026-05-12T02:21:15.378419Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":"e0c24709-c13d-4f35-9f9f-fe3c4cde09d4","year":2010},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:66f8177bb82febc7088a9e0b2d7b5408c56be47ab606b8181c0750b9c16ab4bb","observation_id":"1496d33a-bb54-4338-a90a-d5e73aad3274","resolution":{"observed_at":"2026-05-12T23:16:56.208558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01185867","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Westbrook and Dicky C","venue":null,"work_id":"397f4cf0-570c-48d2-84b9-844458cb245a","year":1995},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:f92e749f56e30eca3eb172da90a4f317046f9b83b51c6c3d9966e728416cdbe9","observation_id":"312f5653-42da-490e-8213-4a767556cf53","resolution":{"observed_at":"2026-05-12T02:21:15.499123Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8533.258618","doi":"10.1145/258533.258618","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"1997 , isbn =","venue":null,"work_id":"4027ea8d-bb74-4da1-be55-8f42dad29157","year":1997},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:8d27b2df8ec76099154e3260cdcb8d04fe5bdb8fde292aa351d849b9d0972080","observation_id":"860d6fee-44a6-4a1b-81fe-fd3f039ac90e","resolution":{"observed_at":"2026-05-12T02:21:15.357842Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2018.31","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Local-Search Algorithm for Steiner Forest , booktitle =","venue":null,"work_id":"32894e41-b405-484f-a1dd-0ea07426c91b","year":2018},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:6d128326012984c15e87a837124b41f0a8c49054012dcc8e8953bd6842962410","observation_id":"3a96d3dc-f52f-44f1-a125-fbba588a2338","resolution":{"observed_at":"2026-05-12T02:21:15.339261Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8608.248867","doi":"10.1145/2488608.2488672","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Klein, Shay Mozes, and Christian Sommer","venue":null,"work_id":"9e26826d-82c2-464d-89a5-3623696e1ef2","year":2013},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:931a21a348a4effedff24f4ac9781552633556246cd1d5f397e1b6370b4d618d","observation_id":"8bd81f6a-ef71-4f6e-acfd-87b34833b7f2","resolution":{"observed_at":"2026-05-12T02:21:15.330843Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:20:10.146244+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:20:10.146244+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00288961","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kou and George Markowsky and Leonard Berman , title =","venue":null,"work_id":"9dc8a22f-c746-483f-b1b0-9c49d7fb4a45","year":1981},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:4bd9243a3baa6135d3b0f7fbcd9e1df6b83795b34e987add2cbeff723e0e06a7","observation_id":"22fbace8-894e-4633-b29f-fb8b56b7a8da","resolution":{"observed_at":"2026-05-12T02:21:15.460877Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2020.42","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the Facility Location Problem in Online and Dynamic Models , booktitle =","venue":null,"work_id":"fc9ca458-fa81-43fe-b674-3254529884ff","year":2020},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:d008b7f30f3905881c4d8dfd871642af78f5cbc79023e15f8a5ce975bae24496","observation_id":"d588aef7-c281-4ca9-8c68-ddf6f69a05df","resolution":{"observed_at":"2026-05-12T02:21:15.464227Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"and Parotsidis, Nikos and Saulpic, David and Schwiegelshohn, Chris , title =","venue":null,"work_id":"9cbce6f6-ebe9-421d-bb19-4e550b6c6c27","year":2019},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:66204c45f6b736e879fbde19f22ea856c601618f31e86dcb7d62ebc65422d887","observation_id":"e8fff05c-9503-45f8-9e86-5ce2ed60805a","resolution":{"observed_at":"2026-05-12T23:16:56.229859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-60220-8_62","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Kao, Ming-Yang and Krishnan, P","venue":null,"work_id":"0062a26f-554a-4b96-9864-b4554f3310a8","year":1995},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:6a483a09b18f032747eade4838d581ca1bd0aa6c0a59e58c4272732396bf63eb","observation_id":"ca4ef0b7-1e76-44d7-9706-10028ed799b6","resolution":{"observed_at":"2026-05-12T02:21:15.447391Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2009.506201","doi":"10.1109/infcom.2009.5062016","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"and Lin, Henry , title =","venue":null,"work_id":"cde3f63d-46ab-4ce0-a30d-a0290ecadc29","year":2009},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:8fc2cb1aef0b5021a97e9ab42bc25523879487285e3b8b15c04143a7de3f65ef","observation_id":"aa0a97f8-fcc7-49e3-9853-2047a9e6f9c6","resolution":{"observed_at":"2026-05-12T02:21:15.423827Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2014.48","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"2daa93b1-4e1e-46e3-b4a6-e499301025f9","year":2014},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:9ccd810d72b8338f2228b0dd0b5190a1c98fed7ee8d7cb0fc77be6ad70c6cacc","observation_id":"b63328c6-d628-478c-91a7-9a6787cfff86","resolution":{"observed_at":"2026-05-12T02:21:15.308412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7088.167201","doi":"10.1145/167088.167201","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC) , pages =","venue":null,"work_id":"c151dae8-48be-4836-94e3-bfd4aac28c95","year":1993},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:ab174fb717b67c158a52e0dc6f0a39cde92c2acef3d3fb368130e55605852fb8","observation_id":"d82c7f4c-8326-48e2-b8a8-c1090587ccd0","resolution":{"observed_at":"2026-05-12T02:21:15.478456Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.1074","doi":"10.1006/jagm.2000.1074","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Journal of Algorithms , volume =","venue":null,"work_id":"1e5ccd34-b3eb-4a2c-8951-fcb7903499df","year":2000},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:eb3c3dca0d3269394a7a28a0a6f241d0c1750901fd0a61efd6bcfac0e5e34ec7","observation_id":"678956df-d45e-4709-99c3-1c66645a05b2","resolution":{"observed_at":"2026-05-12T02:21:15.388051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/pl00009263","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Zhang, Lisa , title =","venue":null,"work_id":"75568ffe-69d7-4c5e-ae49-c56801987d5e","year":1999},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:645949c387d2b4361217292c040a75bd4b8b5b11c69d28e460c00b7e81b560e2","observation_id":"4d1ff14a-7799-4fb3-9d20-fae3fea1327e","resolution":{"observed_at":"2026-05-12T02:21:15.336334Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1090.0381","doi":"10.1287/moor.1090.0381","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Online Scheduling with Bounded Migration , urldate =","venue":null,"work_id":"2f422736-dace-44c3-8c92-b5428c876237","year":2009},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:d1cd489ae9eede43c54c5b5f59d5d22c85f88287879716ef1fb904068e85ec48","observation_id":"e9d27abd-db6b-4a53-836f-a630cd25ef6e","resolution":{"observed_at":"2026-05-12T02:21:15.503375Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-15775-2_4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Robust","venue":null,"work_id":"2f5d65ad-f226-437c-be43-884e500d8b17","year":2010},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:3327bcc6b5b37cac38637c1e1f706ae888142ad2f3025f47857665e1f9b557e3","observation_id":"46c795e0-4045-45b7-9017-958f2ec8d06c","resolution":{"observed_at":"2026-05-12T02:21:15.474414Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-012-9718-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algorithmica , volume =","venue":null,"work_id":"10b97506-a898-4e6e-9fb6-31f541deacd0","year":2014},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:c69528300c723a9c86aec20b1013a21f3e40d3617a1ba2114f557ab33ffc4fd3","observation_id":"0545e426-ed8b-421c-8458-124c427ab295","resolution":{"observed_at":"2026-05-12T02:21:15.484335Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1999.1662","doi":"10.1006/jcss.1999.1662","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Plotkin and Orli Waarts , title =","venue":null,"work_id":"2e22b87d-a67f-491d-8bd5-993c6d3c9450","year":2001},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0ec97359013d02c7b4c02d1644f7347a7c257ab734c349a3688011d163be2e62","observation_id":"c1103a26-9c36-4a30-8c04-1b4c84315c7d","resolution":{"observed_at":"2026-05-12T02:21:15.383485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973402.35","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maintaining Assignments Online: Matching, Scheduling, and Flows , booktitle =","venue":null,"work_id":"86ec6721-69ec-438d-880c-065d77a81e93","year":2014},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:3ed158101daeb9966fe224c870bac580771d7c2b4bb16e0d9b6c4112a3484a2b","observation_id":"13a6de5c-1101-4bfe-960d-a46378e6803f","resolution":{"observed_at":"2026-05-12T02:21:15.402479Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4246.358522","doi":"10.1145/3564246.3585222","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse , booktitle =","venue":null,"work_id":"1e484169-d898-4e8c-a7de-6b8e8a38d28f","year":2023},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:e17d8eebce5e3c9af07a876e07dcb0f96018572e72321b16a697e064d1b4e756","observation_id":"a273def2-1424-40c3-b3b6-791543bda9c3","resolution":{"observed_at":"2026-05-12T02:21:15.419515Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3276.331637","doi":"10.1145/3313276.3316373","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"https://doi.org/10.1145/3313276.3316379 Fully dynamic spectral vertex sparsifiers and applications","venue":null,"work_id":"2c2618da-47d9-4871-9501-0cff1a660fe2","year":2019},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:6b9bca2e5f8e8d86e337a778fe5bc65864616d769400da03d4a59fc2bdfa3b5c","observation_id":"fe66127e-c3e0-468e-942c-0a9993d7afc6","resolution":{"observed_at":"2026-05-12T02:21:15.431848Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.00033","doi":"10.1109/bigdatacongress.2019.00033","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"A New Deterministic Algorithm for Dynamic Set Cover , booktitle =","venue":null,"work_id":"19627eee-0e89-4dd3-a28b-fde4d86740a4","year":2019},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:203d20e5cf198f744ed11ce650b138800451ec306a4055c1e286f839a7ff3a2f","observation_id":"f3044537-2468-4810-85a1-fb94b96ec9b0","resolution":{"observed_at":"2026-05-12T02:21:15.367939Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6700.2020","doi":"10.1109/focs46700.2020.00013","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"c016149e-231e-40ae-a771-6cdae0f78587","year":2020},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:9ecaac03786e366b9b85373341ac9e3a20beed037bc7710486376b09d232b11c","observation_id":"3459b5c9-dbe6-46f2-a9a3-5097d9966bab","resolution":{"observed_at":"2026-05-12T02:21:15.530455Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976465.150","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , booktitle =","venue":null,"work_id":"776d0202-3348-4489-aee9-578a23255b23","year":2021},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:eeb87b3c3d32edc56a393b92f64c276acdce416c831eca4728d2b73bfe57c9ea","observation_id":"6dbb00be-e247-46dd-9cf5-bb7cdc0cf040","resolution":{"observed_at":"2026-05-12T02:21:15.517265Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2021.8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach , booktitle =","venue":null,"work_id":"c035c5f3-c312-466a-b637-422055b15610","year":2021},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:c8964226064211fbd21de2780a876399849c6e3c0ecf255ff2b82a6712e4a85d","observation_id":"b5600b2b-cdd8-47df-bcc0-24289bb48ddc","resolution":{"observed_at":"2026-05-12T02:21:15.395610Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"Efficient and Stable Fully Dynamic Facility Location , booktitle =","venue":null,"work_id":"2a2a2abe-8274-4c82-83d5-5e7c669156d9","year":2022},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:ccf3872af07546405d1d9ed28b63141d0d5ecaaa69a5d9ade4b0dd4f05ef6aca","observation_id":"08d339b2-b366-4e8f-a926-e4bad0ce26dc","resolution":{"observed_at":"2026-05-12T23:16:56.215623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-48447-7_34","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic Representations of Sparse Graphs , booktitle =","venue":null,"work_id":"d2a4ccee-b139-4843-9aef-9d97a0775d83","year":1999},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:44f76e50cbe454c9ef2bc615c0438ab0b219cdbbe013654f78965a2cadac56f7","observation_id":"fa1e2168-386a-4548-928c-eeb7c1cdca2c","resolution":{"observed_at":"2026-05-12T02:21:15.392275Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7713.338432","doi":"10.1145/3357713.3384321","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Smoothed complexity of local max-cut and binary max- CSP","venue":null,"work_id":"2665333c-f1e6-4c6f-a877-f7844887bda6","year":2020},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:2dc0579014697b7fa42e5df12cd51e03e1bf6ee180f7e2042848c5fae366cb0a","observation_id":"7c8d2b09-d553-4327-acc6-5f51a1e20969","resolution":{"observed_at":"2026-05-12T02:21:15.513752Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5447.351215","doi":"10.1145/3485447.3512156","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Bera and Sayan Bhattacharya and Jayesh Choudhari and Prantar Ghosh , editor =","venue":null,"work_id":"53de3f0a-05b4-4b1e-b923-73a528aee39b","year":2022},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:6a63581bab319b606ff3110d0dd90a3c4834f629fdc75cb6c9285ccc09580a8b","observation_id":"14838b74-72d2-48ba-aea3-b2a380a6718d","resolution":{"observed_at":"2026-05-12T02:21:15.324209Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3392724","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2020 , issue_date =","venue":null,"work_id":"ef2ac7c8-4ad4-492e-8fdb-d6c8b5fe6a3a","year":2020},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:c942476f117e1d6886bc695f2d1e5ac6d006176df8ed95023d4f45dd9e9c2b8e","observation_id":"f323cb9a-1664-4019-a92f-db8873d6ac4a","resolution":{"observed_at":"2026-05-12T02:21:15.316044Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8745.318892","doi":"10.1145/3188745.3188922","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"5 Sepehr Assadi and Shay Solomon","venue":null,"work_id":"d033dd19-fda7-40c2-a6e6-3683a283eed6","year":2021},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:3e56b15b37d3194ab0083aa0d8b02c533850042c69e97f4101e90fd3803617d9","observation_id":"8f22aa00-b759-47b8-b292-3bd05d65ae67","resolution":{"observed_at":"2026-05-12T02:21:15.313474Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4422.234442","doi":"10.1145/2344422.2344425","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"2012 , issue_date =","venue":null,"work_id":"7ca7474c-7e89-4a0c-9ab8-9888d3ccb9c1","year":2012},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:96c9ba96af1c8c220e720db8a64e6d0c4eb8094ad7284e786a5022d9ead847c0","observation_id":"cf359985-5348-4a33-b3ff-74a17bd0133c","resolution":{"observed_at":"2026-05-12T02:21:15.440345Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2022.17","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary , booktitle =","venue":null,"work_id":"f9ca9737-42c4-4a3b-b2a2-6945b5f00f8e","year":2022},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0bef0957c1b8b9bf8f5d6a808ec841f1218eb56e23ce1ec0d4870e4453d83070","observation_id":"179f261d-a733-4a60-a1da-e83dfc0cf4a8","resolution":{"observed_at":"2026-05-12T02:21:15.341886Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2018.8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online Maximum Matching with Recourse , booktitle =","venue":null,"work_id":"1abe8e8e-7fa2-4093-ab38-05515d6865b3","year":2018},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:ca8e4e0d1b520d0038e0df71663f03525d7d97e397bfabeb9a18c0769dbc7512","observation_id":"7355b7e1-4336-4348-86d7-9dfa3eaf50b5","resolution":{"observed_at":"2026-05-12T02:21:15.412855Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"Forty-second International Conference on Machine Learning","venue":null,"work_id":"8296ac83-dc1d-43eb-8f71-86b009f11a22","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:b807918256b88b94001c7a574228eba86c27ee7c2fb755cdc688cdbb53efd4f6","observation_id":"4d40fa4b-08e8-40d1-8d50-7436dc2610ea","resolution":{"observed_at":"2026-05-12T23:16:56.234020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"The Thirteenth International Conference on Learning Representations , year =","venue":null,"work_id":"3be625d7-4a7e-4f6a-b5e9-cfd10aed5405","year":null},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:c1345bdf18e6b1cef11689c4786cb71f1443281d87f4aed2b7b1701bb2ede517","observation_id":"50150224-c306-41cc-ab5e-92431e954827","resolution":{"observed_at":"2026-05-12T23:16:56.226651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2021.57","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Generalized Matching Reconfiguration Problem , booktitle =","venue":null,"work_id":"b158474a-a299-4cd5-b522-b92f09b824dc","year":2021},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:b98af7d28ed19d7d9a553cf224a4fd0152169924e7ceab454f04a9a8088d3243","observation_id":"ab3e50c6-b7a8-4dba-9459-b946b8c20680","resolution":{"observed_at":"2026-05-12T02:21:15.326896Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-59835-7_14","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fully-Dynamic Load Balancing , booktitle =","venue":null,"work_id":"bb2205d2-8640-4819-bb4c-adf5a1779f27","year":2024},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:22c25badd376fa01cb885d4531f8e8a8699b5860fc9e93b85e741eba3249b9f8","observation_id":"cee922f9-4cf4-4619-ac53-4ed9ca9b6c63","resolution":{"observed_at":"2026-05-12T02:21:15.506360Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2017.51","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"URL:https://drops.dagstuhl.de/ entities/document/10.4230/LIPIcs.ITCS.2017.51,doi:10.4230/LIPIcs.ITCS.2017.51","venue":null,"work_id":"d9c7b371-5cb5-426c-a406-54c8c1c75f40","year":2017},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:25e32fc7550d14e5da1d54102b8605d257bd845a4764251dc41d91f94b61eaf2","observation_id":"fa9d0d40-05ef-41f3-9fd4-e4947fa15432","resolution":{"observed_at":"2026-05-12T02:21:15.537880Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-13T23:19:49.95336+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T23:19:49.95336+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.149","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Karlin and Sherry Sarkar , editor =","venue":null,"work_id":"96007160-ee45-4676-b1a4-2416432138f6","year":2024},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:15354ecc67271976a06bba74caf4ae4dbe8928c64ff6e423ffbdcbf872179185","observation_id":"6f334cd2-4832-4b83-a36c-f64bb43eeb26","resolution":{"observed_at":"2026-05-12T02:21:15.407618Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.00032","doi":"10.1109/focs.2019.00032","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"d26fddd0-efee-4e6b-bcd7-6f227c0e2c22","year":2019},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:9a98084b57495b1a0b7e8f154a74ffbf6e9535f8d51a2115dd46693bb5824057","observation_id":"c767829e-2ce5-4476-9c98-e28da295737c","resolution":{"observed_at":"2026-05-12T02:21:15.496255Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-05-25T15:23:50.008408+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T15:23:50.008408+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.08485","doi":"10.48550/arxiv.2511.08485","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"11 Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger","venue":null,"work_id":"2acf0c89-7a1c-4623-aebe-0281d58d5074","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:37d440e9b15932d74d3604f88fde878f7a34eab11cb47d2d2010e4cf06ee388f","observation_id":"a99f8e80-17b1-46a9-ac96-eb45f3320d65","resolution":{"observed_at":"2026-05-12T02:21:15.487950Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.07354","doi":"10.48550/arxiv.2511.07354","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"CoRR , volume =","venue":null,"work_id":"851f30ce-a560-4450-b780-6ccef66ac8de","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:304f9d848eac84b11920914f1f64681304d5c4cfd5f2517bbcce06576323c8a2","observation_id":"a1c7ddde-0ead-4ae6-9fd5-45a6e5fec12e","resolution":{"observed_at":"2026-05-12T02:21:15.349682Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1266.2024","doi":"10.1109/focs61266.2024.00007","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Minor containment and disjoint paths in almost-linear time","venue":null,"work_id":"4d4ecf63-4e54-473f-89a4-027172eeb7e8","year":2024},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:35b6b2b4932464f5e30bf8690b16cdc16b55ac57002e3b381e9ab7da2af8bb80","observation_id":"243433fb-e9ee-4c3f-99e1-0c49711fead2","resolution":{"observed_at":"2026-05-12T02:21:15.362890Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:44.276639+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:44.276639+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.24","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-","venue":null,"work_id":"8c7b1da6-8837-4ac0-8e61-3a502b7c9989","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:41f48d350aafaba9d3947c7b3e206d32462f90a56d743cf71c4d1fb7d6508964","observation_id":"f8da0e08-8820-4754-a399-e981f33e6d62","resolution":{"observed_at":"2026-05-12T02:21:15.405145Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3057.293308","doi":"10.1145/2933057.2933083","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"A Distributed (2+","venue":null,"work_id":"80b5b746-59fb-4ac7-9a16-94b85528e937","year":2016},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:23d25ce4072a7f38746fac24a0a9ed4dd3b3cb044e2feffab65af1510462c41c","observation_id":"2866e57a-0800-405a-9f42-9103d85909b3","resolution":{"observed_at":"2026-05-12T02:21:15.444233Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4246.358521","doi":"10.1145/3564246.3585210","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"A Borsuk-Ulam lower bound for sign-rank and its applications","venue":null,"work_id":"44116998-3782-451c-8212-08c8083c77b4","year":2023},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:ec265de256317329190d89a1e7f0ff773af3100a8349ac9f0a03eafe6b25dc20","observation_id":"98602975-353b-43ef-9d9d-0637ef7e6782","resolution":{"observed_at":"2026-05-12T02:21:15.491739Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.13605","doi":"10.48550/arxiv.2511.13605","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"CoRR , volume =","venue":null,"work_id":"71da930e-37fc-456b-8f0c-3b3aef79b6db","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:f8eff966c48f80566d5779dd181aea8d285adc92e373f31a047c48407d163ef3","observation_id":"b15debe6-7bf2-4222-a8ef-2834f57b2d2a","resolution":{"observed_at":"2026-05-12T02:21:15.436390Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+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-06-05T21:23:00.469572Z","title":"Consistent Submodular Maximization , booktitle =","venue":null,"work_id":"a58ecfa8-2861-4820-8ad4-dbc5a080d3f5","year":2024},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0eac2b2481390d3c1c58a1a99bf94a0507c347e672cee3276eeb05a2ee0389cd","observation_id":"591d30c2-3e92-49a6-873a-65654f0134ec","resolution":{"observed_at":"2026-05-12T23:16:56.205006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7823.371813","doi":"10.1145/3717823.3718130","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Cost of Consistency: Submodular Maximization with Constant Recourse , booktitle =","venue":null,"work_id":"f0c21504-fcef-4bd4-a838-9eaab1c2a09f","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:0070de51499b8d95700c640625990891e6ac023f33a9fa18da4d5a159d0e98e6","observation_id":"136066db-29c1-4b02-ada1-a4854a4f0350","resolution":{"observed_at":"2026-05-12T02:21:15.523863Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.18460","doi":"10.48550/arxiv.2511.18460","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"CoRR , volume =","venue":null,"work_id":"e471fc87-addd-4ab1-95a3-721b4c6b4d94","year":2025},"citing_paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-12T02:19:47.540967Z"},"links":{"citing_paper":"/paper/2605.09821"},"observation_digest":"sha256:abbce113167861182010931b4edd5bfd1c4f8317507216df76022368930490e9","observation_id":"30545221-c6fb-4808-9be6-fedd798b4618","resolution":{"observed_at":"2026-05-12T02:21:15.373460Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.09821","last_updated":"2026-05-10T23:54:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-10T23:54:46Z","title":"Online Steiner Forest with Recourse"},"reference_resolution":{"displayed":81,"state_counts":{"malformed_identifier":0,"metadata_mismatch":16,"parse_uncertain":0,"unresolved":0,"verified_exact":55,"verified_fuzzy":10},"total_outbound_references":81},"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-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"thesis":"As of 31 July 2026, this Paper Citation Record lists 81 of 81 outbound references and 0 inbound Pith citation observations for arXiv:2605.09821."}