{"as_of":"2026-08-09T13:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28b613acd6d50823d843cbf21990d4ddd3178b794f201cfb83ce0d2bdc2ecf65","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:36:54.653442Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2506.05039/citation-record","integrity":"/paper/2506.05039/integrity","json":"/paper/2506.05039/citation-record.json","paper":"/paper/2506.05039"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:36:54.326950Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.326950Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:c44e4c168e3ab86625d7b018363318888a2d63aefe33505e113103206759af3b","observation_id":"7e3afb58-fd58-4cea-8906-3f0fabc3b7c9","resolution":{"observed_at":"2026-08-07T10:36:54.326950Z","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-07T10:36:56.016615Z","title":"V., and Galstyan, A","venue":null,"work_id":"fd226ea4-8691-4914-949a-fae432e2b831","year":2019},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.332719Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:d7e6ab3e44ffe6c4a554d4e9454072efc258cdc223e5308f2f4a5787ef44e8c3","observation_id":"55d08321-fbe6-4f2c-b59c-5d76d6bd6518","resolution":{"observed_at":"2026-08-07T10:36:56.021799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-93037-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":null,"venue":"Lecture notes in computer science","work_id":"5689a436-d56c-47c8-a056-bc46dcc75800","year":2018},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.337301Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:39d393b3bdc0cd1c7eec97510afab2e5873e0cdae3656a4fc5dd9ba227fdd50a","observation_id":"2cdfd3c8-d1be-4847-a6d2-0609245c1f5b","resolution":{"observed_at":"2026-08-07T10:36:54.774092Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.446924Z","title":"Make heterophilic graphs better fit GNN: A graph rewiring approach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.446924Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:e36007a2d8618dea1a887a93f9aab5832121452abd5173081d1b8f91f574a699","observation_id":"2a899830-c526-4500-81bc-fad05a0d8836","resolution":{"observed_at":"2026-08-07T10:36:54.446924Z","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-07T10:36:56.000499Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":"58bb367b-d7f9-42d6-b410-0cf37895ef88","year":2013},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.451520Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:6bfd6695f603c4598070c5332fd3eedb1ff544e3a04fa34cc73b07880dcbf5d1","observation_id":"8cb51053-aa35-4853-a711-d424033dc889","resolution":{"observed_at":"2026-08-07T10:36:56.006510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.985113Z","title":"Simple and deep graph convolutional networks","venue":null,"work_id":"83817214-2423-4d95-b289-813459ddddeb","year":2020},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.455768Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:ab9a62f680c5d105505dd2f55cf619f8d63a1eaa5fd44069ea7fcdb3cbf77e40","observation_id":"5e7680aa-cc64-4ea8-af53-2da082035804","resolution":{"observed_at":"2026-08-07T10:36:55.990107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2223.35022","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:36:55.490062Z","title":"Fede: Embedding knowledge graphs in federated setting","venue":null,"work_id":"5bef4ae6-2e74-4a9e-8167-ae6cfb7363ce","year":2021},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.460362Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:1c475a70d83493e35248756d40d30e6b7bc27aa2f95cbf30ef1c9e6abf1f534c","observation_id":"9da03bab-5cfe-40b4-9043-af45a9bd81b5","resolution":{"observed_at":"2026-08-07T10:36:55.497806Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.967796Z","title":"Refactor gnns: Revisiting factorisation-based models from a message-passing perspective","venue":null,"work_id":"920a59d9-8e83-4505-b29e-f4835adc482e","year":2022},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.465510Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:c7b7bdd132b0c96c810893a42e0fc34b728d459487a3491dd042b922c18e0862","observation_id":"dad8ff0e-700a-449b-bca4-c7deaab9c30d","resolution":{"observed_at":"2026-08-07T10:36:55.973906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.952364Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"83eceaf7-90f1-4ef8-99d8-d4ef8b1ba08b","year":2021},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.469306Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:0e3b4f8dc45a159d97f03b24503a97c1dc613906fde51193caf3d48b9fa7efcc","observation_id":"f035741f-371a-4208-ba98-f2e497930a10","resolution":{"observed_at":"2026-08-07T10:36:55.957399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.473317Z","title":"Learning structural node embeddings via diffusion wavelets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.473317Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:c6321bde749ccc04e90caaba33277d76966e4d66f9d11c42c87ec3719828d07a","observation_id":"4ee7d64b-ee4b-4239-9de8-e82c52c48efc","resolution":{"observed_at":"2026-08-07T10:36:54.473317Z","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-07T10:36:54.477662Z","title":"and Leskovec, J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.477662Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:dedd03b8b788e34acaf788baade1a41ef0590a7e8d52c39b2615f51bb9372434","observation_id":"09ae9146-2c4e-4d1b-bc90-5b5b2b574031","resolution":{"observed_at":"2026-08-07T10:36:54.477662Z","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-07T10:36:55.937679Z","title":null,"venue":null,"work_id":"b4643dd0-9f7b-4597-b176-d85aea79f4b9","year":2024},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.481926Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:57a16d13ef67ad5f8d672ec482986e035580be01d7479337b72abc14d1bcecf6","observation_id":"8917ce91-6e72-4259-a6c7-07a252ccc9a4","resolution":{"observed_at":"2026-08-07T10:36:55.942571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.923442Z","title":"L., Ying, Z., and Leskovec, J","venue":null,"work_id":"e9f8ed39-bf54-46e9-a316-929d20396224","year":2017},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.486945Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:dddfcb3072996995af98237a64e7717597cc779dbd8eac8504ea4d0c3cc45b32","observation_id":"de1c4691-6deb-4d42-b803-38b5b776aba2","resolution":{"observed_at":"2026-08-07T10:36:55.927859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04051","last_updated":"2021-06-08T02:07:21Z","snapshot_observed_at":"2026-07-06T11:16:56.255738Z","submitted_at":"2021-06-08T02:07:21Z","title":"Graph-MLP: Node Classification without Message Passing in Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04051","snapshot_observed_at":"2026-08-07T10:36:54.491318Z","title":"Graph-mlp: Node classification without message passing in graph","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.491318Z"},"links":{"cited_paper":"/paper/2106.04051","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:cf7b0e864f81d40f73e9e7ac7cb5eeeacf05a9c9c06a433ac07e830c3e3d1bb0","observation_id":"dd6b1f81-874c-4d0e-a23a-3adcf053a2d7","resolution":{"observed_at":"2026-08-07T10:36:54.491318Z","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":"10.1137/21m1395351","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:36:54.748025Z","title":"and Benson, A","venue":null,"work_id":"e95dd34c-5e89-4e92-b4b0-e9aea4d05d1c","year":2022},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.495784Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:1b8d64d95a3720c430f4f7a0f53a7ebd5e5c4bc1d3dbce1efd0dc359744e08c0","observation_id":"069d7bf3-2cf3-4275-bdff-d571d404f78e","resolution":{"observed_at":"2026-08-07T10:36:54.754436Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.909420Z","title":null,"venue":null,"work_id":"6af7278f-b46e-4692-8e81-abdb40e5f7bd","year":2017},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.500527Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:9614479873877bc6819077935fa1378e6c64aeed53a7913bbb20816e1d56dca1","observation_id":"dbcbe1c3-37a6-4a20-b068-0590c01cb7c0","resolution":{"observed_at":"2026-08-07T10:36:55.913630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.895339Z","title":"Edge-splitting MLP : Node classification on homophilic and heterophilic graphs without message passing","venue":null,"work_id":"a858453a-cc1a-4828-baff-b0ac65b91afc","year":2024},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.505272Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:397f7fe486bf6de1714a44399e6805ea7fc3a5d49470bb6d5b44b051a9969e3d","observation_id":"06edfb58-07e6-4e40-bc80-99abee0b6640","resolution":{"observed_at":"2026-08-07T10:36:55.900185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.880948Z","title":"Canonical tensor decomposition for knowledge base completion","venue":null,"work_id":"813008bd-4116-4d1a-9e7b-3943ceae90a2","year":2018},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.509312Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:095c96e74afffbabf032033915ca4c60acce4be940e3ef9f27f4f3a34363068f","observation_id":"7e5bba33-dc99-4223-ae8a-da3a1de78457","resolution":{"observed_at":"2026-08-07T10:36:55.885653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.867341Z","title":null,"venue":null,"work_id":"884d3a5a-4196-40f1-ae95-e7ffa13ddcc4","year":2014},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.513597Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:7dd884953542ccb718cd50a24c1aa4c5dbae8fbde11c83d798ac607cbfb43c7d","observation_id":"9cd00720-2520-4ebc-8383-7fe8fae43cb5","resolution":{"observed_at":"2026-08-07T10:36:55.871656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.518032Z","title":"and Scherp, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.518032Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:ff3b250c69408e256e73cba39eb3fc6667a64e77ae0fedf6efc744534642ea57","observation_id":"1bb15937-1bee-4555-a1a8-9cb4fb2ff5c9","resolution":{"observed_at":"2026-08-07T10:36:54.518032Z","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-07T10:36:55.851250Z","title":"L., Gupta, V., Bhalerao, O., and Lim, S","venue":null,"work_id":"5a917365-6e2a-4b45-b8bc-a55ad7982584","year":2021},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.522511Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:357b49d4868a708e915b15dac04be8646272e3ab325f0c8951ea7c83804688eb","observation_id":"d468cc02-0522-4b80-b100-2adf57722574","resolution":{"observed_at":"2026-08-07T10:36:55.855652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.834139Z","title":"Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities","venue":null,"work_id":"6718f478-8d8d-4deb-aab7-a9274575915d","year":2023},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.526527Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:ac89cb084bd62f8fb509089a23cbaf05d21523df9dc02e957b603db1a1c29261","observation_id":"fb85f111-413c-4bc7-8535-d7fb9426095d","resolution":{"observed_at":"2026-08-07T10:36:55.840391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.819176Z","title":"Revisiting heterophily for graph neural networks","venue":null,"work_id":"d100bdc3-693c-4b56-9302-b7f20ea38498","year":2022},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.530622Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:bf60c859fb6f06ab8028bda55f43ff61a88836b2543afd3198152128d48fd904","observation_id":"3ab7ea8c-2c74-42b9-b2d9-4b4771716e0a","resolution":{"observed_at":"2026-08-07T10:36:55.824097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-08-09T07:12:13.529182Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T10:36:54.534673Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.534673Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:39152e52ab55dd7186b550013eee8a6ae63903c872a24ff55934f67faaaa170f","observation_id":"3886432c-2490-4fcc-877b-2f31a5b29601","resolution":{"observed_at":"2026-08-07T10:36:54.534673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-07T10:36:54.539238Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.539238Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:b83cf82d4273a3b33adaed8e618bd57569ed213e14ef3eb0e93eb0ff9c5e67a8","observation_id":"9847853d-67d5-4964-b985-5f39febd06bc","resolution":{"observed_at":"2026-08-07T10:36:54.539238Z","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-07T10:36:55.804091Z","title":"and Prokhorenkova, L","venue":null,"work_id":"ccb67964-3274-4d11-bb67-d8c5020435f5","year":2024},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.543727Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:67fc30b5819b15b5f81415da8863bed310564d42c366ec05530151475a98cb18","observation_id":"181faf5f-ba06-48ee-a535-46309d8f37cf","resolution":{"observed_at":"2026-08-07T10:36:55.808826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.789629Z","title":"Query-driven active surveying for collective classification","venue":null,"work_id":"3a704288-7de2-4ec6-b2a8-91f2ef50fa41","year":2012},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.548166Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:2634efe190eeb80cd1de9f68b2ecea93727585395887bc34fef5a71dad629d7b","observation_id":"7eb50e58-d08f-4092-84cd-0e52e501e0e6","resolution":{"observed_at":"2026-08-07T10:36:55.794410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08928","last_updated":"2016-06-29T01:05:36Z","snapshot_observed_at":"2026-07-06T05:01:40.436265Z","submitted_at":"2016-06-29T01:05:36Z","title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","version":1},"cited_work":{"arxiv_id":"1606.08928","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.08928","snapshot_observed_at":"2026-08-07T10:36:55.107984Z","title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","venue":"cs.LG","work_id":"2bedc4f7-d53d-4a97-b8d9-e8db1d01e6e4","year":2016},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.552686Z"},"links":{"cited_paper":"/paper/1606.08928","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:6ee4f73f4d7a98f68d878b8e840d53273b99f4ba358e891a60fdfb165139cb93","observation_id":"c2aa9301-1e79-4147-a164-a5a689ae99d3","resolution":{"observed_at":"2026-08-07T10:36:55.113931Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.05005","last_updated":"2017-07-17T05:09:03Z","snapshot_observed_at":"2026-08-01T15:10:58.723106Z","submitted_at":"2017-07-17T05:09:03Z","title":"graph2vec: Learning Distributed Representations of Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.05005","snapshot_observed_at":"2026-08-07T10:36:54.557051Z","title":"graph2vec: Learning distributed representations of graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.557051Z"},"links":{"cited_paper":"/paper/1707.05005","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:553519ad9b4acac56b6b283b454ef4a36791904c1ace14aa389a6ab75052a650","observation_id":"6d88f18e-c33f-419e-a061-4fa131552d1a","resolution":{"observed_at":"2026-08-07T10:36:54.557051Z","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-07T10:36:55.774986Z","title":"C., Lei, Y., and Yang, B","venue":null,"work_id":"3c975dd2-9451-4e0d-836f-05ab16dc15d8","year":2020},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.561364Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:377525e45b99116b390999301b3dc4bd1c93ebe91c5e693421ffd604911b5c27","observation_id":"53d46ba2-78c8-4773-b6e6-a75af69586c4","resolution":{"observed_at":"2026-08-07T10:36:55.779790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.565489Z","title":"Deepwalk: online learning of social representations","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.565489Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:aa193c3166a10aedcae1b3998546d67a0574c8863323015057882900b9f21918","observation_id":"c12efb71-a42d-439f-82ef-b1342c7b4acc","resolution":{"observed_at":"2026-08-07T10:36:54.565489Z","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-07T10:36:55.760402Z","title":"Characterizing graph datasets for node classification: Homophily-heterophily dichotomy and beyond","venue":null,"work_id":"f07a44a0-8b51-43fb-bfa5-1b4283865869","year":2023},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.569784Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:e3837f8e2534be60246b954bb2bb37e088d6c9155c890389d9cff03146fe1cf2","observation_id":"ecd1b5ec-dff7-48a3-b9c7-96ecf655a93a","resolution":{"observed_at":"2026-08-07T10:36:55.765312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.746366Z","title":"A critical look at the evaluation of gnns under heterophily: Are we really making progress? In ICLR 2023","venue":null,"work_id":"76532125-3098-43a2-97e2-a6467ed8968f","year":2023},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.573905Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:8e89132421e97517e346b48167580377dfce3b060143058f44bc703244cc64f6","observation_id":"a76cfe1f-a668-403c-b310-a7b1cc0fa08f","resolution":{"observed_at":"2026-08-07T10:36:55.750788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/tgdk.1.1.11","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:36:54.729967Z","title":"How Does Knowledge Evolve in Open Knowledge Graphs? Transactions on Graph Data and Knowledge, 1 0 (1): 0 11:1--11:59, 2023","venue":null,"work_id":"7da674ae-d111-43fd-9e8a-2d0a0ac0da94","year":2023},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.578314Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:2aa6705264e63649c218f35ec848a77df500fe2f3fd96b8ca8f0edd1db2ffd4d","observation_id":"4a7a7340-9c35-46bf-8947-0650595a88c2","resolution":{"observed_at":"2026-08-07T10:36:54.735924Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.583090Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.583090Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:2021ccbc1516093666f8411d1832ef508b0d025f0667e31477fa55fcffbba6dc","observation_id":"c1bf3c60-289d-4632-865a-7ac85363c8aa","resolution":{"observed_at":"2026-08-07T10:36:54.583090Z","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":"10.1007/978-3-319-46523-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"o tzsch, M., L \\' e cu \\' e , F., Fl \\","venue":"Lecture notes in computer science","work_id":"d2edd1de-f43f-4cfd-9ce4-ef6e654def89","year":2016},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.587204Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:92b3c0d2956339890945c854787107ffa6989f42c6a2ef20ca7b0f29240cb688","observation_id":"93720469-590f-403e-be1f-da13637725a9","resolution":{"observed_at":"2026-08-07T10:36:54.719436Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.731134Z","title":"I., Chamberlain, B","venue":null,"work_id":"7373eb34-8de4-49ed-8968-42cbf9b4dfd9","year":2022},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.592269Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:00fbd6fa3e18bc0554a53994357ad94695e73c4bcb941a0b8d083770937c2a64","observation_id":"11f80065-2f4b-47ae-8a81-760126936898","resolution":{"observed_at":"2026-08-07T10:36:55.735816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.716210Z","title":"F., and Catalyurek, U","venue":null,"work_id":"95b74bbc-e285-4df0-b695-ea46e750b9b1","year":2024},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.596101Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:399f75c122a46f9a842b4a8eb37f7a68805be8e14f97fb9b44645bcf32b59036","observation_id":"93a7b58b-4fbb-4b0d-ab2a-da7cd448c9a2","resolution":{"observed_at":"2026-08-07T10:36:55.720922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.600516Z","title":"Collective classification in network data","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.600516Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:7b5fcf3610ededf6012acd56f8f429fb3427a5665200300cee933690302f5fd6","observation_id":"9c00cdbb-2f95-4511-9990-1991d6550381","resolution":{"observed_at":"2026-08-07T10:36:54.600516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-07-06T07:14:41.761512Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-07T10:36:54.604764Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.604764Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:1246353c8552659df0edec397850aa595eb8e3aa60dca9b51292654732fb4516","observation_id":"e0eac5ae-12c4-4021-a72a-305aa98fa1f1","resolution":{"observed_at":"2026-08-07T10:36:54.604764Z","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-07T10:36:55.701224Z","title":"Rotate: Knowledge graph embedding by relational rotation in complex space","venue":null,"work_id":"b50aca4f-d947-4dbc-bdf3-b3cd958beb84","year":2019},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.609141Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:db38cae3b70b3e028b62de5ebf845b3d0beff85a1990b5b1d767ae61ba9d8fb0","observation_id":"92596f72-cc3b-4458-8c3b-2c93b6eaed0c","resolution":{"observed_at":"2026-08-07T10:36:55.705932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.612976Z","title":"LINE: large-scale information network embedding","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.612976Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:a689f37e3a8548163df6ca3205e1d50250b9719d0cdfa02d9d535ea5650941c6","observation_id":"8f76f3cb-7673-445b-9edc-8a2fa999d62a","resolution":{"observed_at":"2026-08-07T10:36:54.612976Z","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-07T10:36:55.684364Z","title":null,"venue":null,"work_id":"05febeb1-ffca-45fa-aca5-336e0b4162d1","year":2023},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.617441Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:efb0cfdd00f417afdf859d51573f9db7dd66328853ff639eb55821e289ecedac","observation_id":"336bb8f6-9b9d-47a0-9f8a-cae4f2182369","resolution":{"observed_at":"2026-08-07T10:36:55.690458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.669067Z","title":"Complex embeddings for simple link prediction","venue":null,"work_id":"a040e189-4c15-466b-9c8d-4022e68f999d","year":2016},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.621614Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:44dc54cac4cd123ceb2a8335ccb55ab33aa2a1283ca7a18e3ab66cda7e615c65","observation_id":"1bf98797-99be-4d20-a9e5-2802124334f5","resolution":{"observed_at":"2026-08-07T10:36:55.673923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.652934Z","title":"Graph attention networks","venue":null,"work_id":"d72de1e2-7d42-4b79-a625-aa299838c15d","year":2018},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.625797Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:86dc76a39ffc1f5f9c7a52f2217a4acf2df7e9533f6cca6ce826e0c70b1381b4","observation_id":"1a254296-d459-4ae6-bcaf-e19dc7825574","resolution":{"observed_at":"2026-08-07T10:36:55.658446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:54.630166Z","title":"Knowledge graph embedding by translating on hyperplanes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.630166Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:a7212c0cb09cff1e4bd26332a5d2fae618f8299bf1001593c26d063ac86b1de4","observation_id":"dd55959d-b734-4444-8f94-f0a49947dafb","resolution":{"observed_at":"2026-08-07T10:36:54.630166Z","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-07T10:36:55.637521Z","title":null,"venue":null,"work_id":"dcbc4e50-99ab-41f6-88b8-fc4b61c9a05b","year":2019},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.634409Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:25ffb610eaed2367afedea51b9a8d6b3955489ba3c782d70f4c8918bbc42bc64","observation_id":"6d31011e-eac5-4502-89f1-f0e17de93529","resolution":{"observed_at":"2026-08-07T10:36:55.641962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.622563Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"b8451aed-b22c-472f-8913-b94644ee85ad","year":2018},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.638650Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:1cc45c438baf561845382411ef678439bd9ee33bcec4b3f66e30097f9efe0bdd","observation_id":"6931c187-7b5c-428c-b514-38c19a3a7a04","resolution":{"observed_at":"2026-08-07T10:36:55.627443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.606479Z","title":"How powerful are graph neural networks? In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019","venue":null,"work_id":"5a29014a-279b-4c9f-8115-29c1b5479ecb","year":2019},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.643929Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:d82e6449dc507669a0e65eec401a3bbf699da78d094b22eccda0bb2d2760a7bd","observation_id":"305cdcad-2dc6-4f6d-9bf1-bf91e745d271","resolution":{"observed_at":"2026-08-07T10:36:55.611738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.591132Z","title":"Graph-less neural networks: Teaching old mlps new tricks via distillation","venue":null,"work_id":"e25c39db-6fb5-4fda-be72-4b0fa5cd12b1","year":2022},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.648465Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:8ff8ddd67b4d1023bbddd1c22cf3d27de9798a8c47061e6b583cb7d864adce65","observation_id":"263005cf-8404-44dd-ad4c-5a42cf625862","resolution":{"observed_at":"2026-08-07T10:36:55.596077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:36:55.575170Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"d6549cd3-8cbf-4cbb-8a9f-9ee6fa3e3724","year":2020},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.653442Z"},"links":{"citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:08f088f82687f65bf7b8bd21932ea25ff96dc5e9a21e4a2bc0d7d71558d2f40e","observation_id":"0b9e1655-151f-41dc-8ff9-d1285fa32e05","resolution":{"observed_at":"2026-08-07T10:36:55.580784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":20,"verified_exact":5,"verified_fuzzy":25},"total_outbound_references":51},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2506.05039."}