{"as_of":"2026-08-16T15:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ea4e9bd51ddf2f5c5bad388cfcd8cd30411e9e3f30d653d3563f69625b555d3","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:24:53.037132Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.05268/citation-record","integrity":"/paper/1908.05268/integrity","json":"/paper/1908.05268/citation-record.json","paper":"/paper/1908.05268"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.597119Z","title":"Corneil, and Andrzej Proskurow ski","venue":null,"work_id":"be8e1687-ce6e-41a1-9e21-fc55e54fe12a","year":1987},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.877384Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:5dbf6e375b8b6addf50dc3ee6c0bb9fc146aa9185b62b37c971a5b62947f19a3","observation_id":"428cfc6a-f77f-46bc-99cb-33798a27624f","resolution":{"observed_at":"2026-08-14T13:24:53.601634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.04801","last_updated":"2019-04-09T12:47:29Z","snapshot_observed_at":"2026-08-15T01:17:25.756606Z","submitted_at":"2018-11-09T15:44:43Z","title":"On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties","version":3},"cited_work":{"arxiv_id":"1811.04801","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.04801","snapshot_observed_at":"2026-08-14T13:24:53.115163Z","title":"On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties","venue":"cs.DM","work_id":"46d2e4f6-088e-4745-9bcc-597f09cd161a","year":2018},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.883503Z"},"links":{"cited_paper":"/paper/1811.04801","citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:3f20a157c120d34b3d305ee853054f1b8a9a3d4b0afa72fa4014cf7fd224c05f","observation_id":"7019c09a-5ed7-4ea2-924e-d7000427e3bd","resolution":{"observed_at":"2026-08-14T13:24:53.120712Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.577183Z","title":null,"venue":null,"work_id":"a0388938-b371-460c-9130-5755d8e24749","year":2013},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.889478Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:99d385076071bb4c38ac2fc5f9bace8fcfad5c134b5c700aa75934c06cf11433","observation_id":"05ebdf26-0551-4da3-9e9a-48ca24e0bc81","resolution":{"observed_at":"2026-08-14T13:24:53.584661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.559156Z","title":"Graph isomorphism in quasipolynomial tim e [extended abstract]","venue":null,"work_id":"bf22271d-233a-4400-ba1a-cbbd87e175c1","year":2016},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.893711Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:7510adc53af8317376369d71d3a53a016818bf9f185a8cdd2d97b63510e48f68","observation_id":"6f8801fa-52f5-438a-be62-d442242de3ac","resolution":{"observed_at":"2026-08-14T13:24:53.564980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.544635Z","title":"Faster canonical forms for strongly regular graphs","venue":null,"work_id":"c9a6f1fe-19ed-4ebe-b472-ce8dc693ad03","year":2013},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.898553Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:0c513f0218a979596b36fb03dd957eaa8b22f144544c378967bfc4b828daac95","observation_id":"0c560d2f-dfcf-4fb4-85b0-457f8532db05","resolution":{"observed_at":"2026-08-14T13:24:53.549216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.532625Z","title":null,"venue":null,"work_id":"036e8c61-ba1e-4257-91d6-9c3a357c638f","year":1996},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.903231Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:1f31f6f3eb814c250f1458c32624e8bc690c52a4419bbdbd41cd0efcf1c77808","observation_id":"724edb09-2417-4d79-b371-7eb2447bacb9","resolution":{"observed_at":"2026-08-14T13:24:53.536497Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.518641Z","title":"Brouwer and Jack H","venue":null,"work_id":"16052240-f56b-4763-ae28-03d0c963ed0f","year":2009},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.907944Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:09cb40ac86bc0646b65a792f14624657c4ae36f07ca37de301cc07dc077d0bb4","observation_id":"97cb39a4-31a8-43e5-93e8-df284fb04bc3","resolution":{"observed_at":"2026-08-14T13:24:53.522740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.502290Z","title":"Brouwer and Dale M","venue":null,"work_id":"1122fa22-8d29-4edb-95b4-889099931704","year":1985},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.912634Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:4cf239c907ced204f9dcb09594593d572c31aef4afd30726da8179e547fcd593","observation_id":"a4348810-5ed8-47dc-a5a5-234ecacc66b1","resolution":{"observed_at":"2026-08-14T13:24:53.506961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.483705Z","title":"An optimal l ower bound on the number of variables for graph identifications","venue":null,"work_id":"3d31e14c-a6fa-4cfc-b52c-287b258157c1","year":1992},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.917077Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:580f8307ee0de3d9f09ec8a017fda7cc2936375e944c64c859ad403523460086","observation_id":"73999d3e-b758-470b-88f3-125249a10a67","resolution":{"observed_at":"2026-08-14T13:24:53.488702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.464328Z","title":"The power of counting log ics on restricted classes of finite structures","venue":null,"work_id":"0f511d62-a2c5-4bcf-9f8c-7cec63c05ddb","year":2007},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.921118Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:edfc708d09331a03cddf0ff8c77dcf0b61838a70a1fd4c3819c577f5c31bf88f","observation_id":"f5f5f74b-9c41-491a-8388-927575403342","resolution":{"observed_at":"2026-08-14T13:24:53.468475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.448242Z","title":"Lovász me ets Weisfeiler and Leman","venue":null,"work_id":"15e6df0f-d59e-4056-a80c-818de55829e4","year":2018},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.925491Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:601aed010779ea027d4907b875939dc8a071730a9418d1e29a6fe59458582a0a","observation_id":"8e9d5acf-558b-4029-b003-95fa8a5812ec","resolution":{"observed_at":"2026-08-14T13:24:53.452441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.433366Z","title":"On the vertex co nnectivity of a relation in an association scheme","venue":null,"work_id":"f9311132-1ee7-4bab-9741-cbfd879e16c1","year":2006},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.929636Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:238a634ea3b98ade8c247392419ddc03d274c32ebaa1023e352dfe7115cbee58","observation_id":"0ca4e856-b07c-49b7-ae11-41f8edb8e9ff","resolution":{"observed_at":"2026-08-14T13:24:53.438716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.419606Z","title":"On the combinatorial power of the weisfei ler-lehman algorithm","venue":null,"work_id":"eb290ef1-66b3-4f36-ad00-0b7ebe68c35c","year":2017},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.933830Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:30ebf0cdbffa3c8974284679d42d03ddc85a94e0eb43e4103d1f02e7a7e1a0bb","observation_id":"f881e3a5-0de9-4794-974a-77017da556df","resolution":{"observed_at":"2026-08-14T13:24:53.423777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.408147Z","title":"Fixed-point definability and polynomial time on graphs with excluded minors","venue":null,"work_id":"2fffbb48-d111-4614-83e1-a12bb8347f7f","year":2012},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.937955Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:117ab295a83e60d81f68fd626c2405cff763df928ce3fcc4349e678f4fcad93a","observation_id":"24c6724c-f50d-4145-b210-3e161f952b8c","resolution":{"observed_at":"2026-08-14T13:24:53.412010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.395635Z","title":"Descriptive Complexity, Canonisation, and Definable Graph S tructure The- ory","venue":null,"work_id":"72e7e313-87fa-44b0-80dc-ee8b2959b5af","year":2017},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.942155Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:b170625d1c8d9024576c9acf97b36f605e05f87cde8ea7b16fb0255ed87205f0","observation_id":"e0d92a92-678c-4343-81e2-4ec1efc06fab","resolution":{"observed_at":"2026-08-14T13:24:53.400697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.379827Z","title":"A linear upper bound on t he weisfeiler-leman dimension of graphs of bounded genus","venue":null,"work_id":"4f84a798-5910-4979-9959-982edaf5dc54","year":2019},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.946342Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:d5f892c53454369a4460b88fda325139b50881bcaff8120700b6aebab04ed189","observation_id":"264f0951-c211-48a4-b54b-17ba7f1e2fbe","resolution":{"observed_at":"2026-08-14T13:24:53.386366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.365307Z","title":"Definability and descri ptive complexity on databases of bounded tree-width","venue":null,"work_id":"ae47d437-f6be-46e6-b81e-960c715ff4c7","year":1999},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.950432Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:b9085b52f5b009495f25f523fef27a345245e849380c4eb652f9597fcb56556c","observation_id":"991be5c8-dfed-4c43-933e-7c67a1343fe2","resolution":{"observed_at":"2026-08-14T13:24:53.370607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.351870Z","title":"Canonisation and definab ility for graphs of bounded rank width","venue":null,"work_id":"1ede6034-909c-46dd-92b0-b15535a8af86","year":2019},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.954667Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:c253938afcca4707893c2df36fb64fd490a787d23bcfd255e05d44d22dd150a8","observation_id":"9d63f364-e7ac-4c45-8fc8-5dedd3ef82e3","resolution":{"observed_at":"2026-08-14T13:24:53.356197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.338856Z","title":"Pebble games and linear eq uations","venue":null,"work_id":"8c0b318a-2980-41a3-969a-1253e0c4b0ea","year":2015},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.959400Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:ee0640927115e234ba7473fd05bb4dc0cbb64bbf53340210c1a1c959977c80c0","observation_id":"11f8eadf-706f-4190-9c1c-5b598b19ebd8","resolution":{"observed_at":"2026-08-14T13:24:53.342541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.326175Z","title":"Logical hierarchies in PTIME","venue":null,"work_id":"7b3597bc-5d44-4f7d-b606-c966d9a29c44","year":1996},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.965206Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:cb7d3fbc2e6027ec7470a00b8f94ab377ffdecb2ed214b6203e7649f09b68dbe","observation_id":"0497ba19-7630-4353-9feb-ae8d8e9245a9","resolution":{"observed_at":"2026-08-14T13:24:53.330571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.310579Z","title":"Hopcroft and Robert Endre Tarjan","venue":null,"work_id":"e64af808-68bd-4ebe-8131-4da57a5e71e5","year":1971},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.971768Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:23b6e1fe500ab656666b91a9d28aa5bb75d2eaf03b3fae5f610e131f5c045019","observation_id":"404c2574-8168-4f80-b2e8-cd469d13a376","resolution":{"observed_at":"2026-08-14T13:24:53.314681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.296590Z","title":"Hopcroft and Robert Endre Tarjan","venue":null,"work_id":"5dbb024d-5376-4821-9399-69e6a107119e","year":1972},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.976372Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:fe2c04dd8b141b195e561a6235691eae3ebc35ad19963310d1e8143dd30fd565","observation_id":"519e1832-737b-48ed-900c-6fc16c016d5f","resolution":{"observed_at":"2026-08-14T13:24:53.301921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.283122Z","title":"Hopcroft and Robert Endre Tarjan","venue":null,"work_id":"e1353f63-5962-4612-93dd-b1265e1c0233","year":1973},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.982685Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:a2d6c8bacfc4f081188361ea0850019b285cb0937fa3da5c306635d296f49651","observation_id":"7cf5b1a2-c019-4c38-852f-4379b127f807","resolution":{"observed_at":"2026-08-14T13:24:53.287381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.270239Z","title":"Hopcroft and Robert Endre Tarjan","venue":null,"work_id":"14109864-0b8b-474b-954a-139b09cc4f78","year":1973},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.987046Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:139fa0c011d17055ef93ea4a45b25f618dbb8a2c0d13f04df0d75b816a9c0c22","observation_id":"6957bfc1-79ae-4345-baec-2053f562594d","resolution":{"observed_at":"2026-08-14T13:24:53.274644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.255996Z","title":"Hopcroft and J","venue":null,"work_id":"bb851c9c-00d9-49ae-87a8-b942048e28e2","year":1974},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.991125Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:25216a56dd411149df979b3e3af96c6e6873125421ee36ebc45ee526da8ba4a2","observation_id":"fe09a306-c03f-4286-b32e-87e54e239989","resolution":{"observed_at":"2026-08-14T13:24:53.261128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.242172Z","title":"Describing Graphs: A First-Order Approach to Graph Canonization, pages 59–81","venue":null,"work_id":"43d6251b-6b6f-4568-b0c9-780d2dbe39ba","year":1990},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.995371Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:eaf3fbc1aa423aec69357ca133b0506e084b7b06ffb2f73fc28eba241820ed60","observation_id":"10a33e15-ab1d-4b5b-997c-c19c0d202b21","resolution":{"observed_at":"2026-08-14T13:24:53.246584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.226929Z","title":"The Weisfeiler-Leman dimension of planar graphs is at most 3","venue":null,"work_id":"be30c966-0c0f-4aed-8a9d-dd07c13978b5","year":2017},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:52.999169Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:f42eb776f1534fee0c0195b977bdd44f273dfa9370a71bc12bbc1e4bde365ee2","observation_id":"bf65c8a5-b797-40f8-85b0-ec86aa8009f9","resolution":{"observed_at":"2026-08-14T13:24:53.232149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.003351Z","title":"Treewidth, Computations and Approximations , volume 842 of Lecture Notes in Computer Science","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.003351Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:ae86f37431126c4a75566f39de17138c7769aeca86807b4ff389d0951182d406","observation_id":"eda61667-adb5-49f2-addc-85e3f0c7804f","resolution":{"observed_at":"2026-08-14T13:24:53.003351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.206681Z","title":"Kodalen and William J","venue":null,"work_id":"4f469134-8f8c-45ff-bf22-6d0cf941bedd","year":2017},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.007771Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:fb0cb974bebb67889d808af251eb68682a6caba332bbf6ace8d323f9d801742f","observation_id":"6c90f913-7997-4ce4-8a10-b2b3cc4a98d9","resolution":{"observed_at":"2026-08-14T13:24:53.210737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.194259Z","title":null,"venue":null,"work_id":"fbad0320-e48e-4b0e-809f-2c3ca56c8cd0","year":1981},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.011692Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:3acafca55b052b15e823ccd4c78c9194c1b5064921e730ef1d061ea27098717c","observation_id":"56f6bda7-e1b8-4ae4-a211-66235d5f35ee","resolution":{"observed_at":"2026-08-14T13:24:53.198682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.180650Z","title":"McKay and Adolfo Piperno","venue":null,"work_id":"8ccf9c18-1146-4e36-97ce-75e823563884","year":2014},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.015996Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:a4d0a654042cafdc7cd518f2cab374cfbc01f05819e624295358e8169e2d7304","observation_id":"638b86e1-bcb2-41a1-af05-25cd7fc3507e","resolution":{"observed_at":"2026-08-14T13:24:53.185548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01543","last_updated":"2020-10-19T15:54:46Z","snapshot_observed_at":"2026-08-14T16:52:52.018019Z","submitted_at":"2019-04-02T16:59:19Z","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","version":3},"cited_work":{"arxiv_id":"1904.01543","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.01543","snapshot_observed_at":"2026-08-14T13:24:53.091184Z","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","venue":"cs.DS","work_id":"d35c209b-f9ce-4a58-ba8e-55e24270be10","year":2019},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.020290Z"},"links":{"cited_paper":"/paper/1904.01543","citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:4b0aef4de53ea2c89884fea79cca54ac85bf611641cf1df4e4e0fa62a49f05bf","observation_id":"d3c14b3d-f194-46b5-963b-fba40d7b0075","resolution":{"observed_at":"2026-08-14T13:24:53.099336Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02244","last_updated":"2021-11-30T15:37:55Z","snapshot_observed_at":"2026-08-14T18:19:29.349171Z","submitted_at":"2018-10-04T14:31:57Z","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02244","snapshot_observed_at":"2026-08-14T13:24:53.024417Z","title":"Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.024417Z"},"links":{"cited_paper":"/paper/1810.02244","citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:f3f214b695c70e875cc42bf9a5c57390ec7b55e6c2ee71ad313134ff9ef1f203","observation_id":"141c721e-a9ba-4172-abdf-50745f187f39","resolution":{"observed_at":"2026-08-14T13:24:53.024417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.161787Z","title":"Graph isomorphism for unit square graphs","venue":null,"work_id":"d4a920a7-3eb7-405e-b503-6b48c8e634c0","year":2016},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.029596Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:47563f5955d1c153e827a10222fabf1d5dc4bc45cca26cc73a7069de4b081874","observation_id":"6f075e3e-4f85-407c-afd3-ec9133f8b587","resolution":{"observed_at":"2026-08-14T13:24:53.168399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.147390Z","title":null,"venue":null,"work_id":"02376cc1-fa14-45ec-9e73-88eec6f11490","year":1984},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.033514Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:c8925b879ba01eaa4f9cae83a564d960bd258a511d69840eb7945fafab157199","observation_id":"40ab9fe9-8814-49b6-9f3e-f1cce103a579","resolution":{"observed_at":"2026-08-14T13:24:53.152354Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:24:53.133038Z","title":"The reduction of a gr aph to canonical form and the algebra which appears therein","venue":null,"work_id":"1d2f6956-ede2-47ae-8d28-d1ad057629e4","year":1968},"citing_paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:24:53.037132Z"},"links":{"citing_paper":"/paper/1908.05268"},"observation_digest":"sha256:f525c247e4264845a0b945600d186dcf8daae34fe219449bc906561572434fe2","observation_id":"4a960e79-d268-4f14-bac7-29769310485d","resolution":{"observed_at":"2026-08-14T13:24:53.138509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05268","last_updated":"2021-09-22T11:29:58Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T13:16:55.095968Z","submitted_at":"2019-08-14T17:49:29Z","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.05268."}