{"as_of":"2026-08-16T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2b7f491f6cb8fbebf19db6449f9877c1a73ea36f1a083567bf22ee9e7285446","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:44:29.906897Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.00978/citation-record","integrity":"/paper/1908.00978/integrity","json":"/paper/1908.00978/citation-record.json","paper":"/paper/1908.00978"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.189365Z","title":"Bacs´ o and Zs","venue":null,"work_id":"dfc38bb0-c79e-44aa-ab73-a4e7a4422e9a","year":1990},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.834473Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:4db08267c86928cbd215eb64b402c0d6f94ce70bd2a1ce67c57ef5477dd6b9ee","observation_id":"c7c6e0a2-3a3f-4698-8f9c-9bdc09cebe31","resolution":{"observed_at":"2026-08-14T15:44:30.195878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.171156Z","title":"Biggs, Perfect codes in graphs, Journal of Combinatorial Theory, Series B 15 (1973) 289-296","venue":null,"work_id":"d684d0fd-e5b6-4205-9fcd-bd7c262127a7","year":1973},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.840438Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:c07f4283ed50ef7a4ed46f56c8c0527199dc0999b74d98005bee6b608d5b0996","observation_id":"91afe167-c55c-4e01-8c3c-7c0624efd53a","resolution":{"observed_at":"2026-08-14T15:44:30.176615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.155718Z","title":"Brandst¨ adt, C","venue":null,"work_id":"d1cf6731-d983-49b9-9c0c-d27dbd51c764","year":2010},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.845160Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:2953dad5a2b5345e9e6207234842f3c98970708bffa69b577d721ce38d9288f2","observation_id":"03f29897-95fa-49a5-a423-2b6dd977a2f2","resolution":{"observed_at":"2026-08-14T15:44:30.160609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.139737Z","title":"Brandst¨ adt and R","venue":null,"work_id":"aa309d24-ab84-42b5-b156-dd4b10b00a15","year":2014},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.849925Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:64a0f173e99e23cdf4a23e3bfaf588b5364d521ae406e95447d4dd7a51350219","observation_id":"b93b5eb9-f034-4b43-9394-7c49dc35a868","resolution":{"observed_at":"2026-08-14T15:44:30.144818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.122674Z","title":"Brandst¨ adt and R","venue":null,"work_id":"27328b56-42bd-4880-bc93-832bf4a01033","year":2017},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.854679Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:5ad786795c0588fe05ea821e62b8e84a586a9103fed76f2acd18da129fe7f377","observation_id":"d3405206-79af-484d-841b-7f786f4dec0b","resolution":{"observed_at":"2026-08-14T15:44:30.127691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.09301","last_updated":"2019-04-11T08:45:47Z","snapshot_observed_at":"2026-08-14T20:51:19.579780Z","submitted_at":"2017-06-27T15:27:42Z","title":"Dominating Induced Matchings in $S_{1,2,4}$-Free Graphs","version":3},"cited_work":{"arxiv_id":"1706.09301","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.09301","snapshot_observed_at":"2026-08-14T15:44:29.996508Z","title":"Dominating Induced Matchings in $S_{1,2,4}$-Free Graphs","venue":"cs.DM","work_id":"e1c67b38-4ba0-47a7-b6ac-e1565befc439","year":2017},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.859089Z"},"links":{"cited_paper":"/paper/1706.09301","citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:803fc6dec70f2e53a0164272c56e0d1bd79ccdcb4964d84630d96e38f7abdcdc","observation_id":"58a3bbbc-bd4a-492d-be96-4441ba8e17af","resolution":{"observed_at":"2026-08-14T15:44:30.002303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.04894","last_updated":"2020-01-06T16:46:34Z","snapshot_observed_at":"2026-08-14T20:54:06.114720Z","submitted_at":"2017-06-14T13:45:52Z","title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time","version":5},"cited_work":{"arxiv_id":"1706.04894","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.04894","snapshot_observed_at":"2026-08-14T15:44:29.973073Z","title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time","venue":"cs.DM","work_id":"689495da-e01e-483f-9ea6-29a9214b686e","year":2017},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.864819Z"},"links":{"cited_paper":"/paper/1706.04894","citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:a1d62b6496fa94860a64badb439291d7d6f759a9cce67058d13b1b2a3ceb963a","observation_id":"6f381fe3-b507-4fb6-8ba7-b82e89981c29","resolution":{"observed_at":"2026-08-14T15:44:29.978458Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.05582","last_updated":"2020-03-18T19:56:36Z","snapshot_observed_at":"2026-08-14T16:32:33.687641Z","submitted_at":"2019-05-14T13:17:00Z","title":"Finding Dominating Induced Matchings in $S_{1,1,5}$-Free Graphs in Polynomial Time","version":2},"cited_work":{"arxiv_id":"1905.05582","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.05582","snapshot_observed_at":"2026-08-14T15:44:29.946561Z","title":"Finding Dominating Induced Matchings in $S_{1,1,5}$-Free Graphs in Polynomial Time","venue":"cs.DM","work_id":"13952eed-26c3-4173-8304-9b4dab9394a4","year":2019},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.870016Z"},"links":{"cited_paper":"/paper/1905.05582","citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:c5cbc7c404210dc7bac04bfc6f6b0d37aafafb5cf5ae28756ec5160feea50e52","observation_id":"ce4fb670-446c-4bc2-b48d-1a57609b9b43","resolution":{"observed_at":"2026-08-14T15:44:29.953802Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.105734Z","title":"Cardoso, N","venue":null,"work_id":"fba9ced4-b080-400f-966c-257ef63ceede","year":2011},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.875387Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:3c71827ed8ce8e77b0811e7b6f58d119a3841ddb238bd4f1397b654026a20d9a","observation_id":"3747ec9a-36c9-4a52-b1c6-6632c350ac42","resolution":{"observed_at":"2026-08-14T15:44:30.111243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.087965Z","title":"Grinstead, P.L","venue":null,"work_id":"539781a4-50f7-41a1-8ab4-7e22cb5fb613","year":1993},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.881446Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:e01f5f3f26495ec9f9e960a7e297b982b6f25c5303a6b42bb29efa788adb5114","observation_id":"12c7ec77-8409-46cf-a52a-967b9add8724","resolution":{"observed_at":"2026-08-14T15:44:30.092848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.071894Z","title":"Hertz, V.V","venue":null,"work_id":"e64a6388-e01b-4a9c-92b7-5b4c936904fb","year":2018},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.886580Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:8a70a9f3b236873309d7fa5bbe24218d6579a8e62133368b2d6fce958afe5a23","observation_id":"0500c370-2a3c-4e71-9b87-664e81419e12","resolution":{"observed_at":"2026-08-14T15:44:30.076785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.053396Z","title":"Korpelainen, V.V","venue":null,"work_id":"f2a4583d-647c-4339-9952-f73be263e219","year":2014},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.892562Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:f92175b43bbbfdda0b9ea06b96d621c3d45d3bf04276a118fb1b1b8567bc1ccd","observation_id":"e0d9a2ba-f48f-4671-954a-e7c8e15a8985","resolution":{"observed_at":"2026-08-14T15:44:30.059458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.034166Z","title":"Lu, M.-T","venue":null,"work_id":"c6246c79-2478-4f5e-ab66-5c996dc14450","year":2002},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.899134Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:6106cdb2a137f6b9ad3e0c8ae13bc1d33e50930a2e1f48e8006d2b0f654c4027","observation_id":"0f7e837a-a624-4084-b10f-c3a20bd1136e","resolution":{"observed_at":"2026-08-14T15:44:30.040070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:44:30.015492Z","title":"Lu and C.Y","venue":null,"work_id":"e85e69e8-06d1-4dea-b37c-457e2d8bf73e","year":1998},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.906897Z"},"links":{"citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:00648c54c5c5db594f45487ed697d88b583ff930224108e91fc88ca594adbb3b","observation_id":"f0cc8b13-1fb3-48b3-aba9-c9fcd53591ac","resolution":{"observed_at":"2026-08-14T15:44:30.021002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","latest_version":3,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":11},"total_outbound_references":14},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:1908.00978."}