{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KHR5BVTZLVJW3Z4I77UONU2PBF","short_pith_number":"pith:KHR5BVTZ","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"},"canonical_sha256":"51e3d0d6795d536de788ffe8e6d34f0966f3bfab7e9b60fa7dde76abfd752b1e","source":{"kind":"arxiv","id":"1806.03713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03713","created_at":"2026-05-18T00:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03713v1","created_at":"2026-05-18T00:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03713","created_at":"2026-05-18T00:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"KHR5BVTZLVJW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KHR5BVTZLVJW3Z4I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KHR5BVTZ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KHR5BVTZLVJW3Z4I77UONU2PBF","target":"record","payload":{"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"},"canonical_sha256":"51e3d0d6795d536de788ffe8e6d34f0966f3bfab7e9b60fa7dde76abfd752b1e","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"},"source_kind":"arxiv","source_id":"1806.03713","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ikkNZtZu1OPOEAsr9J21Bo/MQ8VM0cfvR/PHucUD9yD560hUPc7fqs41nQTW4GuA0i6w63RATR0uGWfyJQ7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:41:58.646747Z"},"content_sha256":"05408837819f67a45196477f1abca5fc2d25ffc0479386e918c1e7a817d5e0f4","schema_version":"1.0","event_id":"sha256:05408837819f67a45196477f1abca5fc2d25ffc0479386e918c1e7a817d5e0f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KHR5BVTZLVJW3Z4I77UONU2PBF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjtEY5w03zfafsPf/eR8UYOFhX2wtRghZ0yCBZKNLDlZ6ilFEejFj/kJOaJMgezzJwImaJeOvZT7z7U9ed1YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:41:58.647090Z"},"content_sha256":"a7ac3d9e04217065ef44540ac87e27112af30dc46bae987348c36d5dc282ae3c","schema_version":"1.0","event_id":"sha256:a7ac3d9e04217065ef44540ac87e27112af30dc46bae987348c36d5dc282ae3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/bundle.json","state_url":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T00:41:58Z","links":{"resolver":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF","bundle":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/bundle.json","state":"https://pith.science/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHR5BVTZLVJW3Z4I77UONU2PBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KHR5BVTZLVJW3Z4I77UONU2PBF","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":"b61ae13e75c1d79d070ab4474a51d918ec17456318c05ded60641f7193de4aa6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-06-10T19:46:17Z","title_canon_sha256":"972a6ef57de2cbcd1421d3580d9d0a5ea70554c02b66c41cc9772622286274dd"},"schema_version":"1.0","source":{"id":"1806.03713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03713","created_at":"2026-05-18T00:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03713v1","created_at":"2026-05-18T00:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03713","created_at":"2026-05-18T00:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"KHR5BVTZLVJW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KHR5BVTZLVJW3Z4I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KHR5BVTZ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:a7ac3d9e04217065ef44540ac87e27112af30dc46bae987348c36d5dc282ae3c","target":"graph","created_at":"2026-05-18T00:13:42Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Arkaitz Zubiaga, Elena Kochkina, Maria Liakata","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-06-10T19:46:17Z","title":"All-in-one: Multi-task Learning for Rumour Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03713","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:05408837819f67a45196477f1abca5fc2d25ffc0479386e918c1e7a817d5e0f4","target":"record","created_at":"2026-05-18T00:13:42Z","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":"b61ae13e75c1d79d070ab4474a51d918ec17456318c05ded60641f7193de4aa6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-06-10T19:46:17Z","title_canon_sha256":"972a6ef57de2cbcd1421d3580d9d0a5ea70554c02b66c41cc9772622286274dd"},"schema_version":"1.0","source":{"id":"1806.03713","kind":"arxiv","version":1}},"canonical_sha256":"51e3d0d6795d536de788ffe8e6d34f0966f3bfab7e9b60fa7dde76abfd752b1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e3d0d6795d536de788ffe8e6d34f0966f3bfab7e9b60fa7dde76abfd752b1e","first_computed_at":"2026-05-18T00:13:42.289756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:42.289756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"31fdt62DkbVWRfmtRytz8iQ7DE948zjYvNl7nCFKQXJowPVpIU5++LBisbJmhLIuedEpALqrKViBjQxljrjDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:42.290462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05408837819f67a45196477f1abca5fc2d25ffc0479386e918c1e7a817d5e0f4","sha256:a7ac3d9e04217065ef44540ac87e27112af30dc46bae987348c36d5dc282ae3c"],"state_sha256":"49efe033e45433f10db20d3b695c7284d811b92de87e005c920e2880dd51726e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mj7j5U53D5XF3UDA82UKFtC85Hh6UHIA5xtjyRl7cSj+hjPW1SFulW9GEmA+3paE0y0AvWUhWzXRhuOY7XcTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:41:58.649008Z","bundle_sha256":"3a36234ead2992bc58418394badb27a1df96e606400922b231f6a0997e5182f1"}}