Paper Citation Record · LEDGER

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics

As of 23 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2606.23289.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2606.23289 v1

Coverage vector

measured 60 of 60 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T06:04:14.440654Z

measured 61 of 61 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T00:53:42.401046Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-12T00:53:43.526293Z

Reference resolution

60 of 60 outbound references displayed

verified exact3
verified fuzzy0
unresolved57
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 75802ce4-6d54-4076-adbb-9007b4443687 · outbound

This paper cites The structure and function of complex networks.SIAM review, 45(2):167–256, 2003.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics The structure and function of complex networks.SIAM review, 45(2):167–256, 2003

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f7a2f42-2b47-451c-bbcf-35986f9f721b · outbound

This paper cites Complex networks: Structure and dynamics.Physics reports, 424(4-5):175–308, 2006.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Complex networks: Structure and dynamics.Physics reports, 424(4-5):175–308, 2006

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f898696b-99e9-4535-afad-a4a25a24eea6 · outbound

This paper cites Public discourse and social network echo chambers driven by socio-cognitive biases.Physical Review X, 10(4):041042, 2020.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Public discourse and social network echo chambers driven by socio-cognitive biases.Physical Review X, 10(4):041042, 2020

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b32a95a-3ef5-4114-ac33-8339cb8a3535 · outbound

This paper cites Error and attack tolerance of complex networks.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Error and attack tolerance of complex networks

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b1388c1-a131-40f6-b596-c8d8569a20f6 · outbound

This paper cites Network dismantling.Pro- ceedings of the National Academy of Sciences, 113(44):12368–12373, 2016.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Network dismantling.Pro- ceedings of the National Academy of Sciences, 113(44):12368–12373, 2016

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f0bf57b-5b8c-45aa-a2c1-6ed842d75427 · outbound

This paper cites A comparative analysis of approaches to network-dismantling.Scientific reports, 8(1):13513, 2018.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics A comparative analysis of approaches to network-dismantling.Scientific reports, 8(1):13513, 2018

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 958a4398-178e-42f0-bf1f-3df9f2f3c52f · outbound

This paper cites Recent advances in network dismantling: A comprehensive review and list of recommendations for future work.Chaos, Solitons & Fractals, 199:116673, 2025.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Recent advances in network dismantling: A comprehensive review and list of recommendations for future work.Chaos, Solitons & Fractals, 199:116673, 2025

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 624eef76-520f-4b88-bdb9-540276b88fdd · outbound

This paper cites Centrality in social networks conceptual clarification.Social networks, 1(3):215–239, 1978.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Centrality in social networks conceptual clarification.Social networks, 1(3):215–239, 1978

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 901501c7-6eca-4a42-a69a-1eb70f25c9bf · outbound

This paper cites Power and centrality: A family of measures.American journal of sociology, 92(5):1170–1182, 1987.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Power and centrality: A family of measures.American journal of sociology, 92(5):1170–1182, 1987

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 026d9855-a292-4170-a48c-0852b5b2a7e6 · outbound

This paper cites Vital nodes identification in complex networks.Physics reports, 650:1–63, 2016.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Vital nodes identification in complex networks.Physics reports, 650:1–63, 2016

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69314c03-23f2-4bef-8696-a6e3a3a963db · outbound

This paper cites Identification of influential spreaders in complex networks.Nature physics, 6(11):888–893, 2010.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Identification of influential spreaders in complex networks.Nature physics, 6(11):888–893, 2010

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 059d9b35-622f-4c51-8ebc-a0de254f7f82 · outbound

This paper cites Searching for superspreaders of information in real-world social media.Scientific reports, 4(1):5547, 2014.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Searching for superspreaders of information in real-world social media.Scientific reports, 4(1):5547, 2014

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a48b848-3172-47aa-b2cb-1545e207ab4c · outbound

This paper cites Local-forest method for superspreaders identification in online social networks.Entropy, 24(9):1279, 2022.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Local-forest method for superspreaders identification in online social networks.Entropy, 24(9):1279, 2022

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00569733-3b9b-4e0c-b70f-affc01266c9d · outbound

This paper cites Influence maximization in complex networks through optimal perco- lation.Nature, 524(7563):65–68, 2015.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Influence maximization in complex networks through optimal perco- lation.Nature, 524(7563):65–68, 2015

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87956738-7a0e-46c5-afb9-f3b5b8cdb519 · outbound

This paper cites Immunization and targeted destruction of networks using explosive percolation.Physical review letters, 117(20):208301, 2016.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Immunization and targeted destruction of networks using explosive percolation.Physical review letters, 117(20):208301, 2016

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2552e94-496c-4cf3-aed6-9f68a53a16d1 · outbound

This paper cites Domirank cen- trality reveals structural fragility of complex networks via node dominance.Nature communications, 15(1):56, 2024.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Domirank cen- trality reveals structural fragility of complex networks via node dominance.Nature communications, 15(1):56, 2024

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9c9ad4e-c967-4527-a8bf-e3bf6e4eaf95 · outbound

This paper cites Finding key players in complex networks through deep reinforcement learning.Nature machine intelligence, 2(6):317–324, 2020.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Finding key players in complex networks through deep reinforcement learning.Nature machine intelligence, 2(6):317–324, 2020

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a71c274d-70cd-48ed-b0e8-193f2fb1e15b · outbound

This paper cites Machine learning dismantling and early-warning signals of disintegration in complex systems.Nature communications, 12(1):5190, 2021.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Machine learning dismantling and early-warning signals of disintegration in complex systems.Nature communications, 12(1):5190, 2021

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6eab7113-c9f8-4495-8797-2d1c2bd5c7de · outbound

This paper cites Encoding node diffusion competence and role significance for network dis- mantling.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Encoding node diffusion competence and role significance for network dis- mantling

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fce96b1e-c38a-4bfa-8623-caf7279f3a02 · outbound

This paper cites The structure and dynamics of networks with higher order interactions.Physics Reports, 1018:1–64, 2023.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics The structure and dynamics of networks with higher order interactions.Physics Reports, 1018:1–64, 2023

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95ca9a66-82d1-4f99-8b8c-3be609c63b91 · outbound

This paper cites Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs.Nature communications, 14(1):1375, 2023.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs.Nature communications, 14(1):1375, 2023

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01b2c11d-8d08-4f3e-9080-3149938c9535 · outbound

This paper cites Higher-order network adaptivity: co-evolution of higher-order structure and spreading dynamics.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Higher-order network adaptivity: co-evolution of higher-order structure and spreading dynamics

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-07-08T01:19:06.298599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 874b0897-ab3f-4482-82f2-4199cac7c065 · outbound

This paper cites Simplicial models of social contagion.Nature communications, 10(1):2485, 2019.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Simplicial models of social contagion.Nature communications, 10(1):2485, 2019

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13b22312-dae6-49f3-acc5-c735adcda0ac · outbound

This paper cites Influential groups for seeding and sustaining nonlinear contagion in heterogeneous hyper- graphs.Communications Physics, 5(1):25, 2022.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Influential groups for seeding and sustaining nonlinear contagion in heterogeneous hyper- graphs.Communications Physics, 5(1):25, 2022

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c373f12c-c8ba-47b1-a64d-c70b52c064fc · outbound

This paper cites Connectivity in hypergraphs.Canadian Mathematical Bulletin, 61(2):252–271, 2018.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Connectivity in hypergraphs.Canadian Mathematical Bulletin, 61(2):252–271, 2018

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fbba640-c29d-49d9-8271-b7b5e0b6c62d · outbound

This paper cites Higher-order interdependent percolation on hypergraphs.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Higher-order interdependent percolation on hypergraphs

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 599c3544-f032-4fcc-abe5-3ff0d0f91c1e · outbound

This paper cites Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbca9b31-8357-4545-9c59-5701b2928ef3 · outbound

This paper cites Geometry of nonequilibrium reaction networks.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Geometry of nonequilibrium reaction networks

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afa6aa2e-c16f-476f-8b78-c25aab27d168 · outbound

This paper cites Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c0f81e1-128b-4c93-9892-aed9f611bd27 · outbound

This paper cites Hyperci: a higher order collective influence measure for hypernetwork disman- tling.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Hyperci: a higher order collective influence measure for hypernetwork disman- tling

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 52dd5b26-3a30-446e-ab00-8071d7a918c4 · outbound

This paper cites Influence maximization based on threshold models in hypergraphs.Chaos: An Interdisciplinary Journal of Nonlinear Science, 34(2), 2024.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Influence maximization based on threshold models in hypergraphs.Chaos: An Interdisciplinary Journal of Nonlinear Science, 34(2), 2024

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ffccb2b-640f-43d9-8171-8420874450fd · outbound

This paper cites Hypernetwork dismantling via deep reinforcement learning.IEEE Transactions on Network Science and Engineering, 9(5):3302–3315, 2022.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Hypernetwork dismantling via deep reinforcement learning.IEEE Transactions on Network Science and Engineering, 9(5):3302–3315, 2022

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0bc89f0e-7661-402b-b165-3887a7e312ee · outbound

This paper cites Deep learning-based hypernetwork dismantling for effectively hindering structural recovery.Information Processing & Management, 63(3):104551, 2026.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Deep learning-based hypernetwork dismantling for effectively hindering structural recovery.Information Processing & Management, 63(3):104551, 2026

Reference 33

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92b8f8af-7253-4ddd-9d27-c1a3d5728876 · outbound

This paper cites Betweenness approximation for edge computing with hypergraph neural networks.Tsinghua Science and Technology, 30(1):331–344, 2024.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Betweenness approximation for edge computing with hypergraph neural networks.Tsinghua Science and Technology, 30(1):331–344, 2024

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0f63aa1-14e8-4f3f-891d-7b811adc3c21 · outbound

This paper cites Hyper-cores promote localization and efficient seeding in higher-order processes.Nature communications, 14(1):6223, 2023.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Hyper-cores promote localization and efficient seeding in higher-order processes.Nature communications, 14(1):6223, 2023

Reference 35

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eccd425b-82fd-402e-8ef5-521fea9b785b · outbound

This paper cites Node and edge nonlinear eigenvector centrality for hypergraphs.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Node and edge nonlinear eigenvector centrality for hypergraphs

Reference 36

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bab87a60-2e66-4475-8c56-1bd171e38420 · outbound

This paper cites Locating influential nodes in hypergraphs via fuzzy collective influence.Communications in Nonlinear Science and Numerical Simulation, 142:108574, 2025.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Locating influential nodes in hypergraphs via fuzzy collective influence.Communications in Nonlinear Science and Numerical Simulation, 142:108574, 2025

Reference 37

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6affa742-b20d-4645-b966-7bfe1ac5d4b1 · outbound

This paper cites Subhypergraphs in non-uniform random hypergraphs.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Subhypergraphs in non-uniform random hypergraphs

Reference 38

Resolution: verified exact; local_arxiv, observed 2026-07-04T12:49:52.070283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 846b2e12-5b61-4772-a8e6-3bee2f5e6586 · outbound

This paper cites Smallworldness in hypergraphs.Journal of Physics: Complexity, 4(3):035007, 2023.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Smallworldness in hypergraphs.Journal of Physics: Complexity, 4(3):035007, 2023

Reference 39

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b51ae0b6-5260-4706-91cb-230f6e8f9071 · outbound

This paper cites Xgi: A python package for higher-order interaction networks.Journal of Open Source Software, 8(85):5162, 2023.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Xgi: A python package for higher-order interaction networks.Journal of Open Source Software, 8(85):5162, 2023

Reference 40

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bd79e8d-5a94-4ba8-a0d9-045cc41e03fb · outbound

This paper cites Hypergraphx: a library for higher- order network analysis.Journal of Complex Networks, 11(3):cnad019, 2023.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Hypergraphx: a library for higher- order network analysis.Journal of Complex Networks, 11(3):cnad019, 2023

Reference 41

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b749aa9-781d-4ed2-a358-ef4fb1b33a59 · outbound

This paper cites Prob- abilistic activity driven model of temporal simplicial networks and its application on higher-order dynamics.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Prob- abilistic activity driven model of temporal simplicial networks and its application on higher-order dynamics

Reference 42

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 285ab2ca-ffd9-4b55-afc0-6c4015283e90 · outbound

This paper cites Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys.PloS one, 10(9):e0136497, 2015.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys.PloS one, 10(9):e0136497, 2015

Reference 43

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d285545-6214-47ff-b202-74db9c6a544f · outbound

This paper cites Can co-location be used as a proxy for face-to-face contacts?EPJ Data Science, 7(1):1–18, 2018.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Can co-location be used as a proxy for face-to-face contacts?EPJ Data Science, 7(1):1–18, 2018

Reference 44

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a184c4cc-32f4-4fba-9319-64ee50ea504c · outbound

This paper cites High-resolution measurements of face-to-face contact patterns in a primary school.PloS one, 6(8):e23176, 2011.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics High-resolution measurements of face-to-face contact patterns in a primary school.PloS one, 6(8):e23176, 2011

Reference 45

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc2ecd39-5d7a-4e49-9ea5-709db3179179 · outbound

This paper cites Simplicial closure and higher-order link prediction.Proceedings of the National Academy of Sciences, 115(48):E11221–E11230, 2018.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Simplicial closure and higher-order link prediction.Proceedings of the National Academy of Sciences, 115(48):E11221–E11230, 2018

Reference 46

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e383dd2-e32c-4fd9-99a2-d2ac7562fb72 · outbound

This paper cites Estimating potential infection transmission routes in hospital wards using wearable proximity sensors.PloS one, 8(9):e73970, 2013.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Estimating potential infection transmission routes in hospital wards using wearable proximity sensors.PloS one, 8(9):e73970, 2013

Reference 47

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a61d904-6799-482d-a26c-c6f36fe69944 · outbound

This paper cites Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers.Network Science, 3(3):326–347, 2015.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers.Network Science, 3(3):326–347, 2015

Reference 48

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 109a4d97-3300-475a-ba03-310de5886797 · outbound

This paper cites The role of heterogeneity in contact timing and duration in network models of influenza spread in schools.Journal of The Royal Society Interface, 12(108):20150279, 2015.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics The role of heterogeneity in contact timing and duration in network models of influenza spread in schools.Journal of The Royal Society Interface, 12(108):20150279, 2015

Reference 49

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 376ae91a-3112-405e-a2b5-06e24bfd10e5 · outbound

This paper cites Motifs in temporal networks.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Motifs in temporal networks

Reference 50

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21dcc22b-4c2f-4f25-8863-4d71e70784ba · outbound

This paper cites The enron corpus: A new dataset for email classification research.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics The enron corpus: A new dataset for email classification research

Reference 51

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33bd866c-ef0c-4245-9bfe-91069ba32154 · outbound

This paper cites A network analysis of commit- tees in the US House of Representatives.Proceedings of the National Academy of Sciences, 102(20):7057–7062, 2005.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics A network analysis of commit- tees in the US House of Representatives.Proceedings of the National Academy of Sciences, 102(20):7057–7062, 2005

Reference 52

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 303adcd5-f7f3-4dee-a496-322559db84da · outbound

This paper cites Legislative cosponsorship networks in the US House and Senate.Social networks, 28(4):454– 465, 2006.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Legislative cosponsorship networks in the US House and Senate.Social networks, 28(4):454– 465, 2006

Reference 53

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c74ec394-3c0f-41e7-8ce0-72c6f4168395 · outbound

This paper cites Generative hypergraph clustering: From blockmodels to modularity.Science Advances, 7(28):eabh1303, 2021.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Generative hypergraph clustering: From blockmodels to modularity.Science Advances, 7(28):eabh1303, 2021

Reference 54

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 827c07f1-dfef-452b-8ab4-3879a9314c02 · outbound

This paper cites Justifying recommendations using distantly-labeled reviews and fine-grained aspects.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Justifying recommendations using distantly-labeled reviews and fine-grained aspects

Reference 55

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7baca10f-82c1-4b91-9b20-70a0ad6c9a11 · outbound

This paper cites Diverse and experienced group discovery via hypergraph clustering.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Diverse and experienced group discovery via hypergraph clustering

Reference 56

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a7765f7-e551-4c6e-a2dd-77d9b0c94010 · outbound

This paper cites Generalized network dismantling.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Generalized network dismantling

Reference 57

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d451103-b189-4212-86b4-54c28d1cebf7 · outbound

This paper cites Effective approach to epidemic containment using link equations in complex networks.Science advances, 4(12):eaau4212, 2018.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Effective approach to epidemic containment using link equations in complex networks.Science advances, 4(12):eaau4212, 2018

Reference 58

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ade2b953-6a87-4d56-b83c-53c8948d579a · outbound

This paper cites Effective epidemic containment strategy in hypergraphs.Physical Review Research, 3(3):033282, 2021.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics Effective epidemic containment strategy in hypergraphs.Physical Review Research, 3(3):033282, 2021

Reference 59

Resolution: unresolved; no resolver link, observed 2026-06-26T06:04:14.440654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b748a96-b72a-4998-84fe-f5630dd12a79 · outbound

This paper cites A unified framework for identifying influential nodes in hypergraphs.arXiv preprint arXiv:2512.09606, 2025.

Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics A unified framework for identifying influential nodes in hypergraphs.arXiv preprint arXiv:2512.09606, 2025

Reference 60

Resolution: verified exact; arxiv_id, observed 2026-07-04T12:49:52.067996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Pith citing papers

Observation b7b7b49c-df83-4bc5-b0d8-68a9b47dddca · inbound

Adaptive higher-order contagion of harmful information with platform-induced group dissolution and individual rewiring cites this paper.

Adaptive higher-order contagion of harmful information with platform-induced group dissolution and individual rewiring Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics

Reference 27

Resolution: metadata mismatch; local_arxiv, observed 2026-08-12T00:53:43.531151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.