{"as_of":"2026-08-14T12:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e59f5949f3b6b0da9c2c1ae01f5c30cb3e80a77ad50ce55f1c750047af863aa","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T01:57:09.797119Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2604.24571/citation-record","integrity":"/paper/2604.24571/integrity","json":"/paper/2604.24571/citation-record.json","paper":"/paper/2604.24571"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070710494","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Gregory Z","venue":"SIAM Journal on Discrete Mathematics","work_id":"1ea9cd6f-0425-443a-ac7c-56d146b9d8df","year":2009},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:81cd04cac715b4cd06cad534bde82464770729b8d294e14ae5d42ced057dc457","observation_id":"9d0f1c95-2406-43f5-b5ac-33d01f96643d","resolution":{"observed_at":"2026-05-09T01:09:32.347528Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fellows, Lars Jaffke, Tom \\' a s Masar \\' k, Mateus de Oliveira Oliveira, Geevarghese Philip, and Frances A","venue":null,"work_id":"c4d57b05-3368-40d9-94c6-debcb11a3246","year":2022},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:0959ed8465fc173366cfa12fa08b2a299d91c997fe6b004107bc1effde97a103","observation_id":"7379a117-9e31-48cf-9de5-d61bd66fcaf7","resolution":{"observed_at":"2026-05-26T23:53:13.968937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"FPT algorithms for diverse collections of hitting sets","venue":null,"work_id":"7c0ce969-5098-4cf3-b1f1-9170c0b39419","year":2019},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:7508ed2a28717f2da04e18004bdfb1c929cba705fb6b5b386adc76260ce32efc","observation_id":"35e42ba3-bcdb-4ace-a00a-adb439bc77ee","resolution":{"observed_at":"2026-05-26T23:53:13.961674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m1048975","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Spotting trees with few leaves","venue":"SIAM Journal on Discrete Mathematics","work_id":"c21de9ad-7621-42b2-add7-b21e9a63df63","year":2017},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:2706ea52581dd87dd8fdd1be98df272abd17621f3fac497c02555495c747f2ed","observation_id":"316cf002-146a-44f7-83ec-2341c7ee5453","resolution":{"observed_at":"2026-05-09T01:09:32.362567Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4612-0619-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:38:28.438748Z","title":"Random graphs","venue":"Graduate Texts in Mathematics","work_id":"6abfd059-d96a-4168-bf93-93d5dd4b2dc1","year":2011},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:56e2ccf98238064b8ac24b17de96c59eeb69a8c9e1730567ed24f508f6be0e26","observation_id":"3b8fbce0-a272-48a0-81d4-d21791997995","resolution":{"observed_at":"2026-05-09T01:09:32.351457Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-45138-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T19:25:32.054552Z","title":"In: Rovan, B., V ojt´aˇa, P","venue":null,"work_id":"b0df8ffe-01ec-4da0-8bb2-03cec80e8e19","year":2003},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:c7d143ae9bd3ca26bc7b4b02ed37f8f2dbbc4070f217f6edc5906d13a3eb1c25","observation_id":"f3a8b5c0-5a49-42ee-b050-52aaa671e96c","resolution":{"observed_at":"2026-05-09T01:09:32.344636Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:22.259584+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:22.259584+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2000807.2000812","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bonsma and Frederic Dorn","venue":"ACM Transactions on Algorithms","work_id":"a41047c4-fb00-4315-a41b-07693b7feb40","year":2011},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:5877111ac44d35a00ee15b08dea36c0c1686a2c54bb7d48b311da9bf0c9bbe17","observation_id":"e9c43944-74c2-476b-982d-1e20adeef8a4","resolution":{"observed_at":"2026-05-09T01:09:32.341867Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10878-017-0245-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An approximation algorithm for maximum internal spanning tree","venue":"Journal of Combinatorial Optimization","work_id":"2270bc8f-6322-4d35-92d7-70b212a1d9e7","year":2018},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:94a02eef0f999ca717996c6fc75e53d2f309e89d2bdbe1c999d9b1eef8a9ecde","observation_id":"74aaf39c-3103-4c0d-9c9b-d35bc6f67fe0","resolution":{"observed_at":"2026-05-09T01:09:32.445514Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2010.01.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Gregory Z","venue":"Journal of Computer and System Sciences","work_id":"9718bea9-7dfe-4f17-982a-8036b616ce01","year":2010},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:45de92e75ef464a63720dc1abb0375de98b1490e24d1e1e9beaeae17a535df26","observation_id":"69691095-3d1d-4c6b-82f4-693195696ef0","resolution":{"observed_at":"2026-05-09T01:09:32.337032Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":"58b151b4-a3e3-4ce9-839e-1c5bb3ea0a7d","year":2015},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:17047e75e4cc22067972a43bc0ebf32741e53b0d0bb799837e3a622cfb92c3a1","observation_id":"3be00a58-9e9a-4aa1-8a0f-5479b000775f","resolution":{"observed_at":"2026-05-26T23:53:13.998701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0810.4946","last_updated":"2009-08-18T07:52:06Z","snapshot_observed_at":"2026-08-01T15:14:03.919345Z","submitted_at":"2008-10-27T21:44:42Z","title":"FPT Algorithms and Kernels for the Directed $k$-Leaf Problem","version":3},"cited_work":{"arxiv_id":"0810.4946","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0810.4946","snapshot_observed_at":"2026-07-04T15:47:59.232027Z","title":"Gutin, Eun Jung Kim, and Anders Yeo","venue":null,"work_id":"09fdd563-104f-4cb0-8085-2bd954d85ac8","year":2008},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"cited_paper":"/paper/0810.4946","citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:8269488981cdcbb3535c79c02f726bc3cd1bc49b6832a96f622941a63ba425f9","observation_id":"4fd63b38-1683-4e45-9a0a-25c46c64ae43","resolution":{"observed_at":"2026-07-04T15:47:59.232027Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-11269-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On finding directed trees with many leaves","venue":null,"work_id":"121be6c4-94e6-4c4e-b5a9-45be40c1db4d","year":2009},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:9fe28a62d26873930560fe20afc639a233d50c403350b4eeb9f9d61e10a72f86","observation_id":"d5316e8b-b684-4cc4-a8b0-42e4d0160ebc","resolution":{"observed_at":"2026-05-09T01:09:32.376412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2009.04.012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gutin, and Eun Jung Kim","venue":"Discrete Applied Mathematics","work_id":"e602a79f-f3bc-454f-8b9b-3006eccdf199","year":2009},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:3bc039944f44dd09fddad5f359eb2e8df5dfe8a0550d7fd666abe2b26f292498","observation_id":"2d451471-199a-4038-bc5a-4484cd35ce20","resolution":{"observed_at":"2026-05-09T01:09:32.379534Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.orl.2009.03.004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Woodruff","venue":"Operations Research Letters","work_id":"7aaf1e0b-e435-4088-b12a-189d8fc5cd8c","year":2009},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:e80fbec4f212d6d66b6b644d1616f06c8e4d60c00a695aade765a7f326edb612","observation_id":"830fe41f-5806-4ce7-8cdd-cc8140dfa7dd","resolution":{"observed_at":"2026-05-09T01:09:32.422158Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.isaac.2023.24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"e03ff695-eef5-4b2d-8479-2d04ff551b49","year":2023},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:590f02353ca22551069b5c6439fe509fbef0af84d5f7cdc6e42efe819d780395","observation_id":"1f7d04bb-75f0-4e3f-ab8d-194265c7b3a0","resolution":{"observed_at":"2026-05-09T01:09:32.441416Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:34.841251+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:34.841251+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph Theory, 4th Edition , volume 173 of Graduate texts in mathematics","venue":null,"work_id":"08898579-6b56-44ce-81b7-2c281b7dbfe0","year":2012},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:2206329f2a90b9d4117ed103d68e18145ed61690163b849104e97ad3e39e8d09","observation_id":"c24bd531-e508-4918-a27f-5b7a32edf97d","resolution":{"observed_at":"2026-05-26T23:53:13.987650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4612-0515-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Downey and Michael R","venue":"Texts and monographs in computer science","work_id":"3c8b42cc-9354-44c5-96e6-8feafabc479f","year":1999},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:86668919747bd682108ab5bb34580b92cf588d309b7a32816382b7cb3b99ef04","observation_id":"f5a919e1-7a1b-40cb-aaf8-cfd0c211616c","resolution":{"observed_at":"2026-05-09T01:09:32.355351Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Downey and Michael R","venue":null,"work_id":"f7f540d9-15d0-4c4a-b2ee-9ace92ee47ec","year":2013},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:728450fcaa746e78783b2bae7561e43c2ef50011e9a74c5bd530ab6e695d4298","observation_id":"20a0ab7e-b82b-4325-bb7b-776f7a12ea75","resolution":{"observed_at":"2026-05-26T23:53:13.992059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2405.20931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding diverse solutions parameterized by cliquewidth","venue":null,"work_id":"bf2c23dd-4303-4b97-88c9-a054f470f0ec","year":2024},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:549401f916ccee87aee5e011a47f90e94524f58180268dd67349a05faa90efee","observation_id":"cbedd0dc-1928-433f-ab85-ed785eb66a53","resolution":{"observed_at":"2026-05-11T23:01:16.522153Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minimum partition of a matroid into independent subsets","venue":null,"work_id":"5aae89f2-cc74-48d9-8c96-4c30eea95d20","year":1965},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:44a5916a64c84f3beb327d63431d90dd1fda5bdf739642adc2e17b4564e11ca3","observation_id":"a6325247-a026-457b-a2aa-c803258f5ea1","resolution":{"observed_at":"2026-05-26T23:53:13.983382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fellows, Michael A","venue":null,"work_id":"173635dc-b0f0-418f-b300-fd02b1579825","year":2005},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:a055346ec918e8471e7cb5f777dc0652191c95b3f20199bd764bd413a43b3034","observation_id":"bacbf115-d5e1-4cd7-b212-92915696189f","resolution":{"observed_at":"2026-05-26T23:53:14.018591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/dagrep.8.10.63","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Golovach, and Marie - France Sagot","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"a2e2c345-bbc2-46d8-8fe6-83e2c0f55640","year":2018},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:a5c713bf69820a11f9df6acdc7ec00633af6feef9c00726219af9dc9207484c8","observation_id":"562e93bc-a26d-4314-8a97-c42a3af1b9fa","resolution":{"observed_at":"2026-05-09T01:09:32.358910Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fomin, Serge Gaspers, Saket Saurabh, and St \\' e phan Thomass \\' e","venue":null,"work_id":"4a967aa6-5e47-44a0-afc7-d4a0b639fc57","year":2013},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:b197ffba5949c8b7a6a0668aa235db4174be62d0c9d7f0970349142cfa93b63e","observation_id":"566d1445-1b83-49ca-8e46-317a8fe0f853","resolution":{"observed_at":"2026-05-26T23:53:13.965335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fomin, Petr A","venue":null,"work_id":"a7dc4a51-dbfd-433f-8326-6b0d4066af44","year":2026},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:4e677023bd2baefcdba261a4ba8531a48ecbe2465e16758b95a899102ca69b80","observation_id":"f9a4597d-a948-45d7-876d-eb74509bdca0","resolution":{"observed_at":"2026-05-26T23:53:14.012122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fomin, Petr A","venue":null,"work_id":"09f1ff70-1498-42bc-94bc-3a28a86abc26","year":2024},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:0e9e69507dd94888caabf34bd86dcea60aab805176097bd1a2bc433da41e6db6","observation_id":"29b731ae-ec6c-40a1-bd94-60e087c907ad","resolution":{"observed_at":"2026-05-26T23:53:14.008528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9555-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Fabrizio Grandoni, Daniel Lokshtanov, and Saket Saurabh","venue":"Algorithmica","work_id":"14b272eb-56f1-4b74-b990-f1a537f8f5aa","year":2012},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:64b70ffd932418cbcf682180d4c29f17e591484a29ffa9fd0c83bcceba37794a","observation_id":"088ae94b-20c2-4a43-9583-7b9d05f5ea82","resolution":{"observed_at":"2026-05-09T01:09:32.449108Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Kernelization: Theory of Parameterized Preprocessing","venue":null,"work_id":"6492b85d-20a7-4a15-89e5-ce225c997f19","year":2019},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:e891846b425792536835bc4526669933fbb2beec505c9c0aee321ab96bcd2e3e","observation_id":"eced10c4-0e51-4a34-8692-551ec8c90e03","resolution":{"observed_at":"2026-05-26T23:53:13.979749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":null,"venue":null,"work_id":"925fb316-2536-4086-9234-30754ffa55d8","year":1979},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:6f0279324912fcbd8c3c18681cab9a8d950884488bebcc5ffe30ba6b1ce28892","observation_id":"4660e0d8-5a20-47b8-aeab-87e456e59b6c","resolution":{"observed_at":"2026-05-26T23:53:13.995260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2009.03.036","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gutin, Igor Razgon, and Eun Jung Kim","venue":"Theoretical Computer Science","work_id":"c7f83dfd-6d3b-47eb-af45-9507d5886f6e","year":2009},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:8d71e576df1318d256a76480860c16866ae7dfdea1d4f9b734f59714a4e413bf","observation_id":"0c47bfdf-0d35-4875-8116-7c319d3c548f","resolution":{"observed_at":"2026-05-09T01:09:32.393340Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"A framework to design approximation algorithms for finding diverse solutions in combinatorial problems","venue":null,"work_id":"2e0a1a49-9dc9-4480-bc5c-8da11b1b24d7","year":2023},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:881d9d580cb544ac9dbf636b2bf1964a2eb8a7043e846554b9f2701de8294f9b","observation_id":"69b85153-06d3-49d6-9cae-1cb4ebaa9562","resolution":{"observed_at":"2026-05-26T23:53:13.972640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2025.115092","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding a minimum spanning tree with a small non-terminal set","venue":"Theoretical Computer Science","work_id":"4444fca6-ba7e-4ac1-8e48-d2a9731c1d37","year":2025},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:140e83935cfd45406e078818659382b0a0be35c3d3ce7883ce5538e9c4f34997","observation_id":"3db1de57-0272-4a9b-88e0-e847921bbd08","resolution":{"observed_at":"2026-05-09T01:09:32.372416Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computing diverse shortest paths efficiently: A theoretical and experimental study","venue":null,"work_id":"1a78671f-b027-48fc-add4-9013248266e7","year":2022},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:7288319a3a49910b1baa27f3c29e53294fa841ce3fadaa4e179ff897d4d97de2","observation_id":"f1bffb3f-2b01-46b7-8955-a380582191ad","resolution":{"observed_at":"2026-05-26T23:53:14.002095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Finding diverse trees, paths, and more","venue":null,"work_id":"859e739f-586d-4e52-8573-9496b1020773","year":2021},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:af20286d78dd2c2f1ee7788e41badf4564c8b96d9db4e688c166d44c0b32c0ea","observation_id":"518394b9-77b3-450a-99c3-2f5ba980b134","resolution":{"observed_at":"2026-05-26T23:53:14.005423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00279","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Graph Algorithms and Applications","work_id":"fce896ea-dfd2-4d39-8331-e1cbe8ef7d74","year":2012},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:8061e3b0e3227a26f6a5585b50ad2438853bde5209fef2a1bbf23fc662fd9b6e","observation_id":"1a66b9be-f390-4cb2-9732-fee2bc051833","resolution":{"observed_at":"2026-05-09T01:09:32.455123Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-013-9827-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Better approximation algorithms for the maximum internal spanning tree problem","venue":"Algorithmica","work_id":"9b42a993-4580-432f-907f-c59417455c5c","year":2015},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:73c52a3c2871b5efdb38d56b51b25866908e4d7a21da752a82a6ca68598d134d","observation_id":"4ca08c2b-3b14-42d6-b4fd-d10d13ca2899","resolution":{"observed_at":"2026-05-09T01:09:32.425988Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-010-9454-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A new algorithm for finding trees with many leaves","venue":"Algorithmica","work_id":"63db6197-0501-482e-8263-a7970ce5599a","year":2011},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:46db15817edac2253946087c952378afc196fe247858d6a4216ee8ddc0b7656e","observation_id":"5e242e00-a73f-410d-a4e6-f5c6f1b6aef8","resolution":{"observed_at":"2026-05-09T01:09:32.430050Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2016.11.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree","venue":"Information and Computation","work_id":"fde5389e-9dcb-4f39-b392-ac4837d180e5","year":2017},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:19f818d451594a8a288c61b97f36fcfc6ee3ad30c180f2bf5addf7adf970d773","observation_id":"24eed929-5e5f-4a95-98c4-b5f6a16fdb51","resolution":{"observed_at":"2026-05-09T01:09:32.411252Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2021.01.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A 4/3-approximation algorithm for the maximum internal spanning tree problem","venue":"Journal of Computer and System Sciences","work_id":"f4976cc4-e380-4f58-b1b0-6692924ee514","year":2021},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:565a79b1ca4b47a0de1b9828a563080c02e3c94d39253e3c11902b91a6f3735e","observation_id":"4dfec0a8-0890-4165-af5c-0692c2e1586b","resolution":{"observed_at":"2026-05-09T01:09:32.405215Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1006/jagm.1998.0944","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Algorithms","work_id":"6c1fd35d-4ff3-4c9f-8e20-21899d3c9813","year":1998},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:a46355d12da61506501302630865cd7650236cba15071c4b7400b126d61a63ce","observation_id":"b0d2de20-aad0-4b5e-b8ba-3aaec0620bc6","resolution":{"observed_at":"2026-05-09T01:09:32.461960Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the parameterized complexity of diverse SAT","venue":null,"work_id":"6066c9c8-365b-4ff4-b7e4-4e69c12d1b84","year":2024},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:b21e687914dc5e9418bdd7ed3eee7493316b0e1da31bc54ca530f5209152c5e8","observation_id":"b30351aa-a345-42f8-8f9e-cf53049655b1","resolution":{"observed_at":"2026-05-26T23:53:14.015303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1112/jlms/s1-39.1.12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the London Mathematical Society","work_id":"02a1007e-6a33-4dae-bba9-ea567bf3680a","year":1964},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:9eddbf31140c887f58c4a89d735c67a335b3667aa66ab38998ea9999ec92ffb5","observation_id":"5e6fbef2-aaba-48b2-986d-b941180b9e74","resolution":{"observed_at":"2026-05-09T01:09:32.415114Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-45078-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"o rg - R \\","venue":null,"work_id":"6dfa6a37-8976-4194-9f9a-6bd776431b03","year":2003},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:13cfbf47349e8fd994781c0b64e3a6ea2a2de58137b3b56f85f2d196fb4fe6a6","observation_id":"7b945e6b-b070-4c37-bfaa-2d252da1bca9","resolution":{"observed_at":"2026-05-09T01:09:32.384101Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Reducing to independent set structure -- the case of k-internal spanning tree","venue":null,"work_id":"17bc337d-9eaf-4edd-841e-e1489a215f67","year":2005},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:2debad91122b12fc1ddd498978c135f97924e01a25c72f77081c80c95f04081e","observation_id":"0f0f56e8-7216-4b43-bdcf-2c424e4b921f","resolution":{"observed_at":"2026-05-26T23:53:13.976058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-015-0080-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bonsma, and Stefanie Lowski","venue":null,"work_id":"734e3a1e-5c5b-46b5-bb38-15a31d6e4efd","year":2017},"citing_paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-08T01:57:09.797119Z"},"links":{"citing_paper":"/paper/2604.24571"},"observation_digest":"sha256:6bfffaba42487bb1d1d5e15e7a95519e7977308c17c1f0cd936742c91c8e8e0e","observation_id":"ca77b84a-58d9-4615-a941-3cc9fb876de8","resolution":{"observed_at":"2026-05-09T01:09:32.400049Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.24571","last_updated":"2026-04-27T15:00:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T20:39:59.684751Z","submitted_at":"2026-04-27T15:00:50Z","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":1,"verified_exact":25,"verified_fuzzy":16},"total_outbound_references":44},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2604.24571."}