{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2U6U4M6PGQ2IIPUBCHQ7C434PF","short_pith_number":"pith:2U6U4M6P","schema_version":"1.0","canonical_sha256":"d53d4e33cf3434843e8111e1f1737c794e319ec90cfb18dbe7b8217a8a4acb58","source":{"kind":"arxiv","id":"2605.13861","version":1},"attestation_state":"computed","paper":{"title":"Spectral Analysis of Fake News Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation.","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Reza Zafarani, Weibin Cai","submitted_at":"2026-04-18T14:55:54Z","abstract_excerpt":"The propagation structure of fake news has been shown to be an important cue for detecting it; yet, existing propagation-based fake news detection methods have mainly relied on ad hoc topological features, and a unified view of cascade patterns is still lacking. To address this, we study news propagation from a spectral view by connecting graph spectra to propagation-related structural properties through rigorous spectral bounds. In particular, we introduce several new bounds and integrate them with existing ones into a unified spectral representation of information propagation. We then use th"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-04-18T14:55:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f5e47394522771d46aaa227707e645c0fc5cc122d64a7ed1c50c3407974269c4","abstract_canon_sha256":"f9e66e52a608245be36882ace3662226e2dbe472ad28338574ff45dd98ff1c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:19.485458Z","signature_b64":"GWTm7lxEU8bAx9PiSKI/ZRUKUheKOLpz6E3MyWZHheLj4E6c+N4b9C5ACj69290YtPQ6BkWM3ciLwyo38lM0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d53d4e33cf3434843e8111e1f1737c794e319ec90cfb18dbe7b8217a8a4acb58","last_reissued_at":"2026-05-17T23:39:19.484723Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:19.484723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Analysis of Fake News Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation.","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Reza Zafarani, Weibin Cai","submitted_at":"2026-04-18T14:55:54Z","abstract_excerpt":"The propagation structure of fake news has been shown to be an important cue for detecting it; yet, existing propagation-based fake news detection methods have mainly relied on ad hoc topological features, and a unified view of cascade patterns is still lacking. To address this, we study news propagation from a spectral view by connecting graph spectra to propagation-related structural properties through rigorous spectral bounds. In particular, we introduce several new bounds and integrate them with existing ones into a unified spectral representation of information propagation. We then use th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we introduce several new bounds and integrate them with existing ones into a unified spectral representation of information propagation. We then use these spectral bounds for downstream classification and design a discrete structural optimization framework to interpret learned propagation patterns.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the derived spectral bounds and first-order perturbation approximation faithfully capture the distinguishing structural properties of real versus fake news cascades without substantial information loss or approximation error that would invalidate downstream classification and interpretation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"New spectral bounds create a unified representation of news cascade structures that supports competitive fake news detection and interpretable optimization of propagation patterns.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"46c77b02015f745b238018276a7261a9989f50126530489e3c5f6d5cbe8343b3"},"source":{"id":"2605.13861","kind":"arxiv","version":1},"verdict":{"id":"d34741b7-b551-4237-b39f-d1782cfc876c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T06:34:15.919427Z","strongest_claim":"we introduce several new bounds and integrate them with existing ones into a unified spectral representation of information propagation. We then use these spectral bounds for downstream classification and design a discrete structural optimization framework to interpret learned propagation patterns.","one_line_summary":"New spectral bounds create a unified representation of news cascade structures that supports competitive fake news detection and interpretable optimization of propagation patterns.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the derived spectral bounds and first-order perturbation approximation faithfully capture the distinguishing structural properties of real versus fake news cascades without substantial information loss or approximation error that would invalidate downstream classification and interpretation.","pith_extraction_headline":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation."},"references":{"count":19,"sample":[{"doi":"","year":null,"title":"maximum of out degree","work_id":"0bad2e0c-acf2-4346-a4cc-b140be535f3f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"depth of the maximum of out degree node","work_id":"38532bfe-69b0-46bc-923c-38832461a99e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"width entropy: P i p(wi) log(p(wi)),p(w i) = wiP i wi , wherew i is the width of depthi","work_id":"ed4d7ea8-7fc7-4b5d-b448-2d2423448a90","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Category Meaning / Property Bound Equation C1","work_id":"32015878-bbc2-4a9e-82b8-b7f7d382b483","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"mean branching: P i∈I(T) di |I(T)| , where|I(T)|is the number of internal nodes,di is the degree of nodei","work_id":"37b802d9-c6cc-450f-80f0-10248d86ba3b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":19,"snapshot_sha256":"169cb21a71c9897688dc15aedcde720225d8bec99cba83065c701528145dd1a5","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":"2605.13861","created_at":"2026-05-17T23:39:19.484838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13861v1","created_at":"2026-05-17T23:39:19.484838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13861","created_at":"2026-05-17T23:39:19.484838+00:00"},{"alias_kind":"pith_short_12","alias_value":"2U6U4M6PGQ2I","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"2U6U4M6PGQ2IIPUB","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"2U6U4M6P","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF","json":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF.json","graph_json":"https://pith.science/api/pith-number/2U6U4M6PGQ2IIPUBCHQ7C434PF/graph.json","events_json":"https://pith.science/api/pith-number/2U6U4M6PGQ2IIPUBCHQ7C434PF/events.json","paper":"https://pith.science/paper/2U6U4M6P"},"agent_actions":{"view_html":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF","download_json":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF.json","view_paper":"https://pith.science/paper/2U6U4M6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13861&json=true","fetch_graph":"https://pith.science/api/pith-number/2U6U4M6PGQ2IIPUBCHQ7C434PF/graph.json","fetch_events":"https://pith.science/api/pith-number/2U6U4M6PGQ2IIPUBCHQ7C434PF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF/action/storage_attestation","attest_author":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF/action/author_attestation","sign_citation":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF/action/citation_signature","submit_replication":"https://pith.science/pith/2U6U4M6PGQ2IIPUBCHQ7C434PF/action/replication_record"}},"created_at":"2026-05-17T23:39:19.484838+00:00","updated_at":"2026-05-17T23:39:19.484838+00:00"}