{"as_of":"2026-08-12T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d5e7e341a9213cd7cf4b0c682bcdf8f63202ae10a4a4191098ea7ec5bb6d7f7","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:15:25.690922Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2412.09663/citation-record","integrity":"/paper/2412.09663/integrity","json":"/paper/2412.09663/citation-record.json","paper":"/paper/2412.09663"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.09618","last_updated":"2024-07-12T18:04:32Z","snapshot_observed_at":"2026-08-06T01:25:59.316954Z","submitted_at":"2024-07-12T18:04:32Z","title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.09618","snapshot_observed_at":"2026-08-11T17:15:25.552790Z","title":"The heterophilic graph learning hand- book: Benchmarks, models, theoretical analysis, applications and challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.552790Z"},"links":{"cited_paper":"/paper/2407.09618","citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:2549839f370a24c2ce18a5e47ca7de2639783e8e58978f23a88e0c08283a8114","observation_id":"e8bd5c10-1a9f-420d-a3f5-43ea374fe0ef","resolution":{"observed_at":"2026-08-11T17:15:25.552790Z","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-11T17:15:26.153093Z","title":"Be- yond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"7e196af9-5c42-4db8-9669-6682ef7e5f47","year":2020},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.558973Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:7b928f8f610658a477cc5a978f95138abed65a311643ee750a176e7ade87b46d","observation_id":"0d7336f2-a5c0-49bd-8cbc-21116ed32997","resolution":{"observed_at":"2026-08-11T17:15:26.159181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.136749Z","title":"Is homophily a necessity for graph neural networks? In International Conference on Learning Representations, 2022","venue":null,"work_id":"ad24f260-ccd4-44e2-b950-07d2ab66aa95","year":2022},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.564291Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:f4f69e2f53107c00c9c835e88dd8943becb33ae566a10a82154267a4ce803a26","observation_id":"4c482dc4-52c6-4532-a109-2a4aaa836153","resolution":{"observed_at":"2026-08-11T17:15:26.141643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.121581Z","title":"Revisiting heterophily for graph neural networks","venue":null,"work_id":"d43fae84-c46f-40d2-b503-ee6201ef656a","year":2022},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.569821Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:f4c9905bc5954722a4f93e3c2073179f5fcd764407c601edab882ed113f41384","observation_id":"943284cf-15e3-4d70-a189-5fd2db3337b6","resolution":{"observed_at":"2026-08-11T17:15:26.126387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.106304Z","title":"A critical look at the evaluation of GNNs under heterophily: Are we re- ally making progress? 2023","venue":null,"work_id":"2c60e012-b06a-491e-9ccc-34bad4a56254","year":2023},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.575414Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:e49f9a421443117883d0760879b86cecaaebcc6ccb1340600f8597966e11bf43","observation_id":"267cc8a6-1f42-48d0-9343-01cfcc61edb0","resolution":{"observed_at":"2026-08-11T17:15:26.111355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.090943Z","title":"Characteriz- ing graph datasets for node classification: Homophily-heterophily dichotomy and beyond","venue":null,"work_id":"13c75db1-7027-480e-9deb-a5681037c61b","year":2023},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.580974Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:ccf570e5186cf30994ade7a34b3967cb5a61e801e080810bee1105d7584f535f","observation_id":"d43fd6da-c879-4a67-b705-f39176f77e70","resolution":{"observed_at":"2026-08-11T17:15:26.096095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.076082Z","title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","venue":null,"work_id":"142cd177-21ff-45ce-bce0-77913f6bc594","year":2019},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.587840Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:6ecd61f69b567524326af61bdbfa8c01713426958e2c835ea784ec988c88053e","observation_id":"41e231cc-dea4-43d5-b718-7d2d6ea56dc9","resolution":{"observed_at":"2026-08-11T17:15:26.080973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.060460Z","title":"Geom-GCN: Geo- metric graph convolutional networks","venue":null,"work_id":"650175fa-67b4-4acb-9b86-32ea11e2acc2","year":null},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.594040Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:556800878565dba789fa2dfebec375c89683e301b7e29380d3ac9273437921f4","observation_id":"9170c2f1-c8fb-432f-a5a7-f524c323c32d","resolution":{"observed_at":"2026-08-11T17:15:26.065390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.044911Z","title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","venue":null,"work_id":"5126f974-5a85-495d-b36a-15a0d012b24d","year":2021},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.599412Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:46e1d4062a0924caee0acfc06ff1012056922bc5a0d22493f0c6307f6d3346b8","observation_id":"d7f9f38e-981a-4a28-9c5f-9e86fc0cdf16","resolution":{"observed_at":"2026-08-11T17:15:26.050065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:26.027245Z","title":null,"venue":null,"work_id":"dd2157e4-f537-4d25-bb93-d5dc73777721","year":2003},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.604781Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:99e9e7eb4f1b04a424c9933ebbb36aefc690dd7e36be3d16c404a95f21a24c6b","observation_id":"228e3a89-444e-44d5-a58d-2bb7b693c83b","resolution":{"observed_at":"2026-08-11T17:15:26.033459Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18854","last_updated":"2024-06-27T02:48:33Z","snapshot_observed_at":"2026-08-12T05:39:58.916941Z","submitted_at":"2024-06-27T02:48:33Z","title":"What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18854","snapshot_observed_at":"2026-08-11T17:15:25.609744Z","title":"What is missing in homophily? Disentangling graph homophily for graph neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.609744Z"},"links":{"cited_paper":"/paper/2406.18854","citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:b67aab49ed707ad81aeb87498864a43421ef9ed36a483240cf3cf80077e9bb2a","observation_id":"3e236507-a41b-4af1-979d-22c5f6f05667","resolution":{"observed_at":"2026-08-11T17:15:25.609744Z","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-11T17:15:26.011322Z","title":"When do graph neural networks help with node classification? In- vestigating the homophily principle on node distinguishability","venue":null,"work_id":"d206c2b7-3be2-4da6-b30c-736738330e07","year":2024},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.614961Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:2b0880bdc9f8819f36d73f2c7c2187b5c18809f0ba39a1c9560348ca25b3fb8e","observation_id":"687af56d-fae1-4404-88d7-6c4add82cc0a","resolution":{"observed_at":"2026-08-11T17:15:26.016537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.993439Z","title":"Graph database repository for graph based pattern recognition and machine learning","venue":null,"work_id":"05a7a974-484d-4f71-aef1-94cd5c3baf9d","year":2008},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.620348Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:46ccb4b79d3bc23162af5b1d2296a8de1c4d3acfa2077931854315313f8879da","observation_id":"ffd30179-5902-4fc2-b935-3709ab68fb17","resolution":{"observed_at":"2026-08-11T17:15:26.000007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.975936Z","title":"Good classification measures and how to find them","venue":null,"work_id":"ab283682-c6e7-4e02-99a3-537db0783917","year":2021},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.625059Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:1cded2345e7ac12a4168f8765697304c271df4c658ff04aad960ca13f0d9a980","observation_id":"10ed2b20-b76d-41c7-b4e3-4ede081f3517","resolution":{"observed_at":"2026-08-11T17:15:25.981611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.959791Z","title":"Higher-order homophily on simplicial complexes","venue":null,"work_id":"3de7f27f-60d4-4642-9085-a65ee2444748","year":2024},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.629723Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:b0d5690b5d970590216311c7a8a191572697a3589b3edaf9a3fba39c731f3be8","observation_id":"60bd8b94-3245-46a1-814a-476a250e8b82","resolution":{"observed_at":"2026-08-11T17:15:25.965469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.943600Z","title":"On the inadequacy of nominal assortativity for assessing homophily in networks","venue":null,"work_id":"bd320c69-f516-4e09-a322-195fea7e15a6","year":2023},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.634439Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:87ed26267f6141a02bec689c250c9be15afeba0970de6cc75e8d203b6ebb1b3b","observation_id":"4e780484-663f-4db3-a062-08b797a6c28d","resolution":{"observed_at":"2026-08-11T17:15:25.949073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.926311Z","title":"Lee Giles, Kurt D","venue":null,"work_id":"d06d7851-ca86-4f34-b15f-e8d54247b335","year":1998},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.639590Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:f0e009764841c0a386995271be9c84f7ce2b1bb97ffc1272e4d64064b1f94990","observation_id":"420498bd-dff3-440e-bffe-b9903b698662","resolution":{"observed_at":"2026-08-11T17:15:25.931865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.910529Z","title":"Automating the construction of internet portals with machine learning","venue":null,"work_id":"3d0cfc65-c379-4f0f-af71-3b3c09db0d46","year":2000},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.644492Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:f54d5aa1c6515a4e080ade924b852861b07e595d3d585cdf3a9a5d5869fb05bd","observation_id":"8ae9e7b6-bfe3-4334-b2d7-be0571198dd3","resolution":{"observed_at":"2026-08-11T17:15:25.915634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.649572Z","title":"Collective classification in network data","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.649572Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:2aa5dd01192d0b672462a1c055996086875bbe88aea1c87db7eef3a518e074a6","observation_id":"ed3eb9e4-82bb-414d-8d98-1d032ec6d35c","resolution":{"observed_at":"2026-08-11T17:15:25.649572Z","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-11T17:15:25.883558Z","title":"Query-driven active surveying for collective classification","venue":null,"work_id":"32f2d263-0d5e-46d2-860a-59195ecb6634","year":2012},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.654337Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:43d9efe7c6a8892b035b02a226456ec930cf56fbbc755538a8874cba40dc036f","observation_id":"03ea3ce7-8390-4352-8f2a-83e77d04f31c","resolution":{"observed_at":"2026-08-11T17:15:25.888612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.867188Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":"bb2c2dfc-04d9-40bb-8989-781682ca1829","year":2016},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.660411Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:0549d55233b053a2bb1b24859f7d53186c73399931be9618cfca7b948372d1ee","observation_id":"340800f5-c8eb-4e39-993b-dc39b75c0661","resolution":{"observed_at":"2026-08-11T17:15:25.872754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.850606Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":"99df0fcc-5fc7-4e1d-916b-41d271169759","year":null},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.666243Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:a93e10e80963c901b2045898750fa85bd37099be6122e03d2a0b9db1b28d8115","observation_id":"24280517-b5c9-409d-a3f1-4550e376389e","resolution":{"observed_at":"2026-08-11T17:15:25.855828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.832256Z","title":"Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models","venue":null,"work_id":"b2f2ad7b-52d4-45ec-890c-b0f9dd2dc0ae","year":2020},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.671514Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:d332f1f6024040e98167f42bb7ea03734777bf4134fb996586586cf645f7831d","observation_id":"8bc710eb-af72-473a-9242-cf1cdede42cb","resolution":{"observed_at":"2026-08-11T17:15:25.838309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.816294Z","title":"Multi-scale attributed node embedding","venue":null,"work_id":"77f2dc5a-6f7d-4315-aad2-011fbab77054","year":2021},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.676242Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:a19ef1693c3d4bbb8b7d10ec3cdd361cc93c5ed85dd2751cde4f82371fbccffe","observation_id":"b6c73b45-75d9-4661-a8b7-c1c819ef85c2","resolution":{"observed_at":"2026-08-11T17:15:25.821220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.799488Z","title":"Social influence analysis in large-scale networks","venue":null,"work_id":"82713612-7e56-4cd3-9364-1ffa4c2d560f","year":2009},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.681171Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:1e219e5f37d4504d1dfedcd955be2bf6a79245cdb244c6b939abda5e39dbaa28","observation_id":"a456f828-2276-4bcc-9b6a-cdf6f9d23aa9","resolution":{"observed_at":"2026-08-11T17:15:25.804889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.781341Z","title":"GraphSAINT: Graph sampling based inductive learning method","venue":null,"work_id":"c52f7013-16ca-4e1e-9365-db3ab323493b","year":2020},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.685838Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:b844bffed35747af822dbb8adbec7fcad5bbda72f126e01390d22d1a7b046af3","observation_id":"dabd8905-43d4-4dae-8560-2a25a16cd51b","resolution":{"observed_at":"2026-08-11T17:15:25.788231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T17:15:25.762504Z","title":"1 4 1 4 1 4 1 4 # , L 2 =","venue":null,"work_id":"198db560-7f3e-4f8a-9fb2-ccfc4f1f338e","year":2021},"citing_paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T17:15:25.690922Z"},"links":{"citing_paper":"/paper/2412.09663"},"observation_digest":"sha256:bff2d878bd271edb51a0a9c8081d929b3bea4c4f096f37d67d524609c7edfcc2","observation_id":"8243c506-5015-4a01-bece-ad59ca0551e4","resolution":{"observed_at":"2026-08-11T17:15:25.768945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.09663","last_updated":"2024-12-12T14:54:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T05:40:20.808250Z","submitted_at":"2024-12-12T14:54:56Z","title":"Revisiting Graph Homophily Measures"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":27},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2412.09663."}