{"as_of":"2026-08-10T02:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d3beeeef3733bce0418eb9b7c6055bfe743beaffd3ee4fae2ecbb4517914b58","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-09T06:31:02.800959+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-08T07:18:21.382631Z","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:ea56606cdb6edf0232417629e052682878a320363fdb89b6945044e84c831e33","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-08T07:18:21.382631Z","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:285f90b85e2bae1c250856a65accb60bb05373499509dea75cba6f9b98ef8abd","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-08T07:18:21.382631Z","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:358d69f4f93c9a2cd867fad5d81640be191d601e876abc4eb19d77051d49922d","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-08T07:18:21.382631Z","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:6e7be48993c5d1c18d7ded57ec93d86c6201accd103637c9c997ace91bba6a46","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-08T07:18:21.382631Z","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:e48c10c9008aea086e64268fc3c8471f4b04da9c5da9d632a11c7208ffcde953","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-08T07:18:21.382631Z","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:ee111ceee32597ac7efe1875bb977ea4fbee879cae50f38c4ec2841f64617784","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-08T07:18:21.382631Z","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:a812db21ae34acdfe2f1695844114840d948829aed6c037fad653dcbb63c1ec1","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-08T07:18:21.382631Z","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:a962246ad5608ac469ef96d034bad48cfca9b3cc11851088d95b5670fb6e58b0","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-08-07T10:46:08.274157Z","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-08T07:18:21.382631Z","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:17e0f3da720a255502c76e4ff6313a8494db93f8406cfc2084d1eab2e0876901","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-08T07:18:21.382631Z","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:80db4c0631f0ee6d5334c5eff6d953970e8949538d3821655c261c998c25036c","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-08T07:18:21.382631Z","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:6aff781249328871f6883ff73ecc78a1feda1c0234340c34ce1443b6fe6bad19","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-09T07:13:23.894027Z","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-08T07:18:21.382631Z","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:64501cc852167a06cd02dafceb5dc37d75487b1e722e0f6791a1aab846c7d28f","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-08T07:18:21.382631Z","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:e48b89c7edf98e6b445cd2ae3027364cac50eb06d36920316049c5accda2f8c4","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-08T07:18:21.382631Z","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:f1461755bbd16a366b3cbcc6825b30a96591897766cfa39a6e3807fa0d3ce870","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-08T07:18:21.382631Z","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:53fb3dfea144b1c64628fe4b8719f9767372b22bc01efbb1e7b8fb5f81701b7e","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-08T07:18:21.382631Z","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:027cae314497f5507ca8a486c6a43eff2931b04c05d340aeceeb1bb40c5d54fc","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-08T07:18:21.382631Z","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:139a4c8c76cb331d9b4310815ed19b4e26a0f20f4ea9b4fd4d0fe3a1cdf05bf0","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-07T10:11:23.671536Z","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-08T07:18:21.382631Z","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:f1ee2ae75cd9c6c6df7c8cabd98e8076a862ab91ce817283e4085ac8e2b9a286","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-08T07:18:21.382631Z","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:33db8a0ecbc63a09a6df8d3e84f83103ce3962535d8875addfbffbf5c34e1981","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-08T07:18:21.382631Z","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:82be07a9d10d05431ae9831e2674508bd5318a7eaf1164fe4c19268e6a8b6702","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-08T07:18:21.382631Z","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:40281e118d311ea593460ca6f66776b186a14958a41efb1c64a7d3144c698696","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-08T07:18:21.382631Z","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:3977dddaae6cf10f47fdade3ac8b016f15ac99e775990af43712aa31d497bf2b","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-08T07:18:21.382631Z","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:a3e52dd6aadf21efb3421a37cfc5e5b18c25280fbdc13f96ba026c2f9a1099da","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-08T07:18:21.382631Z","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:b72ff42d4825619c73f1c88ffe2b74bd1404f411de00e17357784a5151313502","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-08T07:18:21.382631Z","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:e24a5e6f48baf2e6315195fae7db8431e18b88f8efa2ba77f4acd5d7453d471e","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-08T07:18:21.382631Z","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:fb5ca7c40b4406ef6059629a64302daf27d28d187dca42c1162930d8817b0e89","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-08-09T23:03:24.890432Z","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-08T07:18:21.382631Z","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:cb62b597e0d01121e8b470fdb1fccb21f6b8861b0ea664e1e2c81701c6ed48e7","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-08T07:18:21.382631Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2510.23469."}