{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3VRKADHAKX5SIITJ2VTAPUFCTU","short_pith_number":"pith:3VRKADHA","schema_version":"1.0","canonical_sha256":"dd62a00ce055fb242269d56607d0a29d20bf73d4a0c301ef7a663ddb1e0143c4","source":{"kind":"arxiv","id":"2501.03290","version":1},"attestation_state":"computed","paper":{"title":"A Decision-Based Heterogenous Graph Attention Network for Multi-Class Fake News Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Alireza Bagheri, Batool Lakzaei, Mostafa Haghir Chehreghani","submitted_at":"2025-01-06T07:18:31Z","abstract_excerpt":"A promising tool for addressing fake news detection is Graph Neural Networks (GNNs). However, most existing GNN-based methods rely on binary classification, categorizing news as either real or fake. Additionally, traditional GNN models use a static neighborhood for each node, making them susceptible to issues like over-squashing. In this paper, we introduce a novel model named Decision-based Heterogeneous Graph Attention Network (DHGAT) for fake news detection in a semi-supervised setting. DHGAT effectively addresses the limitations of traditional GNNs by dynamically optimizing and selecting t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.03290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-06T07:18:31Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"9afa02ae84985461805cc33c345c118e825b310bb26b22b150c50d87f86dd49e","abstract_canon_sha256":"39cf2f4e00a03b285e312edf9a01be9a267749b41fb55efd405e3a4568b04895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:52.050553Z","signature_b64":"L5HPfbK0p8gGs9I1CF7WLBH36ETaT0AsIAFTRhou9czz7sLTy5mnHUitaUtXdioErpVy0U++MvqeT1bTKArxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd62a00ce055fb242269d56607d0a29d20bf73d4a0c301ef7a663ddb1e0143c4","last_reissued_at":"2026-07-05T09:57:52.050150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:52.050150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decision-Based Heterogenous Graph Attention Network for Multi-Class Fake News Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Alireza Bagheri, Batool Lakzaei, Mostafa Haghir Chehreghani","submitted_at":"2025-01-06T07:18:31Z","abstract_excerpt":"A promising tool for addressing fake news detection is Graph Neural Networks (GNNs). However, most existing GNN-based methods rely on binary classification, categorizing news as either real or fake. Additionally, traditional GNN models use a static neighborhood for each node, making them susceptible to issues like over-squashing. In this paper, we introduce a novel model named Decision-based Heterogeneous Graph Attention Network (DHGAT) for fake news detection in a semi-supervised setting. DHGAT effectively addresses the limitations of traditional GNNs by dynamically optimizing and selecting t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03290","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.03290/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.03290","created_at":"2026-07-05T09:57:52.050210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03290v1","created_at":"2026-07-05T09:57:52.050210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03290","created_at":"2026-07-05T09:57:52.050210+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VRKADHAKX5S","created_at":"2026-07-05T09:57:52.050210+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VRKADHAKX5SIITJ","created_at":"2026-07-05T09:57:52.050210+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VRKADHA","created_at":"2026-07-05T09:57:52.050210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.23340","citing_title":"CrediBench: Building Web-Scale Network Datasets for Information Integrity","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU","json":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU.json","graph_json":"https://pith.science/api/pith-number/3VRKADHAKX5SIITJ2VTAPUFCTU/graph.json","events_json":"https://pith.science/api/pith-number/3VRKADHAKX5SIITJ2VTAPUFCTU/events.json","paper":"https://pith.science/paper/3VRKADHA"},"agent_actions":{"view_html":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU","download_json":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU.json","view_paper":"https://pith.science/paper/3VRKADHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03290&json=true","fetch_graph":"https://pith.science/api/pith-number/3VRKADHAKX5SIITJ2VTAPUFCTU/graph.json","fetch_events":"https://pith.science/api/pith-number/3VRKADHAKX5SIITJ2VTAPUFCTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU/action/storage_attestation","attest_author":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU/action/author_attestation","sign_citation":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU/action/citation_signature","submit_replication":"https://pith.science/pith/3VRKADHAKX5SIITJ2VTAPUFCTU/action/replication_record"}},"created_at":"2026-07-05T09:57:52.050210+00:00","updated_at":"2026-07-05T09:57:52.050210+00:00"}