{"as_of":"2026-08-21T13:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7179c02c9eef49d4a6c70672834abb731734ddc9585bad363b29930512a7b39d","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T15:09:22.109289Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.07934/citation-record","integrity":"/paper/2607.07934/integrity","json":"/paper/2607.07934/citation-record.json","paper":"/paper/2607.07934"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.17053","last_updated":"2024-03-28T11:00:52Z","snapshot_observed_at":"2026-08-19T21:18:47.096483Z","submitted_at":"2023-09-29T08:26:44Z","title":"On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters","version":3},"cited_work":{"arxiv_id":"2309.17053","doi":"10.48550/arxiv.2309.17053","metadata_source":"pith","pith_arxiv_id":"2309.17053","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters","venue":"cs.LG","work_id":"90e6cc1d-c928-48ef-8db5-9ce823947eca","year":2023},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"cited_paper":"/paper/2309.17053","citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:cc652ee3ed82faef77cea18165f27660d153c4b44df7d967ddb20702c9bf34dd","observation_id":"a03a4c41-3fa8-4387-85be-8c4347af7b74","resolution":{"observed_at":"2026-07-10T15:17:21.609799Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.930720Z","title":"Weisfeiler and Leman Go Relational , booktitle =","venue":null,"work_id":"ab50d3cc-9554-40ae-b9d1-bad127664891","year":2022},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:b797f02910c5f6eab54f4b4ea38c8ef09a90011af4f16340f0266c02af11efe2","observation_id":"5c909780-edcb-49f8-be5f-4bf8652a79a4","resolution":{"observed_at":"2026-07-10T15:17:21.931889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2025.88","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"443c52f9-8aef-478b-96ab-138b04137ae4","year":2025},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:f89aa4efd5397b2371dac7bc604dbcd961c823621fb5d605fc292fdad560fb4a","observation_id":"585a4793-062a-4df9-a0f2-af8099b46222","resolution":{"observed_at":"2026-07-10T15:17:21.658932Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-25027-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties , booktitle =","venue":"Lecture notes in computer science","work_id":"2c33531b-3c7b-4337-98b6-719bcdbe61ce","year":2019},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:fafdae9734298337102112d54217e107aece6b6557be50321fee66fcf03c144f","observation_id":"66d868e7-1f62-4e3d-9872-6766f3abf5e6","resolution":{"observed_at":"2026-07-10T15:17:21.640527Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.122","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Counting Small Induced Subgraphs: Hardness via Fourier Analysis , booktitle =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"757af119-604a-4590-88aa-d11060c67fed","year":2025},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:9ee9c3b5f99f4e02f7b24d951879b379967f0a2de9b13d7f5d16fcd006264f6e","observation_id":"6fc720cb-46f9-4371-b18c-bb2edcf997f1","resolution":{"observed_at":"2026-07-10T15:17:21.645578Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.946614Z","title":"2026 , eprint=","venue":null,"work_id":"c7700ed2-ccfd-454a-86ac-c2811bf30ced","year":2026},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:10d6d463b81ec18966a6f0da541ca790ed949d7eeb615e03aea9a9610d5be743","observation_id":"df52214b-0c2e-4666-a335-c1e429dc088c","resolution":{"observed_at":"2026-07-10T15:17:21.947948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-21275-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:17:21.616227Z","title":"6 Josep Díaz, Olli Pottonen, Maria J","venue":null,"work_id":"cc8dcfd4-029e-42d3-9ba1-999221a6d688","year":2015},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:b2ea4b659ff5af20199924bb285c3b152a958d811b98ad80d39bc45dbc691042","observation_id":"21b68ad6-9680-4d73-89c7-c3069207cab4","resolution":{"observed_at":"2026-07-10T15:17:21.617574Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.829959+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.829959+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-30786-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Color Refinement, Homomorphisms, and Hypergraphs , booktitle =","venue":"Lecture notes in computer science","work_id":"f25b2c45-1618-4c42-9300-3681296a83b7","year":2019},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:d962da490177f7a71af3d690fe6cca2eb83371d52b5980797a69fb9e3ab828dc","observation_id":"a3b48ddf-1dac-482f-a636-b2ae51f05ef5","resolution":{"observed_at":"2026-07-10T15:17:21.665047Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2264.2021","doi":"10.1109/lics52264.2021.9470514","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2021 36th Annual ACM/IEEE Sym- posium on Logic in Computer Science (LICS)","venue":null,"work_id":"aabc149b-4d07-477d-9e0b-a689cffdcefc","year":2021},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:f84d5a9df482866d1e24bd38c940e8e7efdaca204b1ada55eb1d24ed57945fff","observation_id":"fae161cb-8898-424c-8f9a-7ce7138287c5","resolution":{"observed_at":"2026-07-10T15:17:21.615687Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2013.01.012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Computer and System Sciences","work_id":"42baafba-fd8c-4024-9848-85a26a40e613","year":2013},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:de89bc41c166916b82f00ffaf82ad93013f8e501c42945538e0aa72194ef556a","observation_id":"fa1e85bd-025d-4d9c-9051-21b40e30fca3","resolution":{"observed_at":"2026-07-10T15:17:21.611439Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2018.40","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lovász Meets Weisfeiler and Leman","venue":"RWTH Publications (RWTH Aachen)","work_id":"a3769420-e0d3-4eeb-a942-294b99f5e033","year":2018},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:165689522575b09ac35a67f5863d8c9e8e09e182ef41272fc866d3c0c4e50c0f","observation_id":"864bdca0-37c6-4fca-a520-90c3edfa2302","resolution":{"observed_at":"2026-07-10T15:17:21.666711Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:05.130855+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:05.130855+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.943160Z","title":"Journal of Graph Theory , volume=","venue":null,"work_id":"77173f4e-e154-439e-b4ce-7726845a2683","year":2010},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:67e94f1985217f2857650f0b09533d4c5598e82c3a89883874a0f03efa22cd38","observation_id":"294e94c8-1f88-4d44-8d4c-446e32781b3d","resolution":{"observed_at":"2026-07-10T15:17:21.944276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.944801Z","title":"nti, Series , volume=","venue":null,"work_id":"f8eb3c2a-628b-4080-a33c-e7982897f950","year":null},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:dad3b49c41f1da09cfa30626a73853e6dc442ee7105c9e3aa333e80987554843","observation_id":"4e43eb28-a12d-4929-9a02-9b85bb3182f1","resolution":{"observed_at":"2026-07-10T15:17:21.946055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2636918","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Constraint Solving via Fractional Edge Covers , journal =","venue":"ACM Transactions on Algorithms","work_id":"5dbdc7ab-e46a-41aa-b034-5c36c0db1167","year":2014},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:aa8fc2712bcdb921fe263af2bcd7cd452fabf02759f20e8291ae74b274d05fcd","observation_id":"8d7fa8b4-6378-4109-a03c-d85e4b5292bd","resolution":{"observed_at":"2026-07-10T15:17:21.623637Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8318.156832","doi":"10.1145/1568318.1568320","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On lattices, learning with errors, random linear codes, and cryptography","venue":"Journal of the ACM","work_id":"8d5ac8b9-e44c-4a0d-9e47-e1abb0d9b3ad","year":2009},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:06fc8bfaece258ca8856f6e01e938e85d7d569bfe807fc7663a8ba51b57d889b","observation_id":"c9d8acd9-1ecb-4d44-aa32-3e662c334cbf","resolution":{"observed_at":"2026-07-10T15:17:21.637062Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2001.1809","doi":"10.1006/jcss.2001.1809","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hypertree decompositions and tractable queries","venue":"Journal of Computer and System Sciences","work_id":"a67c674d-a4e4-4971-86af-36a32e559da4","year":2002},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:8d1d756560f6dbaaddc344e8215cbf4f33048fd937adfee73aaab8340fd60773","observation_id":"27650d93-ea32-483a-a711-9d4fb1b96fd1","resolution":{"observed_at":"2026-07-10T15:17:21.634255Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2402.322390","doi":"10.1145/2402.322390","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the ACM","work_id":"c7901999-a506-4a7e-b816-19a1179a2bdf","year":1983},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:7c1ea5de120efecb110b796067a656a794134ac0c2ed03919c309a6da748f841","observation_id":"d25b4b7e-9d5e-4b28-81af-b11a1bb86f4f","resolution":{"observed_at":"2026-07-10T15:17:21.620154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.322347","doi":"10.1109/tkde.2022.3223471","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2023 , url =","venue":"IEEE Transactions on Knowledge and Data Engineering","work_id":"0eb0944a-5c07-401c-9760-2f758779bdf2","year":2023},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:d8b5701fea8490370ba8e3c3c979419b4e61f378d022bac0a81b3437dcf92a28","observation_id":"4cd65644-2c62-41b8-9256-d8e6950bb078","resolution":{"observed_at":"2026-07-10T15:17:21.649956Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.315431","doi":"10.1109/tpami.2022.3154319","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bouritsas, F","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","work_id":"666959ed-25f5-4d15-ad4b-4ac83c573c16","year":2023},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:450b3c12d638ff47a3995c951050be9832c92c5c5c76fa2b2ad57a6a2e9bb7ac","observation_id":"f04b73f1-901c-46a1-a31c-23ca36008c60","resolution":{"observed_at":"2026-07-10T15:17:21.661517Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.937656Z","title":"Proceedings of the ACM on Management of Data , volume=","venue":null,"work_id":"6857d124-106f-44f1-b2c2-eee300811365","year":2024},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:724ce793bb6b253996fb6539489ed44d9703fb95955244847faf0f217cbb1050","observation_id":"7fc1f9b2-8bd7-4e73-ab09-6fe0df8632f9","resolution":{"observed_at":"2026-07-10T15:17:21.938901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.939420Z","title":"and Lander, E","venue":null,"work_id":"3daa93a2-5ca4-4c7d-adb2-c9b000833fe4","year":1990},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:58e851fb0ee0c23cbc551b3ecdf17864b67517f236092080a72ccdf82cf15245","observation_id":"63971147-414d-4403-a02a-88b44e991e7a","resolution":{"observed_at":"2026-07-10T15:17:21.940686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2019.54","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Complexity of Homomorphism Indistinguishability , booktitle =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"dd521cab-0d5f-4949-9172-1ddccd3a7c42","year":2019},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:822fb0f6040a89be7bad046ad4d565289ca573ecb238201ed88822df2b2347e8","observation_id":"5ee4aaab-5adc-4cee-beca-22f1f7e0b9c2","resolution":{"observed_at":"2026-07-10T15:17:21.655386Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3771726","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity , year =","venue":"ACM Transactions on Computational Logic","work_id":"2471bf6d-04a4-4c21-988c-7d73210a0097","year":null},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:b3666f06391c7e61a5a1766791556007f292e2e42b9c57ace94dedd22d9aefbd","observation_id":"b0182f62-03f8-4308-87b1-ab40479dc2bb","resolution":{"observed_at":"2026-07-10T15:17:21.653643Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2024.82","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Algorithmic Meta Theorem for Homomorphism Indistinguishability , booktitle =","venue":"arXiv (Cornell University)","work_id":"35f5dda6-a9f0-442f-a9e2-b38501f475af","year":2024},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:824f49627049d5ac5bed0b6dd882f83f67aa50e415268136999c74703356d360","observation_id":"41e335e1-5559-4696-8b2d-4e29971087f5","resolution":{"observed_at":"2026-07-10T15:17:21.657031Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2023.82","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors , booktitle =","venue":"arXiv (Cornell University)","work_id":"ebedd6f0-1efa-4095-ac44-8aaf6d00bfdd","year":2023},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:e0776be78cf9282cd191b532ced13777fee8bbc9bf6dd3afd099b423ed3bea7a","observation_id":"71e6aab0-4d33-48cd-921d-d4ad1af78261","resolution":{"observed_at":"2026-07-10T15:17:21.603798Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2024.152","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On Homomorphism Indistinguishability and Hypertree Depth , booktitle =","venue":"arXiv (Cornell University)","work_id":"cf5f8a7a-3fc8-41ac-994c-b3e562577f65","year":2024},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:f070b5794e27f2b9041e81c933a15fbfa1fb5682dff92e6e6cc8ed07ab53c20c","observation_id":"2f2c1b59-4f66-42a9-ab72-0efb3c2dcc24","resolution":{"observed_at":"2026-07-10T15:17:21.600295Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2025.105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Roberson and Tim Seppelt and Peter Zeman , editor =","venue":"IT University Of Copenhagen (IT University of Copenhagen)","work_id":"3ebe2acb-3909-49ba-abc7-51fe4cdc09c5","year":2025},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:5881b552c530ce2789c3c1b7d73e8834931aa106159d14304273919acdd64d7d","observation_id":"33bed962-bba5-436d-8a56-66deef5463c6","resolution":{"observed_at":"2026-07-10T15:17:21.629644Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2026.25","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing , booktitle =","venue":"IT University Of Copenhagen (IT University of Copenhagen)","work_id":"dd626798-83ab-46c5-a2c1-5a2291d867d8","year":2026},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:a9d0fd9433f2ea8fa7b752ac51704b97b3f40ebe7b5cd41b2791f8c3ce67928c","observation_id":"103f34de-41c1-417d-a7c2-7d40a100b00e","resolution":{"observed_at":"2026-07-10T15:17:21.647388Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6700.2020","doi":"10.1109/focs46700.2020.00013","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"c016149e-231e-40ae-a771-6cdae0f78587","year":2020},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:0872a5c466bd2b165fa1c009eccec393ad6671a05d3d72d9af8d6ede6988e379","observation_id":"f582ddf8-f40d-443c-a2ad-82f3008976ac","resolution":{"observed_at":"2026-07-10T15:17:21.673841Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/theoretics.24.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lasserre Hierarchy for Graph Isomor- phism and Homomorphism Indistinguishability","venue":"TheoretiCS","work_id":"1cd2ca04-6242-4005-9684-5b408eb1248c","year":2024},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:f7b4bb873272e1868701f7439597d267dc2c7a17b08433feb5ef275f7a055d9a","observation_id":"0c0ee9fe-d4bd-4b69-9e8c-759348236f7f","resolution":{"observed_at":"2026-07-10T15:17:21.613071Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-05-20T11:52:31.37186+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T11:52:31.37186+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2024.53","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width","venue":"arXiv (Cornell University)","work_id":"0f9473b4-a099-440b-9a6f-efbad568963b","year":2024},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:6df710c36631be0800699fff9a193c09bb750226c57993a372e8e8676ca59adb","observation_id":"455ca90c-73c7-4c74-95ea-38ee9282cd02","resolution":{"observed_at":"2026-07-10T15:17:21.621886Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-05-25T09:53:20.187311+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T09:53:20.187311+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.20461","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On recognizing graphs by numbers of homomorphisms","venue":"Journal of Graph Theory","work_id":"99f85a81-5587-4628-954c-a7195047c82f","year":2010},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:d1d6a647a9dd1256cc12d7cdf0ce04e91cb0dbbd0d04d0458db5d72b9cbd4fb8","observation_id":"59a9556e-cbca-4704-b376-54091aef434d","resolution":{"observed_at":"2026-07-10T15:17:21.671285Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-13T16:49:41.718175+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T16:49:41.718175+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7518.289754","doi":"10.1145/2897518.2897542","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semidefinite Progr ams on Sparse Random Graphs and /T_heir Application to Community Detection","venue":null,"work_id":"01732f92-b764-429e-bfc2-ca72127d962c","year":2016},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:f3e96ea471f9d2f1168df89514ac66dbf43a25551d54a6c6ef531d8c370bb364","observation_id":"642433f1-a337-4fc8-8258-69ea6af289d7","resolution":{"observed_at":"2026-07-10T15:17:21.669638Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.934148Z","title":"2012 , publisher=","venue":null,"work_id":"c79bd40e-03b8-49ef-bb1e-4f7d64943f00","year":2012},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:6f012515edc1c35c94dd7406d60ef71af22fe5ad86ecbfdd1db3fe9987bc777f","observation_id":"c0a66da5-8ff8-41d2-85f6-695e58e7cce5","resolution":{"observed_at":"2026-07-10T15:17:21.935216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.935751Z","title":"The Twelfth International Conference on Learning Representations , year=","venue":null,"work_id":"1bf86e7c-750c-4c19-8753-03a9b7b90d9b","year":null},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:819e7f87c369fe4c9eeb16dc8de0dbfafe5ee53c7886c8d1aff7ff5648e6a360","observation_id":"28989c8b-d612-4d07-8368-46af82969400","resolution":{"observed_at":"2026-07-10T15:17:21.937124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01305232","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An optimal lower bound on the number of variables for graph identification.Combinatorica, 12(4):389–410","venue":"COMBINATORICA","work_id":"a989c5d0-7528-4651-94b9-d23d0b149c9e","year":1992},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:66faa2f0757b5f07d25743b29f5099dd0f1788e7f72c99c33bae9ae79d976c51","observation_id":"9d462961-8001-4cf2-95aa-f6323d67cc42","resolution":{"observed_at":"2026-07-10T15:17:21.663375Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-05-25T09:53:19.765347+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T09:53:19.765347+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2021.27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"fbc1f10a-1954-4167-b883-78f3c7813d31","year":2021},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:28542b6dbdb992a2b7e3be02fae80b2f090f1b09cad7f2dd6d38e0f47f943917","observation_id":"22ec4ace-e87c-49c1-995a-2c745b61ca29","resolution":{"observed_at":"2026-07-10T15:17:21.625304Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2019.117","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus , booktitle =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"70979550-dac3-4526-9557-e9de7098eb99","year":2019},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:44a02be8fbf71705089236f16ea8467fdab0565ddca15e2cca88055ef9161795","observation_id":"679ddfd0-b570-4fcc-9373-4f9ab0a1a254","resolution":{"observed_at":"2026-07-10T15:17:21.602046Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v33i01.33014602","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"8af0c145-235e-4630-9f1d-91643fa6de08","year":2019},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:d4b247edb733d9edf80cffc1af7569166dc9c26e7a317690c657ccd994c58c58","observation_id":"81a02c14-87e8-4365-96a5-0bcfa8bfa0ff","resolution":{"observed_at":"2026-07-10T15:17:21.605557Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:05.65791+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:05.65791+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-016-9686-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bonsma and Martin Grohe , title =","venue":"Theory of Computing Systems","work_id":"4550ca33-0799-41b4-8ec0-a93930930d96","year":2017},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:0de5c4cb035feb4839234dbeed8e6b7f313205b113d50818f00d083448405372","observation_id":"c44d8cf2-baa3-4006-b847-a95d122a3187","resolution":{"observed_at":"2026-07-10T15:17:21.607219Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0209047","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random Graph Isomorphism , journal =","venue":"SIAM Journal on Computing","work_id":"ff385600-6ca6-44eb-a3e9-187372c72036","year":1980},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:9afee119bba02c2aa8d69f22cbfaac905633264f32848fc515461a471357e1ef","observation_id":"810d5558-181c-4d1f-9b31-656c70ae43e7","resolution":{"observed_at":"2026-07-10T15:17:21.631477Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.941379Z","title":null,"venue":null,"work_id":"c349e03f-59b8-49b7-a835-3a15a044d4cc","year":null},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:2a058114b1c402a6d5eac40df545efefe5c0d726edb6580284acc291c7c05d52","observation_id":"793a950f-520a-4255-b779-56a96dfff8e4","resolution":{"observed_at":"2026-07-10T15:17:21.942642Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3333003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The W eisfeiler- L eman dimension of planar graphs is at most 3","venue":"Journal of the ACM","work_id":"cdc52990-754a-4542-97f2-1d590413966b","year":2019},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:59965a0a3fbd79aa7cb4c06f2d9cca15eef8b1a2fef592cd1c050767fff7784f","observation_id":"ed0b055f-5268-4d51-96cb-f37615bd661c","resolution":{"observed_at":"2026-07-10T15:17:21.651728Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.948484Z","title":"Kriege and Martin Grohe and Matthias Fey and Karsten M","venue":null,"work_id":"de7c8c61-cd3f-44f7-b422-bdaf678e0a09","year":2023},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:b1e73d9034d8ac5af9a6f530f2451d1f091bb165aa7c9d3a4f0dce7da9c07769","observation_id":"71ab9452-1544-44a8-bb89-25b85ad0ec96","resolution":{"observed_at":"2026-07-10T15:17:21.949807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3756323","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2026 , url =","venue":"ACM Transactions on Computation Theory","work_id":"2217fdc6-b295-4bf1-952e-fe75190576dc","year":2026},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:8472c0f4c01022a8160629e48af5aba7f80445430d341d58f4f753ddb1224389","observation_id":"dbc668d2-c249-443b-92cf-f7d85ad73075","resolution":{"observed_at":"2026-07-10T15:17:21.642131Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T15:17:21.932465Z","title":"Acta Mathematica Hungarica , volume=","venue":null,"work_id":"b70546cf-7ae2-4c64-9da9-f7a50f351d4d","year":1967},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:11d8e92b46f81fd96623789cca30af23751864b55e0262df1775b63c21a54838","observation_id":"71b618e4-fa9f-413a-ad74-346b300ffb22","resolution":{"observed_at":"2026-07-10T15:17:21.933610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2020/239","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems , url =","venue":null,"work_id":"096882e9-9ff3-47b6-954e-0e8e5a095f9d","year":2020},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:cd6c697d813ceefbbeb4ee7460f45283a7a8594c9bea9e70dad31eac3b3ac397","observation_id":"ee2fade7-5a37-46b1-8f10-abc79493e204","resolution":{"observed_at":"2026-07-10T15:17:21.638771Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3801900","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2026 , issue_date =","venue":"Proceedings of the ACM on Management of Data","work_id":"4dddcc65-02d3-4088-a34a-f928357682e8","year":2026},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:63476ea689ccf4f858b76af7999535d730fe473b271f6b3ded707fc0d7d5a0c7","observation_id":"19725f17-eb36-462d-ba91-40ded48c716d","resolution":{"observed_at":"2026-07-10T15:17:21.643880Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.114204","doi":"10.1016/j.tcs.2023.114204","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fractional covers of hypergraphs with bounded multi-intersection , volume =","venue":"Theoretical Computer Science","work_id":"fe94546f-af07-4fc0-a4ff-0c5abcf517d9","year":2023},"citing_paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-10T15:09:22.109289Z"},"links":{"citing_paper":"/paper/2607.07934"},"observation_digest":"sha256:ffe3718f604a2fcc881c832e5281aef02582252c2c3ce27198250bc3d8372995","observation_id":"b83fb573-663d-4033-925e-46e3e645cdd6","resolution":{"observed_at":"2026-07-10T15:17:21.627982Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07934","last_updated":"2026-07-08T21:30:51Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T08:35:23.927258Z","submitted_at":"2026-07-08T21:30:51Z","title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":1,"verified_exact":31,"verified_fuzzy":10},"total_outbound_references":49},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2607.07934."}