{"as_of":"2026-08-11T10:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aae5398b2c863153f6b1eddbdce235f4fa08bada971d3e393a9b20d88bb56d6a","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:10:54.478962Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.07598/citation-record","integrity":"/paper/2501.07598/integrity","json":"/paper/2501.07598/citation-record.json","paper":"/paper/2501.07598"},"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-10T21:10:55.543694Z","title":"Deep collective classification in heterogeneous information networks,","venue":null,"work_id":"f2bac4fc-c708-4380-bca8-58a94cea403a","year":2018},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.126323Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:4fb4a5b9013e73380ab79415a90e0560e162d0f8ee2e75342e203783defc30a6","observation_id":"2a528460-d23b-4a58-b639-05ef4377024a","resolution":{"observed_at":"2026-08-10T21:10:55.549410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.525226Z","title":"Dropedge: Towards deep graph convolutional networks on node classification,","venue":null,"work_id":"6753d5ad-9e98-40c4-9c59-f0fbb4544f56","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.131792Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:0517ce8df746376977a72b7bb75e7a2ccef77b540e63e52217932c5658e33dca","observation_id":"b21b5c67-9a47-405e-aec0-0c32ee871254","resolution":{"observed_at":"2026-08-10T21:10:55.531220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.503707Z","title":"Node classification in signed social networks,","venue":null,"work_id":"fd388418-805d-45bd-bace-49e02b3f4dab","year":2016},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.137277Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:cee921db8da38c093e63f843e4aed70eac9ccfd4c15f61491fc03cfcdb9f74bc","observation_id":"7fecfc49-147a-4fc3-b682-06b666a9f723","resolution":{"observed_at":"2026-08-10T21:10:55.511133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.480707Z","title":"Link prediction based on graph neu- ral networks,","venue":null,"work_id":"493c7026-b1d9-453e-ae7a-2349e57ccec7","year":2018},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.142206Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:8b9e500286ff87313028b27ce70ac9c3e4b746900bef5cc35c08cdf74fac4c86","observation_id":"1a10da74-6024-44bf-b362-2e88de0f4dee","resolution":{"observed_at":"2026-08-10T21:10:55.488207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.462977Z","title":"Composition- based multi-relational graph convolutional networks,","venue":null,"work_id":"0caf4434-3fcc-4670-b7a9-bffd2bc1fa75","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.251245Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:ad678da06c87681af63e7285e9d564c9405581a2b1f5050faa1b54928a1fad80","observation_id":"c7ca4982-3c35-4f53-84bf-cff6bf49e49e","resolution":{"observed_at":"2026-08-10T21:10:55.468360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.442299Z","title":"Distance encoding: Design provably more powerful neural networks for graph rep- resentation learning,","venue":null,"work_id":"58ddbebd-c0f4-48fb-89c0-da70e334b60a","year":2020},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.256755Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:d7b511baa9a835aa13ab91a54beb005d72e206bc39624029d7d5cf337e6d9388","observation_id":"5a7c8928-7d82-4043-8745-075995c235c9","resolution":{"observed_at":"2026-08-10T21:10:55.449013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.421730Z","title":"Learning knowledge graph embedding with heterogeneous relation atten- tion networks,","venue":null,"work_id":"1e7852a7-b713-4619-94f7-9b6e152ec45a","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.263318Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:564f785d3d1798fa1b65984ddf4b54f4ad5c3eb17d059a4fca5168574aad6764","observation_id":"7ef3f066-1f61-4f05-9373-a2703d8488f8","resolution":{"observed_at":"2026-08-10T21:10:55.428408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.401032Z","title":"Meta-knowledge transfer for inductive knowledge graph embed- ding,","venue":null,"work_id":"fc8478ad-5074-437d-8d93-f878a921e731","year":2022},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.268563Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:d942fc7fb76b1d9ac6262d88aa1f9855e5d516e74f5100872f489d0accdfd302","observation_id":"0afc20c1-8b1b-4590-a49b-ce9c3d9f7733","resolution":{"observed_at":"2026-08-10T21:10:55.408213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.382197Z","title":"Indigo: Gnn-based inductive knowledge graph completion using pair-wise encod- ing,","venue":null,"work_id":"41f099f2-3f1e-4991-8fb8-942cce557ba6","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.274061Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:f41f1ac1173269b6ebd47a18e4ce87c73ba724e07eb50803875a2f98683db8aa","observation_id":"2a73295e-9479-4a31-b736-2026b0217e90","resolution":{"observed_at":"2026-08-10T21:10:55.387816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.280162Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.280162Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:e3d0b31dbafe83bb3647b53526dd1ec0a37009300fc9b36d3c2a0fe3e3651df9","observation_id":"6ccfc10d-e45a-45ee-8921-b370c7232d68","resolution":{"observed_at":"2026-08-10T21:10:54.280162Z","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-10T21:10:55.355661Z","title":"Sim- plifying graph convolutional networks,","venue":null,"work_id":"458be414-2a87-492a-a9af-9839272187e7","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.286329Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:696e7402f4ad60897cf83de77f2394326bb8f4c0f171daff95660ce90f812357","observation_id":"2dcd706b-51a7-4af1-b94c-48ec3126053e","resolution":{"observed_at":"2026-08-10T21:10:55.360749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.339516Z","title":"Gated graph sequence neural networks,","venue":null,"work_id":"2c9bd98e-90f7-48f2-929c-ca82a5822a04","year":2016},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.291467Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:f1d43af31076b3cf9fe4e86bfe9e397fc33adce342f35cd6bb2d53ac5932b02b","observation_id":"dabbe1fe-d192-4694-9215-c1b39a9a4415","resolution":{"observed_at":"2026-08-10T21:10:55.344831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.321960Z","title":"A survey of heterogeneous information network analysis,","venue":null,"work_id":"37fe8faf-455a-4bf5-b59e-6973f3febbbf","year":2016},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.296520Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:23606e3df95ae1c3f19e1426e52ba82a666564dfa0833b41cccd5ca0620ceaef","observation_id":"cc28270a-895e-470b-a2ca-c8d1c0129b6c","resolution":{"observed_at":"2026-08-10T21:10:55.327834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.302597Z","title":"Mining heterogeneous information networks: principles and methodologies,","venue":null,"work_id":"8b12640d-163c-4df8-a840-b8dcc9a00d18","year":2012},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.302562Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:4acd73a56104154b2f725e8cba1c409783a798ce21962c9a4475a3efa8df81fa","observation_id":"2d794a33-b131-4302-89d2-e708b0118931","resolution":{"observed_at":"2026-08-10T21:10:55.308206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.282081Z","title":"Rankclus: integrating clustering with ranking for heterogeneous information network analysis,","venue":null,"work_id":"4488deeb-43df-4651-b81c-7d83f1bc6b16","year":2009},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.307940Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:e31ff56e2836e5f35d41109d543f619b3988121c77d9265454c9bb95c3bb8d81","observation_id":"e14a7b83-189b-4b7b-b29d-4a478e1c10d0","resolution":{"observed_at":"2026-08-10T21:10:55.288522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.263011Z","title":"Collective prediction of multiple types of links in heterogeneous information networks,","venue":null,"work_id":"783f31f8-ab44-477a-a9bd-4a817e3383dc","year":2014},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.313710Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:877eea03680686164bac48ead943d4a49d7e4fec8820d06fd34446d91913f185","observation_id":"6f340e80-78d8-49f6-bc0b-dea6f7dcdb5a","resolution":{"observed_at":"2026-08-10T21:10:55.269008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.241328Z","title":"A com- prehensive survey on graph neural networks,","venue":null,"work_id":"f3620448-f285-4dbe-b7f4-0ee4f8abea26","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.320198Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:d97035805f728e64fd0dacef36fc6b9ac32ede37e8025018ab8eb197adfbd7c2","observation_id":"5842dd7d-77f9-4d24-9552-10d32f958a6a","resolution":{"observed_at":"2026-08-10T21:10:55.248535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.217707Z","title":"Heterogeneous graph neural network,","venue":null,"work_id":"e794d637-7af7-4146-94c8-53f3197321bb","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.325414Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:d49c16cb3f48a6bf9a4c04a33504c619097b6f2b850674aa7bfbe74bcea89d69","observation_id":"29ab7d67-9a74-43b7-b927-054726c2f7c2","resolution":{"observed_at":"2026-08-10T21:10:55.222869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.200358Z","title":"Non-recursive graph convo- lutional networks,","venue":null,"work_id":"d72ca71d-64b7-4ec3-9eae-fd1d9e0910de","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.331200Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:f9bea280e61796e489609d5c70e048c867fea0b009106b63207c85fefa914bd4","observation_id":"92cad412-115c-474d-82a0-ac4e1cb68065","resolution":{"observed_at":"2026-08-10T21:10:55.205649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.182763Z","title":"Towards deeper graph neural net- works,","venue":null,"work_id":"64c44f85-6b46-4f4b-a6d6-ba0f7d13d914","year":2020},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.336855Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:7b2510a781758a0b8fe326be1b6a8cf7e6117bf1c849a214d8d7e4b635a230f1","observation_id":"b875da5f-41bf-4fce-bcd4-0f4832bd3958","resolution":{"observed_at":"2026-08-10T21:10:55.188511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.165607Z","title":"Modeling relational data with graph convolutional networks,","venue":null,"work_id":"d156e1ea-eeb3-4b62-94fe-45211ea0318c","year":2018},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.342673Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:8d8480e4f6dc9321763d94ba94ebb366e3eb8711330d228e384f465ea35e73c9","observation_id":"a1c4f85a-4499-4fe3-bc92-f3148f861f43","resolution":{"observed_at":"2026-08-10T21:10:55.170621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.146894Z","title":"Heterogeneous graph attention network,","venue":null,"work_id":"1d2dfb60-c6ce-4eeb-b34e-11ce13ccd2db","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.347633Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:72f750f59c17f7028f7bbb896f7fb43cab04b281a289e682ef95b3a9c90cc3f6","observation_id":"e6971690-a173-45c1-9902-ad9e7d891c74","resolution":{"observed_at":"2026-08-10T21:10:55.152576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.128084Z","title":"Magnn: Metapath ag- gregated graph neural network for heterogeneous graph embed- ding,","venue":null,"work_id":"ce447e7b-0107-4fe9-81ab-e1fa3adea001","year":2020},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.352543Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:76573980b3fe41b11e8a0c1991f22c9dda6839c96f6363f3476fbf7cb0135498","observation_id":"ad15dcf1-bf8d-46c5-8b71-51cb905a8a07","resolution":{"observed_at":"2026-08-10T21:10:55.134371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.103217Z","title":"Simple and efficient heterogeneous graph neural network,","venue":null,"work_id":"91021713-f19f-4bb8-bd6a-15876b806d17","year":2023},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.357159Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:56dddec0917bc82823986d872640902e5daed089a97fa7e183861a84f67672a7","observation_id":"dbbfb431-4305-4047-86df-8bc704a8a5ed","resolution":{"observed_at":"2026-08-10T21:10:55.110762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.075191Z","title":"Pathsim: Meta path-based top-k similarity search in heterogeneous information networks,","venue":null,"work_id":"9404975e-3939-47fa-906e-ceb378515c78","year":2011},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.362862Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:f8b82abb56a719e14bb7edcbb37e643cc259fc71bb600f3e6b65494420d2e495","observation_id":"4d1ba4b6-2af6-434c-ac4b-cc3cb206feb9","resolution":{"observed_at":"2026-08-10T21:10:55.084342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.367704Z","title":"Discovering meta-paths in large heterogeneous information networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.367704Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:7eda1e3c1d59cf0e7c6138a493678f7ea4a49501c55886659061021e40141e20","observation_id":"ab241ffb-9f54-4221-902e-e3634009d02f","resolution":{"observed_at":"2026-08-10T21:10:54.367704Z","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-10T21:10:55.057840Z","title":"Higher- order attribute-enhancing heterogeneous graph neural networks,","venue":null,"work_id":"2aa7e743-cc5c-4daf-94fd-e064737bec58","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.372286Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:f8a7f244ccfc93d8c7164fce619a572669f88b7c0dcca02c401c13fe1e490f94","observation_id":"e44a037a-bf15-49c6-b24d-43131ea5b5c8","resolution":{"observed_at":"2026-08-10T21:10:55.063008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.040164Z","title":"Graph trans- former networks,","venue":null,"work_id":"0c31040b-62af-4d22-a714-a6205c806561","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.376872Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:a2acd1612aab428406a150c7896e04425913b80fc46676b044150aa17f5236ba","observation_id":"5ccb4b82-498b-49b3-b57f-df1b89c77e74","resolution":{"observed_at":"2026-08-10T21:10:55.046069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:55.020953Z","title":"Heterogeneous graph transformer,","venue":null,"work_id":"4adbf1f1-54a8-4c1a-b65b-4f0c90afa225","year":2020},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.381385Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:fc713f80285263d3c7c4fc06b2327a91ded2b92baf2fc1da9b3977bbfbca8302","observation_id":"c6c66b2d-65f0-41cc-ab95-bddee79fbcf2","resolution":{"observed_at":"2026-08-10T21:10:55.027644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.996884Z","title":"Mhnf: Multi-hop hetero- geneous neighborhood information fusion graph representation learning,","venue":null,"work_id":"b4a5d6af-715c-4957-b61b-cc607d3d2891","year":2022},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.386150Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:3d13564bbe49747d541ad6fe01a98696b179c4ddd78509101222e0c4aafab54b","observation_id":"33617ebb-8edf-49e6-848c-dd0afa7fdac6","resolution":{"observed_at":"2026-08-10T21:10:55.003909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.978342Z","title":"Are we really making much progress? revisiting, benchmarking and refining heterogeneous graph neural networks,","venue":null,"work_id":"e8fdb9b0-c90a-4360-99da-a6d8fd32c3b3","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.391085Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:66e55b3c745e635569881c44d3d2299d04cc5ffe7ffae81b5134d3d9f0aceffd","observation_id":"24c31382-9569-46b2-8e12-5dd99a80e662","resolution":{"observed_at":"2026-08-10T21:10:54.984656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.958518Z","title":"Efficient heterogeneous graph learning via random projection,","venue":null,"work_id":"56c3b99b-9d49-407f-af81-62c353e9032e","year":2024},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.395785Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:8f2a0cc4a1b689f2279e3b36023492aa30db8851a4a418a178bba9f970ae032d","observation_id":"08bbc367-8c42-4245-ad82-7ea9ef80b0ba","resolution":{"observed_at":"2026-08-10T21:10:54.965548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.939462Z","title":"Graph neural networks with a distribution of parametrized graphs,","venue":null,"work_id":"e673ea7c-1d55-4cc9-8e99-13324147ef3d","year":2024},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.400325Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:168a702884ca83883703e1dd8031fd23fddd84f644957a8b82e7a6a76b37cb89","observation_id":"6da7b457-14a2-4b04-93fa-ddff7563bd9d","resolution":{"observed_at":"2026-08-10T21:10:54.945423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.915592Z","title":"Graph neural architecture search,","venue":null,"work_id":"a6fabd03-7c5e-4c18-87e9-60316db59218","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.404949Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:aaf846e39cc9b34be6d4772602fd6e2e0523aacf68abbf0dc7dacca0d0cdafbd","observation_id":"4da32df4-d6ec-45ce-ad1f-09722ebb3348","resolution":{"observed_at":"2026-08-10T21:10:54.922087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03184","last_updated":"2019-09-10T01:14:33Z","snapshot_observed_at":"2026-08-01T00:00:36.517027Z","submitted_at":"2019-09-07T04:10:41Z","title":"Auto-GNN: Neural Architecture Search of Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03184","snapshot_observed_at":"2026-08-10T21:10:54.410324Z","title":"Auto-gnn: Neural architecture search of graph neural networks,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.410324Z"},"links":{"cited_paper":"/paper/1909.03184","citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:92a50a00b75d08c25e5ad300fd91e3396cf54355f5a1deb60d1e2bae4f07b13a","observation_id":"b32b9f0a-2aaf-46dd-a9c6-303952fcd5c4","resolution":{"observed_at":"2026-08-10T21:10:54.410324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08582","last_updated":"2022-06-17T06:47:21Z","snapshot_observed_at":"2026-07-06T13:21:53.571940Z","submitted_at":"2022-06-17T06:47:21Z","title":"DFG-NAS: Deep and Flexible Graph Neural Architecture Search","version":1},"cited_work":{"arxiv_id":"2206.08582","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.08582","snapshot_observed_at":"2026-08-10T21:10:54.612151Z","title":"DFG-NAS: Deep and Flexible Graph Neural Architecture Search","venue":"cs.LG","work_id":"e3b6a944-5f4d-47e9-b25b-1eedf1b48c68","year":2022},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.420191Z"},"links":{"cited_paper":"/paper/2206.08582","citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:10e4c0556f1ba62ab500234602390990a65cc2401f1ed76f0cfe4b7958dd8783","observation_id":"66d09ed5-aa1a-4784-b6ab-2d2afb3470ab","resolution":{"observed_at":"2026-08-10T21:10:54.619930Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.896856Z","title":"Large-scale graph neural architecture search,","venue":null,"work_id":"111e5f49-74ac-411c-a19a-ca7e272c592d","year":2022},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.426476Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:210b5408b7df77cfb0bb0b1164d0b9e21161e7f170cc4851e1ca031ef0536082","observation_id":"966decab-32ec-4747-9cd1-b1625a07efbe","resolution":{"observed_at":"2026-08-10T21:10:54.903021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.874383Z","title":"Genetic meta-structure search for recommendation on heterogeneous in- formation network,","venue":null,"work_id":"9d4c7a0c-1b28-4948-acf6-22ac439afb4b","year":2020},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.432329Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:6467e68d009a0cc62da83e49e8ed26b2af0ef43b21c624a616bed2369a78b1de","observation_id":"8e819694-372d-4a33-b00b-c5d3a4368ad6","resolution":{"observed_at":"2026-08-10T21:10:54.882635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.854012Z","title":"Autogel: An automated graph neural network with explicit link information,","venue":null,"work_id":"0c55328a-e580-4c6b-a1c1-9baee64e6ff6","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.437571Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:43b5a3fae7ca589b1cc5cc04ce65067d811d8e00c6f23c59128063d07cb3a4e6","observation_id":"cc397082-34ce-416d-9954-0cceac03229d","resolution":{"observed_at":"2026-08-10T21:10:54.860100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.831994Z","title":"Diffmg: Differentiable meta graph search for heterogeneous graph neural networks,","venue":null,"work_id":"198f59c3-d618-4ccd-a32e-dcd2ead8adfb","year":2021},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.442323Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:d034908402736d07998a154841eb2dd4a0b0f90d34eaffc5491d3d8d52009c86","observation_id":"651f5dfa-f07d-4a49-a687-e7c3646ecb7d","resolution":{"observed_at":"2026-08-10T21:10:54.839209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.810165Z","title":"Measuring and relieving the over-smoothing problem for graph neural networks from the topological view,","venue":null,"work_id":"73aa5650-4e7d-4836-a1b1-c8894cd24816","year":2019},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.446871Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:c64aa21a11a99632cf7518363e6df7f8034f67156faea0ad4ebb51fc7f4d2e1b","observation_id":"e3d5c72e-aee2-4ae0-b3eb-a98f180c936b","resolution":{"observed_at":"2026-08-10T21:10:54.816717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.790512Z","title":"Hierarchical optimization: An introduction,","venue":null,"work_id":"e5ef324e-5ace-43e0-bd74-fe685f296a21","year":1992},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.451780Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:7a2f6fbd7c8c48c4a71551b6562f3fb771400c7d55300354f68bff67808d48f1","observation_id":"dec963b7-737f-4afb-b290-88decbfa77c0","resolution":{"observed_at":"2026-08-10T21:10:54.796324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.770821Z","title":"An overview of bilevel optimization,","venue":null,"work_id":"2db21169-bc77-4323-a280-4e000aa31e22","year":2007},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.456311Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:3c3e1d95c628f554a325d627a251d9d1191b7928430ab770e7f6cdbd28f459bf","observation_id":"e38ed35c-f99b-4138-b265-90cb76381c0a","resolution":{"observed_at":"2026-08-10T21:10:54.776508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09055","last_updated":"2019-04-23T06:29:32Z","snapshot_observed_at":"2026-08-09T13:23:20.015254Z","submitted_at":"2018-06-24T00:06:13Z","title":"DARTS: Differentiable Architecture Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.09055","snapshot_observed_at":"2026-08-10T21:10:54.462485Z","title":"Darts: Differentiable architec- ture search,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.462485Z"},"links":{"cited_paper":"/paper/1806.09055","citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:23610c6cc5ac8dc71874f0661b77bf05bf2fab25c151edd46d1f6865f7a1982b","observation_id":"aeeb2046-9ab3-4cff-b200-008310ba0139","resolution":{"observed_at":"2026-08-10T21:10:54.462485Z","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-10T21:10:54.751834Z","title":"Graph attention networks,","venue":null,"work_id":"f6a50aee-8d18-40d9-b800-bc465a30f3ec","year":2017},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.468373Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:5584c6abbea5552552b09be58f82b55ff63e40b9c316a1ebc1387ff3677c3d9a","observation_id":"924cba55-0ce1-4b78-a5f4-2ef5e4aedaa9","resolution":{"observed_at":"2026-08-10T21:10:54.757424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.730228Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":"23755428-73d4-4445-b356-023098ddb19e","year":2016},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.474037Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:df827711c80ca14b11c61664086bf7ea2377d6226901ce21713ea09e89bb9cdc","observation_id":"43a1c0b7-cf19-4047-bfc3-e95ae0e1e8d8","resolution":{"observed_at":"2026-08-10T21:10:54.736968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"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-10T21:10:54.478962Z","title":"Heterogeneous network representation learning: A unified framework with survey and benchmark,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:54.478962Z"},"links":{"citing_paper":"/paper/2501.07598"},"observation_digest":"sha256:06778b781ead6f230d1e1031f6b9a418f03773870a9ad0d5085c0981149d0012","observation_id":"fc440fc4-1560-4e2f-ace9-661893be8388","resolution":{"observed_at":"2026-08-10T21:10:54.478962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.07598","last_updated":"2025-01-10T14:26:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T21:03:54.797137Z","submitted_at":"2025-01-10T14:26:10Z","title":"Automated Heterogeneous Network learning with Non-Recursive Message Passing"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":41},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2501.07598."}