{"as_of":"2026-08-12T08:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92ac7cc6f140185d6ff7b882621a5a04fa60dbb264bc033bbb532d6d7752cea9","coverage":[{"denominator":82,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":82,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T04:45:01.492472Z","state":"measured"},{"denominator":82,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":82,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.08614/citation-record","integrity":"/paper/2607.08614/integrity","json":"/paper/2607.08614/citation-record.json","paper":"/paper/2607.08614"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4246.358520","doi":"10.1145/3564246.3585204","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree , booktitle =","venue":null,"work_id":"72f97daa-2316-4057-86c2-4d1c68f33ea5","year":2023},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:ee1c0d462860be72b30976ee3b1b5c83d057475a7d65c373aecdf6f4657725b9","observation_id":"0dfc811b-9c6c-41d6-80fd-ecdf0985e4f2","resolution":{"observed_at":"2026-07-10T04:46:45.750899Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:01.350719+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:01.350719+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8661.301873","doi":"10.1145/3018661.3018731","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Leskovec, Jure , year =","venue":null,"work_id":"485aa8f2-60cd-4a6b-b869-c4a4a12ee974","year":2017},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:f54089ddcb71d36c475f3eaea07be86804c42c59815a4aa7a0b585c1c8db5815","observation_id":"5760e58c-d8ca-48e4-9d49-4f486b0ca321","resolution":{"observed_at":"2026-07-10T04:46:45.729707Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:01.617744+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:01.617744+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.884763Z","title":"IEEE Transactions on Knowledge and Data Engineering , volume=","venue":null,"work_id":"86041f31-2cae-4bb2-8521-23ef97273414","year":2021},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:44f234852c97ec8acea866158d908e44339cc9eacfed30f19a1b970b339f9fc4","observation_id":"63d0aa3e-83ca-43a7-b8b5-4a27ddebcee3","resolution":{"observed_at":"2026-07-10T04:46:46.886370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.889226Z","title":"Discover Data , volume=","venue":null,"work_id":"541b42e0-ff32-4a3d-b83a-2f75d7efdb2a","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:ca6acd35490bd3dbb2ec8c40c410cf527a273bbe7b6da78b19092d29c85453a5","observation_id":"710f9ada-1577-4327-885c-c166c4e96840","resolution":{"observed_at":"2026-07-10T04:46:46.890720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.08.008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The complexity of counting homomorphisms seen from the other side , journal =","venue":"Theoretical Computer Science","work_id":"d71a5d36-30ac-468b-9c7d-471d08551162","year":2004},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:ab243eb9bd39c1ef0d70257b88ab6c442675152b96622bc2a2f457e4aecde36e","observation_id":"8b5c9134-2736-441f-8cbc-41a1c9d7cf17","resolution":{"observed_at":"2026-07-10T04:46:45.717981Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:01.852945+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:01.852945+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2010.v006a005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Can You Beat Treewidth? , journal =","venue":"Theory of Computing","work_id":"b3b0485f-6745-4c0b-b410-edef7d8df0b1","year":2010},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:af0a24c4e50ac2c1dd0b234993ff71763d6415ab8e2d5462440745ee39b65a3d","observation_id":"f6b5d88f-3d2a-4331-a700-9127f72b74c3","resolution":{"observed_at":"2026-07-10T04:46:45.734791Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:02.098496+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:02.098496+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.893934Z","title":"Complexity of","venue":null,"work_id":"2192efea-a91c-47f5-acab-cad65d79a65e","year":2014},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:146eec641f1715f9b18565bd1ca0a7c2b4a3c009d57953a0d7fd0cf03f147d33","observation_id":"aec3adab-8e45-4764-a40b-6e9a7e25907c","resolution":{"observed_at":"2026-07-10T04:46:46.895416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5399.305550","doi":"10.1145/3055399.3055501","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"https://doi.org/10.1145/3055399.3055501 Area-convexity, l\\( _ \\( \\) \\) regularization, and undirected multicommodity flow","venue":null,"work_id":"b226cd55-eca5-4cef-bcc9-80180d09614f","year":2017},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:99abbbd524ff725a404a124ec83418fcc48742c55151386df93cf337c988effd","observation_id":"dea0197e-4684-420c-81a4-3801aa7522c7","resolution":{"observed_at":"2026-07-10T04:46:45.721214Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/22m1512211","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2024 , url =","venue":"SIAM Journal on Computing","work_id":"bbf331d7-816f-4300-904a-0b410f8236b3","year":2024},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:e7220e36027d3dd43e806cd2ba16bd6572169cb654aa88b91c6d1735d6764c3a","observation_id":"787295ec-adfe-452b-8dcd-f63297eddde4","resolution":{"observed_at":"2026-07-10T04:46:45.723823Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:02.695814+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:02.695814+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8260.364964","doi":"10.1145/3618260.3649641","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[GPAM+20] Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing X u, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio","venue":null,"work_id":"94e20ab3-f068-4909-bc16-98f961bff88e","year":2024},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:4766871fb44f7b62ab58446488a14c79af03ede8b73edb556a3081830fe57e90","observation_id":"1c41964a-6156-4061-aaed-2a4e62c49e08","resolution":{"observed_at":"2026-07-10T04:46:45.759620Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9600.329098","doi":"10.1145/3289600.3290986","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ISBN 9781450359405","venue":null,"work_id":"96e8a698-2330-4d63-ba2b-d6cfc6e4c9a8","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:242fa485400ef438319bdf5d6323732c93b7ed1ddeb77690b1fbe4fa783249b2","observation_id":"a718230b-71ae-4f14-9e48-98b254ecf5b9","resolution":{"observed_at":"2026-07-10T04:46:45.729108Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5760.2012","doi":"10.1080/17445760.2012.668546","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Casteigts, P","venue":"International Journal of Parallel Emergent and Distributed Systems","work_id":"1975d49e-993f-4600-9b3f-2ce4321502d7","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:372a6369e4d422e2118317c75d9effbb3a9ad93bf6b30b48fd655eb937cdcdd4","observation_id":"b23c2556-9416-445f-b034-c36cbe0f96cf","resolution":{"observed_at":"2026-07-10T04:46:45.755088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:03.582591+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:03.582591+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-021-00831-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding Temporal Paths Under Waiting Time Constraints.Algorithmica, 83(9):2754–2802, September 2021.doi:10.1007/s00453-021-00831-w","venue":"Algorithmica","work_id":"bae8c2fd-5a48-47cc-b664-df9c8fd58307","year":2021},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:36f6d5b15529fa850d3cfaba0e0233613ba4a2556520d78e26ea178a00bbebef","observation_id":"25c8bcc9-5e16-4927-abb0-df8f689c104f","resolution":{"observed_at":"2026-07-10T04:46:45.744070Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:03.918853+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:03.918853+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(99)00184-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Upper bounds to the clique width of graphs","venue":"Discrete Applied Mathematics","work_id":"96fa7bc9-b67b-48a3-9417-a1fac361876e","year":2000},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:14d163ce80d61913e67c47a1648cb88d588a30eda256b15a6a3de28f5efc6da2","observation_id":"ed65b251-b742-442d-b600-db10203dabf9","resolution":{"observed_at":"2026-07-10T04:46:45.693162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:04.171407+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:04.171407+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2005.05.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kanj, and Ge Xia","venue":"Information and Computation","work_id":"b17bba6c-f391-4e58-a3a0-f420e1942b05","year":2005},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:8bf63f9fe55fcaa65a87a4871fc5df259043272d2c3fb8f1d31ae244be0fbcbb","observation_id":"b3dd94d5-8ed0-459d-8201-bbdcd1941a5c","resolution":{"observed_at":"2026-07-10T04:46:45.686677Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:04.396047+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:04.396047+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2006.04.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kanj and Ge Xia , title =","venue":"Journal of Computer and System Sciences","work_id":"385595a5-a562-4851-9718-465776d8d54f","year":2006},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:ac6efcba09d07d661eaa39012eb312a295214cebb4374dc694adb250ef8f3225","observation_id":"299eb7f3-ae64-4097-b262-6741c8f3c8aa","resolution":{"observed_at":"2026-07-10T04:46:45.684634Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:04.620982+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:04.620982+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.1727","doi":"10.1006/jcss.2000.1727","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the compl exity of k-sat","venue":"Journal of Computer and System Sciences","work_id":"916831f8-6530-4477-a9cf-ff25b1e8ddd7","year":2001},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:b77849e1f386a528b3838d59b0f2f1d00a18e947fb504f824a7f92259b2b85c0","observation_id":"ce299931-b529-408e-b2a0-073cb1dc3b47","resolution":{"observed_at":"2026-07-10T04:46:45.673639Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:04.880867+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:04.880867+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:496d5c7d0d0db3d14ca4f70612051fcacbe75a0e2ba8c708e90c7b3a6b40037e","observation_id":"11866081-b4e2-463e-b7f3-05b9cda8eb3f","resolution":{"observed_at":"2026-07-10T04:46:45.705879Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+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-12T06:34:36.333875+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.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:daa8892edbc790b3261cf6873cada2df1fc9cc6a7f68113210728be991c4632b","observation_id":"4b294f1d-a138-469d-a9e5-b804c186c2f9","resolution":{"observed_at":"2026-07-10T04:46:45.704093Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+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-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-29953-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Parameterized Complexity Theory , series =","venue":null,"work_id":"8916bce5-031f-4a58-bb9e-361b82e828e4","year":2006},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:8d88673bc13dea15d3bccf83c14774ee1db48edecdf8da6b9eff08ec2628296d","observation_id":"fccbaf2c-270f-4e8f-ae71-bf6e2397d6bc","resolution":{"observed_at":"2026-07-10T04:46:45.718914Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:05.398435+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:05.398435+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:7f437600952201737f7128e3e737caebaf5dba2ba31ca1eb86ed6fdfde55a01e","observation_id":"f3a96976-4599-4cb6-9637-f74081e4b455","resolution":{"observed_at":"2026-07-10T04:46:45.747050Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+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-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-42071-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"As Time Goes By: Reflections on Treewidth for Temporal Graphs , booktitle =","venue":"Lecture notes in computer science","work_id":"31735f7d-27ff-4304-87e6-3594dfaed661","year":2020},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:6531e7f66daf61139668dc8189836e341017be4742b2197d7618dbe0a7f86639","observation_id":"fa6948b1-fc36-4fe2-836c-f4b127893028","resolution":{"observed_at":"2026-07-10T04:46:45.723623Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:05.905457+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:05.905457+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disc.2007.01.020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Discrete Mathematics","work_id":"4268f1fa-0972-4290-9a90-59e049d37490","year":2007},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:cf99336b132c69d28e1cfcdd96d1815dbb5185872f9b4a935830dbc88b756f49","observation_id":"bf9a39b4-f5e0-40f5-9cb4-309734e93c59","resolution":{"observed_at":"2026-07-10T04:46:45.712580Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:06.219926+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:06.219926+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/9781108649094.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dabrowski and Matthew Johnson and Dani","venue":"Cambridge University Press eBooks","work_id":"cd2ab587-3c2c-49a9-9874-f619146a1fdb","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:5e38712a07c589cf1c7e9a3dbc2335025bbc6f9b5a0a4a174fa74f49481c41fc","observation_id":"d8447655-f28a-4dfb-80ae-9aa9ff7be79b","resolution":{"observed_at":"2026-07-10T04:46:45.708151Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:06.776966+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:06.776966+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.828355Z","title":"2012 , url =","venue":null,"work_id":"e5a37f6d-e61f-4710-ae51-61890982768a","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:0c40d745c75857710dce3675744fec6aac8910bee0f8a0436383a7af9b7a90dd","observation_id":"74aadbd5-9990-4b2f-91ce-7917648ca646","resolution":{"observed_at":"2026-07-10T04:46:46.831524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.24438","last_updated":"2026-05-18T14:57:50Z","snapshot_observed_at":"2026-08-03T18:59:34.991673Z","submitted_at":"2025-05-30T10:20:30Z","title":"Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs","version":3},"cited_work":{"arxiv_id":"2505.24438","doi":"10.48550/arxiv.2505.24438","metadata_source":"pith","pith_arxiv_id":"2505.24438","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs","venue":"cs.LG","work_id":"f8480132-a028-4f9e-a56a-d3e6988d393a","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"cited_paper":"/paper/2505.24438","citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:433057dc83e872201b07386a63723e9949760d2b8cee05b9c643e032295bed82","observation_id":"df941448-8724-4ebd-8f77-dba1fd8939b6","resolution":{"observed_at":"2026-07-10T04:46:45.740945Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:07.000337+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:07.000337+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.106213","doi":"10.1016/j.neunet.2024.106213","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Weisfeiler-Lehman goes dynamic: An analysis of the expressive power of Graph Neural Networks for attributed and dynamic graphs , journal =","venue":"Neural Networks","work_id":"ba465e7f-3ffe-48db-9ab1-0f1029776e64","year":2024},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:0fee2372841929b08f84047ea45189d9605ec2932de30f22ae78b94846dab175","observation_id":"bd90695f-83a9-4410-b36c-67d2475b3977","resolution":{"observed_at":"2026-07-10T04:46:45.705902Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:07.290534+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:07.290534+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.100837","doi":"10.1016/j.cosrev.2025.100837","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computer Science Review","work_id":"2159655a-ebc6-44e4-8a5f-34da5f01151c","year":2026},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:d7c05a685941388ac7387fcc75aceec1ef1bc13e9154b36a6a4e9a8a595ee1fb","observation_id":"cf00b471-c40f-4c2c-92d5-4fce7efd3b17","resolution":{"observed_at":"2026-07-10T04:46:45.737931Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:07.576809+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:07.576809+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s41109-020-00311-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Applied Network Science , volume =","venue":"Applied Network Science","work_id":"ee2dd8c6-a17b-4101-9270-042085faeb16","year":2020},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:d44bd1c42a6d32c9c1c11489d2c9c33b3dab7e2e8911cdf148e0f880135f3c7a","observation_id":"2cd63910-2123-4b88-ba76-fb8238a8d27f","resolution":{"observed_at":"2026-07-10T04:46:45.682570Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:07.889732+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:07.889732+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.826047Z","title":"On the Equivalence Between Temporal and Static Equivariant Graph Representations , booktitle =","venue":null,"work_id":"a04fdbd6-be1c-4058-a50e-994e8623ec91","year":2022},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:403df954edcb6ab39a69b8c2994f35b70a83b0ebccc90b70783909dfd38013d3","observation_id":"4cb01973-4813-4d91-b855-86172d7db7b3","resolution":{"observed_at":"2026-07-10T04:46:46.827719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.824368Z","title":null,"venue":null,"work_id":"e035e502-93c1-42d4-857e-228162ff2bf2","year":2023},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:956a1b99602f1e90edde703439b8b5a6eaa4bac6271f119287ddfb9b3afbb473","observation_id":"e62e49ed-0830-44cc-a6c4-a86730d72794","resolution":{"observed_at":"2026-07-10T04:46:46.825453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-025-01301-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Counting","venue":"Algorithmica","work_id":"fbca43bd-0144-4c99-b73b-86dee881495f","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:6cf8bc0cecf7ec38ae7112e0e7c3676f3577aebaf1b46a78811f9cdbe6ae1aa8","observation_id":"a6e5c82e-0952-4022-80c5-49c9ca960609","resolution":{"observed_at":"2026-07-10T04:46:45.732122Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:08.253982+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:08.253982+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.physrep.2012.03.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2012 Temporal networks.Physics Reports519, 97–125","venue":"Physics Reports","work_id":"ee41300a-7b70-414e-b0a0-78ed46aecf84","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:8193a4261c762b57db8c66a93b81872074cd5d5ae3b54ca6c9a237a473709f99","observation_id":"beef0ede-1d06-4a6e-837e-a2ed2e2f7843","resolution":{"observed_at":"2026-07-10T04:46:45.733932Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:08.605096+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:08.605096+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v39i20.35396","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Expressive Power of Temporal Message Passing , booktitle =","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"29b68915-92e8-4c58-b470-284e3db5be9d","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:c27913bcfb53931fc36016f88ea3ff72d8548c7f5267a2b6c1938c2d49e57cde","observation_id":"ec6fd1aa-b554-4977-9e06-f14988646e4f","resolution":{"observed_at":"2026-07-10T04:46:45.721585Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:08.847133+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:08.847133+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.832137Z","title":"and Bertin, Nicolas and Hao, Tong and Goldberg, Debra S","venue":null,"work_id":"6fddc56e-efe0-45f0-93b3-1d7c9e30b7a2","year":2004},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:6f56e2b613ccae0dc4a6a6cc35454100cae715939e9a96ddd168f48f233a60b7","observation_id":"893763bb-d65f-4675-8bdc-65417e099319","resolution":{"observed_at":"2026-07-10T04:46:46.833956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1437.187169","doi":"10.1145/1871437.1871694","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Communication motifs: a tool to characterize social communications , booktitle =","venue":null,"work_id":"f4d7aea6-0774-4f1e-8677-f2bf222da190","year":2010},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:b2fa60d12d1ac864b995c59e219e5b020f675d01da6cc4af66d7fb17508f206e","observation_id":"4ec4321a-d64d-408a-8784-a292280c0a46","resolution":{"observed_at":"2026-07-10T04:46:45.732308Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:09.10137+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:09.10137+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2002.1829","doi":"10.1006/jcss.2002.1829","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kleinberg and Amit Kumar , title =","venue":"Journal of Computer and System Sciences","work_id":"73a2fc07-3b53-47bc-8ca4-661727bc9755","year":2002},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:75b0372df2ba5fc4c100f8cefc0da94972909190278cfc302034bf1249b8d095","observation_id":"37d9222b-804d-45d7-9aaa-6e04d26e1752","resolution":{"observed_at":"2026-07-10T04:46:45.726842Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:09.321637+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:09.321637+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.816737Z","title":"2019 , url =","venue":null,"work_id":"f2d4d823-5d01-4197-923c-81d3931c3405","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:d1d90262b7cb30872d15f9b711dc1e174dd5baa43f26932e2c00dd3b01ddf4bd","observation_id":"5e1b90d4-b62a-4c9f-a9c2-568c1ad51278","resolution":{"observed_at":"2026-07-10T04:46:46.817934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.818426Z","title":"Large Networks and Graph Limits , series =","venue":null,"work_id":"16434747-4269-4040-a11a-527bc400dbf2","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:9d73c416d1712b24ecc484b73128abc0217b28a961692cab18a0ceb6eb11b78d","observation_id":"22c48cf5-d18b-4e0c-814b-425aac687829","resolution":{"observed_at":"2026-07-10T04:46:46.819560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2023.59","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tight algorithms for connectivity problems parameterized by clique-width","venue":"arXiv (Cornell University)","work_id":"8bd076b1-4dcf-4530-9150-c953b9045634","year":2023},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:b7fad3f3b9496c606b867ee5b6f0313a75555c00396e188cb35b2793a2f746ad","observation_id":"70ef8324-0f06-402e-9e87-9462dc4f497c","resolution":{"observed_at":"2026-07-10T04:46:45.761919Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:09.565937+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:09.565937+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2019.02.030","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast exact algorithms for some connectivity problems parameterized by clique-width , journal =","venue":"Theoretical Computer Science","work_id":"e670fe31-5e7c-4728-8be0-7d415e9280c1","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:c90a882498c06ef6bb0a068b1465113ba96732354741041063ea47ff11acb6dc","observation_id":"502791f1-6785-48a2-9d7c-3361051d30d2","resolution":{"observed_at":"2026-07-10T04:46:45.702333Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:09.789251+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:09.789251+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.907842Z","title":"Weisfeiler-lehman goes dynamic: An analysis of the expressive power of graph neural networks for attributed and dynamic graphs","venue":null,"work_id":"68a3f619-8ce2-4f5f-aaa6-e2cc055553b4","year":2024},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:f26d29edb5287a5dea4d66564214c0278c431d326293bdfe49892d50264f614d","observation_id":"8192edde-191a-434b-affd-39be87dedefd","resolution":{"observed_at":"2026-07-10T04:46:46.912671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.885058Z","title":"Efficient computation of optimal temporal walks under waiting-time constraints","venue":null,"work_id":"82776dfb-32cf-4957-a978-7255599774a9","year":2020},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:8bde319c8c93a99e3268017fa43124002660ab2eade31c796b3ecc3bf24889ec","observation_id":"15094a1f-f91f-49b3-8d59-706e9a1c2e26","resolution":{"observed_at":"2026-07-10T04:46:46.886649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.893719Z","title":"Fast exact algorithms for some connectivity problems parameterized by clique-width","venue":null,"work_id":"7e7db1ec-bf05-4778-9cbe-c0257d19eaec","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:32d9ab2622c9c5dc4ad642eeeb16377ee8619a0615e36c828b6fa1908828d42a","observation_id":"ca6535b5-3152-4c99-b499-0bb7cec6a16c","resolution":{"observed_at":"2026-07-10T04:46:46.894989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.806918Z","title":"Time-varying graphs and dynamic networks","venue":null,"work_id":"7c1c2afd-1e85-4634-a926-5c84b9aacb1d","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:df1261922086dd57e62b1b13f22e48b0ebce959e9b57694f6654f493145389bf","observation_id":"319a7ea3-c713-49f5-a42d-22cf3ef5ef4a","resolution":{"observed_at":"2026-07-10T04:46:46.808386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.809082Z","title":"Finding temporal paths under waiting time constraints","venue":null,"work_id":"971b7321-61ad-43dd-951f-defe974980e3","year":2021},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:71709e0462f81404e97e75b8461087339dcc81f9712ca31db2f7241837a3e9cf","observation_id":"da16a4a5-dff1-4111-80dd-45eefaf08d1e","resolution":{"observed_at":"2026-07-10T04:46:46.810579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.812873Z","title":"Juedes, Iyad A","venue":null,"work_id":"a84f805b-6389-4b36-aaef-a3aea20ac95a","year":2005},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:aa59db2009468198ccbcb632899111f128c01f98ab9d51df0a4a7f2bc5822721","observation_id":"5186d0b7-efee-4d21-9a0d-27e1cb6e03c0","resolution":{"observed_at":"2026-07-10T04:46:46.814338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.808911Z","title":"Kanj, and Ge Xia","venue":null,"work_id":"0a333bf5-0f44-4fbb-be39-f1f7ef919201","year":2006},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:b57d955f08dedc541a5917ed30ca55da0e2d6e4655a74c600024b74bedf50bde","observation_id":"356fae25-a295-4c28-8fa9-e1acc07e217e","resolution":{"observed_at":"2026-07-10T04:46:46.810796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.888948Z","title":"Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , volume 138 of Encyclopedia of mathematics and its applications","venue":null,"work_id":"8e80e13a-07da-440e-befc-c5320f8164f5","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:e7bfcaa89b714eae37fc8232cc07d7e92bdbd5d3b0f64302fb92478b91e0a414","observation_id":"608e8bdc-6a37-4de8-97d1-e29a257747f2","resolution":{"observed_at":"2026-07-10T04:46:46.890254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.890887Z","title":"Upper bounds to the clique width of graphs","venue":null,"work_id":"6167ef60-69dc-464c-b8ea-27583a668781","year":2000},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:af3da46731588072cc9d7ba7999f3c98b8a287935e962fc622aae8dbd84d0f9e","observation_id":"80be82e5-fbe1-4ab1-9a7f-7eca9ccb8d19","resolution":{"observed_at":"2026-07-10T04:46:46.893014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.804772Z","title":"Homomorphisms are a good basis for counting small subgraphs","venue":null,"work_id":"3d0a5a18-1dd9-48d1-874e-50a5d4d2bf69","year":2017},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:f7cf25def571cfd1e1f7e6d5f725b6520ada3830957c1c13fb169217d89706d8","observation_id":"72406803-9f9b-4b5e-b4bf-21cb5e1cf633","resolution":{"observed_at":"2026-07-10T04:46:46.806330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.795852Z","title":"Complexity of C ounting S ubgraphs: O nly the B oundedness of the V ertex- C over N umber C ounts","venue":null,"work_id":"447c47fa-0623-47b4-841d-177317fdd4f7","year":2014},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:d1cc4a7babf638afb5af9aab8da4fac4b0ceb1cb00a3564b539e307926e3a81c","observation_id":"a6ab5a6f-762c-438a-820e-156b49fc2ab7","resolution":{"observed_at":"2026-07-10T04:46:46.797423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.821765Z","title":"Dabrowski, Matthew Johnson, and Dani \\\" e l Paulusma","venue":null,"work_id":"12bbdd4b-ca53-4880-a275-92e83635a52b","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:6a6d200239fbc4e79e4be5c9a9f578c768719278413f3b906c0361463e07c476","observation_id":"88880290-7119-4314-a321-8f884bb0ebf7","resolution":{"observed_at":"2026-07-10T04:46:46.823426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.834575Z","title":"The complexity of counting homomorphisms seen from the other side","venue":null,"work_id":"e7b7c76b-be9b-4310-8dfe-8af49dcd1286","year":2004},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:4b38bc3a7ac978a6c52d54bdc0520aa311d009aad8589a7d15f5f142aa6a2e72","observation_id":"3c33a356-3ea6-4d54-8bd2-59d1efbcbeab","resolution":{"observed_at":"2026-07-10T04:46:46.836154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.839090Z","title":"Lov \\' a sz meets weisfeiler and leman","venue":null,"work_id":"613f9326-6e8c-4583-ba8d-67f067978709","year":2018},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:42cbf9043bfda0ffd5263b0f2b532b236876d8def974e9257fd953995a026792","observation_id":"680b06f2-19fc-47a2-baa1-8cbee3a80f9b","resolution":{"observed_at":"2026-07-10T04:46:46.841039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.913947Z","title":"Counting small induced subgraphs with edge-monotone properties","venue":null,"work_id":"d8ceb223-a981-4b5a-88fb-12a4df790be6","year":2024},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:dcc27d3ed4dda6a3998752a7ae538994de2813ceaf34bcac0ab5df3b5f95e152","observation_id":"ba0ab347-b5f2-49e3-90eb-5919eaaa0151","resolution":{"observed_at":"2026-07-10T04:46:46.915500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.896009Z","title":"On recognizing graphs by numbers of homomorphisms","venue":null,"work_id":"d9ba8b45-8b90-44d0-89a5-213e2305fce7","year":2010},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:ea68eff998f670304cfff285d3547bac155f3e557791215fbb27acb28d884dc9","observation_id":"870c63e8-1367-4801-bd48-b33f0aa231d0","resolution":{"observed_at":"2026-07-10T04:46:46.903824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.891299Z","title":"Enright, Kitty Meeks, and Hendrik Molter","venue":null,"work_id":"79a53d33-7af1-480e-a3c5-b68a61a01ad0","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:1efbdb4b174254108ffe92a5bd930b85edc80fdce27debb87074145342ccf955","observation_id":"e1c5a399-10ed-4392-8d9b-d1b26c58a5c6","resolution":{"observed_at":"2026-07-10T04:46:46.892893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.877080Z","title":"Parameterized Complexity Theory","venue":null,"work_id":"d8f7a708-5dc3-48bb-93ed-bbdb808e7d27","year":2006},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:8cdc18ff3c73e1727ec7e1a9469709de0abaccf448075a6c918e706b6d134721","observation_id":"34b6e0cc-ae22-4360-b918-f8198e1ccf40","resolution":{"observed_at":"2026-07-10T04:46:46.878245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.878613Z","title":"As time goes by: Reflections on treewidth for temporal graphs","venue":null,"work_id":"12192bd2-49e3-4842-87b0-bc8eca5fc293","year":2020},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:5af119a8edf40321aea18c23e9308a7bf372860fa4bf0e920a6fb8dfa2ac2edb","observation_id":"c674052f-2c21-4be3-8f2c-fa92143852a8","resolution":{"observed_at":"2026-07-10T04:46:46.880283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.880879Z","title":"Counting small induced subgraphs with hereditary properties","venue":null,"work_id":"6da7a30e-02fa-4c2d-a472-e83a58d92dfe","year":2024},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:c8c9c81463400d71944347fd3f1a46f7c022a757de19178598d405a00b6634c5","observation_id":"65618678-122f-4f19-983b-b0214037f62b","resolution":{"observed_at":"2026-07-10T04:46:46.884448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.872171Z","title":"On the equivalence between temporal and static equivariant graph representations","venue":null,"work_id":"9abd66ab-c46b-4ad7-b55c-68518ed8ccd7","year":2022},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:f3b0aee80837a138eedcc1bbf89b528585917eedbe9429958614cbc96897faf1","observation_id":"c47490db-dbd2-457e-b3c8-934b3432a29b","resolution":{"observed_at":"2026-07-10T04:46:46.874847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.870425Z","title":"Line graphs of bounded clique-width","venue":null,"work_id":"522f2052-c0ed-4f70-ae0a-8e68d688b007","year":2007},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:16242cce49149b5ce7c19541ea4a4965851e2483c495346725ae2a9b5ad57eac","observation_id":"7b7d96d9-920a-49ed-9ac7-21085ab00e9e","resolution":{"observed_at":"2026-07-10T04:46:46.871709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.875420Z","title":"Han, Nicolas Bertin, Tong Hao, Debra S","venue":null,"work_id":"2333e4ac-4311-4ada-9f00-ad2c8442d3e0","year":2004},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:7144ac2aeea03ffd63572650a0bebc8281ffe4b44e28f4c53f293cdc18753640","observation_id":"e37196e8-072c-4241-8c02-7496c4077a36","resolution":{"observed_at":"2026-07-10T04:46:46.876601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.24438","last_updated":"2026-05-18T14:57:50Z","snapshot_observed_at":"2026-08-03T18:59:34.991673Z","submitted_at":"2025-05-30T10:20:30Z","title":"Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs","version":3},"cited_work":{"arxiv_id":"2505.24438","doi":"10.48550/arxiv.2505.24438","metadata_source":"pith","pith_arxiv_id":"2505.24438","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs","venue":"cs.LG","work_id":"f8480132-a028-4f9e-a56a-d3e6988d393a","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"cited_paper":"/paper/2505.24438","citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:9c5838075e2a18fc94801407bfba8c068075eeb06c4fe966088f019df6c9d264","observation_id":"4316af52-d7ea-4dab-a91f-d9ff0884d8ed","resolution":{"observed_at":"2026-07-10T04:46:46.504710Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:07.000337+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:07.000337+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.887011Z","title":"Tight algorithms for connectivity problems parameterized by clique-width","venue":null,"work_id":"0adda7b5-d3d3-459f-ad27-3359768f100b","year":2023},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:f0422962f47c7c5c9de6b764a886c5c29baf020458fba087ac44cf87f1ac8748","observation_id":"5d42b345-7369-47c1-a756-affa079b1fb8","resolution":{"observed_at":"2026-07-10T04:46:46.888603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.904953Z","title":"Temporal networks","venue":null,"work_id":"1c2f4266-f4d9-4499-a012-6941f00b740b","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:369079e2d14d7baec298ea0ab0afd231854bacd24694dd3f4d1a06e3cf48d939","observation_id":"9e4e0ef6-977d-4f4c-aa6b-946d2306db13","resolution":{"observed_at":"2026-07-10T04:46:46.907189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.860464Z","title":"On the complexity of k- SAT","venue":null,"work_id":"87d7f47f-e8a2-44c9-b14e-a547f469bdb0","year":2001},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:a1582b95f8d1698c346ed4ac5ac7f40e2550f8e40c82e9f0f4afe1d7a1d71efa","observation_id":"1a6e0026-774f-4df8-a5ba-57d5aee9835e","resolution":{"observed_at":"2026-07-10T04:46:46.862230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.870189Z","title":"Kleinberg, and Amit Kumar","venue":null,"work_id":"f6fa3ecb-c80a-4d3e-9738-5ebcfc49b01c","year":2002},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:8e8f4f61077fedd087e6f4568716f7e5f62dd7304865662bae0a9a9f00da3a03","observation_id":"4aca515d-98a0-40df-aba6-8bd7f00ef1e8","resolution":{"observed_at":"2026-07-10T04:46:46.871366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.887158Z","title":"Benson, and Moses Charikar","venue":null,"work_id":"416e84c2-2c7c-432d-82df-ac7666ec3d30","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:3aa800b43ef4890435e48b3b8133d815bb114909e6876ce522ddb260a92f5175","observation_id":"53678f9a-840b-4993-a6ba-3626a00043cc","resolution":{"observed_at":"2026-07-10T04:46:46.888399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.868599Z","title":"Temporal network motifs: Models, limitations, evaluation","venue":null,"work_id":"0fadbbc4-654c-4b4f-8498-9da8f8c84310","year":2021},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:2c22e7b2c977ee411c5b1e8d998510cf829464870ea3cfc1164bc408e980136a","observation_id":"a87d50f8-e596-487a-acaa-7f1eeade067a","resolution":{"observed_at":"2026-07-10T04:46:46.869865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.852417Z","title":"Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities","venue":null,"work_id":"63799ef0-b42f-4f9d-bec1-4f853d61a8c7","year":2023},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:74b2041903945d2ed8d61e2d436426587092c911d3fbfc4187aa30fb59e549e4","observation_id":"97a54ae2-2342-4c1a-8c46-5b525f15e8f2","resolution":{"observed_at":"2026-07-10T04:46:46.853750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.854228Z","title":"Large Networks and Graph Limits , volume 60 of Colloquium Publications","venue":null,"work_id":"6fcbded2-ef2f-4c32-888b-ab127b613389","year":2012},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:5f4dc56c487a4464de4bc2a42045d3772e7fc73dc3441d7caf4ec6058bc2fa6b","observation_id":"854532fe-c410-44f9-b0fd-948fccb23604","resolution":{"observed_at":"2026-07-10T04:46:46.856447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.850422Z","title":"Can you beat treewidth? Theory Comput","venue":null,"work_id":"c30010d5-ad90-4967-9576-67ef23d61fa5","year":2010},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:1688c1b5f9628753e985746b8dd8103007b8d805c29a74394685188b9ab9e3b5","observation_id":"a205c337-a4b4-4a3f-bdaa-f5c4d3f81b2c","resolution":{"observed_at":"2026-07-10T04:46:46.851884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1126/science.298.5594.824","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Science , author=","venue":"Science","work_id":"7ec82e86-5eb1-42f4-aef7-31a497e8262a","year":2002},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:b79c6762b270295156531ed56372de353a0f65f86c9f79cf4ebc870b2cae9915","observation_id":"20498cd9-199b-49d9-ab98-ee0a27c7dfee","resolution":{"observed_at":"2026-07-10T04:46:45.694792Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T21:49:33.4779+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T21:49:33.4779+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.857155Z","title":"Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe","venue":null,"work_id":"2ba7a62e-87e6-48d3-a3cd-6be73af53e8f","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:c2b5bcbe31b8106bb99ffead68d5ec8923ed34d11e1fa70b10b9c5bb76f264d6","observation_id":"52e4e8a1-a94c-4a5b-9d0b-21ace37f072c","resolution":{"observed_at":"2026-07-10T04:46:46.858443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.866734Z","title":"Benson, and Jure Leskovec","venue":null,"work_id":"aec26e5e-d311-4833-ad90-1b2b3b9949f9","year":2017},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:090c2df7813835a16ed14278ecd2d6ebd65b2ebf6f39dca857af439bc4ce0fce","observation_id":"fd43fdc1-5676-4e18-add1-f58043cc9e51","resolution":{"observed_at":"2026-07-10T04:46:46.867917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.848419Z","title":"Counting problems on quantum graphs","venue":null,"work_id":"58351fe9-c2d7-4cee-bf4a-408afaf6c49b","year":2019},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:332b0c52dabd2598509793f03a12fb7cb1d94bb54aa45d6c9278d0d722277e58","observation_id":"c698a81c-ff47-4105-8607-8839960f4281","resolution":{"observed_at":"2026-07-10T04:46:46.849842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.836827Z","title":"Parameterised counting complexity theory","venue":null,"work_id":"df9eb06e-699b-4a1c-aadc-57f113eddaa6","year":2026},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:e6b383cbd39129c8e066c650064aa94cfe6ea0fe2e95b4cc7250b05cbd8cb174","observation_id":"edbe2db2-0a9f-4cc8-a8c9-8c21ab3029d4","resolution":{"observed_at":"2026-07-10T04:46:46.838349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.843966Z","title":"A powerful lens for temporal network analysis: temporal motifs","venue":null,"work_id":"037b6f28-dceb-4771-b2d6-08ba4092106c","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:28e45b0cf7c0b130f398682f33bf67497497f05b88d9c593cebed8a11d130051","observation_id":"1d86169c-3a0c-4d2f-bb68-de1027e77454","resolution":{"observed_at":"2026-07-10T04:46:46.845435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.846427Z","title":"Expressive power of temporal message passing","venue":null,"work_id":"7742106c-6a2f-4abb-b7f1-9d47531692a4","year":2025},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:560df01ae5664cef585bbdfd43e57c2471ade94c137eea6e249396fb5b66a9fb","observation_id":"a390d326-a21b-4832-900c-a7dd52715678","resolution":{"observed_at":"2026-07-10T04:46:46.847888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T04:46:46.850762Z","title":"Communication motifs: a tool to characterize social communications","venue":null,"work_id":"f5c6fd55-8b6d-4860-85ac-fc5d6a5c0ed5","year":2010},"citing_paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-10T04:45:01.492472Z"},"links":{"citing_paper":"/paper/2607.08614"},"observation_digest":"sha256:ae1835edab0622c87fa5d7d7378d73e2cd7bd3a773553406ef8670e2274a573a","observation_id":"c41ef635-21b3-4bc0-9393-3035c7637089","resolution":{"observed_at":"2026-07-10T04:46:46.852091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08614","last_updated":"2026-07-09T15:45:46Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-12T23:18:53.327417Z","submitted_at":"2026-07-09T15:45:46Z","title":"The Parameterised Complexity of Temporal Motif Counting, and a Lov\\'asz-Style Isomorphism Theorem"},"reference_resolution":{"displayed":82,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":1,"verified_exact":29,"verified_fuzzy":47},"total_outbound_references":82},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 82 of 82 outbound references and 0 inbound Pith citation observations for arXiv:2607.08614."}