Pith. sign in

REVIEW 2 cited by

Causal Spherical Hypergraph Networks for Modelling Social Uncertainty

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.17840 v1 pith:RM5CDPDQ submitted 2025-06-21 cs.LG cs.AI

classification cs.LGcs.AI
keywords uncertaintysocialcausalnetworkscausal-sphhndirectionalgrouphypergraph
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Human social behaviour is governed by complex interactions shaped by uncertainty, causality, and group dynamics. We propose Causal Spherical Hypergraph Networks (Causal-SphHN), a principled framework for socially grounded prediction that jointly models higher-order structure, directional influence, and epistemic uncertainty. Our method represents individuals as hyperspherical embeddings and group contexts as hyperedges, capturing semantic and relational geometry. Uncertainty is quantified via Shannon entropy over von Mises-Fisher distributions, while temporal causal dependencies are identified using Granger-informed subgraphs. Information is propagated through an angular message-passing mechanism that respects belief dispersion and directional semantics. Experiments on SNARE (offline networks), PHEME (online discourse), and AMIGOS (multimodal affect) show that Causal-SphHN improves predictive accuracy, robustness, and calibration over strong baselines. Moreover, it enables interpretable analysis of influence patterns and social ambiguity. This work contributes a unified causal-geometric approach for learning under uncertainty in dynamic social environments.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ManifoldMind: Dynamic Hyperbolic Reasoning for Trustworthy Recommendations

    cs.IR 2025-07 reject novelty 5.0 of 10

    A recommender model that scores user-item pairs via beam-searched multi-hop tag paths in learnable-curvature hyperbolic space, claiming state-of-the-art accuracy, calibration, and diversity.

  2. RicciFlowRec: A Geometric Root Cause Recommender Using Ricci Curvature on Financial Graphs

    cs.LG 2025-08 reject novelty 4.0 of 10

    A curvature and flow based recommender that attributes financial shocks to source nodes and re-ranks stocks by structural risk reports gains on S&P 500 data, but its attribution test is partly self-referential and sev...

Reference graph

Works this paper leans on

24 extracted references · 15 canonical work pages · cited by 2 Pith papers

  1. [1]

    Bach, D. R. and Dolan, R. J. Knowing how much you don't know: a neural organization of uncertainty estimates. Nature reviews neuroscience, 13 0 (8): 0 572--586, 2012

  2. [2]

    R., Gleich, D

    Benson, A. R., Gleich, D. F., and Leskovec, J. Higher-order organization of complex networks. Science, 353 0 (6295): 0 163--166, 2016

  3. [3]

    and Shenhav, A

    FeldmanHall, O. and Shenhav, A. Resolving uncertainty in a social world. Nature human behaviour, 3 0 (5): 0 426--435, 2019

  4. [4]

    Hypergraph neural networks

    Feng, Y., You, H., Zhang, Z., Ji, R., and Gao, Y. Hypergraph neural networks. In Proceedings of the AAAI conference on artificial intelligence, volume 33, pp.\ 3558--3565, 2019

  5. [5]

    Granger, C. W. Investigating causal relations by econometric models and cross-spectral methods. Econometrica: journal of the Econometric Society, pp.\ 424--438, 1969

  6. [6]

    Monitoring behavioral changes using spatiotemporal graphs: A case study on the studentlife dataset

    Harit, A., Sun, Z., Yu, J., and Al Moubayed, N. Monitoring behavioral changes using spatiotemporal graphs: A case study on the studentlife dataset. In NeurIPS 2024 Workshop on Behavioral Machine Learning, 2024 a

  7. [7]

    Harit, A., Sun, Z., Yu, J., and Moubayed, N. A. Breaking down financial news impact: A novel ai approach with geometric hypergraphs. In Proceedings of SEMANTiCS 2024, Amsterdam, 2024 b

  8. [8]

    B., Mar, R

    Hirsh, J. B., Mar, R. A., and Peterson, J. B. Psychological entropy: a framework for understanding uncertainty-related anxiety. Psychological review, 119 0 (2): 0 304, 2012

Show all 24 references
  1. [9]

    seizing

    Kruglanski, A. W. and Webster, D. M. Motivated closing of the mind:" seizing" and" freezing.". Psychological review, 103 0 (2): 0 263, 1996

  2. [10]

    Crafting papers on machine learning

    Langley, P. Crafting papers on machine learning. In Langley, P. (ed.), Proceedings of the 17th International Conference on Machine Learning (ICML 2000), pp.\ 1207--1216, Stanford, CA, 2000. Morgan Kaufmann

  3. [11]

    SNARE Codebook , 2023

    Laninga-Wijnen, L., Dijkstra, J., Franken, A., Gremmen, M., Harakeh, Z., Pattiselanno, K., van Rijsewijk, L., Vollebergh, W., and Veenstra, R. SNARE Codebook , 2023. URL https://doi.org/10.34894/JX2FYB

  4. [12]

    Spherical message passing for 3d graph networks

    Liu, Y., Wang, L., Liu, M., Zhang, X., Oztekin, B., and Ji, S. Spherical message passing for 3d graph networks. arXiv preprint arXiv:2102.05013, 2021

  5. [13]

    A., Abadi, M

    Miranda-Correa, J. A., Abadi, M. K., Sebe, N., and Patras, I. Amigos: A dataset for affect, personality and mood research on individuals and groups. IEEE transactions on affective computing, 12 0 (2): 0 479--493, 2018

  6. [14]

    An introduction to decision theory

    Peterson, M. An introduction to decision theory. Cambridge University Press, 2017

  7. [15]

    Shannon, C. E. Prediction and entropy of printed english. Bell system technical journal, 30 0 (1): 0 50--64, 1951

  8. [16]

    The Cambridge handbook of computational psychology

    Sun, R. The Cambridge handbook of computational psychology. Cambridge University Press, 2008

  9. [17]

    Self-supervised hypergraph representation learning for sociological analysis

    Sun, X., Cheng, H., Liu, B., Li, J., Chen, H., Xu, G., and Yin, H. Self-supervised hypergraph representation learning for sociological analysis. IEEE Transactions on Knowledge and Data Engineering, 35 0 (11): 0 11860--11871, 2023 a

  10. [18]

    I., Wang, J., and Lio, P

    Sun, Z., Harit, A., Cristea, A. I., Wang, J., and Lio, P. Money: Ensemble learning for stock price movement prediction via a convolutional network with adversarial hypergraph model. AI Open, 4: 0 165--174, 2023 b

  11. [19]

    Advanced hypergraph mining for web applications using sphere neural networks

    Sun, Z., Harit, A., Yu, J., Wang, J., and Li \`o , P. Advanced hypergraph mining for web applications using sphere neural networks. In Companion Proceedings of the ACM on Web Conference 2025, pp.\ 1316--1320, 2025

  12. [20]

    Hypergcn: A new method for training graph convolutional networks on hypergraphs

    Yadati, N., Nimishakavi, M., Yadav, P., Nitin, V., Louis, A., and Talukdar, P. Hypergcn: A new method for training graph convolutional networks on hypergraphs. Advances in neural information processing systems, 32, 2019

  13. [21]

    Ci-gnn: A granger causality-inspired graph neural network for interpretable brain network-based psychiatric diagnosis

    Zheng, K., Yu, S., and Chen, B. Ci-gnn: A granger causality-inspired graph neural network for interpretable brain network-based psychiatric diagnosis. Neural Networks, 172: 0 106147, 2024

  14. [22]

    S., and Pan, S

    Zheng, X., Wang, Y., Liu, Y., Li, M., Zhang, M., Jin, D., Yu, P. S., and Pan, S. Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082, 2022

  15. [23]

    Analysing how people orient to and spread rumours in social media by looking at conversational threads

    Zubiaga, A., Liakata, M., Procter, R., Wong Sak Hoi, G., and Tolmie, P. Analysing how people orient to and spread rumours in social media by looking at conversational threads. PloS one, 11 0 (3): 0 e0150989, 2016

  16. [24]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

Pith tools