{"as_of":"2026-08-11T21:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2494b7954919bb4adeaa07a4584696a0a38c714a26fc5e930c1bb1067a46ff49","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T08:10:14.148558Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2607.10941/citation-record","integrity":"/paper/2607.10941/integrity","json":"/paper/2607.10941/citation-record.json","paper":"/paper/2607.10941"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T08:10:14.148558Z","title":"https://warwick.ac.uk/fac/sci/maths/people/staff/daniel_kral/alglogstr/ openproblems.pdf, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:3594a3fbebd943ea6bc9dc121e0c81343fa4a0e1fdbe1c77b57e87ae5d8b4648","observation_id":"f4220f29-20f0-4c85-92e9-1462844a8a5b","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Interpreting nowhere dense graph classes as a classical notion of model theory.European Journal of Combinatorics, 36:322–330, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:baf600051bd1c2dd8ebf3a075110432a7c77346c5c942cf92cf994cf2989237c","observation_id":"347eb531-9826-4f20-91ef-c491c32a9d26","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Implicit representation of sparse hereditary families.Discrete & Computational Geometry, 72(2):476–482, July 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:bca53ba88d931218788f3fc4aeafe4c7771a08b36a8f6038c15b36716c93b0cf","observation_id":"741ee101-3339-4323-9adf-78e9796c5526","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Second-order quantifiers and the complexity of theories","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:7b9d575c9b828eb35010b8e339fcd382feee43fbfeab3eb84b86c18cabf0d92e","observation_id":"73f4ee18-bca1-477c-ad2c-94fbbaeada38","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08266","last_updated":"2025-06-16T02:19:29Z","snapshot_observed_at":"2026-08-07T16:06:38.444747Z","submitted_at":"2025-04-11T05:43:21Z","title":"$\\chi$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.08266","snapshot_observed_at":"2026-07-14T08:10:14.148558Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"cited_paper":"/paper/2504.08266","citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:62abc352ad66d3292fd4370fd444cec19bf5005e7eea80789cdbd6e9f4124b9b","observation_id":"f8ed278f-1064-4d17-a858-78f29f54266e","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Adjacency labeling schemes for small classes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:a8ca64d96213f930e93c505312cd282acfe53f9a499307edf0b106ab6c000c40","observation_id":"c70a2d99-29ed-417a-b150-b2105280d5c3","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Twin-width III: Max Independent Set, Min Dominating Set, and Coloring","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:59056d4b7b98474577acb39f47e944f8755b379960689eeb77f7c052c7dce385","observation_id":"0f0625fe-59f6-4295-bff7-17c2ddaa417e","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Twin-width IV: Ordered graphs and matrices","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:60f1a3f8ea69212e310e3ce27c2e0dde1cff0a700fb55e75f9bbb0af7618d7b0","observation_id":"51a3f937-9cf0-49c9-9cb6-b763bb7a25a5","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Twin-width I: tractable FO model checking.Journal of the ACM, 69(1):1–46, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:d554fbc1479d47da6a0f1eb98954e53b10a60cb87ac25d5d0e25ced87f49ed19","observation_id":"813dcb4d-aa88-426a-9b51-4c62beccf9c1","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Quasi-optimal range searching in spaces of finite VC-dimension","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:cb18bc1a3f6cb542778de5339e76e13b1087e3a1cfd59f2a1222cbf920db7b9d","observation_id":"0ba8091f-eb8e-47bb-8c07-defb46bcfe5c","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Linear time solvable optimization problems on graphs of bounded clique-width.Theory of Computing Systems, 33(2):125–150, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:659248b79b6bfa2eb9f016bce1708d8b5e5cc6ba30d19e97901bdf9162d58c46","observation_id":"beceb744-d9c0-4cf4-9b5d-0164515b8edb","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"First-order model checking on monadically stable graph classes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:202a17cb52072d3e413192912662f712681c49437a2317fac6caf021c5519af8","observation_id":"ff9a7faf-0d91-475f-817e-900ea0d305c9","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Near-linear time computation of Welzl orders on graphs with linear neighborhood complexity.Arxiv preprint 2602.14625, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:50b516334cd2c4fcde30ce07851405cf4900c3a17dc6207e568346e4b3d942e9","observation_id":"e4c7f4d9-9383-4314-b127-932ec6965710","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"First-order model checking on struc- turally sparse graph classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:ca9c8a57f098e6dc537e29789c1490cc173169780694f0b6cc3621dd8854faaa","observation_id":"a351dd9a-384b-4b83-82c1-ff3b0d7a8bde","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:7aa98f9dff9f996bf6e65af774847c4ae070b0dd86bac66d975fa8c1b9129ac8","observation_id":"783c8b04-75f6-4f08-ba5d-ff2136843d5c","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Merge-width and first-order model checking","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:174bea4ace9c9cbfb5df97ff040cb88d0d8882b9648d198cee70c2cad5d3e8e2","observation_id":"03c20566-65c9-4f4f-b8fd-1e2a4006dc04","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Better diameter algorithms for bounded VC-dimension graphs and geometric intersection graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:94de6e2ee73b17eeabea71c799afc2e8b72900ce800d7694ba71af67e29dae3e","observation_id":"d1811945-b4c3-446c-a0f9-fe3d547200e8","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Induced subdivisions and bounded expansion.European Journal of Combina- torics, 69:143–148, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:2629ab0b23c7c8b940854af841b4de078e736720c22db5acb0f1e992f72c04a6","observation_id":"255f1334-e514-45d0-a4c8-2c8a6d186118","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Testing first-order properties for subclasses of sparse graphs.J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:33ae0e875be3a272d1276865055c2b3c059e30fce988a1487a170b39f57a6609","observation_id":"fdb4337b-1c47-4173-a8f9-5264ddc4ab29","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michał Pilipczuk, Roman Rabinovich, and Sebastian Siebertz","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:d19f1a37f5aef550c5783b27fab9ba80c1397eacc10a67483f8859a2f457c12c","observation_id":"77c86fd8-6557-453e-8490-c34d3046b83a","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:0e0765f047d3901f57e871ebd91a823258a0eb712bc35737666686166b7051f2","observation_id":"99fff0e5-c100-4f75-8462-388fe3f8d7ab","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Deciding first-order properties of nowhere dense graphs.Journal of the ACM, 64(3):1–32, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:3330ec50c81aeb98b61e0aefee6d91302c546302185ad54c875749bcdd3acce9","observation_id":"e5eb75ed-b4c6-4268-95f7-22ca4792810b","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Haussler, N","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:f8499284b1609965240f88d4f2fb2529e48a7ee7d3c9cebd0335fef3e7bbcdb0","observation_id":"578b0c02-e6ce-4656-913a-4179e5816a2d","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Sphere packing numbers for subsets of the Booleann-cube with bounded Vapnik-Chervonenkis dimension.Journal of Combinatorial Theory, Series A, 69(2):217–232, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:a55801e4869c375b68e838f0891381ef57fa4ee2128bdb60f56357d6bcca596f","observation_id":"46c201ad-8cbc-4386-a49a-5a76c6a47a9a","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"PhD thesis, University of Bremen, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:7479779e6d1250b902981982dc392dc3f15caee991a8c117fda2689ffc88ad31","observation_id":"b15c07ec-65a3-418e-9c75-a94c121bf870","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Springer Berlin Heidelberg, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:a6b6ea53e9e651bd736378347dc3f889aedc3058141118ffd02598d66c6a8a91","observation_id":"46e88ea5-a402-4f04-8337-a62a574f4220","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Rankwidth meets stability","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:9bfd1387d2573686cb4469580602447cd6f558e547057d1b5731ff345312cd89","observation_id":"ce1dddfa-cdd8-419e-905a-c9e8f6fd5612","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Graph spanners.Journal of Graph Theory, 13(1):99–116, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:0afcdd62ee7c40818b6bb3595e181ed39690d1a6707727a7f8454180c8e176e7","observation_id":"df12813a-1959-4397-a2cf-fcfb93ffce99","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Chapter 1: Measuring sparsity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:8929512431f26f1d6f6a09115ac58acce0f658bc7b915861a566dcc8579178ce","observation_id":"39f81c04-524b-461f-a110-72fa34e47492","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16745","last_updated":"2025-05-22T14:54:15Z","snapshot_observed_at":"2026-08-08T16:38:46.489815Z","submitted_at":"2025-05-22T14:54:15Z","title":"Flipping and Forking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16745","snapshot_observed_at":"2026-07-14T08:10:14.148558Z","title":"Flipping and forking.ArXiv preprint 2505.16745, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"cited_paper":"/paper/2505.16745","citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:51f0135b8d5d4e7dce47cdd28dcda2de1eb37448f227c2a177a0569755f2a9cf","observation_id":"7bd0d798-8810-4086-8267-d0601920df42","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"On the density of families of sets.Journal of Combinatorial Theory, Series A, 13(1):145–147, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:eab65a7fa8589af5979b33c3421a5911737586363a07ebc0f96a014e2f406c2e","observation_id":"65262cb1-c468-4414-8cac-439e407f8dee","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"A combinatorial problem; stability and order for models and theories in infinitary languages.Pacific Journal of Mathematics, 41(1):247–261, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:03117435bbc235ed4d867026536cf108b3c2336a306e4110257a6d434a56204c","observation_id":"691490ee-22a2-4b7b-86e0-3917db7e1a75","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00352","last_updated":"2024-03-22T21:04:55Z","snapshot_observed_at":"2026-07-06T14:47:00.945435Z","submitted_at":"2023-02-01T10:24:05Z","title":"Flip-width: Cops and Robber on dense graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00352","snapshot_observed_at":"2026-07-14T08:10:14.148558Z","title":"Flip-width: Cops and robber on dense graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"cited_paper":"/paper/2302.00352","citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:d8cee8367d750fd3b934a51138772a5cc06f5926320dbc7950298d8d3df3be4b","observation_id":"03dbd727-03d6-4cd3-9354-718c1208d7bb","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:28fdd8d26ddae78edeaecbef7c1a0add26a95e2628c1e0b4bcbd7d4ad880cee5","observation_id":"24690afc-1034-4ea2-bd08-0d077631d95f","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Fast shortest path in graphs with sparse signed tree models and applications.Arxiv preprint 2602.16605, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:db6cc54ba9d0b74a070f767ed491b708351cad8727494b43ae51da04f3de02fc","observation_id":"0f699751-191f-44ff-abd9-b1353085c92a","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:d3864bb711f4a42588d32e09cb373f9c184f36f92ab95bcfffa3aad6ab4cf49b","observation_id":"556f04af-4d58-4440-af29-5d425b198a03","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:dcdd8d39b596c4a5d27e7bf2aab3792e922005915046249f60cecfdd03049730","observation_id":"86a31a73-fb69-4161-898d-8098cabdb30b","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Combining these three points yields a terminalk-sparsification withk⩽dand sizessatisfying |B| polylogd(|A|) ⩽s⩽|A| ·subpoly B,d(|A|)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:fa99543b05d3da699e38a03472bacc8fc00542e246ae3f898b42b3b616223d7e","observation_id":"6f24cd22-7ba0-4c3b-bc67-3f66778fcd14","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Thus, the new sparsification has dimension at most d−1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:34a4b0c7065b425c557c8f9ca486a6f6f7e7181c2baed3713efa38cc89e19a43","observation_id":"c06fb4cc-5c6b-4516-88d2-cb266862dad9","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:775739dd88e5092a4ff9fe2723cafeb4ca8c42cfeab420c314e1bf12cba7f3b2","observation_id":"9e5b65a1-eb57-4e24-8ab8-dcd086154362","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","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-07-14T08:10:14.148558Z","title":"Now we can use Lemma 27 to prove the key lemma about fractional twins","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T08:10:14.148558Z"},"links":{"citing_paper":"/paper/2607.10941"},"observation_digest":"sha256:7d5a75ab2e74d392ed06e6011f43394b636896a8600d807d03c03e640bea9671","observation_id":"dfe58644-267a-40cc-8416-071d2053fe37","resolution":{"observed_at":"2026-07-14T08:10:14.148558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10941","last_updated":"2026-07-12T22:04:50Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-07-16T23:19:06.410210Z","submitted_at":"2026-07-12T22:04:50Z","title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2607.10941."}