{"as_of":"2026-08-17T17:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:609f9b2db02bc8cb5484d9b631b28dbd7b23dcfed6c8517b70265cc165f1bf11","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T01:19:35.773966Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.11407/citation-record","integrity":"/paper/2605.11407/integrity","json":"/paper/2605.11407/citation-record.json","paper":"/paper/2605.11407"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.comgeo","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T13:33:50.345892Z","title":"2022.101900","venue":null,"work_id":"a2bb8225-eae1-4d11-b841-10751f0d510f","year":2014},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:a248a15dc12849f555e3a8b62fa1c848e81222b6f06ab23136858a189c7ee3af","observation_id":"baf9d4e7-2611-43f4-9f44-5c5008c1f73e","resolution":{"observed_at":"2026-05-13T01:22:00.758623Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"Cycle transversals in perfect graphs and cographs.Theoretical Computer Science, 469:15–23","venue":null,"work_id":"3d1d9155-bbc2-4779-a171-98baa1932f22","year":null},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:f7713ccfed3ae1bc9ce98a26261b41c72c18003b09c5a0b9529324b4b102b3de","observation_id":"06740452-1b54-46dc-b57f-2b6d6c07f25d","resolution":{"observed_at":"2026-05-13T15:22:55.859096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"String matching with variable length gaps.Theor","venue":null,"work_id":"62f77ce7-6741-4c42-9875-cdd6452cc227","year":2013},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:563d81ae2e3a834c2ff03c29c8520eb83391fda0d44409f9f3b4dd92c3ceddb8","observation_id":"e085d741-35d3-4793-b57b-377b22074d75","resolution":{"observed_at":"2026-05-13T01:22:00.755036Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/oasics","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DX.2024.7","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"198323da-b922-4136-b3a7-28d8b5e7369e","year":2019},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:5fc559cc4f8ad86e1999f84b5f656da5ed55f17d5cb91aaab59f7e8507cb370e","observation_id":"912b77b5-8c24-4780-bd55-fc24b6b14da0","resolution":{"observed_at":"2026-05-13T01:22:00.719998Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2009.03.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kanj, and Ge Xia","venue":"Theoretical Computer Science","work_id":"f9a5c53f-be97-4ca9-9aec-08bffa64f5a2","year":2009},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:ebb66625b0f61ce64f62450558d0034fd5a23b1fe28eac7607703da8d12a4d82","observation_id":"76742742-a2e0-44e2-829b-2447270b0b6a","resolution":{"observed_at":"2026-05-13T01:22:00.726542Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7817.997868","doi":"10.1145/997817.997868","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Duncan, David Eppstein, and Stephen G","venue":null,"work_id":"0e201b86-c9d9-482a-9268-ff69492036b4","year":2004},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:a4f45a950912f7f6e3048ed44aa7dbf69b2fd9becf0bf53ee5af41376801cb8b","observation_id":"c612687e-34c8-44b9-9192-16623370dfea","resolution":{"observed_at":"2026-05-13T01:22:00.747427Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4483.44485","doi":"10.1145/44483.44485","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Furst, Jonathan L","venue":"Journal of the ACM","work_id":"731858ce-1260-4a46-b5ef-95a30c635f33","year":1988},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:823eb86fe421256c0476e004ff0e00e3115ec3e8d5c8583940e654909a356b3f","observation_id":"6f15c527-aae9-4205-a3f2-82e601a99621","resolution":{"observed_at":"2026-05-13T01:22:00.751833Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0132071","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Applied Mathematics","work_id":"2f66a39f-28de-49c3-85ae-1da2174058ae","year":1977},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:c1b4f528cf99ff8538159f675345a70ebcc644baafa95ec7d1306f72c33b1c30","observation_id":"36e45c85-d7f6-4633-b4e4-93724e8f234a","resolution":{"observed_at":"2026-05-13T01:22:00.732759Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"Garey and David S","venue":null,"work_id":"7e302c89-6621-47eb-8316-6873b947dd45","year":1979},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:aace86565add20d45e0c061aaba4b90c82f0673b72536a910f952c2534673b79","observation_id":"e702c27f-1e9a-49cf-979a-5010ed154657","resolution":{"observed_at":"2026-05-13T15:22:55.831847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"c16184c2-2eaf-44e9-a047-76b54d8787cb","year":1972},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:915557a4ba5b8ec96729abac6249fc897b7f3f35bd8a8fe30ef0dd7a25a0f097","observation_id":"9f30377f-6d90-4a33-a455-a6454dd88aba","resolution":{"observed_at":"2026-05-13T15:22:55.846184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0095-8956(76)90049-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On two minimax theorems in graph.Journal of Combinatorial Theory, Series B, 21(2):96–103, 1976.doi:10.1016/0095-8956(76)90049-6","venue":"Journal of Combinatorial Theory Series B","work_id":"ce7d06d5-e08f-4674-84f0-81b0f39e934d","year":1976},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:17f5ce621c75321c893e6329a6e735ef070d71d0842fbe75cd4105a1876d6088","observation_id":"2a7f63c3-86c2-4ad3-96b8-30e08df0a3ce","resolution":{"observed_at":"2026-05-13T01:22:00.740172Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"Lucchesi.A Minimax Equality for Directed Graphs","venue":null,"work_id":"aec701dd-93ef-46c2-a0a5-3b62193b75c2","year":1976},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:d8d459d504c46e9a2b2578107a4dc20ccdd7166a6f180b57cc27e7429b185f39","observation_id":"03907767-5f6f-4a0a-9e03-efd3ce03d803","resolution":{"observed_at":"2026-05-13T15:22:55.836488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1112/jlms/s2-17.3.369","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lucchesi and Daniel H","venue":"Journal of the London Mathematical Society","work_id":"8d1d0b98-af9c-46a2-9e95-91a97c7988c7","year":1978},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:30d6cccaa1edf814b49e2251e7edde25405c0cb826356b052e2ee2d60c1f48e8","observation_id":"bc19f902-6800-4ad3-8289-16a6dcb8869b","resolution":{"observed_at":"2026-05-13T01:22:00.743136Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-007-9112-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minimum weakly fundamental cycle bases are hard to find.Algorithmica, 53(3):402–424, 2009.doi:10.1007/s00453-007-9112-8","venue":"Algorithmica","work_id":"22173c82-6b2d-4941-9193-161e834adb22","year":2009},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:2a55d49e4deb554f499b029565e6f0d034ab06c495a5f6ceeb509a2dd887e9eb","observation_id":"9ba71e26-9e4f-44b3-a889-a0349e8b5855","resolution":{"observed_at":"2026-05-13T01:22:00.735924Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"PhD thesis, Universit¨ at Paderborn, Paderborn, West Germany","venue":null,"work_id":"f3ac2bb6-953b-4899-bf4c-bb41d653e845","year":1983},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:c7a97b7c593bc0c500f8e79155013901a7d4b4a4dc2c6325b499a5adba460fb1","observation_id":"df3509a2-fd12-4e9b-a57f-1ecf871a3818","resolution":{"observed_at":"2026-05-13T15:22:55.841414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"Bounds on feedback vertex sets of undirected cubic graphs","venue":null,"work_id":"91860519-0b69-475c-b4d1-b9cada4b1284","year":1986},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:00e9494c95a824556c3d4be9e665b5437f8e556f3d1365d918d04090c4cbba90","observation_id":"db065b0f-533c-453a-92b4-2665f6d3c558","resolution":{"observed_at":"2026-05-13T15:22:55.854282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.3190120311","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On feedback vertex sets and nonseparating independent sets in cubic graphs.Journal of Graph Theory, 12(3):405–412, 1988.doi:10.1002/jgt.3190120311","venue":"Journal of Graph Theory","work_id":"f7d5ee07-3fdf-4067-b893-6da7158ceb7c","year":1988},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:8bf8c07c53a2f1800c1ffee6c3e1efff5278c44f99c3d99fadd84c8e4ac1367a","observation_id":"9b991f9a-a5eb-413b-8907-b15260207bbb","resolution":{"observed_at":"2026-05-13T01:22:00.723500Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0012-365x(88)90226-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Discrete Mathematics","work_id":"fe3c8eb7-ea2e-4dae-86a7-539b50d488f6","year":1988},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:cfbc465272fdd39731143abeec4b45d5b6b2c412c585335c4560cf527c17e358","observation_id":"c34ef3a5-ec2e-4ce0-9b22-5f1c624846ac","resolution":{"observed_at":"2026-05-13T01:22:00.729848Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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":"Younger.Feedback in a Directed Graph","venue":null,"work_id":"fc637731-6bcd-47a6-9853-c8a5372dad9b","year":1963},"citing_paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:35.773966Z"},"links":{"citing_paper":"/paper/2605.11407"},"observation_digest":"sha256:538bdd43384cc1389f30496d16aa7d63a8aeb8a9a8a46d311ab5a3b12588978a","observation_id":"5f745be5-6ac7-43a7-b49c-fe6a0cc35fcb","resolution":{"observed_at":"2026-05-13T15:22:55.850213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.11407","last_updated":"2026-05-12T01:55:22Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-13T05:46:59.992162Z","submitted_at":"2026-05-12T01:55:22Z","title":"Feedback Set Problems on Bounded-Degree (Planar) Graphs"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":10,"verified_fuzzy":6},"total_outbound_references":19},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2605.11407."}