{"as_of":"2026-08-07T05:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:667c7f33d0be31755389b9b78f8a74a554d434f715b9cc567b31e3808820bc07","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-04T07:55:01.971066Z","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-06T06:34:29.942622+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/2510.23469/citation-record","integrity":"/paper/2510.23469/integrity","json":"/paper/2510.23469/citation-record.json","paper":"/paper/2510.23469"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:55:01.358290Z","title":"This fine-grained gating mechanism is significantly more expressive than simple additive prompts or global transformations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.358290Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:c33656de0074bd7d4106d546de35b264a69890a7df2de9fb8b4c754ee64523f7","observation_id":"f7a93049-f24c-4643-a7a2-a089c38e128f","resolution":{"observed_at":"2026-08-04T07:55:01.358290Z","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-04T07:55:01.364741Z","title":"The Adaptive Message Calibration (AMC) module directly intervenes in this process by injecting a layer-wise, edge-specific structure prompt e(l−1) ij into each message","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.364741Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:4a7be946dfb50409b532eabcff6faccf238449d819e8c0447679ff52140293fd","observation_id":"b9198793-cf84-419b-a0f1-54cff50e088f","resolution":{"observed_at":"2026-08-04T07:55:01.364741Z","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-04T07:54:59.088110Z","title":"Learning discrete structures for graph neural networks","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.088110Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:689d103bdfc84566d548bff63b6c2dceb40fcb97bde9b5edf67da75f337c50d3","observation_id":"fb24d40d-795e-46d1-8552-683fff6b1395","resolution":{"observed_at":"2026-08-04T07:54:59.088110Z","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-04T07:55:01.640152Z","title":"AMC serves as a layer-wise regularizer by generating edge-specific calibration vectors according to equation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.640152Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:e7b468c86fa62df2b891caa786d1391582f8156b191ae07a0cfea6a4c0d9e94c","observation_id":"7e0250bc-4e41-4f43-b8bc-ceabe0021787","resolution":{"observed_at":"2026-08-04T07:55:01.640152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-06T06:17:37.090691Z","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-04T07:54:59.429211Z","title":"Variational graph auto-encoders.arXiv preprint arXiv:1611.07308,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.429211Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:4e1ed9511fa74fcb0dd6c5b1152cbdb14af991054790f73d85972ff05b107411","observation_id":"03a8230a-e258-411d-859a-b2211a8489de","resolution":{"observed_at":"2026-08-04T07:54:59.429211Z","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-04T07:55:01.744741Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.744741Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:b8f4718af9ae4fa4be6a67dd99056c494704fba4859aafe32d582fd6b0e6eeab","observation_id":"177dcd4b-c880-4560-950d-75850fa78b65","resolution":{"observed_at":"2026-08-04T07:55:01.744741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.00387","last_updated":"2015-11-03T18:15:15Z","snapshot_observed_at":"2026-07-06T04:16:46.012738Z","submitted_at":"2015-05-03T01:56:57Z","title":"Highway Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.00387","snapshot_observed_at":"2026-08-04T07:55:00.288566Z","title":"Highway networks.arXiv preprint arXiv:1505.00387,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:00.288566Z"},"links":{"cited_paper":"/paper/1505.00387","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:a3822492edf4d94022439c7a399d0409ff0757111a233e0cc72c6a4c407be69c","observation_id":"c4a55172-468f-4a4d-8092-b32a75a565b9","resolution":{"observed_at":"2026-08-04T07:55:00.288566Z","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-04T07:55:00.638126Z","title":"Bootstrapped representation learning on graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:00.638126Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:de9996eddca28b9997d3032797702a6daa6e003d76f3e45917ca229ccbc5d56d","observation_id":"ce9aaa85-6780-47ef-b72c-e56ad96f36bd","resolution":{"observed_at":"2026-08-04T07:55:00.638126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"physics/0004057","last_updated":"2000-04-24T15:22:30Z","snapshot_observed_at":"2026-07-07T06:44:19.645435Z","submitted_at":"2000-04-24T15:22:30Z","title":"The information bottleneck method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0004057","snapshot_observed_at":"2026-08-04T07:55:00.792862Z","title":"The information bottleneck method.arXiv preprint physics/0004057,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:00.792862Z"},"links":{"cited_paper":"/paper/physics/0004057","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:d96eb255746b010ef6591c01205c409001bd9989092a2cfa4b9946d147a6f92b","observation_id":"c7cd3728-7fc0-4725-9505-0478a64a7e56","resolution":{"observed_at":"2026-08-04T07:55:00.792862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14683","last_updated":"2025-08-20T12:59:05Z","snapshot_observed_at":"2026-08-05T18:23:39.727386Z","submitted_at":"2025-08-20T12:59:05Z","title":"Improving Fairness in Graph Neural Networks via Counterfactual Debiasing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.14683","snapshot_observed_at":"2026-08-04T07:55:01.106487Z","title":"Improving fairness in graph neural networks via counterfactual debiasing.arXiv preprint arXiv:2508.14683,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.106487Z"},"links":{"cited_paper":"/paper/2508.14683","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:feabe5f62850bac117bc1c72f7aa6cb6655dd7b0ebc12b80d89afc3c4eae1dd4","observation_id":"e1477338-4ce6-4356-bb85-2f8019800dec","resolution":{"observed_at":"2026-08-04T07:55:01.106487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-04T07:55:01.172023Z","title":"How powerful are graph neural networks?arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.172023Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:0d6018fe55a34082f0697fc0d2a3d8af4da877e2c8100f1030699221b6252798","observation_id":"c450907f-ac58-4729-a405-fe2e76c9d10a","resolution":{"observed_at":"2026-08-04T07:55:01.172023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-05T13:22:44.473317Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-04T07:55:01.225653Z","title":"Deep graph contrastive representation learning.arXiv preprint arXiv:2006.04131,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.225653Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:065909294ee8183ad3c7c499bbbcb06c4f1276f3c88a240cf725a253b942d504","observation_id":"d8a73c8f-2169-49cc-acde-66c0e45162e4","resolution":{"observed_at":"2026-08-04T07:55:01.225653Z","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-04T07:55:01.297657Z","title":"We demonstrate that ADPrompt can effectively adapt a fixed pre-trained GNNθ∗ to diverse downstream tasks through the learned adaptive dual prompts","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.297657Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:700703880779b37768cbc645e126d7f93184ed6577e90fb43542f027ac8cfbae","observation_id":"4d445a9b-f64c-4cb0-8672-2443cdcff104","resolution":{"observed_at":"2026-08-04T07:55:01.297657Z","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-04T07:55:01.453953Z","title":"Raw node attributesXoften contain sen- sitive information correlated withS, forming the initial source of bias","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.453953Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:f3d7d719cfd7369be2ea7e50979dbda46ffd8ea05f8792be40c522a486700a38","observation_id":"832f9942-a542-491e-a6b1-d43967d498a9","resolution":{"observed_at":"2026-08-04T07:55:01.453953Z","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-04T07:55:01.552113Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.552113Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:d408b9e4eb7aecad19cdf69e73c42554e1792520dc421f53b6c46ee15211ab6b","observation_id":"ac55b707-fb20-42c4-97e6-e3cc83722b89","resolution":{"observed_at":"2026-08-04T07:55:01.552113Z","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-04T07:55:01.833532Z","title":"working field","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.833532Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:04f88d8fe493a4011580839b5348795b30a8bb425c0c527deea743309745ab98","observation_id":"9e9c6f38-1f88-4361-8855-74027eaf3787","resolution":{"observed_at":"2026-08-04T07:55:01.833532Z","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-04T07:55:01.971066Z","title":"It incorporates a fixed prompt to represent sensitive group em- beddings and a learnable prompt to bridge the gap between pre-training and downstream tasks","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.971066Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:e54f4b15d9511b46bd715ed97180eb02277b4bfa6a7593d21e0e2e4082df2a68","observation_id":"2cffe417-0ce9-4027-9cf8-7464c3471e80","resolution":{"observed_at":"2026-08-04T07:55:01.971066Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10637","last_updated":"2020-10-09T11:39:32Z","snapshot_observed_at":"2026-08-02T05:44:45.513979Z","submitted_at":"2020-06-18T16:06:18Z","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10637","snapshot_observed_at":"2026-08-04T07:55:00.157299Z","title":"Temporal graph networks for deep learning on dynamic graphs.arXiv preprint arXiv:2006.10637,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:00.157299Z"},"links":{"cited_paper":"/paper/2006.10637","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:4fcc587e6b9b3182117af52aff7caf53b14499ce29b7dee09f2c67f37a324ebd","observation_id":"617be5d3-3265-4e7a-95d0-91cd21052773","resolution":{"observed_at":"2026-08-04T07:55:00.157299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10341","last_updated":"2018-12-21T15:44:59Z","snapshot_observed_at":"2026-07-06T07:04:37.077852Z","submitted_at":"2018-09-27T04:53:24Z","title":"Deep Graph Infomax","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10341","snapshot_observed_at":"2026-08-04T07:55:00.965539Z","title":"Graph attention networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:00.965539Z"},"links":{"cited_paper":"/paper/1809.10341","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:4689dd63d75061ab33aa1b0f81cec8683bc2793629855dd113ed05232790edf8","observation_id":"53d27dc8-828a-4082-bb7c-f52eb03c2801","resolution":{"observed_at":"2026-08-04T07:55:00.965539Z","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-04T07:54:58.935016Z","title":"Yutai Duan, Jie Liu, Shaowei Chen, Liyi Chen, and Jianhua Wu","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:58.935016Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:5c4630e8617ff66f51ab23e707c6ed6b7a88f22fdf9893bdc9de34b3b92e04f9","observation_id":"8355b832-a498-4ca9-9c3e-e1b83cf38ab0","resolution":{"observed_at":"2026-08-04T07:54:58.935016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10947","last_updated":"2021-01-06T13:32:14Z","snapshot_observed_at":"2026-07-06T07:55:41.176211Z","submitted_at":"2019-05-27T02:59:06Z","title":"Graph Neural Networks Exponentially Lose Expressive Power for Node Classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10947","snapshot_observed_at":"2026-08-04T07:54:59.999444Z","title":"Graph neural networks exponentially lose expressive power for node classification.arXiv preprint arXiv:1905.10947,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.999444Z"},"links":{"cited_paper":"/paper/1905.10947","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:5d7e40f9904d9bb226f8dd38d043a2a152521224c7e9383f0ee50e14c832997a","observation_id":"f0422122-4f74-4997-bcd0-c8a7158878da","resolution":{"observed_at":"2026-08-04T07:54:59.999444Z","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-04T07:54:59.266166Z","title":"Auc-oriented graph neural network for fraud detection","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.266166Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:7bc3d3df238b8bafa375d48a15c872bc2e0c8a805a06766f1514ab6010b945bb","observation_id":"1f809315-5305-4924-adb7-14b6de990dd1","resolution":{"observed_at":"2026-08-04T07:54:59.266166Z","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-04T07:54:59.675313Z","title":"Fairness-aware prompt tuning for graph neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.675313Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:f715ee384a1d19908125b68a2d3d720928877e8c53ef466367ee352351f31508","observation_id":"04c6b3ee-1f90-412e-8d11-30ce9783a156","resolution":{"observed_at":"2026-08-04T07:54:59.675313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16534","last_updated":"2023-11-28T05:36:59Z","snapshot_observed_at":"2026-07-06T16:53:35.776613Z","submitted_at":"2023-11-28T05:36:59Z","title":"Graph Prompt Learning: A Comprehensive Survey and Beyond","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16534","snapshot_observed_at":"2026-08-04T07:55:00.479053Z","title":"All in one: Multi-task prompting for graph neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:00.479053Z"},"links":{"cited_paper":"/paper/2311.16534","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:79becad760564755ebf95854573ad0339962df66f305b4e37c88ee7d7b935aa2","observation_id":"d3b00fe2-c482-4d0f-aafc-994d2a015f66","resolution":{"observed_at":"2026-08-04T07:55:00.479053Z","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-04T07:54:58.772445Z","title":"Edits: Modeling and mitigating data bias for graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:58.772445Z"},"links":{"citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:46085f3f20f91f3dc72d89e9c673ffad28840f5d3128f13ffb77fe3185eef2f7","observation_id":"29ed07e8-0f78-48da-9e81-2aa7d2d420fb","resolution":{"observed_at":"2026-08-04T07:54:58.772445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00190","last_updated":"2021-01-01T08:00:36Z","snapshot_observed_at":"2026-07-06T10:29:18.734092Z","submitted_at":"2021-01-01T08:00:36Z","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00190","snapshot_observed_at":"2026-08-04T07:54:59.553942Z","title":"Prefix-tuning: Optimizing continuous prompts for generation.arXiv preprint arXiv:2101.00190,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.553942Z"},"links":{"cited_paper":"/paper/2101.00190","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:21c6c3fef94681eb4a737ca536efaf48d2fbbc202c4e8f8b88fdbf9eac641603","observation_id":"642e6daa-82cb-4816-84cc-771fb1a20cf0","resolution":{"observed_at":"2026-08-04T07:54:59.553942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08098","last_updated":"2023-02-21T11:56:03Z","snapshot_observed_at":"2026-07-06T15:03:16.833701Z","submitted_at":"2023-02-21T11:56:03Z","title":"Single Event Effects Assessment of UltraScale+ MPSoC Systems under Atmospheric Radiation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08098","snapshot_observed_at":"2026-08-04T07:54:59.762293Z","title":"Graphprompt: Unifying pre-training and downstream tasks for graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:59.762293Z"},"links":{"cited_paper":"/paper/2303.08098","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:d4b4552c3b493db43a53decc15465a9b127ae861eea2d2d34e1640dc0023fe4f","observation_id":"927819af-ea76-43bf-8489-fdccda292691","resolution":{"observed_at":"2026-08-04T07:54:59.762293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2510.23469."}