{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WN7FA3N6QTMVXFCLTF7BJW2BJ3","short_pith_number":"pith:WN7FA3N6","canonical_record":{"source":{"id":"1807.04687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T15:53:29Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"b581c52d64dca84b690ff1a8265369bf0997e7c0c52eec1f5c857582bd72dcdb","abstract_canon_sha256":"eabba9a5529bf2f28e4c16e8bbc8e81e68b0bf44e8c7b6f54fb4a16db54f812d"},"schema_version":"1.0"},"canonical_sha256":"b37e506dbe84d95b944b997e14db414ecba2bba05ea723fb45f5cdb6fecbeb81","source":{"kind":"arxiv","id":"1807.04687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04687","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04687v1","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04687","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"WN7FA3N6QTMV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WN7FA3N6QTMVXFCL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WN7FA3N6","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WN7FA3N6QTMVXFCLTF7BJW2BJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T15:53:29Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"b581c52d64dca84b690ff1a8265369bf0997e7c0c52eec1f5c857582bd72dcdb","abstract_canon_sha256":"eabba9a5529bf2f28e4c16e8bbc8e81e68b0bf44e8c7b6f54fb4a16db54f812d"},"schema_version":"1.0"},"canonical_sha256":"b37e506dbe84d95b944b997e14db414ecba2bba05ea723fb45f5cdb6fecbeb81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:52.795506Z","signature_b64":"OlHz+P1ZQUG2EIpPvuOfY+M6jFkNd/YspLFnW4UdN7A+NJ5WJgSZKCmuMvj/e91fEaO2WSrqZC1ojTFonvFgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37e506dbe84d95b944b997e14db414ecba2bba05ea723fb45f5cdb6fecbeb81","last_reissued_at":"2026-05-18T00:10:52.794764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:52.794764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04687","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:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/kgVlYwpKRSoZq6Vxm21g2MMt3AAbLUzDzogt+7IRcwkWRCKccmik3usQmbRXU8JuysFtTJTTx7XaSwqnvsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:20:28.874594Z"},"content_sha256":"63f90bdab8c05163670c48ab12be73fb3d32a00e17fdbbe90d9561bbe3f14848","schema_version":"1.0","event_id":"sha256:63f90bdab8c05163670c48ab12be73fb3d32a00e17fdbbe90d9561bbe3f14848"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WN7FA3N6QTMVXFCLTF7BJW2BJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making Efficient Use of a Domain Expert's Time in Relation Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Linara Adilova, Stefan R\\\"uping, Sven Giesselbach","submitted_at":"2018-07-12T15:53:29Z","abstract_excerpt":"Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, state-of-the art models, like the convolutional neural network used in this paper, achieve great results when trained on large enough amounts of labeled data. However, from a practical point of view the question arises whether this is the most efficient approach when one takes the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04687","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:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExDklTdk7pCxYT5Ti3q+R/d1FSPa/fQEkxsnEZOor1Zz32GCll0gOjAHsLtHiTaS3qDAoRpN2aanG54EmehDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:20:28.874944Z"},"content_sha256":"5d5ed90008f8c5cc0c2d870f86a03f6fb057cf087bf3115eeb28bff861a3ebb9","schema_version":"1.0","event_id":"sha256:5d5ed90008f8c5cc0c2d870f86a03f6fb057cf087bf3115eeb28bff861a3ebb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3/bundle.json","state_url":"https://pith.science/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3/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-21T14:20:28Z","links":{"resolver":"https://pith.science/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3","bundle":"https://pith.science/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3/bundle.json","state":"https://pith.science/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WN7FA3N6QTMVXFCLTF7BJW2BJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WN7FA3N6QTMVXFCLTF7BJW2BJ3","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":"eabba9a5529bf2f28e4c16e8bbc8e81e68b0bf44e8c7b6f54fb4a16db54f812d","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T15:53:29Z","title_canon_sha256":"b581c52d64dca84b690ff1a8265369bf0997e7c0c52eec1f5c857582bd72dcdb"},"schema_version":"1.0","source":{"id":"1807.04687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04687","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04687v1","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04687","created_at":"2026-05-18T00:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"WN7FA3N6QTMV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WN7FA3N6QTMVXFCL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WN7FA3N6","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:5d5ed90008f8c5cc0c2d870f86a03f6fb057cf087bf3115eeb28bff861a3ebb9","target":"graph","created_at":"2026-05-18T00:10:52Z","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":"Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, state-of-the art models, like the convolutional neural network used in this paper, achieve great results when trained on large enough amounts of labeled data. However, from a practical point of view the question arises whether this is the most efficient approach when one takes the ","authors_text":"Linara Adilova, Stefan R\\\"uping, Sven Giesselbach","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T15:53:29Z","title":"Making Efficient Use of a Domain Expert's Time in Relation Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04687","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:63f90bdab8c05163670c48ab12be73fb3d32a00e17fdbbe90d9561bbe3f14848","target":"record","created_at":"2026-05-18T00:10:52Z","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":"eabba9a5529bf2f28e4c16e8bbc8e81e68b0bf44e8c7b6f54fb4a16db54f812d","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T15:53:29Z","title_canon_sha256":"b581c52d64dca84b690ff1a8265369bf0997e7c0c52eec1f5c857582bd72dcdb"},"schema_version":"1.0","source":{"id":"1807.04687","kind":"arxiv","version":1}},"canonical_sha256":"b37e506dbe84d95b944b997e14db414ecba2bba05ea723fb45f5cdb6fecbeb81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b37e506dbe84d95b944b997e14db414ecba2bba05ea723fb45f5cdb6fecbeb81","first_computed_at":"2026-05-18T00:10:52.794764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:52.794764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OlHz+P1ZQUG2EIpPvuOfY+M6jFkNd/YspLFnW4UdN7A+NJ5WJgSZKCmuMvj/e91fEaO2WSrqZC1ojTFonvFgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:52.795506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63f90bdab8c05163670c48ab12be73fb3d32a00e17fdbbe90d9561bbe3f14848","sha256:5d5ed90008f8c5cc0c2d870f86a03f6fb057cf087bf3115eeb28bff861a3ebb9"],"state_sha256":"7d09d1989962a7fc21c5defb5dee74dbdf56feaf61c2afcdba124bc1480625e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zArvoaaJHqygZhUTmZtXmQWd+k4lkCbmODp5BIH0Wcb1EghUIPJ3iOJF4vksqqdYGrw1ADbXs3r6FsrXRyTTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:20:28.876970Z","bundle_sha256":"2107a7414aeaec9d8dd3b5bbf118ad7312053b00d5b6417af352fb2478ac52a2"}}