{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:U5FKIWLBSHSFOUM5WQLKBL7EBC","short_pith_number":"pith:U5FKIWLB","canonical_record":{"source":{"id":"2003.03666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-03-07T21:21:29Z","cross_cats_sorted":[],"title_canon_sha256":"5b449b845c03cada7d7f964d92bfa4fc5db78b524e5d56a485d7fcbde3b884a1","abstract_canon_sha256":"3fbab2de1e16b424f974d23853874100daee4ca7c683656c63cd26d6e8186c79"},"schema_version":"1.0"},"canonical_sha256":"a74aa4596191e457519db416a0afe408a989a359bc0ab85a36de7eeb6f8b391c","source":{"kind":"arxiv","id":"2003.03666","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.03666","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"2003.03666v2","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.03666","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"U5FKIWLBSHSF","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"pith_short_16","alias_value":"U5FKIWLBSHSFOUM5","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"pith_short_8","alias_value":"U5FKIWLB","created_at":"2026-07-05T01:47:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:U5FKIWLBSHSFOUM5WQLKBL7EBC","target":"record","payload":{"canonical_record":{"source":{"id":"2003.03666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-03-07T21:21:29Z","cross_cats_sorted":[],"title_canon_sha256":"5b449b845c03cada7d7f964d92bfa4fc5db78b524e5d56a485d7fcbde3b884a1","abstract_canon_sha256":"3fbab2de1e16b424f974d23853874100daee4ca7c683656c63cd26d6e8186c79"},"schema_version":"1.0"},"canonical_sha256":"a74aa4596191e457519db416a0afe408a989a359bc0ab85a36de7eeb6f8b391c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:54.669871Z","signature_b64":"nbGmPSDMeypG3n+pxCEBK6upz94rPjMplFuxt1c5fsWuJcVQBKBIDokSJMeff1DU9QCqePck9VzdIeRk3/GFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74aa4596191e457519db416a0afe408a989a359bc0ab85a36de7eeb6f8b391c","last_reissued_at":"2026-07-05T01:47:54.669493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:54.669493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.03666","source_version":2,"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-07-05T01:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkdxpvonN/PvPUmjXbMCuDz8yL9IErLVABz+shzA06560gYzyiRfEMgUW9D87Wh9PuBP2gmwG9pl1PplN31pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:45:15.619642Z"},"content_sha256":"be52a82a08225d3602ff5387129424dda30b9be6258445cb01de10042c06f789","schema_version":"1.0","event_id":"sha256:be52a82a08225d3602ff5387129424dda30b9be6258445cb01de10042c06f789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:U5FKIWLBSHSFOUM5WQLKBL7EBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-task Learning Based Neural Bridging Reference Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Juntao Yu, Massimo Poesio","submitted_at":"2020-03-07T21:21:29Z","abstract_excerpt":"We propose a multi task learning-based neural model for resolving bridging references tackling two key challenges. The first challenge is the lack of large corpora annotated with bridging references. To address this, we use multi-task learning to help bridging reference resolution with coreference resolution. We show that substantial improvements of up to 8 p.p. can be achieved on full bridging resolution with this architecture. The second challenge is the different definitions of bridging used in different corpora, meaning that hand-coded systems or systems using special features designed for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.03666","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.03666/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPDc8RvBhkCxwVGfsWBwUtUerAeyEJv8GKwbcMumrP77+/IqRqkEQ9LVfJ8+K6mMifK/gNTQWLOOSzwJrtD+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:45:15.620014Z"},"content_sha256":"51b3d93c80206ab0d39109eb1e9c7334c895835d530730d3546f68e095e2d25e","schema_version":"1.0","event_id":"sha256:51b3d93c80206ab0d39109eb1e9c7334c895835d530730d3546f68e095e2d25e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC/bundle.json","state_url":"https://pith.science/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC/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-07-09T06:45:15Z","links":{"resolver":"https://pith.science/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC","bundle":"https://pith.science/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC/bundle.json","state":"https://pith.science/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5FKIWLBSHSFOUM5WQLKBL7EBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:U5FKIWLBSHSFOUM5WQLKBL7EBC","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":"3fbab2de1e16b424f974d23853874100daee4ca7c683656c63cd26d6e8186c79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-03-07T21:21:29Z","title_canon_sha256":"5b449b845c03cada7d7f964d92bfa4fc5db78b524e5d56a485d7fcbde3b884a1"},"schema_version":"1.0","source":{"id":"2003.03666","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.03666","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"2003.03666v2","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.03666","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"U5FKIWLBSHSF","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"pith_short_16","alias_value":"U5FKIWLBSHSFOUM5","created_at":"2026-07-05T01:47:54Z"},{"alias_kind":"pith_short_8","alias_value":"U5FKIWLB","created_at":"2026-07-05T01:47:54Z"}],"graph_snapshots":[{"event_id":"sha256:51b3d93c80206ab0d39109eb1e9c7334c895835d530730d3546f68e095e2d25e","target":"graph","created_at":"2026-07-05T01:47:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.03666/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a multi task learning-based neural model for resolving bridging references tackling two key challenges. The first challenge is the lack of large corpora annotated with bridging references. To address this, we use multi-task learning to help bridging reference resolution with coreference resolution. We show that substantial improvements of up to 8 p.p. can be achieved on full bridging resolution with this architecture. The second challenge is the different definitions of bridging used in different corpora, meaning that hand-coded systems or systems using special features designed for","authors_text":"Juntao Yu, Massimo Poesio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-03-07T21:21:29Z","title":"Multi-task Learning Based Neural Bridging Reference Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.03666","kind":"arxiv","version":2},"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:be52a82a08225d3602ff5387129424dda30b9be6258445cb01de10042c06f789","target":"record","created_at":"2026-07-05T01:47:54Z","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":"3fbab2de1e16b424f974d23853874100daee4ca7c683656c63cd26d6e8186c79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-03-07T21:21:29Z","title_canon_sha256":"5b449b845c03cada7d7f964d92bfa4fc5db78b524e5d56a485d7fcbde3b884a1"},"schema_version":"1.0","source":{"id":"2003.03666","kind":"arxiv","version":2}},"canonical_sha256":"a74aa4596191e457519db416a0afe408a989a359bc0ab85a36de7eeb6f8b391c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a74aa4596191e457519db416a0afe408a989a359bc0ab85a36de7eeb6f8b391c","first_computed_at":"2026-07-05T01:47:54.669493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:47:54.669493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbGmPSDMeypG3n+pxCEBK6upz94rPjMplFuxt1c5fsWuJcVQBKBIDokSJMeff1DU9QCqePck9VzdIeRk3/GFBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:47:54.669871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.03666","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be52a82a08225d3602ff5387129424dda30b9be6258445cb01de10042c06f789","sha256:51b3d93c80206ab0d39109eb1e9c7334c895835d530730d3546f68e095e2d25e"],"state_sha256":"95bf0215d655e1ca3baeddedbbd2d8c819c6ac252b938c4efb2a9aa1fa94aca2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgUF3g8AbGRvhYqvIKpu/z3EAtk0AxnViqLI+o1A7hCLnY3zehO3uf8LZeMbZJsuHnAsfjdKaleb1LaZRMqvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:45:15.622462Z","bundle_sha256":"1b684b05cade447d55775eaa9fbf55e8d639444e82f3dbd8175d786fc7b517f7"}}