{"as_of":"2026-08-17T03:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5295028a53cae5062d6a74dbb30988cae6879015dc6e0aeefeb65f2d1504793a","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:38:28.450362Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.09947/citation-record","integrity":"/paper/2412.09947/integrity","json":"/paper/2412.09947/citation-record.json","paper":"/paper/2412.09947"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:38:31.514669Z","title":"Mhednbi, and S","venue":null,"work_id":"958c3984-9a62-45ca-90f6-8f1a992824c7","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.236445Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:a6fbfe57bea31243cb57d0d300c6c92d45d2f8fca4d8044a4e136c7d265fde88","observation_id":"4c3c45bf-947b-4ca8-8d4c-ed0cafc2a904","resolution":{"observed_at":"2026-08-11T16:38:31.519503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.497613Z","title":null,"venue":null,"work_id":"5fd8b5c7-752b-4c18-bd27-5b5426fe81b8","year":2020},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.324686Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:2bca9a0056981679a36adf235290c5b3a42033cf91002a6038e14ee3e7240c31","observation_id":"00cfca28-b6ab-407b-953e-506f39ddfc44","resolution":{"observed_at":"2026-08-11T16:38:31.503518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.480548Z","title":null,"venue":null,"work_id":"351a125b-9e1c-43e9-a056-6e1181968f42","year":2021},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.329456Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:040f46f63a111f1f7106ab1b70973673852a70a3130b523909294ae653316a90","observation_id":"6ae96f17-78c3-40da-bb7e-e90afd27f68b","resolution":{"observed_at":"2026-08-11T16:38:31.485742Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.464835Z","title":null,"venue":null,"work_id":"fa810c56-993b-4ee8-8af2-03ea68d1c875","year":2021},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.333976Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:9a25cfd80cb19812fdb2119e591494bc07422d88b504c7d880a8faf505f78b9c","observation_id":"9e9e9842-4730-4f64-b0c5-157d72623fef","resolution":{"observed_at":"2026-08-11T16:38:31.469537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.407640Z","title":null,"venue":null,"work_id":"7d77bdb9-dd47-4241-a038-fb7b53269c00","year":2023},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.339797Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:f8f80fa03ee9d015a3dc2c0395c32def6e9d89eb00774707d5ec363d9432baa3","observation_id":"a8c156e0-5355-4e1f-9441-228ac81ea19d","resolution":{"observed_at":"2026-08-11T16:38:31.453312Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.226590Z","title":null,"venue":null,"work_id":"0fb88542-61ce-455e-947d-bf02ccf90d39","year":2024},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.345470Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:2034054aa9c3b3fe837db853f845ce83608c6d9fb8a55f6e3abd2cc53862e7ec","observation_id":"04f96d7f-bcf1-404f-8846-db79a16a4227","resolution":{"observed_at":"2026-08-11T16:38:31.324561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.160800Z","title":null,"venue":null,"work_id":"b45cb1ac-dd57-40bc-8cfb-cc507557bdb5","year":2024},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.352543Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:5b3a2aafad2a3263da3076c02da518370645f0c366fe711f10672e6789d4405a","observation_id":"b0f87483-0b37-4634-bd92-c7d7f763663e","resolution":{"observed_at":"2026-08-11T16:38:31.165900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.145635Z","title":null,"venue":null,"work_id":"7cd48fb6-8c1f-487a-9f5d-535fc4182771","year":2020},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.358850Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:68a4891397b70afb5bc53b2e095c6fb65cc2e41eb4bf2e07e59da2c4ea0ceca1","observation_id":"05b6428e-136a-479a-a5b2-bd819a9bd56e","resolution":{"observed_at":"2026-08-11T16:38:31.150691Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.130643Z","title":"Wang, S.Di, L","venue":null,"work_id":"6a00ff77-b97e-4206-8439-99f0229e47be","year":2024},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.363578Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:0d471cadad183768449fb098a9df18c9c8697adba417db013ad9db15007b7258","observation_id":"9a39206c-adc1-445a-91ec-c01e4610bfd4","resolution":{"observed_at":"2026-08-11T16:38:31.135241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.115061Z","title":"Tsitsulin, J","venue":null,"work_id":"c9ff3651-8a85-4b7d-939a-e18f7d23922c","year":2023},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.369110Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:8149459fd345c60ddac7dc3304396ca20d91580bcb60aca6a0cb3355626f67d4","observation_id":"01d02df1-bb3a-42a8-9b14-29f9f8990f7e","resolution":{"observed_at":"2026-08-11T16:38:31.120039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:31.098967Z","title":null,"venue":null,"work_id":"2456f05f-66cc-47ec-8b67-9c934bcb5b69","year":2021},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.459827Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:a5605eae755424887bf05690af2d7a6fff1413d6e1681c4f7354da5b7cc5df53","observation_id":"05d6aac5-8eb7-4470-b283-ca3cf726f918","resolution":{"observed_at":"2026-08-11T16:38:31.104256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.939179Z","title":"Agarwal, H","venue":null,"work_id":"e0c352bc-a13e-4ba6-bdc5-06d68fed637f","year":2021},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.540153Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:53bd758066f67bba2972f5cbf7265a424fb669d0afeb64d15448ba882be20f42","observation_id":"4f91d276-a0a8-46d8-b108-e26a8feb0834","resolution":{"observed_at":"2026-08-11T16:38:31.050218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.856291Z","title":"Dai and S","venue":null,"work_id":"865c597f-fdee-4848-bfa3-84a14c8ed99f","year":2023},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.653951Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:c580a486825a5072f43a8ff8e2b9b5971fa63d64331f0d7256d74829f72ffb51","observation_id":"3ce2f70e-6304-49cf-aa7c-d3ede1820088","resolution":{"observed_at":"2026-08-11T16:38:30.861638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.841663Z","title":null,"venue":null,"work_id":"6cfcf82a-abbf-40e8-8bc1-c4916b13b6b6","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.690173Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:42a51f0fc78bacfb3b7f77e3d2413d451beddefd4af838632a8397fc10f99de2","observation_id":"e80c4846-34a8-4c83-ad57-cdd0924d4c9e","resolution":{"observed_at":"2026-08-11T16:38:30.846473Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.826326Z","title":null,"venue":null,"work_id":"fdddbf52-23f4-4115-9cd7-8fbda8744377","year":2024},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.695333Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:13017afc04a04326b6d59b130cd43ccd3fe59591d61daced3e6f98d704fce681","observation_id":"9b598a13-7822-456f-91e7-00f627590d53","resolution":{"observed_at":"2026-08-11T16:38:30.831982Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.615341Z","title":null,"venue":null,"work_id":"6b848b7e-8bce-4668-a8fd-c329c41fd613","year":2023},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.699684Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:128a141b1327c5ec482369e45d6ac6f5e750975adaeac242de5e8844f5a216d2","observation_id":"0cac943a-1dc3-4143-a8da-bea5d22c9e2b","resolution":{"observed_at":"2026-08-11T16:38:30.721019Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.587653Z","title":null,"venue":null,"work_id":"ecaa3e5d-d4b7-4319-ab3c-4a4b190a6c45","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.704144Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:ab84a9e18a08524bcc080975c3a145111858cd11074883e02531853455aac491","observation_id":"33c0e3d9-caef-44c3-b6b4-279690053ffe","resolution":{"observed_at":"2026-08-11T16:38:30.595366Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.543553Z","title":"Cheng, X","venue":null,"work_id":"daff45d0-d891-444e-9798-fd0fb30fae9f","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.708643Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:d5ca2bbe1924d6c64ce77a975aab593f0fc1258d614b43e982c5cd1a48044c20","observation_id":"831fbf69-c026-40e7-b595-46b523418c2b","resolution":{"observed_at":"2026-08-11T16:38:30.575908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.03681","last_updated":"2022-02-16T17:11:22Z","snapshot_observed_at":"2026-08-16T17:29:10.764207Z","submitted_at":"2022-01-10T22:44:30Z","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.03681","snapshot_observed_at":"2026-08-11T16:38:27.715632Z","title":"Loveland, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.715632Z"},"links":{"cited_paper":"/paper/2201.03681","citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:cf5a0dfa862b02d055f7bcd27021b06c5e120516e56476a5cd278253797e4378","observation_id":"d243dfa4-e4a9-41a4-b5c0-e6157fef8183","resolution":{"observed_at":"2026-08-11T16:38:27.715632Z","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-11T16:38:30.370716Z","title":null,"venue":null,"work_id":"eba479bb-e8a8-40f2-a617-7eb5e4a326ae","year":null},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.720992Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:16605a2bfcabd3935723d2d51ccbc9443b5d5dd212dd15a911534fe503909828","observation_id":"9239f3dc-2622-47ef-baad-d4a398b8ffe3","resolution":{"observed_at":"2026-08-11T16:38:30.418089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.354164Z","title":null,"venue":null,"work_id":"3b67e30d-d22e-4246-b880-11104ec2825c","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.725833Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:2eb508ad36375f58a3f47366834deaff25fd765abe275bb85e0c7209f54a5a9e","observation_id":"437fe8ae-c158-4c52-be3b-f9ac16d617bf","resolution":{"observed_at":"2026-08-11T16:38:30.359994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.267693Z","title":"Coston, K","venue":null,"work_id":"27c14c34-ec83-4f1e-8987-1ff1cb10d84d","year":2019},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.796505Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:7087c99b52fcff9493f65ac12abeddb92c727735bd3e5330b8a28bfa9379bb7e","observation_id":"1681b33c-84f8-488f-8fc9-14f109ac1f23","resolution":{"observed_at":"2026-08-11T16:38:30.341981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.120906Z","title":"Lahoti, A","venue":null,"work_id":"815a0218-306a-4c3f-b953-a2723e1a54da","year":2020},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.878335Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:17b694e2be4a294e820c8d845ddf5cc7fa611220c7de03949d7e2302d5e09b8f","observation_id":"21a84e33-dc77-43ca-b3b7-05430b9f794f","resolution":{"observed_at":"2026-08-11T16:38:30.184127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.089477Z","title":null,"venue":null,"work_id":"dece6ea7-1b48-4978-aa18-e170700947db","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.907731Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:1e2929f27fb6e33827c4e4f1668cf28cda8754d35430c26e54823841f220faae","observation_id":"e052eaa5-04e4-4de1-a46c-3cb40b5fe218","resolution":{"observed_at":"2026-08-11T16:38:30.099048Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:30.070636Z","title":"V oigt and A","venue":null,"work_id":"dcbdb126-3fdd-4bed-9e0e-10b41dc8e3d4","year":2017},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.920230Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:9f27cb9477395fdd377efd589bb950454a44c2d8e52491fad1daece67ebeac05","observation_id":"3ed7d8d9-a987-4e37-884d-9f8046730e92","resolution":{"observed_at":"2026-08-11T16:38:30.076150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.975180Z","title":null,"venue":null,"work_id":"4769a3b3-f4b6-42ca-a8d5-c150e7f9855c","year":2023},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.933347Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:b838fa38be01f262acfece265b412bbcbb9e09c0daaad2efc54656d18b5e3338","observation_id":"743f7ca0-eefc-443b-b875-dc2357f49271","resolution":{"observed_at":"2026-08-11T16:38:30.036887Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.868936Z","title":"Chai and X","venue":null,"work_id":"abae3fed-62b7-44e8-8253-b8743dc83c84","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.938170Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:4edea00509edfc3ee9529a15fa015c0135e1f9bd0cd87e5bb203fc7a61fe5204","observation_id":"c20fa9a7-b924-4817-9d4a-bdcb8f10b8b9","resolution":{"observed_at":"2026-08-11T16:38:29.874411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:27.943352Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.943352Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:e1be9b6936bfe0f337e7469920e17761cd89dfc04de971f0b573d14ba265fca6","observation_id":"edb8e676-ba5a-47da-bf9a-6478370d9d80","resolution":{"observed_at":"2026-08-11T16:38:27.943352Z","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-11T16:38:27.969855Z","title":"Dwork, M","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.969855Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:1c3f5966b6b002818c1fcc3767b229f217a40a2a135978f91bf46fb22ce60f9d","observation_id":"e1e5b5b6-01cf-4b58-ab16-7d5019455f66","resolution":{"observed_at":"2026-08-11T16:38:27.969855Z","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-11T16:38:29.852317Z","title":"Hardt, E","venue":null,"work_id":"ba8c7ace-26bb-4f00-a549-9710ca8dc18d","year":2016},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.046787Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:857b291d56ee8ccbf37e5a2439e0d3401443ebf283cf5cbaad424f6da014273b","observation_id":"95cf8406-6a9e-446e-9925-88d7f350012a","resolution":{"observed_at":"2026-08-11T16:38:29.858151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.833334Z","title":null,"venue":null,"work_id":"65307e33-afbe-4e7a-a4d1-12843fc0a1cf","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.131002Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:40b43b56a921575c708720b3cdd2fd695b380ce973694e208806a6e3b1eabfcb","observation_id":"7d5f9d2c-deb8-44e8-8537-2e6e4549c9da","resolution":{"observed_at":"2026-08-11T16:38:29.841483Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.723747Z","title":null,"venue":null,"work_id":"e15913f8-0f7e-4164-a2cf-60c8dab2c0d4","year":2019},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.150135Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:296977676763619bc0f9d1e10625aaee20b6da66f5b5e858276c8e95126a4100","observation_id":"12d738c7-b380-4edc-a181-4f15bf9e54ca","resolution":{"observed_at":"2026-08-11T16:38:29.806769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.625335Z","title":null,"venue":null,"work_id":"74590f5e-50be-4c23-bcac-07a654a445e6","year":2015},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.159706Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:6be1faad7140382ef54bf3b0565b6ba92c82731de59a3d3b8e9da8d3172ca35f","observation_id":"432f79cd-1f5d-4703-b49d-8670d329b5b9","resolution":{"observed_at":"2026-08-11T16:38:29.631089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.608308Z","title":"Yeh and C.-H","venue":null,"work_id":"eea8bf34-baaa-40ce-a897-46584d76db9e","year":2009},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.165773Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:1504aed0b32853b153cd0f5d48ba1e4f5d9e116b6b7177e3b0311857b76571c8","observation_id":"5b83bdec-aff4-4e59-ab97-4f25284e2a66","resolution":{"observed_at":"2026-08-11T16:38:29.614358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.453373Z","title":"Takac and M","venue":null,"work_id":"c53deb0a-62cb-43f3-bd34-60d9811b1686","year":2012},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.170425Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:1f8a229b7508110d44e74f907b0076a6bbcd6a85ac9d31f0a64f0e6c66d4df42","observation_id":"82272cf9-6a80-416c-865c-c92c50b8d50e","resolution":{"observed_at":"2026-08-11T16:38:29.580523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06017","last_updated":"2024-06-18T03:55:04Z","snapshot_observed_at":"2026-08-17T01:43:52.239780Z","submitted_at":"2024-03-09T21:33:26Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","version":2},"cited_work":{"arxiv_id":"2403.06017","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.06017","snapshot_observed_at":"2026-08-11T16:38:28.560832Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","venue":"cs.LG","work_id":"e5abdd1e-96a9-4bff-9e04-4a59c5556f1b","year":2024},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.176642Z"},"links":{"cited_paper":"/paper/2403.06017","citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:97d6e27dfc42452285d7bedad297381eb1c565979ff39f3d7ac316226eab98ba","observation_id":"99030d10-8294-4b1e-81d5-d534b74da175","resolution":{"observed_at":"2026-08-11T16:38:28.611678Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.372059Z","title":null,"venue":null,"work_id":"46de20a2-f9b9-4215-9ff7-81067406dbee","year":2013},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.257029Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:0f46c214636fc0b993eaf72b6f788aa0a003e7eaf3184f673a5d793c6926de52","observation_id":"811a54ef-d0d2-4b37-aff9-d5c0f8dbd025","resolution":{"observed_at":"2026-08-11T16:38:29.376929Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.356666Z","title":"Yan, H.-T","venue":null,"work_id":"6a428df7-dc50-4bff-b718-1ae0aaf2438b","year":2020},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.307639Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:c996c083498ea5549b5dd0bc55956ddd9643afc73bf47c19056cbfceeabace53","observation_id":"5a42443d-ffaf-4471-ab99-8a0ca3b32198","resolution":{"observed_at":"2026-08-11T16:38:29.361637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.265627Z","title":"Van, and G","venue":null,"work_id":"10d54d49-e63e-4593-9c40-0663ec599888","year":null},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.317543Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:8bb0f7609907b4a53d4c5ffaf0adfa58d774a95ec2953f65cad129d02450453d","observation_id":"031067c2-32e8-45d2-bc19-706346650294","resolution":{"observed_at":"2026-08-11T16:38:29.345931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.176976Z","title":null,"venue":null,"work_id":"1b3c1fc4-44b6-4731-84e1-dd9b6a1daf2c","year":2021},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.323754Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:90982bfd6f0e72f4adc6cec8a7d8f035a8d43f65f7ce1ea27bfb51dcf0434d17","observation_id":"817be04a-2cf4-4182-906c-9fe552417192","resolution":{"observed_at":"2026-08-11T16:38:29.183046Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.159657Z","title":"Bruna, W","venue":null,"work_id":"f4cc4e4f-1ba9-4b0c-8136-a0a21050d6ad","year":2014},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.328940Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:f7600656e1fc5cbf76a02d865e74b3cde299799c4c3b432b7e45506f6b2a4caa","observation_id":"85c74dc7-0603-4079-873b-d0a7070bd644","resolution":{"observed_at":"2026-08-11T16:38:29.164190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.038115Z","title":"Velickovic, G","venue":null,"work_id":"0b1125fd-6293-40db-96aa-4414245b5ad1","year":2018},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.333509Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:2f4c4c87486f702f293e7554efeab8e2057a0deea671b5d413274de1e2c50d0b","observation_id":"268be2f0-064f-4c74-b5cb-83754c7cfbea","resolution":{"observed_at":"2026-08-11T16:38:29.092883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:29.023461Z","title":null,"venue":null,"work_id":"69343136-078a-4011-9505-70435014ebf8","year":2017},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.338115Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:41589afe3259bc3db9903ab3eb9f080ffe9e34b9c93599db2fe8cfa0d0ed803a","observation_id":"371a3ae7-25a2-4f7f-b57a-8fc80848a79f","resolution":{"observed_at":"2026-08-11T16:38:29.028236Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:28.995117Z","title":null,"venue":null,"work_id":"0ae02591-540b-4bf5-8024-6fe4a7a7f8e4","year":2021},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.342934Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:9a0f5585c2426aadc8dd76dcba38eb0f621a35d4bc20ae7686fcbb3b8c26529b","observation_id":"d6de8fc9-4a20-4423-97ce-fbb1f3517b68","resolution":{"observed_at":"2026-08-11T16:38:29.013089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:38:28.869385Z","title":null,"venue":null,"work_id":"88390c5f-6530-410f-aee6-9afcc42bff4e","year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.377479Z"},"links":{"citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:50a01897723288d7c23c919f836d97432994d496d80efcf5b8054716e4a367cf","observation_id":"1ca415c4-0c89-4fe1-b798-dbca11d46f0c","resolution":{"observed_at":"2026-08-11T16:38:28.911318Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-11T16:38:28.450362Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.450362Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:de45b81f9f183bda4c36a6f599757d4e88330b8aa0e4865ab94cdae9f3ae7ef6","observation_id":"0db3a322-2877-44ea-9ea2-d97cb3b4838c","resolution":{"observed_at":"2026-08-11T16:38:28.450362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":46},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2412.09947."}