{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RSZQSCS63NQCODQBUO542PK342","short_pith_number":"pith:RSZQSCS6","canonical_record":{"source":{"id":"1704.00514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-03T10:25:22Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ecea4b718b651c4195feee74060cace6d04708e7e26147bfa76c644c3d494ae5","abstract_canon_sha256":"2194210afdb3fd574b032dcae9f9786eade37527df6a6cabb883dc9c5bea359e"},"schema_version":"1.0"},"canonical_sha256":"8cb3090a5edb60270e01a3bbcd3d5be695cb376527ecc32a43acbd4af5b58473","source":{"kind":"arxiv","id":"1704.00514","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00514","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00514v2","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00514","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"RSZQSCS63NQC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSZQSCS63NQCODQB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSZQSCS6","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RSZQSCS63NQCODQBUO542PK342","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-03T10:25:22Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ecea4b718b651c4195feee74060cace6d04708e7e26147bfa76c644c3d494ae5","abstract_canon_sha256":"2194210afdb3fd574b032dcae9f9786eade37527df6a6cabb883dc9c5bea359e"},"schema_version":"1.0"},"canonical_sha256":"8cb3090a5edb60270e01a3bbcd3d5be695cb376527ecc32a43acbd4af5b58473","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:31.934452Z","signature_b64":"jv7+huZqeOMQkZ2c0+RdnkcMLgUz2Jc1ds2qan2br6D6uEiChu88/3v1b19jS05M/Y+mDj9rOaAfrbtNzTHuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb3090a5edb60270e01a3bbcd3d5be695cb376527ecc32a43acbd4af5b58473","last_reissued_at":"2026-05-18T00:45:31.933747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:31.933747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00514","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-05-18T00:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFn5wTBaepAgBePUJBWMWIKaMjLAnVowOwtYYvT8boxu6WF+Lr/jhcq7UJkYv8uioUVFdNFVCQQD4kskQG+nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:27:59.150035Z"},"content_sha256":"7fe129d485b12ef263aee237fc30668d1d5e50b63c6624585c0ac579312bb829","schema_version":"1.0","event_id":"sha256:7fe129d485b12ef263aee237fc30668d1d5e50b63c6624585c0ac579312bb829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RSZQSCS63NQCODQBUO542PK342","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Task Learning of Keyphrase Boundary Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.CL","authors_text":"Anders S{\\o}gaard, Isabelle Augenstein","submitted_at":"2017-04-03T10:25:22Z","abstract_excerpt":"Keyphrase boundary classification (KBC) is the task of detecting keyphrases in scientific articles and labelling them with respect to predefined types. Although important in practice, this task is so far underexplored, partly due to the lack of labelled data. To overcome this, we explore several auxiliary tasks, including semantic super-sense tagging and identification of multi-word expressions, and cast the task as a multi-task learning problem with deep recurrent neural networks. Our multi-task models perform significantly better than previous state of the art approaches on two scientific KB"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00514","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":""},"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:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6SoaMxCiGJ245pnwsIrFyYLzwJVEAOqQRvLN8fHhJImcrxattWhy2OdN0RJ2DE1jsxp//y8AYYNIyj7njyDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:27:59.150648Z"},"content_sha256":"0f66e049bcb413b4351ddd063e2b2f16c412a827a5290f59e630c279aafebac1","schema_version":"1.0","event_id":"sha256:0f66e049bcb413b4351ddd063e2b2f16c412a827a5290f59e630c279aafebac1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSZQSCS63NQCODQBUO542PK342/bundle.json","state_url":"https://pith.science/pith/RSZQSCS63NQCODQBUO542PK342/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSZQSCS63NQCODQBUO542PK342/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-05-28T15:27:59Z","links":{"resolver":"https://pith.science/pith/RSZQSCS63NQCODQBUO542PK342","bundle":"https://pith.science/pith/RSZQSCS63NQCODQBUO542PK342/bundle.json","state":"https://pith.science/pith/RSZQSCS63NQCODQBUO542PK342/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSZQSCS63NQCODQBUO542PK342/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RSZQSCS63NQCODQBUO542PK342","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":"2194210afdb3fd574b032dcae9f9786eade37527df6a6cabb883dc9c5bea359e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-03T10:25:22Z","title_canon_sha256":"ecea4b718b651c4195feee74060cace6d04708e7e26147bfa76c644c3d494ae5"},"schema_version":"1.0","source":{"id":"1704.00514","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00514","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00514v2","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00514","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"RSZQSCS63NQC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSZQSCS63NQCODQB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSZQSCS6","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:0f66e049bcb413b4351ddd063e2b2f16c412a827a5290f59e630c279aafebac1","target":"graph","created_at":"2026-05-18T00:45:31Z","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":"Keyphrase boundary classification (KBC) is the task of detecting keyphrases in scientific articles and labelling them with respect to predefined types. Although important in practice, this task is so far underexplored, partly due to the lack of labelled data. To overcome this, we explore several auxiliary tasks, including semantic super-sense tagging and identification of multi-word expressions, and cast the task as a multi-task learning problem with deep recurrent neural networks. Our multi-task models perform significantly better than previous state of the art approaches on two scientific KB","authors_text":"Anders S{\\o}gaard, Isabelle Augenstein","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-03T10:25:22Z","title":"Multi-Task Learning of Keyphrase Boundary Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00514","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:7fe129d485b12ef263aee237fc30668d1d5e50b63c6624585c0ac579312bb829","target":"record","created_at":"2026-05-18T00:45:31Z","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":"2194210afdb3fd574b032dcae9f9786eade37527df6a6cabb883dc9c5bea359e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-03T10:25:22Z","title_canon_sha256":"ecea4b718b651c4195feee74060cace6d04708e7e26147bfa76c644c3d494ae5"},"schema_version":"1.0","source":{"id":"1704.00514","kind":"arxiv","version":2}},"canonical_sha256":"8cb3090a5edb60270e01a3bbcd3d5be695cb376527ecc32a43acbd4af5b58473","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cb3090a5edb60270e01a3bbcd3d5be695cb376527ecc32a43acbd4af5b58473","first_computed_at":"2026-05-18T00:45:31.933747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:31.933747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jv7+huZqeOMQkZ2c0+RdnkcMLgUz2Jc1ds2qan2br6D6uEiChu88/3v1b19jS05M/Y+mDj9rOaAfrbtNzTHuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:31.934452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00514","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fe129d485b12ef263aee237fc30668d1d5e50b63c6624585c0ac579312bb829","sha256:0f66e049bcb413b4351ddd063e2b2f16c412a827a5290f59e630c279aafebac1"],"state_sha256":"b1d1d3130965ec84b36971b95d578253fb7cc3f748ba7bc810abce1fffb7fb8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYKvHUy4aS++B9GUN8UDMzRL1Ble9UASoFQNljmw7GXRLkvlnPoqhLY4tW7e0OphaElbtZVnfbr79m/5PUeBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:27:59.153582Z","bundle_sha256":"9503b184d1ac051bc0ddb7fe01f241d1516e730d3b188b1f82bf1ecb9bb1a1d1"}}