{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2U6U4M6PGQ2IIPUBCHQ7C434PF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f9e66e52a608245be36882ace3662226e2dbe472ad28338574ff45dd98ff1c85","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-04-18T14:55:54Z","title_canon_sha256":"f5e47394522771d46aaa227707e645c0fc5cc122d64a7ed1c50c3407974269c4"},"schema_version":"1.0","source":{"id":"2605.13861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13861","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13861v1","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13861","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"2U6U4M6PGQ2I","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2U6U4M6PGQ2IIPUB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2U6U4M6P","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:cea166bd02a86f84c6d0a956f33ddbc1281fb4ceffbee4e9d44c17b2c12636df","target":"graph","created_at":"2026-05-17T23:39:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New spectral bounds create a unified representation of news cascade structures that supports competitive fake news detection and interpretable optimization of propagation patterns."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation."}],"snapshot_sha256":"46c77b02015f745b238018276a7261a9989f50126530489e3c5f6d5cbe8343b3"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Reza Zafarani, Weibin Cai","cross_cats":["cs.AI"],"headline":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-04-18T14:55:54Z","title":"Spectral Analysis of Fake News Propagation"},"references":{"count":19,"internal_anchors":0,"resolved_work":19,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"maximum of out degree","work_id":"0bad2e0c-acf2-4346-a4cc-b140be535f3f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"depth of the maximum of out degree node","work_id":"38532bfe-69b0-46bc-923c-38832461a99e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"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","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Category Meaning / Property Bound Equation C1","work_id":"32015878-bbc2-4a9e-82b8-b7f7d382b483","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"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","year":null}],"snapshot_sha256":"169cb21a71c9897688dc15aedcde720225d8bec99cba83065c701528145dd1a5"},"source":{"id":"2605.13861","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T06:34:15.919427Z","id":"d34741b7-b551-4237-b39f-d1782cfc876c","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Spectral bounds on graph propagation patterns distinguish fake news cascades from real ones and enable classification plus structural interpretation.","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.","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."}},"verdict_id":"d34741b7-b551-4237-b39f-d1782cfc876c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:96208a5514ba9bf51a14ba95e6b9817fdf456ada6ee09153a33be15c18af8910","target":"record","created_at":"2026-05-17T23:39:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f9e66e52a608245be36882ace3662226e2dbe472ad28338574ff45dd98ff1c85","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-04-18T14:55:54Z","title_canon_sha256":"f5e47394522771d46aaa227707e645c0fc5cc122d64a7ed1c50c3407974269c4"},"schema_version":"1.0","source":{"id":"2605.13861","kind":"arxiv","version":1}},"canonical_sha256":"d53d4e33cf3434843e8111e1f1737c794e319ec90cfb18dbe7b8217a8a4acb58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d53d4e33cf3434843e8111e1f1737c794e319ec90cfb18dbe7b8217a8a4acb58","first_computed_at":"2026-05-17T23:39:19.484723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:19.484723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GWTm7lxEU8bAx9PiSKI/ZRUKUheKOLpz6E3MyWZHheLj4E6c+N4b9C5ACj69290YtPQ6BkWM3ciLwyo38lM0AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:19.485458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96208a5514ba9bf51a14ba95e6b9817fdf456ada6ee09153a33be15c18af8910","sha256:cea166bd02a86f84c6d0a956f33ddbc1281fb4ceffbee4e9d44c17b2c12636df"],"state_sha256":"ca846867a301124547c238af59d1769abe0bb3cbd6f7b92f0748b8c565900fab"}