{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PPTSRG37UKY3HXSSUKHP2TFQOV","short_pith_number":"pith:PPTSRG37","schema_version":"1.0","canonical_sha256":"7be7289b7fa2b1b3de52a28efd4cb07564ae6a29074b840148afc15fbdc28e04","source":{"kind":"arxiv","id":"1610.07363","version":1},"attestation_state":"computed","paper":{"title":"Learning Reporting Dynamics during Breaking News for Rumour Detection in Social Media","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.CL","authors_text":"Arkaitz Zubiaga, Maria Liakata, Rob Procter","submitted_at":"2016-10-24T11:25:24Z","abstract_excerpt":"Breaking news leads to situations of fast-paced reporting in social media, producing all kinds of updates related to news stories, albeit with the caveat that some of those early updates tend to be rumours, i.e., information with an unverified status at the time of posting. Flagging information that is unverified can be helpful to avoid the spread of information that may turn out to be false. Detection of rumours can also feed a rumour tracking system that ultimately determines their veracity. In this paper we introduce a novel approach to rumour detection that learns from the sequential dynam"},"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":"1610.07363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-24T11:25:24Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"36265f17fb0bafcbe36fcb9e05fb52887149c6f545a1a36bb4a6c069c555d622","abstract_canon_sha256":"645d1265303aea80226d4589d900c12d36e48eb7036bd2e10e7e636b87eaffe1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:30.314159Z","signature_b64":"zSqy1/pFn6wXzUloBoqubjYW6AYmMcMa4o+fQA2qRMKubxD4tqTtQuUJBwwEA987QgOZ2JaotuBbpWb9ivq0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be7289b7fa2b1b3de52a28efd4cb07564ae6a29074b840148afc15fbdc28e04","last_reissued_at":"2026-05-18T01:01:30.313672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:30.313672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Reporting Dynamics during Breaking News for Rumour Detection in Social Media","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.CL","authors_text":"Arkaitz Zubiaga, Maria Liakata, Rob Procter","submitted_at":"2016-10-24T11:25:24Z","abstract_excerpt":"Breaking news leads to situations of fast-paced reporting in social media, producing all kinds of updates related to news stories, albeit with the caveat that some of those early updates tend to be rumours, i.e., information with an unverified status at the time of posting. Flagging information that is unverified can be helpful to avoid the spread of information that may turn out to be false. Detection of rumours can also feed a rumour tracking system that ultimately determines their veracity. In this paper we introduce a novel approach to rumour detection that learns from the sequential dynam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07363","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":""},"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":"1610.07363","created_at":"2026-05-18T01:01:30.313753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07363v1","created_at":"2026-05-18T01:01:30.313753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07363","created_at":"2026-05-18T01:01:30.313753+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPTSRG37UKY3","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPTSRG37UKY3HXSS","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPTSRG37","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02259","citing_title":"An Information-theoretic Propagation Denoising and Fusion Framework for Fake News Detection","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV","json":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV.json","graph_json":"https://pith.science/api/pith-number/PPTSRG37UKY3HXSSUKHP2TFQOV/graph.json","events_json":"https://pith.science/api/pith-number/PPTSRG37UKY3HXSSUKHP2TFQOV/events.json","paper":"https://pith.science/paper/PPTSRG37"},"agent_actions":{"view_html":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV","download_json":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV.json","view_paper":"https://pith.science/paper/PPTSRG37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07363&json=true","fetch_graph":"https://pith.science/api/pith-number/PPTSRG37UKY3HXSSUKHP2TFQOV/graph.json","fetch_events":"https://pith.science/api/pith-number/PPTSRG37UKY3HXSSUKHP2TFQOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV/action/storage_attestation","attest_author":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV/action/author_attestation","sign_citation":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV/action/citation_signature","submit_replication":"https://pith.science/pith/PPTSRG37UKY3HXSSUKHP2TFQOV/action/replication_record"}},"created_at":"2026-05-18T01:01:30.313753+00:00","updated_at":"2026-05-18T01:01:30.313753+00:00"}