Fair Influence Maximization in Hypergraphs
arXiv 2606.14189•18dd30283c82202c05bd31ea66bf0b76d63ac51fd7af78282e4da79406f864fa
Community NotesLLM-adoptionMapperRedditTwitter/Xcontent-moderationcounter-narcoticsdataset-releasedisinformationdual-use-researchecho-chambersfairnesshypergraphsinfluence-maximizationinformation-operationsinteger-linear-programmingmodel-lifespannetwork-interdictionpolarizationreproducibilityrobust-optimizationsocial-networkstopological-data-analysis
Paper metadata
- arXiv ID
- 2606.14189
- Version
- Not specified by this published record
- Category
- Computer Science — Social and Information Networks (cs.SI)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_si
- Record identifier
- 18dd30283c82202c05bd31ea66bf0b76d63ac51fd7af78282e4da79406f864fa
- Enrichment time
- 2026-06-15T08:52:16Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.