{"as_of":"2026-08-14T15:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb95171180e5c3745ecde19b598c8081f8066cef6ac168035336ece29cfe46e0","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-12T15:42:48.784218Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:26:20.438770Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T17:44:19.088737Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14035","snapshot_observed_at":"2026-08-11T17:26:20.438770Z","title":"Teaching mlps to master heterogeneous graph-structured knowledge for efficient and accurate inference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08937","last_updated":"2024-12-12T04:58:32Z","snapshot_observed_at":"2026-08-11T17:19:14.579398Z","submitted_at":"2024-12-12T04:58:32Z","title":"Multi-Scale Heterogeneous Text-Attributed Graph Datasets From Diverse Domains","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T17:26:20.438770Z"},"links":{"cited_paper":"/paper/2411.14035","citing_paper":"/paper/2412.08937"},"observation_digest":"sha256:59d9d8ed2bcd1073aa742b62109a815b29921922571fab6c8acfd9f9ce614c44","observation_id":"0e86f697-c2f5-4f88-8d96-04f715e08af1","resolution":{"observed_at":"2026-08-11T17:26:20.438770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"cited_work":{"arxiv_id":"2411.14035","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.14035","snapshot_observed_at":"2026-08-08T17:44:19.088737Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","venue":"cs.LG","work_id":"306175a7-c240-4c89-b934-0ce99e30d44d","year":2024},"citing_paper":{"arxiv_id":"2502.05864","last_updated":"2025-02-09T11:55:14Z","snapshot_observed_at":"2026-08-13T03:08:59.597615Z","submitted_at":"2025-02-09T11:55:14Z","title":"Learning Accurate, Efficient, and Interpretable MLPs on Multiplex Graphs via Node-wise Multi-View Ensemble Distillation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T17:44:18.967986Z"},"links":{"cited_paper":"/paper/2411.14035","citing_paper":"/paper/2502.05864"},"observation_digest":"sha256:38a08a0f344e4aeef2d25bd89d2934c265d5fe3e170875023c903888dd89a80d","observation_id":"6a7bfb34-1f50-48de-b9c0-17d12e57f23f","resolution":{"observed_at":"2026-08-08T17:44:19.096087Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.14035/citation-record","integrity":"/paper/2411.14035/integrity","json":"/paper/2411.14035/citation-record.json","paper":"/paper/2411.14035"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:42:48.527361Z","title":"Heterogeneous network representation learning: A unified framework with survey and benchmark,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.527361Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:70a34c929a55cb88461a0bf16a190830b246dfce44ee0fe5e05d412fdb0b77ae","observation_id":"c0e6712d-c3af-4f39-a951-cdd3f6e1a6cf","resolution":{"observed_at":"2026-08-12T15:42:48.527361Z","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-12T15:42:49.711311Z","title":"Online user representation learning across heterogeneous social networks,","venue":null,"work_id":"597fee93-f237-4f42-b6a8-b9f56ca44465","year":2019},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.533305Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:1030c0b4ba5aba7ee503ba5a35a36eee8dc938e840fd3795349e5c24811887e7","observation_id":"f70630a9-fc0b-4440-8780-9c61befacde9","resolution":{"observed_at":"2026-08-12T15:42:49.717338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.687522Z","title":"Oag: Linking entities across large-scale heterogeneous knowledge graphs,","venue":null,"work_id":"f9eb25e1-3145-4a82-8fe8-292c496d39f2","year":2022},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.539457Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:74935241907d509e19ae9053968b482d867d6ed165867207295456bfecaeb01f","observation_id":"21c0962f-e205-45ec-8c8c-27ae7bb7fa3e","resolution":{"observed_at":"2026-08-12T15:42:49.694916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.669310Z","title":"Heterogeneous informa- tion network embedding for recommendation,","venue":null,"work_id":"35b511ab-dcdb-4a6d-8173-9ad66d16a361","year":2018},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.544972Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:2a0dc21a2dce10b74f239bbd9413b46891c9b9393727e618c45ec0d5a7acfcfb","observation_id":"4e5066e2-6741-497a-86d1-69759103b86a","resolution":{"observed_at":"2026-08-12T15:42:49.674975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.648680Z","title":"Connecting embeddings based on multiplex relational graph attention networks for knowledge graph entity typing,","venue":null,"work_id":"7794f4f0-99db-4b3f-95b7-f2eb8d929e76","year":2022},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.551618Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:d84023e9cf0e542ac78c31d7bff7c7084c16a0353d918cf1ae689423810cac6c","observation_id":"eeae88d0-97fa-47db-be28-d4385aca7274","resolution":{"observed_at":"2026-08-12T15:42:49.655435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.629986Z","title":"Single-cell biological network inference using a heterogeneous graph transformer,","venue":null,"work_id":"9a4fb3a3-6d5b-4918-8528-29a826b2695b","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.557273Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:8946efe4a38a59af618b5d496b7f294740dc5b15c928e529c93c07c2d1244747","observation_id":"ead0b8eb-5e6d-41d0-ad39-057d11b8017e","resolution":{"observed_at":"2026-08-12T15:42:49.635540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.612122Z","title":"Modeling relational data with graph convolutional networks,","venue":null,"work_id":"4dfb0397-be2b-4558-ad84-cbd35c5ec1f4","year":2018},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.564381Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:ab25c9ede6edb1f1c83e0bde4fe7a912e83634a5693d26cfc90e3088890424b1","observation_id":"e2b29ec4-6691-42b9-8d14-705c4d2ee9f9","resolution":{"observed_at":"2026-08-12T15:42:49.617673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.593916Z","title":"Interpretable and efficient heterogeneous graph convolutional network,","venue":null,"work_id":"e81b01bb-2ac6-493f-a140-eea4c817fba3","year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.569885Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:42b2e5fd474e531de3e2302f96a51da0efb546ae0aa37fdd8cf1dbd61734c7b3","observation_id":"f139d2dc-8b21-4935-ad33-4147440c85f8","resolution":{"observed_at":"2026-08-12T15:42:49.599882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.576640Z","title":"Are we really making much progress? revisiting, benchmarking and refining heterogeneous graph neural networks,","venue":null,"work_id":"613fc259-b92b-452b-a989-c871cd35af2b","year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.575231Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:f87138d863acb7b4ba1afce54eaaab3d6d626c91c6f32ee92dec268b76a33f8e","observation_id":"e6edef59-5bec-4319-af66-f16316deaded","resolution":{"observed_at":"2026-08-12T15:42:49.582272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.560040Z","title":"Hgamlp: Heterogeneous graph attention mlp with de-redundancy mech- anism,","venue":null,"work_id":"7d614c54-7b55-4651-afc0-50638d313ca4","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.580087Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:ba175536a6c96de04f5584d4e7956b8ec07d38a234b047ff5a21cc3e7f8e4d29","observation_id":"79ae7407-3443-40fe-a7b4-d1c44953e48f","resolution":{"observed_at":"2026-08-12T15:42:49.565515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.542940Z","title":"Heterogeneous graph attention network,","venue":null,"work_id":"e4b44f27-3425-49d7-a2d9-64a9594662f3","year":2019},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.584961Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:1a0bb755fca904bda833a2b9975142f8ad0d39dc268a0ed1df9d15a51435d74e","observation_id":"537898ef-dd6e-4fd7-840a-20361f134fb8","resolution":{"observed_at":"2026-08-12T15:42:49.548045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.525992Z","title":"Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,","venue":null,"work_id":"9860aece-63d2-4d76-8e04-f7d6ea727acf","year":2020},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.589778Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:0dc523e23ee75cd0aa65dac617a031f55fde1b7c7ff78a952215c86b608b5822","observation_id":"3bbb3a17-68cf-44c5-9f1e-2c395d31ba17","resolution":{"observed_at":"2026-08-12T15:42:49.531865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.506755Z","title":"Heterogeneous graph propagation network,","venue":null,"work_id":"34eca3c1-9ead-4153-88f9-124b95e76572","year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.595129Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:2583e49c845c353841c8be13f32ea5a78a8bd2e588b3d8ccc6f8f06ea37a2f85","observation_id":"dc5c74b2-d64a-4107-858d-2a49c82d4921","resolution":{"observed_at":"2026-08-12T15:42:49.515074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.480876Z","title":"Reliable node sim- ilarity matrix guided contrastive graph clustering,","venue":null,"work_id":"574450fc-f3c6-4721-b110-b5cc6ee66d45","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.600012Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:c2628c0ecca6c71ff94d23e68523aa1429c3ac95e2f8b117d5317f756a0d1c5e","observation_id":"f57755a3-8331-4c18-bf22-79286ff4f0a5","resolution":{"observed_at":"2026-08-12T15:42:49.489371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.463515Z","title":"Paths2pair: Meta-path based link prediction in billion-scale commercial heterogeneous graphs,","venue":null,"work_id":"f6349137-f349-42ef-916a-6886bcace982","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.604693Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:798bf1528b3083882cd45f954aa82edd5c388ba0f4276dc1e81b64eca4db0133","observation_id":"8965ae89-fdb2-41d0-ae14-6b12323230c2","resolution":{"observed_at":"2026-08-12T15:42:49.469136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.443610Z","title":"Igb: Addressing the gaps in labeling, features, heterogeneity, and size of public graph datasets for deep learning research,","venue":null,"work_id":"fea426e7-a897-446e-a3e3-8c19ad177eef","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.609475Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:bbfdaac0d7032fac0067730f27f0f8ba59fbdcce2f19a01ddae233ecd8de7167","observation_id":"43772f09-8037-446f-8412-7b406102fb4d","resolution":{"observed_at":"2026-08-12T15:42:49.449966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.425737Z","title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation,","venue":null,"work_id":"26bc815b-d8fd-4e5f-a978-bcf452cd29bd","year":2022},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.615017Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:f5273637d48988054a0feb4746d50f0acad24f166e635260cd4b9236c0443bc3","observation_id":"5a8ee6a3-f0c8-445c-9885-69ebb1d278b3","resolution":{"observed_at":"2026-08-12T15:42:49.430946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.406148Z","title":"Learning MLPs on graphs: A unified view of effectiveness, robustness, and efficiency,","venue":null,"work_id":"e0a7d9aa-ffea-4065-bf20-c4d68c385059","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.620527Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:150fb2e4e9633c6fd77443b32192d5bf5086f0fb73de0acb61af05e00e11b928","observation_id":"6cf0b43a-d5a3-4af6-989e-16942ceed15d","resolution":{"observed_at":"2026-08-12T15:42:49.411625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.385697Z","title":"Quantifying the knowledge in gnns for reliable distillation into mlps,","venue":null,"work_id":"d1689f7c-0483-4348-b09d-cac62e92764d","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.625924Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:bacd874e47664663157cf75ef8791de2bf372c55669a476ac8873a387714670c","observation_id":"b893552c-5568-432b-8db4-94e19fad6b1d","resolution":{"observed_at":"2026-08-12T15:42:49.392657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.365720Z","title":"VQGraph: Rethinking graph representation space for bridging GNNs and MLPs,","venue":null,"work_id":"f613228f-d60f-4be1-a086-cc8d42c3acd3","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.632945Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:2e6b77d489520b63a0980049d138505d64a71c01e9a4f3a0c83775ec2995ab18","observation_id":"143ab6d4-36f5-4784-96ad-43578262e6a1","resolution":{"observed_at":"2026-08-12T15:42:49.371528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-12T15:42:48.637978Z","title":"Distilling the knowledge in a neural network,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.637978Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:d3c343ef5d3fcc30f2e3f4783c578c6ba685fd8df11572aedeb4296f0899e12e","observation_id":"d5af9cbe-02a0-4b29-95fe-b0c9893b7a82","resolution":{"observed_at":"2026-08-12T15:42:48.637978Z","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-12T15:42:48.643596Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.643596Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:125eec209a907c0947a207870003ad46e523073e653759be30ad75b1ebb711f6","observation_id":"a7de3277-380c-4a08-a2ff-0087b351a61a","resolution":{"observed_at":"2026-08-12T15:42:48.643596Z","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-12T15:42:48.649267Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.649267Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:64b347a2a1ca08b31f016c1e294c466f5d094a0fb95a7ce1df9d34e74edbbdfe","observation_id":"3605ba6c-e3fb-4354-902d-489fe85fec22","resolution":{"observed_at":"2026-08-12T15:42:48.649267Z","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-12T15:42:49.322862Z","title":"Double wins: Boosting accuracy and efficiency of graph neural networks by reliable knowledge distillation,","venue":null,"work_id":"c783c26a-6c87-4ef1-b802-b60c6c932089","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.654164Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:eeb3ce77c30f2a76634ed40c6a08289010926bcdd22589d6706e66feac931a40","observation_id":"0f8a737b-1468-4590-b403-d2e6d60e50eb","resolution":{"observed_at":"2026-08-12T15:42:49.328658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.300353Z","title":"Extracting low-/high- frequency knowledge from graph neural networks and injecting it into mlps: An effective gnn-to-mlp distillation framework,","venue":null,"work_id":"978f3283-2e02-4d4e-8dbf-6e6f41de0087","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.659830Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:b44a488356f432ceaf4d6b1c47471ee533658bfb781a6ad62cc726960741d717","observation_id":"9566b457-a69d-42ca-baab-cd05a0d525ca","resolution":{"observed_at":"2026-08-12T15:42:49.309587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:48.664852Z","title":"Linkless link prediction via relational distillation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.664852Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:12f4f5eb553ee42fd6e434818e0ca2142f84077660d6a280bbbe8b4fb2b45df1","observation_id":"f2a61737-bd36-40ff-aff0-82a23b31d87d","resolution":{"observed_at":"2026-08-12T15:42:48.664852Z","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-12T15:42:49.264945Z","title":"Mugsi: Distilling gnns with multi-granularity structural information for graph classification,","venue":null,"work_id":"019a1f04-17f3-4215-8e9d-9b991e4247cd","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.669898Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:aa8c05db04a017a7ce2fa480b012ffdab881f1a031d1749fa9fdda39dc65c321","observation_id":"b5c00f91-898a-4b20-8f78-893ac9f803f3","resolution":{"observed_at":"2026-08-12T15:42:49.271835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.241680Z","title":"LightHGNN: Distilling hy- pergraph neural networks into MLPs for 100x faster inference,","venue":null,"work_id":"1c76f8e9-4bd2-4782-91e1-0f7ab641d8d1","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.675039Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:a5947176f78ca73ce63d0f83a3b48db92abcc4fb61cd85f863138635195a0953","observation_id":"7c6c45c7-8e4f-49f8-8bbb-ee565a310099","resolution":{"observed_at":"2026-08-12T15:42:49.251845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:48.681833Z","title":"In defense of pseudo-labeling: An uncertainty-aware pseudo-label selection frame- work for semi-supervised learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.681833Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:b21c367fd19fb295847daa7d19503a84229408a5d3b3e3b72c4d327961b3ca78","observation_id":"daef2616-7232-418c-ac88-cdf615c686df","resolution":{"observed_at":"2026-08-12T15:42:48.681833Z","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-12T15:42:49.212446Z","title":"Re- liable data distillation on graph convolutional network,","venue":null,"work_id":"7b094528-c3c6-433f-8dea-72d1a0c45833","year":2020},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.687350Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:ed1628cf08876765e9b7ca20b5c44f624354145c9cb1ac8d9b0cd58299ffc2b8","observation_id":"4735154a-5435-4996-9612-d090a7e5a73b","resolution":{"observed_at":"2026-08-12T15:42:49.218306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.192498Z","title":"Deep insights into noisy pseudo labeling on graph data,","venue":null,"work_id":"f8b5d036-76b4-4873-8ab8-f2607ac9e826","year":2023},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.692540Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:56500636b7af88ae540432711b8ee0527365d33c816a524d83718e56b5987f14","observation_id":"a379a6eb-b507-44a3-9dfa-1d1a434a7985","resolution":{"observed_at":"2026-08-12T15:42:49.198642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.172137Z","title":"Self-supervised heterogeneous graph neural network with co-contrastive learning,","venue":null,"work_id":"9f522b01-441b-4fd5-a52f-2604c6067b96","year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.697377Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:6500f49c78ee19c309c7782bbb23e41c9524de0f38d94bcf09c4c18b39052a10","observation_id":"d0071e1c-4c9f-40f9-a755-32e6af6b90da","resolution":{"observed_at":"2026-08-12T15:42:49.177440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.151122Z","title":"OGB- LSC: A large-scale challenge for machine learning on graphs,","venue":null,"work_id":"f9655c69-02cd-4506-be13-c30b4dd24484","year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.703075Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:b70306fefd49191ed8e6b8377f4378e925d99f3cdb42a219dbbd9f6d98fa37ad","observation_id":"7b030171-5485-4b18-9fc8-bb3c3855b7d4","resolution":{"observed_at":"2026-08-12T15:42:49.157658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.129232Z","title":"On graph neural networks versus graph-augmented mlps,","venue":null,"work_id":"918d10a9-dadb-4b00-95e7-24fe1b2b576a","year":2021},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.708081Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:0c2a2fd26d15a562aa948d374b04cee8376e22e90a624d04d595805dc1284a5f","observation_id":"639f946e-ed13-4eb9-8407-0f0ead4fdcb0","resolution":{"observed_at":"2026-08-12T15:42:49.137304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.10688","last_updated":"2020-09-17T04:47:27Z","snapshot_observed_at":"2026-08-14T00:10:32.005179Z","submitted_at":"2019-11-25T03:44:34Z","title":"Rethinking Softmax with Cross-Entropy: Neural Network Classifier as Mutual Information Estimator","version":4},"cited_work":{"arxiv_id":"1911.10688","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.10688","snapshot_observed_at":"2026-08-12T15:42:48.887424Z","title":"Rethinking Softmax with Cross-Entropy: Neural Network Classifier as Mutual Information Estimator","venue":"cs.LG","work_id":"d3b723f1-631b-4334-9277-d2509beb3760","year":2019},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.713440Z"},"links":{"cited_paper":"/paper/1911.10688","citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:a324b29d873c60ffb23b27dc3befc395abad3d9b67bc2758908d4f02f533beff","observation_id":"84bdc245-ce1e-4324-8a21-455e3eb24416","resolution":{"observed_at":"2026-08-12T15:42:48.895060Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.104054Z","title":"Joint embedding of struc- ture and features via graph convolutional networks,","venue":null,"work_id":"573b86ec-d61c-43a6-90bf-0f6864350c48","year":2020},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.718946Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:f9d558e9691f4b4622d8d6d9481569d8d5ca8721565da2e7756f762f7d256b50","observation_id":"968b7a46-58bf-43c0-baaf-5f3e0af71ba5","resolution":{"observed_at":"2026-08-12T15:42:49.111605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.085148Z","title":"Multi-scale heterogeneous text-attributed graph datasets from diverse domains,","venue":null,"work_id":"13d77ba3-3e5f-49c2-ba8f-833cba88c43c","year":2025},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.724305Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:94d68be431449c1846e3b9f4e8a2114d11487c78fe562c0b09f1ffeb30b246e9","observation_id":"e1b48617-aad2-4f86-8996-9d7c867a40a9","resolution":{"observed_at":"2026-08-12T15:42:49.091567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.066092Z","title":"Minilm: Deep self-attention distillation for task-agnostic compression of pre- trained transformers,","venue":null,"work_id":"9e71d2e1-a366-4a00-99c9-df40c322b0e1","year":2020},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.729658Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:4f3712c7eebed9d430ea88a29e1e29d2256a3b105458c72f11870d486ac5c0a0","observation_id":"52037565-e50c-4fa9-8394-469fea40cefb","resolution":{"observed_at":"2026-08-12T15:42:49.071972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:49.045069Z","title":"Sentence-BERT: Sentence embeddings using Siamese BERT-networks,","venue":null,"work_id":"91f91bc8-ca55-4c6f-a3e6-e2ea5a0f11c9","year":2019},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.734821Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:e76c38ac8f3fc24ba89d7a5356e55cd20dd8c9cad720c28db0e37d913dcf5573","observation_id":"fb04f29e-32b5-481c-9bbe-faf7e77c93a6","resolution":{"observed_at":"2026-08-12T15:42:49.052925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-12T15:42:48.739509Z","title":"Roberta: A robustly optimized bert pretraining approach,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.739509Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:0f7dbc5ea0ea0832e8c34ac4fa949f6f0be73f1c807d2998b6e6480b11e94b01","observation_id":"8f538768-a9f2-419b-bf09-9a783f4df6a0","resolution":{"observed_at":"2026-08-12T15:42:48.739509Z","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-12T15:42:49.022892Z","title":"Inductive representation learn- ing on large graphs,","venue":null,"work_id":"a98bd4d8-1b50-48b8-9368-2fde0bd1743a","year":2017},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.747098Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:8d50d847be8af8e0bb8974c8ba631eea2ce24ceb1ff52cc14cebe335f6f95028","observation_id":"c482b218-c2f1-4fd3-90b0-627999bf2afa","resolution":{"observed_at":"2026-08-12T15:42:49.028468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-08-10T08:01:55.032475Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-08-12T15:42:48.752452Z","title":"Relational graph attention networks,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.752452Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:9d0b6063a5157325a4ff87d810bafbb4ce95be7191a94fc8ec7dda4d26521543","observation_id":"d07aba24-415c-4356-939c-f8bd1ec54792","resolution":{"observed_at":"2026-08-12T15:42:48.752452Z","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-12T15:42:48.757521Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.757521Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:1f0221ca9a89fd8022e53e3b3f5f63efba592aa340a330a9c3c31c591a337256","observation_id":"b6338218-54e1-4571-a926-348554a064cb","resolution":{"observed_at":"2026-08-12T15:42:48.757521Z","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-12T15:42:48.986809Z","title":"Learning accurate, efficient, and interpretable mlps on multiplex graphs via node- wise multi-view ensemble distillation,","venue":null,"work_id":"23eb3297-0dfd-4bc5-b808-5fc172eef8ba","year":2025},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.765244Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:3d5ca2fb67c7b38b7d7a8adc21b59a1a30b9591fad43fd1d805865ed487baa2f","observation_id":"12ce9d6a-eb40-4280-814b-822e612b4fa6","resolution":{"observed_at":"2026-08-12T15:42:48.993012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:48.968647Z","title":"Hire: Distilling high-order relational knowledge from heterogeneous graph neural networks,","venue":null,"work_id":"5223279f-94b5-465a-b160-7deaea251215","year":2022},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.771457Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:d333c0404d9a47d6cbc2fc238075cd8ef1dc646ab33b487e84928e251bfac1b4","observation_id":"8c86fda8-2665-45a5-9828-9a5e29eeb67e","resolution":{"observed_at":"2026-08-12T15:42:48.975117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:48.952113Z","title":"A teacher-free graph knowledge distillation framework with dual self-distillation,","venue":null,"work_id":"ac4df554-73e0-41f1-8e50-f718240e07f4","year":2024},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.776497Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:9319600b4c82c368e01e25b99ffd1dd08ce7d3dacc928a3858310963c7a48fdf","observation_id":"32d4680c-9181-48b0-a2be-1f2b2bede95c","resolution":{"observed_at":"2026-08-12T15:42:48.957490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T15:42:48.933651Z","title":"Single teacher, multiple perspectives: Teacher knowledge augmentation for enhanced knowledge distillation,","venue":null,"work_id":"4172ad7d-bf21-4708-9ba1-778d41ab0391","year":2025},"citing_paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:48.784218Z"},"links":{"citing_paper":"/paper/2411.14035"},"observation_digest":"sha256:c0918d71b2d42539b59863227bce5303d07789d34334905b6b8d3aba2b1fbedc","observation_id":"b03299db-c554-49ed-84a0-5efca653815e","resolution":{"observed_at":"2026-08-12T15:42:48.939929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14035","last_updated":"2025-07-14T03:41:27Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T15:33:53.246951Z","submitted_at":"2024-11-21T11:39:09Z","title":"Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":37},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 2 inbound Pith citation observations for arXiv:2411.14035."}