{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KHR5BVTZLVJW3Z4I77UONU2PBF","short_pith_number":"pith:KHR5BVTZ","schema_version":"1.0","canonical_sha256":"51e3d0d6795d536de788ffe8e6d34f0966f3bfab7e9b60fa7dde76abfd752b1e","source":{"kind":"arxiv","id":"1806.03713","version":1},"attestation_state":"computed","paper":{"title":"All-in-one: Multi-task Learning for Rumour Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Arkaitz Zubiaga, Elena Kochkina, Maria Liakata","submitted_at":"2018-06-10T19:46:17Z","abstract_excerpt":"Automatic resolution of rumours is a challenging task that can be broken down into smaller components that make up a pipeline, including rumour detection, rumour tracking and stance classification, leading to the final outcome of determining the veracity of a rumour. In previous work, these steps in the process of rumour verification have been developed as separate components where the output of one feeds into the next. We propose a multi-task learning approach that allows joint training of the main and auxiliary tasks, improving the performance of rumour verification. We examine the connectio"},"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":"1806.03713","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-06-10T19:46:17Z","cross_cats_sorted":[],"title_canon_sha256":"972a6ef57de2cbcd1421d3580d9d0a5ea70554c02b66c41cc9772622286274dd","abstract_canon_sha256":"b61ae13e75c1d79d070ab4474a51d918ec17456318c05ded60641f7193de4aa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:42.290462Z","signature_b64":"31fdt62DkbVWRfmtRytz8iQ7DE948zjYvNl7nCFKQXJowPVpIU5++LBisbJmhLIuedEpALqrKViBjQxljrjDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e3d0d6795d536de788ffe8e6d34f0966f3bfab7e9b60fa7dde76abfd752b1e","last_reissued_at":"2026-05-18T00:13:42.289756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:42.289756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-in-one: Multi-task Learning for Rumour Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Arkaitz Zubiaga, Elena Kochkina, Maria Liakata","submitted_at":"2018-06-10T19:46:17Z","abstract_excerpt":"Automatic resolution of rumours is a challenging task that can be broken down into smaller components that make up a pipeline, including rumour detection, rumour tracking and stance classification, leading to the final outcome of determining the veracity of a rumour. In previous work, these steps in the process of rumour verification have been developed as separate components where the output of one feeds into the next. We propose a multi-task learning approach that allows joint training of the main and auxiliary tasks, improving the performance of rumour verification. We examine the connectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03713","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":"1806.03713","created_at":"2026-05-18T00:13:42.289876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03713v1","created_at":"2026-05-18T00:13:42.289876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03713","created_at":"2026-05-18T00:13:42.289876+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHR5BVTZLVJW","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHR5BVTZLVJW3Z4I","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHR5BVTZ","created_at":"2026-05-18T12:32:33.847187+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/KHR5BVTZLVJW3Z4I77UONU2PBF","json":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF.json","graph_json":"https://pith.science/api/pith-number/KHR5BVTZLVJW3Z4I77UONU2PBF/graph.json","events_json":"https://pith.science/api/pith-number/KHR5BVTZLVJW3Z4I77UONU2PBF/events.json","paper":"https://pith.science/paper/KHR5BVTZ"},"agent_actions":{"view_html":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF","download_json":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF.json","view_paper":"https://pith.science/paper/KHR5BVTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03713&json=true","fetch_graph":"https://pith.science/api/pith-number/KHR5BVTZLVJW3Z4I77UONU2PBF/graph.json","fetch_events":"https://pith.science/api/pith-number/KHR5BVTZLVJW3Z4I77UONU2PBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/action/storage_attestation","attest_author":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/action/author_attestation","sign_citation":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/action/citation_signature","submit_replication":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/action/replication_record"}},"created_at":"2026-05-18T00:13:42.289876+00:00","updated_at":"2026-05-18T00:13:42.289876+00:00"}