{"as_of":"2026-08-23T07:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51e3c177afdacbcae3e5c41293d477921e8bf2ca3c0a02ff8c7b03f54f1df06b","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:14:20.824985Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2504.16360/citation-record","integrity":"/paper/2504.16360/integrity","json":"/paper/2504.16360/citation-record.json","paper":"/paper/2504.16360"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.571707Z","title":"Some basic definitions in graph theory,","venue":null,"work_id":"407f8134-9785-4907-a5ac-551312cb537d","year":1970},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.563925Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:4f6b9fe8a35d0e744c5a6983b39f234aa9840d018c23bbdeb53f60ed0c443649","observation_id":"1bb5b748-2cfe-4d66-b261-fb162ad23222","resolution":{"observed_at":"2026-08-16T11:14:21.576349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.557780Z","title":null,"venue":null,"work_id":"d73a3ca0-0153-4c22-b4bc-866e7748d2b2","year":2020},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.569105Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:af78b26e67c1123fb6fe5dd1464ff06d46ab2f4842aea2cb44581c5cc6b1dd75","observation_id":"23b25215-0f48-472d-9dc1-582ce240ccc5","resolution":{"observed_at":"2026-08-16T11:14:21.562052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.542642Z","title":"Network representation learning: A survey,","venue":null,"work_id":"64e93de3-5d89-465c-a774-c7a59cdfd335","year":2018},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.573652Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:81b21cdfadeaf155cd539d8ef09f5890151e55a1a1503f14fb2fd11cc817ffba","observation_id":"7054e2e3-cb8e-4902-bea6-93198b0bcbfd","resolution":{"observed_at":"2026-08-16T11:14:21.548023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.578322Z","title":"Deepwalk: Online learning of social representations,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.578322Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:f25fdbcd37c49901c20ce320dee562ef5391f2ad745dbb81204dd79c81769d1a","observation_id":"4f771fcf-bcbf-421f-8d6b-df8998177222","resolution":{"observed_at":"2026-08-16T11:14:20.578322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.582922Z","title":"Line: Large-scale information network embedding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.582922Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:fac17d781aff8c1d4c73ebb35770f8912d40fb67256e4ffc634f08fc5c7c235a","observation_id":"835c6e8b-6996-4e56-8992-2205214a9a31","resolution":{"observed_at":"2026-08-16T11:14:20.582922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.587878Z","title":"node2vec: Scalable feature learning for networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.587878Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:6f018686643af2691d6a86578402e366e44d093c9e0b777180bb7271f371bf74","observation_id":"0818a4ce-541b-4258-bcc0-4b0ba10a578d","resolution":{"observed_at":"2026-08-16T11:14:20.587878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.592980Z","title":"Neural message passing for quantum chemistry,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.592980Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:b2b0e1733ee3739611d90ae59322694ea761bb38ee3218d5280ec0056be1e049","observation_id":"eccbcc24-75e8-4b13-9584-48e27fceacbd","resolution":{"observed_at":"2026-08-16T11:14:20.592980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.492262Z","title":"Fraud detec- tion: A systematic literature review of graph-based anomaly detection approaches,","venue":null,"work_id":"c950c012-352b-4874-b246-80a772d5f32c","year":2020},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.597433Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:f9dc7b2d0b664eae730c6e7a2aa82375c2f4a7a6770ba528d5a4cda816f1c126","observation_id":"d26bd7f6-3b4d-476c-a4d0-70f8c1618386","resolution":{"observed_at":"2026-08-16T11:14:21.497288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.10850","last_updated":"2018-04-28T22:14:29Z","snapshot_observed_at":"2026-08-14T19:20:53.458621Z","submitted_at":"2018-04-28T22:14:29Z","title":"Drug Similarity Integration Through Attentive Multi-view Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":"1804.10850","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.10850","snapshot_observed_at":"2026-08-16T11:14:20.954235Z","title":"Drug Similarity Integration Through Attentive Multi-view Graph Auto-Encoders","venue":"cs.LG","work_id":"07a29d79-87a4-4110-91aa-13a262da153b","year":2018},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.602075Z"},"links":{"cited_paper":"/paper/1804.10850","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:a19be3b06958852730a0bd37ece2528ab83f7cc717ca28eaa02bd5e637260aef","observation_id":"64c5f8fa-204b-4d4a-8029-ab471cf3cb06","resolution":{"observed_at":"2026-08-16T11:14:20.960931Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.606946Z","title":"Spatial-temporal fusion graph neural networks for traffic flow forecasting,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.606946Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:6b288be65f607cf6bd58126d522f44d9c4c54ef807d53a893ac950a165ef7f54","observation_id":"4f11d193-e824-4462-9696-c06a93ddf01e","resolution":{"observed_at":"2026-08-16T11:14:20.606946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-16T11:14:20.612246Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.612246Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:b31d901a12f942f08be8ff5b7b73cd32f7d862e160957c99526231e597d37309","observation_id":"9f16a869-8849-43cd-af23-fe181ad692fb","resolution":{"observed_at":"2026-08-16T11:14:20.612246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-16T11:14:20.617102Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.617102Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:26e66942cfec4ab43aa5bc25ad46821dc14d6c65c290cdef321817388e597562","observation_id":"534244b1-8e29-4e90-b854-68bb319e2f3f","resolution":{"observed_at":"2026-08-16T11:14:20.617102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.621352Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.621352Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:57aa617b0a7bd1d3afe1b20adbd20f492f8b8084ea1af50d91c313f0e1eb9383","observation_id":"00698801-3c8c-4e6c-b8fc-2bb91f144201","resolution":{"observed_at":"2026-08-16T11:14:20.621352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.459709Z","title":"Node, motif and subgraph: Leveraging network functional blocks through structural convolution,","venue":null,"work_id":"9c4008b2-28f9-4820-bdf4-6a3b9ce4cfa0","year":2018},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.626564Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:979c34ac34867c6739e378bed5a1ecf039acaa64326370f75c2604d6b87c9f7d","observation_id":"c6efe783-2bcf-4fad-8dac-fcae8d97bc26","resolution":{"observed_at":"2026-08-16T11:14:21.464189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.630734Z","title":"Representation learning: A review and new perspectives,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.630734Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:27240bc728656fa62a8dc039eda45dfbb9b2cafef824aad3327755b5fb1e3bd7","observation_id":"e7cd8559-b79f-4747-aee7-1a6d12a0b03b","resolution":{"observed_at":"2026-08-16T11:14:20.630734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.436867Z","title":"Disentangled graph convolutional networks,","venue":null,"work_id":"c4d5c10e-87ed-40cf-8d99-eb6e1e752e53","year":2019},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.635050Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:090b4b9271f7b466a328bf59a9ba91a1c449a14be47d52e4b1aa96d5504f966a","observation_id":"56148c36-1cea-4632-b176-79de0f50b31c","resolution":{"observed_at":"2026-08-16T11:14:21.441429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.422086Z","title":"Independence promoted graph disentangled networks,","venue":null,"work_id":"2f958a77-1103-4e08-a365-99278a7b203d","year":2020},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.639380Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:c0417a11680b34649f84d33faeaeb2bdc9d7d9c7ca12e5b837c19e8dc9c296ef","observation_id":"c163d239-f183-44bc-bd40-d2c4468b2ff4","resolution":{"observed_at":"2026-08-16T11:14:21.426783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.11893","last_updated":"2023-12-14T14:48:01Z","snapshot_observed_at":"2026-08-16T18:29:23.230457Z","submitted_at":"2021-04-24T06:40:35Z","title":"LGD-GCN: Local and Global Disentangled Graph Convolutional Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.11893","snapshot_observed_at":"2026-08-16T11:14:20.644302Z","title":"Lgd-gcn: Local and global disentangled graph convolutional networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.644302Z"},"links":{"cited_paper":"/paper/2104.11893","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:33ceff896d73cbeee4c9a27d09642a694176d04695fb51b9aeb0ed4562d542c7","observation_id":"8915135b-048a-4934-b372-17b52e5f853f","resolution":{"observed_at":"2026-08-16T11:14:20.644302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.407866Z","title":"Factorizable graph convolu- tional networks,","venue":null,"work_id":"5cfd47d4-8e34-458c-93d8-6fcedb9d9085","year":2020},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.649373Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:6f22147dc084685e9ebf34b4ad0f33eba97b2b5aebe69e5c4d99c45ccd204fbe","observation_id":"45f43002-8af5-4904-875c-cc0950922c04","resolution":{"observed_at":"2026-08-16T11:14:21.412564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.655675Z","title":"Debiasing graph neural networks via learning disentangled causal substructure,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.655675Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:4a35791d91b164fd17486f93d632e850f68e2d857f579f106b3224bd55064f24","observation_id":"77f5ce44-b60c-463b-bb4d-60a2e4390cb5","resolution":{"observed_at":"2026-08-16T11:14:20.655675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.383727Z","title":"Kergnns: Interpretable graph neural networks with graph kernels,","venue":null,"work_id":"47963c0b-ffc4-4fc1-bf99-351ba576727e","year":2022},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.660332Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:f3e1ddfc0aba31e15d15674e7412bdb58f60d106708573eb8d0f423c53eb4c3c","observation_id":"1ec644d8-87e5-4760-9080-092fdaaf376e","resolution":{"observed_at":"2026-08-16T11:14:21.388324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.369380Z","title":"Descriptive kernel convolution network with improved random walk kernel,","venue":null,"work_id":"2b138b98-ab4c-4371-82e0-983adf6a8888","year":2024},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.665341Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:389633e8c115d6999f42ad2ca2dcdbc2a2378115c5533a664b51a83f7597681e","observation_id":"ea2fc02e-c843-4fb7-9e52-4483f53c8ce1","resolution":{"observed_at":"2026-08-16T11:14:21.373807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.669773Z","title":"Network motifs: simple building blocks of complex networks,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.669773Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:9da19b0bad4480a13bea10df6e65c906091df0e59c6b2c0e49f180286deaab40","observation_id":"4a3f27b4-4c4d-4124-9ce1-ca7673db004e","resolution":{"observed_at":"2026-08-16T11:14:20.669773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.674258Z","title":"An algorithm for subgraph isomorphism,","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.674258Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:60491be649c44244d0d8dbe078d1063902fd3983097275bd4af86cef6a3162b6","observation_id":"bc017f7a-b16c-4c19-849e-67364ae15dee","resolution":{"observed_at":"2026-08-16T11:14:20.674258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.335946Z","title":"Improving graph neural network expressivity via subgraph isomorphism count- ing,","venue":null,"work_id":"7c06f201-b46c-4250-a917-4b46da4aa363","year":2022},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.678936Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:ec3486e3acf566107332794e48a6fc257fc4d041103cf6979f8ebc69808bcd5f","observation_id":"05c3b784-296c-454b-8193-36dae5f7bcf7","resolution":{"observed_at":"2026-08-16T11:14:21.340797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.320038Z","title":"Motif graph neural network,","venue":null,"work_id":"971afb6e-f321-4f90-abd1-17e632501fb3","year":2023},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.684630Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:28548afc63fdb8d9ce4edb4a087250b1cec5f4138e6312cc24f685061628db1e","observation_id":"34ae192c-a2bf-440d-8333-15fa1298e62c","resolution":{"observed_at":"2026-08-16T11:14:21.324598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.305094Z","title":"Convolution kernels on discrete structures,","venue":null,"work_id":"7e742618-96b3-4038-b022-3ae03e8a4908","year":1999},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.689682Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:be22fc13d672f7eecdb6892e56e1e16c9cb65d42df138f56002df27e9e8955f3","observation_id":"506c8d38-1434-448f-8667-adf4f20e984b","resolution":{"observed_at":"2026-08-16T11:14:21.310014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.290763Z","title":"Fast subtree kernels on graphs,","venue":null,"work_id":"f3730a26-2827-4f1f-b476-e77cfe80c54b","year":2009},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.695563Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:d927b6916f7aacc4b21b069d47c8025c209d6160fd2dbd299a7d2da0b450d86e","observation_id":"43865a66-2627-47bb-ae72-99fa53ae5d57","resolution":{"observed_at":"2026-08-16T11:14:21.295598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.275667Z","title":"A linear-time graph kernel,","venue":null,"work_id":"ccaf4170-e20d-4eba-8d43-69ccc5a63390","year":2009},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.700930Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:6136ad1285fff6642590d6dcd4f7b588550c5c981d9361cb1ee252505e5a5faf","observation_id":"06dc7a49-7cb1-4ed7-aef4-a7065c02190c","resolution":{"observed_at":"2026-08-16T11:14:21.280012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.6483","last_updated":"2012-06-27T19:59:59Z","snapshot_observed_at":"2026-08-18T06:49:38.354483Z","submitted_at":"2012-06-27T19:59:59Z","title":"Subgraph Matching Kernels for Attributed Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.6483","snapshot_observed_at":"2026-08-16T11:14:20.706410Z","title":"Subgraph matching kernels for attributed graphs,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.706410Z"},"links":{"cited_paper":"/paper/1206.6483","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:b0134653a1818fe6034c8aab0d5cd3ece37116a574a0754cafdc734a3df7e855","observation_id":"4703afc8-4b89-480f-9814-0b2b82c8a2dc","resolution":{"observed_at":"2026-08-16T11:14:20.706410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.261272Z","title":"Marginalized kernels between labeled graphs,","venue":null,"work_id":"e9199290-2ded-42e2-ad1a-1bedb7f3776d","year":2003},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.711614Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:05511d5757fbc3beb592f7f4c7d42e8175bca3e68adda45fcc2e808934d5383c","observation_id":"fe9b5ea4-2961-4925-aff8-7ab7a1553b1e","resolution":{"observed_at":"2026-08-16T11:14:21.265774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.716407Z","title":"Weisfeiler-lehman graph kernels","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.716407Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:6c8067755cc02ff5dd9b608d855b4fb7c9989a722e2073d2cca5cad013cc5c40","observation_id":"3ca1508b-72d1-4f2c-b583-b31a82c48d79","resolution":{"observed_at":"2026-08-16T11:14:20.716407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.236219Z","title":"On valid optimal as- signment kernels and applications to graph classification,","venue":null,"work_id":"ce3b421f-8861-4be8-a429-4b588040e012","year":2016},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.721546Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:a4d4497d84ba953886da1d5686a5b97a0b9f533936589cd42db0cd2e2ea5bb35","observation_id":"4eff0ff0-1149-4004-82cd-e8047f84e245","resolution":{"observed_at":"2026-08-16T11:14:21.241489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-21T22:36:44.881291Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-16T11:14:20.726176Z","title":"How powerful are graph neural networks?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.726176Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:3a21d4b4c488bc9407cff162a5599af1e43e509930fbf0d56c63fc3261a1e774","observation_id":"18e876e0-585a-4fd5-b3b7-bf66283ae3d4","resolution":{"observed_at":"2026-08-16T11:14:20.726176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.220612Z","title":"Disentangled graph contrastive learning with independence promotion,","venue":null,"work_id":"5368c399-3816-40ca-9e36-3c96c9921959","year":2022},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.730849Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:f51e406637b1dac87eac49277299bfabb143e28af10b0542b902a09701555efc","observation_id":"495d3a57-5bc6-4edf-a20f-37e00f51c83e","resolution":{"observed_at":"2026-08-16T11:14:21.225640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.205568Z","title":"Interpretable deep graph generation with node-edge co-disentanglement,","venue":null,"work_id":"617b951d-23f3-41f2-badb-3c2ed190dd39","year":2020},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.735265Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:5f6a437973fe31e8fe3bad5143e71c791ef811b626674a36ff9767ffc648384b","observation_id":"74939f53-d872-490a-ba7a-d80d2c328e72","resolution":{"observed_at":"2026-08-16T11:14:21.210302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.189861Z","title":"Graph kernels based on tree patterns for molecules,","venue":null,"work_id":"e8d16753-d644-4084-af51-8a820947e4b2","year":2009},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.739683Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:ce32efdf7ee40055146fbd4e69e5863f8a4f7900377ece09726f7178dcf5c609","observation_id":"f49a02b3-6941-4256-b5c5-0f7ec1c4040d","resolution":{"observed_at":"2026-08-16T11:14:21.194998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.174461Z","title":"Retgk: Graph kernels based on return probabilities of random walks,","venue":null,"work_id":"10d5d9a2-dca1-4867-abf7-f8818d69f9bd","year":2018},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.744419Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:bc84004fbf631b58f3b2b104d449996d3e88c82ca2bad0302f93769234ac1c7f","observation_id":"daac2aa9-2af9-4e9f-be7a-cfcf899321f9","resolution":{"observed_at":"2026-08-16T11:14:21.178934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.160491Z","title":"Shortest-path kernels on graphs,","venue":null,"work_id":"ffb5dcba-08b0-4bb8-b6ae-edec4f3d7072","year":2005},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.749739Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:3ea382cfe0c853e46d7840090053b2f1ad90f292acd554cd81e027214795b0c5","observation_id":"e9afa783-7690-411b-b74a-c544051af7c6","resolution":{"observed_at":"2026-08-16T11:14:21.165043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.146458Z","title":"On graph kernels: Hardness results and efficient alternatives,","venue":null,"work_id":"dec75c0e-602a-4750-94c9-ee55ed701c49","year":2003},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.753918Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:70a1716f2a4616b3e112b288811386600cec325bd79e448ec8663391fce32106","observation_id":"600e9316-7492-45b5-b87a-efebf157be02","resolution":{"observed_at":"2026-08-16T11:14:21.150865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.132444Z","title":"Extensions of marginalized graph kernels,","venue":null,"work_id":"2607088d-9b79-4b08-ab40-d0dee1493939","year":2004},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.758571Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:41ddfc908a5b2a162b4c3bf369f024153d00147d2db5010b7e378eea00bfaf0e","observation_id":"c33d0fec-53c3-4d54-b95b-1b35fc505ad1","resolution":{"observed_at":"2026-08-16T11:14:21.137158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.117998Z","title":"The expressive power of graph neural networks: A survey,","venue":null,"work_id":"7381ab32-a335-4683-8688-83bfc8cbbe98","year":2024},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.763158Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:00a2a2954ab666b14900fd0af97c2c957d85f0cc3151e83d0ba446f1c4f2f431","observation_id":"ffc5f216-18af-4925-9d5d-ac1eb324a0e9","resolution":{"observed_at":"2026-08-16T11:14:21.122812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.767744Z","title":"The hungarian method for the assignment problem,","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.767744Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:45f03143f0f18dc232476bf617d3ec5f9745f395d947d9bd1ffc7d2c9904208c","observation_id":"d0dc1854-bc31-431f-8e6a-ed0738f71d4f","resolution":{"observed_at":"2026-08-16T11:14:20.767744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.092496Z","title":"Algorithms for the assignment and transportation prob- lems,","venue":null,"work_id":"c77e9d4e-a515-4f08-81d8-772bf216b95b","year":1957},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.772058Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:a41aae1cff6acd2839e8f398300119acf3b3527e0146a069b8cf426b11cca2fa","observation_id":"124a260b-159e-43f6-9c11-41f2f0cc13f9","resolution":{"observed_at":"2026-08-16T11:14:21.097343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.777202Z","title":"Theory of reproducing kernels,","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.777202Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:0cd4bc19c25cc04867ba3c5de09cef03be8771b267ffcb9670f833364cc1ef91","observation_id":"06308952-4fb2-427d-b3f1-94505dfae448","resolution":{"observed_at":"2026-08-16T11:14:20.777202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.065942Z","title":"Generalized histogram intersection kernel for image recognition,","venue":null,"work_id":"96f5885f-1103-4db8-a7ef-4871595698ab","year":2005},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.782533Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:2f45cb8cb7c434bf26bf9b85bb69759eec3ba69a823596812c349f2261f59df0","observation_id":"5405d23d-6a76-4635-b879-0608909e425d","resolution":{"observed_at":"2026-08-16T11:14:21.071934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.788296Z","title":"Revisiting semi-supervised learning with graph embeddings,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.788296Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:bdd74b5389c42ebb1755760f5f73d7f64036cabc5146f471dded50969dbd1481","observation_id":"62bbc4e5-7d50-487f-a768-7e8b9ed90d59","resolution":{"observed_at":"2026-08-16T11:14:20.788296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.792987Z","title":"Multi-scale attributed node embedding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.792987Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:db7b4740dac4a3b6db634214ccb8f86349f20384c8b1141efd92adfd81cb1e56","observation_id":"546d41ce-1b47-4703-943c-94fecc209da4","resolution":{"observed_at":"2026-08-16T11:14:20.792987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-10T23:39:48.575656Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-16T11:14:20.797468Z","title":"Geom-gcn: Geo- metric graph convolutional networks,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.797468Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:1b4c1b6c58d9ead6f96a7fce5c75d54b4ed237ebb0ec16ad3a7266364f6ed9d8","observation_id":"eee670c6-cfd9-4ba3-89a8-ee74326bfdc1","resolution":{"observed_at":"2026-08-16T11:14:20.797468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.031540Z","title":"Distinguishing enzyme structures from non-enzymes without alignments,","venue":null,"work_id":"51c2f5fc-3edd-4725-a3a2-1bbdcd5f660b","year":2003},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.802412Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:85f8d27c76ee21d8bbcbef6f6f8a16a1b625367960ff9c6431c1d9feb2a0d47f","observation_id":"b10bfd5d-2668-4848-868c-b2251cca68c2","resolution":{"observed_at":"2026-08-16T11:14:21.036027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:21.017015Z","title":"Brenda, the enzyme database: updates and major new developments,","venue":null,"work_id":"d7d807c9-91f6-4e84-b13b-9839e39905a1","year":2004},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.807179Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:dd7048ed5790d88d6945d392da487ecac018ce3c9ecd7352a7b43783bba37f4e","observation_id":"9bfb7c59-dfe0-409e-a6dc-acc3ce04d542","resolution":{"observed_at":"2026-08-16T11:14:21.021541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.811657Z","title":"Protein function prediction via graph ker- nels,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.811657Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:2ab6e831d7c28978707f41a9d4a978c8a8ebd023f18c208ca8b5cfd47773cb39","observation_id":"e573a6d6-2fe0-46fb-aae8-cad419342a93","resolution":{"observed_at":"2026-08-16T11:14:20.811657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.816053Z","title":"Deep graph kernels,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.816053Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:4f1508f691446fa3014044834d7d668b7c9b9788051db017117e8d03b61a5019","observation_id":"6c67523d-8b8a-4d72-acac-48ec5dbedb32","resolution":{"observed_at":"2026-08-16T11:14:20.816053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.820680Z","title":"Graph u-nets,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.820680Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:c896fabbc55d6323bd0bb3ecd14eb0732c5d1d4003520f0b533a04146a047ff3","observation_id":"b87be7e4-15c2-4bf7-9eb3-17677ce70768","resolution":{"observed_at":"2026-08-16T11:14:20.820680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:14:20.971677Z","title":"Self-attention graph pooling,","venue":null,"work_id":"52771211-1e55-44bd-8ec2-a7971dbcc005","year":2019},"citing_paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T11:14:20.824985Z"},"links":{"citing_paper":"/paper/2504.16360"},"observation_digest":"sha256:9b63459863afde0afde4f37214831263458c4b3ec4e5fd07a381c60df09d62be","observation_id":"2ee2163d-b790-401f-a331-597d4fe074c0","resolution":{"observed_at":"2026-08-16T11:14:20.976492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16360","last_updated":"2025-04-23T02:26:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-21T06:31:53.342225Z","submitted_at":"2025-04-23T02:26:33Z","title":"Disentangled Graph Representation Based on Substructure-Aware Graph Optimal Matching Kernel Convolutional Networks"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":55},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2504.16360."}