IDEAS home Printed from https://ideas.repec.org/a/pal/palcom/v12y2025i1d10.1057_s41599-025-05437-z.html
   My bibliography  Save this article

Provenance of data with rights and interests in online rumor data element circulation on social media

Author

Listed:
  • Jianbo Zhao

    (Xi’an International Studies University
    Global South Economic and Trade Cooperation Research Center)

  • Huailiang Liu

    (Xidian University)

  • Kai Shu

    (Xidian University)

  • Qisen Fang

    (Xidian University)

  • Chufan Tan

    (Xidian University)

  • Yue Su

    (Xidian University)

  • Lianyue Wu

    (Xidian University)

  • Peijie Liu

    (Xidian University)

  • Hai Shen

    (Xi’an International Studies University)

  • Jing Tian

    (Xi’an International Studies University
    Global South Economic and Trade Cooperation Research Center)

Abstract

Social media platforms, as the primary carriers of online rumor dissemination, enable users to gain profits from the platform through activities such as content creation, browsing, and sharing. However, the complexity of data rights and the attribution of responsibility hinders the comprehensive tracing of rumor propagation paths and the precise identification of data infringement subjects. By reusing 92 circulation processes from 13 data lifecycle models, this paper abstracts the circulation process of online rumor data elements, standardizes the “five rights separation” framework for data rights confirmation among ternary data subjects, and defines a Rights-and-Interests-Attributed Data Element. Through integration with PROV-O and ProVOC models, this paper constructs PROV-OCC—an ontological model for data with rights and interests provenance in rumor circulation—comprising 3 parent classes and 32 object properties. It implements a seven-element semantic representation combining W7 provenance technology and validates the model through ontological reasoning via knowledge graph representation of typical rumor cases, verifying its effectiveness in tracing data rights changes, infringement subjects, and propagation paths. The data provenance model supports the recovery and compensation of infringement-related profits, enabling the timely restoration of compromised trust and order for governments and platforms.

Suggested Citation

  • Jianbo Zhao & Huailiang Liu & Kai Shu & Qisen Fang & Chufan Tan & Yue Su & Lianyue Wu & Peijie Liu & Hai Shen & Jing Tian, 2025. "Provenance of data with rights and interests in online rumor data element circulation on social media," Humanities and Social Sciences Communications, Palgrave Macmillan, vol. 12(1), pages 1-22, December.
    • Handle: RePEc:pal:palcom:v:12:y:2025:i:1:d:10.1057_s41599-025-05437-z
    DOI: 10.1057/s41599-025-05437-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41599-025-05437-z
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41599-025-05437-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Zhao Zhang & Wen Xu & Weili Wu & Ding-Zhu Du, 2017. "A novel approach for detecting multiple rumor sources in networks with partial observations," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 132-146, January.
    2. Devavrat Shah & Tauhid Zaman, 2016. "Finding Rumor Sources on Random Trees," Operations Research, INFORMS, vol. 64(3), pages 736-755, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Suisheng Yu & Mingcai Li & Fengming Liu, 2017. "Rumor Identification with Maximum Entropy in MicroNet," Complexity, Hindawi, vol. 2017, pages 1-8, September.
    2. Gong, Chang & Li, Jichao & Qian, Liwei & Li, Siwei & Yang, Zhiwei & Yang, Kewei, 2024. "HMSL: Source localization based on higher-order Markov propagation," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    3. Edward Anderson & David Gamarnik & Anton Kleywegt & Asuman Ozdaglar, 2016. "Preface to the Special Issue on Information and Decisions in Social and Economic Networks," Operations Research, INFORMS, vol. 64(3), pages 561-563, June.
    4. Jiang, Meiling & Gao, Qingwu & Zhuang, Jun, 2021. "Reciprocal spreading and debunking processes of online misinformation: A new rumor spreading–debunking model with a case study," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    5. Michel Grabisch & Agnieszka Rusinowska & Xavier Venel, 2019. "Diffusion in countably infinite networks," Documents de travail du Centre d'Economie de la Sorbonne 19017, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    6. Bin Liu & Yuxia Yan & Qizhi Fang & Junyu Dong & Weili Wu & Huijuan Wang, 2019. "Maximizing profit of multiple adoptions in social networks with a martingale approach," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 1-20, July.
    7. Harry Crane & Min Xu, 2021. "Inference on the history of a randomly growing tree," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 83(4), pages 639-668, September.
    8. Vahideh Manshadi & Sidhant Misra & Scott Rodilitz, 2020. "Diffusion in Random Networks: Impact of Degree Distribution," Operations Research, INFORMS, vol. 68(6), pages 1722-1741, November.
    9. Sahand Negahban & Sewoong Oh & Devavrat Shah, 2017. "Rank Centrality: Ranking from Pairwise Comparisons," Operations Research, INFORMS, vol. 65(1), pages 266-287, February.
    10. Shi, Chaoyi & Zhang, Qi & Chu, Tianguang, 2022. "Source estimation in continuous-time diffusion networks via incomplete observation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).
    11. Sahand Negahban & Sewoong Oh & Devavrat Shah, 2017. "Rank Centrality: Ranking from Pairwise Comparisons," Operations Research, INFORMS, vol. 65(1), pages 266-287, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:palcom:v:12:y:2025:i:1:d:10.1057_s41599-025-05437-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: https://www.nature.com/palcomms/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.