{"as_of":"2026-08-07T09:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94398938190c27ca892b390c91da92434b45ff504d4ea5261fa454005a940970","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T22:23:24.234750Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2511.11046/citation-record","integrity":"/paper/2511.11046/integrity","json":"/paper/2511.11046/citation-record.json","paper":"/paper/2511.11046"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T22:23:20.654755Z","title":"Contextualized messages boost graph representations,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:20.654755Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:8abad3945d0f5e8e197da7b28cb8727688db3925f4eb0c4ff3c0995cc23fe3a0","observation_id":"9d57ce6a-17fb-4144-b636-751b5de4acbd","resolution":{"observed_at":"2026-08-03T22:23:20.654755Z","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-03T22:23:20.791116Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:20.791116Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:0e09d6b03c6a8d7ee22002cbc1f7f6275b88639af165183d5d5e107d6b984e2e","observation_id":"d48ab73c-c01e-4789-95c6-14a8d2a34d80","resolution":{"observed_at":"2026-08-03T22:23:20.791116Z","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-03T22:23:20.838207Z","title":"The reduction of a graph to a canon- ical form and an algebra arising during this reduction,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:20.838207Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:0a0a1ced05ac528748cc316ec058ba2fdc50f8528289b50d4661306a8f73a0b0","observation_id":"848cb8d9-6822-4c78-902b-1ed98d871913","resolution":{"observed_at":"2026-08-03T22:23:20.838207Z","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-03T22:23:20.922159Z","title":"How powerful are graph neural networks?","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:20.922159Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:9ad52b42b12daab6802e481f76755c3e17ed0ae1e39b5fb77275b6c96ecf96a6","observation_id":"e6498a47-802a-4b1f-90ea-25dd911e7348","resolution":{"observed_at":"2026-08-03T22:23:20.922159Z","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-03T22:23:21.035541Z","title":"Random features strengthen graph neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.035541Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:a74942e3a0879ae08be1cc1bedc21ff78828577bc0cf0d8abae167cf1bf6b497","observation_id":"f3f21bd0-17bb-4911-990b-dd3759ce6bf4","resolution":{"observed_at":"2026-08-03T22:23:21.035541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07739","last_updated":"2020-06-13T23:00:22Z","snapshot_observed_at":"2026-07-06T09:28:50.024490Z","submitted_at":"2020-06-13T23:00:22Z","title":"DeeperGCN: All You Need to Train Deeper GCNs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07739","snapshot_observed_at":"2026-08-03T22:23:21.145433Z","title":"DeeperGCN: All you need to train deeper GCNs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.145433Z"},"links":{"cited_paper":"/paper/2006.07739","citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:ac99662a94e1e2054e5e284e6ae10da77b6fc291473623be6830c8842e0c609b","observation_id":"6224dbed-5a03-4c58-acd6-bedd4233d162","resolution":{"observed_at":"2026-08-03T22:23:21.145433Z","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-03T22:23:21.251573Z","title":"GraphSAGE-based traffic speed forecasting for segment network with sparse data,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.251573Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:092b04ec0b02c283223a0d147d651a0129befaa2a2402f63e375aa5a56e400b2","observation_id":"11fdca0e-1c5d-4e85-9f5f-5af5f6f35234","resolution":{"observed_at":"2026-08-03T22:23:21.251573Z","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-03T22:23:21.334586Z","title":"Understanding graph isomorphism network for rs-fMRI functional connectivity analysis,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.334586Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:69d52113e4bbda50f43f170866224119022b6c8cc9347cf7cb36cf077a9b7aee","observation_id":"db96393f-22fa-4cdb-afff-4fdbfc432ea7","resolution":{"observed_at":"2026-08-03T22:23:21.334586Z","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-03T22:23:21.501416Z","title":"Benchmarking graph neural networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.501416Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:ebaeba4a1df750c46b2f6b6766723a30903a45be744d2636aceed814f41c7375","observation_id":"80f3f243-d565-473b-8b8d-e95b30dbe49a","resolution":{"observed_at":"2026-08-03T22:23:21.501416Z","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-03T22:23:21.586306Z","title":"Open graph benchmark: Datasets for machine learning on graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.586306Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:43a6469f1d22a866ee030cde3d213c00de41132d397890fc9a57b8635e86294b","observation_id":"89d84adb-a6aa-4288-8193-2d17c0648660","resolution":{"observed_at":"2026-08-03T22:23:21.586306Z","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-03T22:23:21.679657Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.679657Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:423de87a41373309d484a6767a84f3cf716759bec95280bc85980245114c59c6","observation_id":"7e911e81-a18a-44ab-9a75-220fd856a348","resolution":{"observed_at":"2026-08-03T22:23:21.679657Z","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-03T22:23:21.774743Z","title":"How attentive are graph attention networks?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.774743Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:82e10abadc2315886e19ad50491a8d87906999f221be34714aac766ef43911cc","observation_id":"c96d7b2c-73c4-412a-8564-2a86c4003560","resolution":{"observed_at":"2026-08-03T22:23:21.774743Z","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-03T22:23:21.880161Z","title":"EGAT: Edge-featured graph attention network,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:21.880161Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:bdf87deb867df231654979e45c075ed67a989f06c06bf3ed59c7ee888b4701ed","observation_id":"39b94f21-0baa-468a-801e-9e7e298a7ac8","resolution":{"observed_at":"2026-08-03T22:23:21.880161Z","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-03T22:23:22.127776Z","title":"FinGAT: Financial graph attention networks for recommending top-k profitable stocks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.127776Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:32937682170a4df2a763f15918edf66adfcee56c0b871ee0b5632c935b5578b6","observation_id":"9c67ab28-65c4-4e3c-96b0-4a39b25eb449","resolution":{"observed_at":"2026-08-03T22:23:22.127776Z","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-03T22:23:22.240908Z","title":"GATrust: A multi-aspect graph attention network model for trust assessment in OSNs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.240908Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:22995b98cc7429ee89bf9c0c59b6338d6bcf5e7255b989024f3cacb83affd97f","observation_id":"583c325a-0922-4f53-9a2c-ef4debc88171","resolution":{"observed_at":"2026-08-03T22:23:22.240908Z","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-03T22:23:22.414911Z","title":"FinSIR: Financial SIR-GCN for market-aware stock recommendation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.414911Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:82e4be418bba0158da29cabac567c6d61d9c9820777e71c89356823177880b08","observation_id":"285b03e8-ef89-4fcc-9a34-37f735f948a7","resolution":{"observed_at":"2026-08-03T22:23:22.414911Z","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-03T22:23:22.554753Z","title":"AGTCNet: A graph-temporal approach for principled motor imagery EEG classification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.554753Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:bf92128597ec19506710b793d813065f83e29faab39229370286174626b9a31c","observation_id":"7f119454-e698-4baf-b009-b325b034f06b","resolution":{"observed_at":"2026-08-03T22:23:22.554753Z","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-03T22:23:22.724899Z","title":"Neural message passing for quantum chemistry,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.724899Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:0c0318712c8865440972a8b25a298d805e4dc7bed4584c21ee74419b76da7b27","observation_id":"9fdfab10-e003-4518-bf84-b82ed13823f8","resolution":{"observed_at":"2026-08-03T22:23:22.724899Z","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-03T22:23:22.925256Z","title":"Principal neighbourhood aggregation for graph nets,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.925256Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:03a2bb7047f82ba8e169778cc687d45b9e64141f85570b80d687ea941b7d2fd5","observation_id":"f3cc1a07-8dd7-4bd8-b0bb-5bade9ce700f","resolution":{"observed_at":"2026-08-03T22:23:22.925256Z","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-03T22:23:23.084763Z","title":"Do we need anisotropic graph neural networks?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.084763Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:a139097400325fd97318ddb19ee1c85163d63118e264c696507dd8ba1d588903","observation_id":"a58c5d9c-4e92-4e37-b078-bd7661376a7a","resolution":{"observed_at":"2026-08-03T22:23:23.084763Z","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-03T22:23:23.226446Z","title":"Weisfeiler and leman go neural: higher-order graph neu- ral networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.226446Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:40ef0a1934694e4fe0118f3a0db7b74774d4d52756246c05e9c7148d0cdc5af2","observation_id":"013db0b3-6b3d-4c24-b687-66dcd688c0e2","resolution":{"observed_at":"2026-08-03T22:23:23.226446Z","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-03T22:23:23.347928Z","title":"Expressive power of invariant and equiv- ariant graph neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.347928Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:6c054e67c2ca0147206d8a955619fc15b755c8a98931a30d171630a24f988cf2","observation_id":"9a58cea3-f9f4-41f4-bfaf-bc4994ba0bc6","resolution":{"observed_at":"2026-08-03T22:23:23.347928Z","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-03T22:23:23.524745Z","title":"Weisfeiler and Lehman go cellular: CW networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.524745Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:f0463a55373a46e680406ed28505127fa9eef9588d1d5042d32f3e618261380b","observation_id":"7deacb19-4c80-4a14-bfe8-dd483e597c0f","resolution":{"observed_at":"2026-08-03T22:23:23.524745Z","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-03T22:23:23.654174Z","title":"Do transformers really perform badly for graph representation?","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.654174Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:4b0d6c46d8d279eadc19fa6448ce5d887cde9f576cbe0732867a58a45af77337","observation_id":"fd888136-6517-445f-8945-c59a43e52a28","resolution":{"observed_at":"2026-08-03T22:23:23.654174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15024","last_updated":"2022-09-02T09:25:01Z","snapshot_observed_at":"2026-08-07T00:07:52.494750Z","submitted_at":"2020-12-30T03:43:04Z","title":"Adaptive Graph Diffusion Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15024","snapshot_observed_at":"2026-08-03T22:23:23.754744Z","title":"Adaptive graph diffusion networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.754744Z"},"links":{"cited_paper":"/paper/2012.15024","citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:d1b18561890ebdc22bceb7150b3b31f8736352ccc0f22337767a142dbb9f1b85","observation_id":"27e4c163-dd7f-4986-bdaf-15072701b72e","resolution":{"observed_at":"2026-08-03T22:23:23.754744Z","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-03T22:23:23.854748Z","title":"Improving graph neural network expressivity via subgraph isomorphism count- ing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.854748Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:83c6e10ddc0ec12c6fb2a2b23a577d0cfad3364be58e6e68b5d1a429efe0b7c1","observation_id":"074f0e39-b914-4530-a103-3cee58dd714f","resolution":{"observed_at":"2026-08-03T22:23:23.854748Z","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-03T22:23:23.934748Z","title":"Towards expressive graph representations for graph neural networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.934748Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:abed7bccd2eed605f1b3689b7fb395d574251edbf767a12479e39822d06dd2ab","observation_id":"30413ef1-e91c-41a2-baa4-6a999a10100f","resolution":{"observed_at":"2026-08-03T22:23:23.934748Z","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-03T22:23:23.993941Z","title":"Towards dynamic mes- sage passing on graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:23.993941Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:bf8e19c002966ac178da660047ca3a1fc712867665db0aaa3099806beec4f5d0","observation_id":"0a24e078-4c99-454e-a12d-df3b09e3e181","resolution":{"observed_at":"2026-08-03T22:23:23.993941Z","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-03T22:23:24.104830Z","title":"A simple and expressive graph neural network based method for structural link rep- resentation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:24.104830Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:a356ba3aec59693d03e8c7fbb975547b6ab1a2c20e11480a7d06898992df5823","observation_id":"a273953c-7c81-4b7b-999f-8197f93949c7","resolution":{"observed_at":"2026-08-03T22:23:24.104830Z","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-03T22:23:24.234750Z","title":"Neural execution of graph algorithms,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:24.234750Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:985afb5756ccb65a2d9ce8cf424fb7a477c1e2aef0554f128499d5ae94c5ba65","observation_id":"37d10170-3de5-483d-89ac-0e1657947c5e","resolution":{"observed_at":"2026-08-03T22:23:24.234750Z","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-03T22:23:22.014743Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:22.014743Z"},"links":{"citing_paper":"/paper/2511.11046"},"observation_digest":"sha256:583effa8ca9e68bcf33050c01c89beacc2d2d48c01056e52692f435412694895","observation_id":"62175070-2971-4ec4-9c99-d3e14356d36b","resolution":{"observed_at":"2026-08-03T22:23:22.014743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.11046","last_updated":"2026-06-30T09:20:23Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T12:54:33.008516Z","submitted_at":"2025-11-14T08:00:19Z","title":"Enhancing Graph Representations with Neighborhood-Contextualized Message-Passing"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2511.11046."}