{"as_of":"2026-08-16T09:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39626beea34b3b6cea752aad4ac698f8293ce0b94d94a17ee103d9715f2599ff","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:18:34.959898Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"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.03870/citation-record","integrity":"/paper/1908.03870/integrity","json":"/paper/1908.03870/citation-record.json","paper":"/paper/1908.03870"},"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-14T14:18:36.118271Z","title":"Ambalath, Radheshyam Balasundaram, Chint an Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, and M","venue":null,"work_id":"9740447d-1756-4e44-b1a6-e30eb5c72a6f","year":2010},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.408896Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:5d9cdb5aa4c6ab8e90f63a2743380531c76d68818b45c7700a7819c4c1970ed0","observation_id":"63793780-3790-4be2-b6a6-f4d579319b80","resolution":{"observed_at":"2026-08-14T14:18:36.131372Z","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-14T14:18:36.072751Z","title":"Fellows, and Rolf Nie- dermeier","venue":null,"work_id":"7d8200f1-1f26-4164-a9da-50d3661342fd","year":2011},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.415645Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:0a396f427892b88d568f4937d7c13315bf3fac59357512c1a1d51d50772580d6","observation_id":"5cd91f4f-a535-4a7f-b2f3-925e6b77299f","resolution":{"observed_at":"2026-08-14T14:18:36.077548Z","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-14T14:18:36.057836Z","title":"C onstrained multilinear detection and generalized graph motifs","venue":null,"work_id":"7c3a6913-727f-4f5d-822d-d7faf0801fc1","year":2016},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.421416Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:55097e2e9d08d4ff0b544d287471e77372a22f315159f1a8a0a9758f7b159adb","observation_id":"99aed5f1-5de4-42c9-a341-8de33ae95ab5","resolution":{"observed_at":"2026-08-14T14:18:36.062531Z","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-14T14:18:36.041726Z","title":"Bodlaender, Bart M","venue":null,"work_id":"70d7c0b6-4966-48e1-86a3-e48a17875cee","year":2014},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.426595Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:5e4f61217936b6bfab63c63b3f486d4dd985b3903bb0eeb4fa78b6ccd5cdedfd","observation_id":"e5c9999a-cbb7-4fc6-a8b1-d493f0400481","resolution":{"observed_at":"2026-08-14T14:18:36.046786Z","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-14T14:18:36.012174Z","title":"Bodlaender, Stéphan Thomassé, and Anders Yeo","venue":null,"work_id":"18b82f12-9a63-4768-bafd-16bef860d3b8","year":2011},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.431924Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:fda26fcf4637138cfc8d86b73768673fdd6c81c7b50d75bfd383fb1ddabdb59f","observation_id":"36552691-caab-49f6-8440-47eb13c7c767","resolution":{"observed_at":"2026-08-14T14:18:36.030220Z","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-14T14:18:35.956329Z","title":"The Graph Motif probl em parameterized by the structure of the input graph","venue":null,"work_id":"81680aa2-9693-4b9f-9f81-a0d7f7f94b1b","year":2017},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.437796Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:33e21c8c0db438e9a765f1bb931964a4ffdf75f39a74b5a99a3b4b25ac2dbfeb","observation_id":"bff92d89-43ed-41b8-a50f-e86b510a043e","resolution":{"observed_at":"2026-08-14T14:18:35.977945Z","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-14T14:18:35.939295Z","title":"Karp, Ron Shami r, and Roded Sharan","venue":null,"work_id":"f7d79876-eb9b-4496-9618-cc74de3b4a6b","year":2010},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.474008Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:a6bb2c268d5c055d9eae22ab9edc47c7e2b0470be9c40ad7702a559105d11857","observation_id":"488e06bb-a37f-497b-a671-e5fe3a245e0d","resolution":{"observed_at":"2026-08-14T14:18:35.944438Z","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-14T14:18:35.921798Z","title":"Fomin, Lukasz Kowalik, Daniel Loks htanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":"caab93e3-82fd-4738-b2da-b500ccfe1737","year":2015},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.533575Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:9ac968fa794ad01a9a01fb4459c46c4ba7264d47c46c9dcea78a43b80df86c72","observation_id":"66a5addd-2c75-4090-be9e-f53538d5945e","resolution":{"observed_at":"2026-08-14T14:18:35.928370Z","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-14T14:18:35.886480Z","title":"Vinod Reddy","venue":null,"work_id":"ec913020-af6a-47f5-b35b-c648557ff3b1","year":2017},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.602550Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:016b0e77d70e0d3c0bf9b1b0188930ab76b0809b6c7529d32afbd66143af2b10","observation_id":"eb8772da-77f3-45ef-9156-6c618c812871","resolution":{"observed_at":"2026-08-14T14:18:35.891955Z","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-14T14:18:35.869897Z","title":"Satisfiability al lows no nontrivial sparsification unless the polynomial-time hierarchy collapses","venue":null,"work_id":"7a22dc4e-c5a9-41f1-8b40-7994fd4d81b5","year":2010},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.607726Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:2790e3c2e0986d4a1e304bf74da642ccc458feab691580f162dc27e3a809dac1","observation_id":"67b12174-a232-4fab-8747-1d4753f8ee03","resolution":{"observed_at":"2026-08-14T14:18:35.875680Z","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-14T14:18:35.834372Z","title":"Downey and Michael R","venue":null,"work_id":"efb1fea1-ebed-433d-a250-508ac60f8ee2","year":2013},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.612403Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:963d2491f9ebfff72ba1b3c3a62d524c5f04fa4b210e95dc3ea9d55973690813","observation_id":"ea0b2745-771f-4c29-a256-dc1824b14824","resolution":{"observed_at":"2026-08-14T14:18:35.857261Z","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-14T14:18:35.791320Z","title":"Fellows, Guillaume Fertin, Danny Hermelin, and Stéphane Vialette","venue":null,"work_id":"f2e15b06-feeb-48cc-84a5-175cc27390e4","year":2011},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.617656Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:433e718441f161da4a76d27eec37adb4b45a85ba6643538af4eba8a7789bbfe5","observation_id":"af3b68c9-8c1b-43a9-bfd0-233d1669d47c","resolution":{"observed_at":"2026-08-14T14:18:35.806367Z","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-14T14:18:35.770166Z","title":"Fellows, Danny Hermelin, Frances Rosamond, and Stéphane Vialette","venue":null,"work_id":"81166191-4618-418e-b649-1f13eb43ef4f","year":2009},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.622930Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:3a7ba903b5526af3072fba60d400ebcb18db7288987c5e7fbf26655a493d18de","observation_id":"a383c63a-9450-454c-aa80-9e8c794e80bf","resolution":{"observed_at":"2026-08-14T14:18:35.779483Z","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-14T14:18:35.747503Z","title":"A lgorithmic aspects of the Maximum Colorful Arborescence problem","venue":null,"work_id":"b7789a79-5559-4793-8e56-7904052b576d","year":2017},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.658420Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:56bd00aec030db5ae6d25246256698f2c174f83675b6d6cd1c4cb5ee6b4dfdab","observation_id":"d209c13b-546f-4921-84ab-74fce97a659a","resolution":{"observed_at":"2026-08-14T14:18:35.756936Z","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-14T14:18:35.729236Z","title":"On the Maximum Colorful Ar- borescence problem and color hierarchy graph structure","venue":null,"work_id":"b3ce1d00-d280-4b7f-a98f-c66106a19da8","year":2018},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.747107Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:8b158d3599d9a685386b89e8efb460bccd552d4673448e8e04ff1fa17f6e15f9","observation_id":"c2c353ce-b1a0-430e-8550-7698b84850c9","resolution":{"observed_at":"2026-08-14T14:18:35.735131Z","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-14T14:18:35.654803Z","title":"Fomin and Dieter Kratsch","venue":null,"work_id":"40a63786-81af-4c31-a026-4f6e4a4b8993","year":2010},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.752619Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:a4c0eab743726719d070535d4bd50523b101f2e09b8552668ad8480874f63a10","observation_id":"9bfeb788-5993-49dd-9551-7399b055fc19","resolution":{"observed_at":"2026-08-14T14:18:35.715271Z","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-14T14:18:35.549236Z","title":"Twin-cover: Beyond vertex cover in para meterized algorithmics","venue":null,"work_id":"6db36b29-7262-41fd-b97b-5b9f6679234a","year":2011},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.757552Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:6eb7ddf7792a771a285194a037d007f8bd9ea1783c9e07891e807118007dfc75","observation_id":"dc34bdfe-9115-462c-b794-a5f1f317fe3d","resolution":{"observed_at":"2026-08-14T14:18:35.614844Z","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-14T14:18:35.529356Z","title":"Parameterized algorithmics and computational experiments for finding 2-clubs","venue":null,"work_id":"c1c0ae72-a506-4bda-af6f-b660750e21c8","year":2015},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.761782Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:4c7a942b39dc0ba666fd916d072bf1b2557598bce2cda3321f5659f5cffe2d09","observation_id":"e00074ce-4073-488d-aa51-aef1ba9217a0","resolution":{"observed_at":"2026-08-14T14:18:35.536124Z","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-14T14:18:35.496219Z","title":"Which problems have strongly exponential complexity? Journal of Computer and System Sciences , 63(4):512–530, 2001","venue":null,"work_id":"9c8fd3c7-a637-4e84-aee8-a35c76693e23","year":2001},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.766887Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:56a9d9e26929f749b028c1204159ace425886c804b346e32a16b0adaff592faa","observation_id":"1b33c5fe-9be4-464b-a296-9d651af2b4aa","resolution":{"observed_at":"2026-08-14T14:18:35.514894Z","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-14T14:18:35.368413Z","title":"Fernandes, and Marie-Fra nce Sagot","venue":null,"work_id":"d9977a25-4d30-49c2-9d07-77971f5e185a","year":2006},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.771720Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:fe4ae35883f29516a9dc60aa29ec4b5f3f1db8543133e6ded853c963cb3c660a","observation_id":"ab5c487a-fda6-4d1c-9449-acd88b5edb7f","resolution":{"observed_at":"2026-08-14T14:18:35.432334Z","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-14T14:18:35.347321Z","title":"A general metho d to speed up fixed-parameter- tractable algorithms","venue":null,"work_id":"da14116f-00f0-47e2-b451-13cd375e4288","year":2000},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.776222Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:6c86229e0123ceac2e36c023ae88562647a492837ad79009f276635c89fdbc68","observation_id":"780e591d-8ff9-4d37-bde2-a981867c77eb","resolution":{"observed_at":"2026-08-14T14:18:35.354659Z","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-14T14:18:35.170228Z","title":"Pinter, Hadas Shachnai, and Meirav Zehavi","venue":null,"work_id":"50206817-671b-4272-8726-e43f5796a609","year":2016},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.781609Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:017ebadfcbb349460cea9837c674a562fbcf7a2e0ecc455b67ac8406cb93c2ed","observation_id":"a32660cf-89f1-4922-af86-bfe7561637f5","resolution":{"observed_at":"2026-08-14T14:18:35.270326Z","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-14T14:18:35.153442Z","title":"Pinter and Meirav Zehavi","venue":null,"work_id":"540f9ac4-01df-4335-b738-4d4effda598b","year":2014},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.786537Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:ec865342d169e0c18975d8d85ea1cadfe2c52d5126cbfd58b0fe543ae72eed50","observation_id":"185b5fab-58da-4358-bd14-38e0f787a9a0","resolution":{"observed_at":"2026-08-14T14:18:35.158806Z","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-14T14:18:35.133840Z","title":"Finding maximum col- orful subtrees in practice","venue":null,"work_id":"9d9ed595-b82d-437f-ba9c-03aa48bfdb27","year":2013},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.836494Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:1608e55275f64c7ba76348c192ab0be1147b22594f718e093e62f1be65d68ce2","observation_id":"a50a72b2-54d9-46a8-894d-b8fccf62f8e2","resolution":{"observed_at":"2026-08-14T14:18:35.140743Z","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-14T14:18:35.028375Z","title":"Modeling cellular machin ery through biological network com- parison","venue":null,"work_id":"c41091de-2545-43f9-945c-c39082a8391a","year":2006},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.893249Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:53cb099b5564ebb37b9a4d6dad7e788a5a06fdba39920fe56f5e215192bedeb4","observation_id":"447f78d2-3df7-416f-8750-2d037e49de0d","resolution":{"observed_at":"2026-08-14T14:18:35.034241Z","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-14T14:18:35.009587Z","title":"An (almost complete) state of the art ar ound the Graph Motif problem","venue":null,"work_id":"a628b1d9-ed25-4516-96fd-96abbf80b64e","year":2012},"citing_paper":{"arxiv_id":"1908.03870","last_updated":"2019-08-11T08:34:12Z","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:18:34.959898Z"},"links":{"citing_paper":"/paper/1908.03870"},"observation_digest":"sha256:767e23b41297a67d41c94b7cbc62ee1099c9cc1a281a88915169ad9f0dd17cd7","observation_id":"1f93a47a-2c5d-4c2d-8b75-eafc0e0d5d58","resolution":{"observed_at":"2026-08-14T14:18:35.016725Z","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.03870","last_updated":"2019-08-11T08:34:12Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-14T13:57:18.927582Z","submitted_at":"2019-08-11T08:34:12Z","title":"Graph Motif Problems Parameterized by Dual"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":26},"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 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:1908.03870."}