Metraipolis › archive › dc_7eeb0c25a094

Polarity-Asymmetric Structural Calibration for Link Sign Prediction — arXiv:2609.05896

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05896
License (as archived)
CC0-1.0
Archived
2026-10-16T13:39:38.929Z
SHA-256 of the archived text
8073e6595853a22df2846bed593dd115811978abfe7cb01fa3ad009623e39374
Stable URL of this page
https://metraipolis.com/documento/dc_7eeb0c25a094

How to cite

Polarity-Asymmetric Structural Calibration for Link Sign Prediction — arXiv:2609.05896 — arXiv (en), https://arxiv.org/abs/2609.05896 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7eeb0c25a094 (Metraipolis archive dc_7eeb0c25a094, sha256 8073e6595853a22df2846bed593dd115811978abfe7cb01fa3ad009623e39374)
BibTeX
@misc{dc7eeb0c25a094,
  title = {Polarity-Asymmetric Structural Calibration for Link Sign Prediction — arXiv:2609.05896},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05896},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7eeb0c25a094; sha256 8073e6595853a22df2846bed593dd115811978abfe7cb01fa3ad009623e39374},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05896. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Link sign prediction (LSP) aims to infer the positive or negative polarity of unobserved links in signed networks. Signed Graph Neural Networks (SGNNs) usually rely on signed-graph structural priors, including structural balance and homophily-like similarity, to guide message passing and prediction. These priors describe population-level tendencies, not guarantees for individual target edges. Their failures are especially costly under severe sign imbalance, where errors on minority and locally conflicting relations are harder to detect and correct. We propose Polarity-Asymmetric Structural Calibration (PASC), a target-edge structural-prior calibration framework for signed link prediction. PASC constructs a structure-only prior representation, estimates a target-edge structural prior score, and compares this score with a local signed-context cue to derive a conflict residual. The residual calibrates signed attention aggregation, target-edge gated fusion, and regime-adaptive optimization. Experiments on five real-world signed network datasets show that PASC consistently achieves the best Macro-F1 among representative baselines, with competitive AUC, Binary-F1, and Micro-F1. Structural-shift experiments further suggest reduced dependence on dense-neighborhood and local-closure shortcuts. Source code is available at this https URL .

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-09 in cs.SI).
Categorie arXiv: Social and Information Networks (cs.SI) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.05896 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:07:42.330Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).