{"as_of":"2026-08-17T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b7276b6b0cca72939dec91f75cb65839a329b60f64b68600f7dff667c5024cd9","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:07:34.641102Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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.02174/citation-record","integrity":"/paper/1908.02174/integrity","json":"/paper/1908.02174/citation-record.json","paper":"/paper/1908.02174"},"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:07:35.001516Z","title":"Below all subsets for minimal connected dominating set","venue":null,"work_id":"2bef019f-c592-4057-bad7-84dfc6971a62","year":2018},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.550650Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:bafaa2995efbeab9920363e5e3664d28cb5d0c443208e30f2f9a5dbe86b3fe5b","observation_id":"956afdfd-60d5-47b2-98c9-f2539444afbb","resolution":{"observed_at":"2026-08-14T15:07:35.006328Z","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:07:34.987725Z","title":null,"venue":null,"work_id":"a906c5e7-410e-4518-b031-69488cab45c8","year":2016},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.555921Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:16e51cf52841230fb03522f64523728d11ee6e50799d4061604d9d6fa136095b","observation_id":"e9a73198-4d31-4529-8356-0cb21ff9d77a","resolution":{"observed_at":"2026-08-14T15:07:34.992073Z","resolver_source":"raw_fallback","status":"unresolved"},"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:07:34.973548Z","title":null,"venue":null,"work_id":"aa62d638-08f2-4f2f-ae31-53f595ee0ed4","year":2011},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.560638Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:74d3eb64b8d1a1e16bcc6d3d9bba27a2c843a6115b8d1fcbf172f30e45f8c53c","observation_id":"83e69c31-ee58-4d7b-9b60-bebbf1f5bbca","resolution":{"observed_at":"2026-08-14T15:07:34.978165Z","resolver_source":"raw_fallback","status":"unresolved"},"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:07:34.959371Z","title":null,"venue":null,"work_id":"00f5a1ee-f4b5-487a-8c8a-42903688a5e3","year":2017},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.565406Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:e0c308a88401716cb87fc33cc82ed4f1a863dcd5ea2bbeaee72dbaee01b64d61","observation_id":"e0e3b19c-4dde-4d2c-985c-744b699b3657","resolution":{"observed_at":"2026-08-14T15:07:34.964107Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"10.1016/0020-0190(90)90147-p","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.707075Z","title":null,"venue":null,"work_id":"af71475e-dd88-4eb9-8067-f222ed34d74a","year":1990},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.571506Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:c0b26e8ee30f3fe483461c32108ddf58b1dcb84012b3a0fb2411c0d72ba1e9d4","observation_id":"67ee5a96-5fa1-4f60-be5b-e2f4b2013ea5","resolution":{"observed_at":"2026-08-14T15:07:34.712196Z","resolver_source":"doi","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:07:34.945441Z","title":null,"venue":null,"work_id":"9378f4ce-d91c-493f-a541-19a3b52b793e","year":1999},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.576230Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:ab1263feb51fc74f48ce7aac3ead9e8f25f06d4536d39a15d93e66f5da70c1b4","observation_id":"bffe4b31-8c01-4aec-abc7-0dd24c0fd0ca","resolution":{"observed_at":"2026-08-14T15:07:34.949850Z","resolver_source":"raw_fallback","status":"unresolved"},"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:07:34.930602Z","title":"Hedetniemi J","venue":null,"work_id":"f34a58a3-3a2b-41bd-b7b2-cccf596f165e","year":1983},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.581443Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:7ce53b436479b824c35361224e96ea70823d4c154f785fa11255c73d212d70e2","observation_id":"c671d66d-cbba-4d26-b7d2-59779f5484d0","resolution":{"observed_at":"2026-08-14T15:07:34.935109Z","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:07:34.915896Z","title":"The NP-completeness of steiner tree and dominating set for chordal bipartite graphs","venue":null,"work_id":"bb588151-d258-461e-854a-db6b407ce57d","year":1987},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.586033Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:c7b65678fdffcc0ffbf62b37e0bf3f9ea5f3e0b54336d1039865864740f9720f","observation_id":"278a3d03-47b5-4c97-a928-d4ebdeba704d","resolution":{"observed_at":"2026-08-14T15:07:34.921142Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.590515Z","title":"ACM Trans","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.590515Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:8ee38539a47742416a071079619455f5593c03319639234dec41f9467a6ddf2a","observation_id":"52e078d5-49ac-44c8-a869-722048a9f6b9","resolution":{"observed_at":"2026-08-14T15:07:34.590515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2013.03.026","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.691258Z","title":null,"venue":null,"work_id":"c9885dee-e136-4256-820e-2038044f634f","year":2013},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.595040Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:37b9b3eff4f584c1965e51a4817f124355352cd93f10a8cac0ed23ae7c31783a","observation_id":"8cd94e06-5a61-4b7c-be2d-bce08696f127","resolution":{"observed_at":"2026-08-14T15:07:34.696996Z","resolver_source":"doi","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:07:34.900694Z","title":"Golovach, Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi","venue":null,"work_id":"6c7f7ce2-cb99-4eb3-a978-a540313d02e7","year":2019},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.599667Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:d4bd9b96f7f176ae975cf8311c7fc3c89aa7be97a117b4870254f49e008df55c","observation_id":"3096f3e6-b61b-4e5b-be42-aee502943c25","resolution":{"observed_at":"2026-08-14T15:07:34.905942Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.604078Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.604078Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:6acecd8f76f5ef8c08a12924a352e77038fb7d8072c402d17eef0abdc1546b1d","observation_id":"12439bbc-df1d-4c89-9af8-d6f80be4c722","resolution":{"observed_at":"2026-08-14T15:07:34.604078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:07:34.885408Z","title":"Moon , L","venue":null,"work_id":"6b16da77-87ec-4f83-9214-b1e49ee03686","year":1965},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.608838Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:03e3a0eed431a2f2e73daf0e240f08638c892f841cfa98933464eedb4db63aab","observation_id":"dc9f5095-c355-499d-89d2-a741cbe8d98e","resolution":{"observed_at":"2026-08-14T15:07:34.889875Z","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:07:34.870862Z","title":null,"venue":null,"work_id":"88215852-c883-4061-bbd7-a7ed32a4d48b","year":1979},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.613195Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:7f8f44f1436e40c1ad69f90778572d27eb082d3ec367f6cb8b54fe2da5b6c461","observation_id":"0fb0812b-511e-4416-baef-4bd48873fbdb","resolution":{"observed_at":"2026-08-14T15:07:34.875453Z","resolver_source":"raw_fallback","status":"unresolved"},"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:07:34.856039Z","title":"Brandst\\\" a dt, V","venue":null,"work_id":"a08d0a17-a876-4a7f-a1ff-0f558fa7b2a5","year":1999},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.617706Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:083d9cdb01e7aa19f3400ae9df7c62f603362e314b0229222141ad8c7983ee2a","observation_id":"17025d78-ff51-469d-9c1e-b44e9873df9f","resolution":{"observed_at":"2026-08-14T15:07:34.860542Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.622329Z","title":"Texts in Theoretical Computer Science","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.622329Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:fcc1e3546283e5e6c0628a001e1df6069cee8a1898bb9bfdaddabe59cfb93207","observation_id":"9b8c0830-140c-4fe1-b4f2-66b1398a7c42","resolution":{"observed_at":"2026-08-14T15:07:34.622329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:07:34.841824Z","title":"Golovach, Dieter Kratsch, and Mohamed Yosri Sayadi","venue":null,"work_id":"110785a3-915a-4c52-a2b2-3548c0c6c68a","year":2019},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.626923Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:8448a619803741862b4bc9f005385cca211b1797a3c87e494b59ebf22caee443","observation_id":"d2a6e60c-3445-43f5-b81b-d6d5caa39f8f","resolution":{"observed_at":"2026-08-14T15:07:34.846338Z","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:07:34.827053Z","title":"Golovach, Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi","venue":null,"work_id":"076bde81-e748-410b-9093-877e7b9d822d","year":2019},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.631318Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:6fb748d0c6818a0cb1896d1380fe506c2fb730168a86953c162b9b12bc6714bb","observation_id":"50da4582-9074-489a-9b4f-9d59d8cc83bb","resolution":{"observed_at":"2026-08-14T15:07:34.831986Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.635777Z","title":", \" * write output.state after.block = add.period write","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.635777Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:10d09aeb46ecfb72479816181f8fda867d1d3afc922c1401726001ed37117102","observation_id":"91e96fa7-e54c-400a-85a4-6cd345de3929","resolution":{"observed_at":"2026-08-14T15:07:34.635777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:07:34.641102Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T15:07:34.641102Z"},"links":{"citing_paper":"/paper/1908.02174"},"observation_digest":"sha256:b2843023693adfa1c8c9cd8c3b0845c5cd0a72a0fae433f81dbce418719ced58","observation_id":"b9688aaa-0df6-40c8-9a7b-589200ab408d","resolution":{"observed_at":"2026-08-14T15:07:34.641102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.02174","last_updated":"2019-08-06T14:13:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T13:06:24.368088Z","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":8},"total_outbound_references":20},"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 17 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.02174."}